25.00/14.59 YES 25.00/14.59 25.00/14.59 Ultimate: Cannot open display: 25.00/14.59 This is Ultimate 0.1.24-8dc7c08-m 25.00/14.59 [2019-03-28 12:38:15,573 INFO L170 SettingsManager]: Resetting all preferences to default values... 25.00/14.59 [2019-03-28 12:38:15,575 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 25.00/14.59 [2019-03-28 12:38:15,586 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 25.00/14.59 [2019-03-28 12:38:15,587 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 25.00/14.59 [2019-03-28 12:38:15,588 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 25.00/14.59 [2019-03-28 12:38:15,589 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 25.00/14.59 [2019-03-28 12:38:15,590 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 25.00/14.59 [2019-03-28 12:38:15,592 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 25.00/14.59 [2019-03-28 12:38:15,593 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 25.00/14.59 [2019-03-28 12:38:15,593 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 25.00/14.59 [2019-03-28 12:38:15,594 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 25.00/14.59 [2019-03-28 12:38:15,594 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 25.00/14.59 [2019-03-28 12:38:15,595 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 25.00/14.59 [2019-03-28 12:38:15,596 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 25.00/14.59 [2019-03-28 12:38:15,597 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 25.00/14.59 [2019-03-28 12:38:15,598 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 25.00/14.59 [2019-03-28 12:38:15,600 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 25.00/14.59 [2019-03-28 12:38:15,601 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 25.00/14.59 [2019-03-28 12:38:15,603 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 25.00/14.59 [2019-03-28 12:38:15,604 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 25.00/14.59 [2019-03-28 12:38:15,605 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 25.00/14.59 [2019-03-28 12:38:15,607 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 25.00/14.59 [2019-03-28 12:38:15,607 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 25.00/14.59 [2019-03-28 12:38:15,608 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 25.00/14.59 [2019-03-28 12:38:15,608 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 25.00/14.59 [2019-03-28 12:38:15,609 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 25.00/14.59 [2019-03-28 12:38:15,610 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 25.00/14.59 [2019-03-28 12:38:15,610 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 25.00/14.59 [2019-03-28 12:38:15,611 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 25.00/14.59 [2019-03-28 12:38:15,611 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 25.00/14.59 [2019-03-28 12:38:15,612 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 25.00/14.59 [2019-03-28 12:38:15,613 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 25.00/14.59 [2019-03-28 12:38:15,613 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 25.00/14.59 [2019-03-28 12:38:15,614 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 25.00/14.59 [2019-03-28 12:38:15,614 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 25.00/14.59 [2019-03-28 12:38:15,614 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 25.00/14.59 [2019-03-28 12:38:15,615 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 25.00/14.59 [2019-03-28 12:38:15,616 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 25.00/14.59 [2019-03-28 12:38:15,616 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 25.00/14.59 [2019-03-28 12:38:15,631 INFO L110 SettingsManager]: Loading preferences was successful 25.00/14.59 [2019-03-28 12:38:15,631 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 25.00/14.59 [2019-03-28 12:38:15,632 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 25.00/14.59 [2019-03-28 12:38:15,632 INFO L133 SettingsManager]: * Rewrite not-equals=true 25.00/14.59 [2019-03-28 12:38:15,632 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 25.00/14.59 [2019-03-28 12:38:15,633 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 25.00/14.59 [2019-03-28 12:38:15,633 INFO L133 SettingsManager]: * Use SBE=true 25.00/14.59 [2019-03-28 12:38:15,633 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 25.00/14.59 [2019-03-28 12:38:15,633 INFO L133 SettingsManager]: * Use old map elimination=false 25.00/14.59 [2019-03-28 12:38:15,633 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 25.00/14.59 [2019-03-28 12:38:15,633 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 25.00/14.59 [2019-03-28 12:38:15,634 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 25.00/14.59 [2019-03-28 12:38:15,634 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 25.00/14.59 [2019-03-28 12:38:15,634 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 25.00/14.59 [2019-03-28 12:38:15,634 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.00/14.59 [2019-03-28 12:38:15,634 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 25.00/14.59 [2019-03-28 12:38:15,634 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 25.00/14.59 [2019-03-28 12:38:15,635 INFO L133 SettingsManager]: * Check division by zero=IGNORE 25.00/14.59 [2019-03-28 12:38:15,635 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 25.00/14.59 [2019-03-28 12:38:15,635 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 25.00/14.59 [2019-03-28 12:38:15,635 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 25.00/14.59 [2019-03-28 12:38:15,635 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 25.00/14.59 [2019-03-28 12:38:15,635 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 25.00/14.59 [2019-03-28 12:38:15,636 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 25.00/14.59 [2019-03-28 12:38:15,636 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 25.00/14.59 [2019-03-28 12:38:15,636 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 25.00/14.59 [2019-03-28 12:38:15,636 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 25.00/14.59 [2019-03-28 12:38:15,636 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 25.00/14.59 [2019-03-28 12:38:15,637 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 25.00/14.59 [2019-03-28 12:38:15,663 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 25.00/14.59 [2019-03-28 12:38:15,677 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 25.00/14.59 [2019-03-28 12:38:15,680 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 25.00/14.59 [2019-03-28 12:38:15,682 INFO L271 PluginConnector]: Initializing CDTParser... 25.00/14.59 [2019-03-28 12:38:15,682 INFO L276 PluginConnector]: CDTParser initialized 25.00/14.59 [2019-03-28 12:38:15,683 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 25.00/14.59 [2019-03-28 12:38:15,748 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/ef4b05f049a7482e80f900f1966a1db8/FLAG4ca19cdf7 25.00/14.59 [2019-03-28 12:38:16,082 INFO L307 CDTParser]: Found 1 translation units. 25.00/14.59 [2019-03-28 12:38:16,083 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 25.00/14.59 [2019-03-28 12:38:16,083 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. 25.00/14.59 [2019-03-28 12:38:16,090 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/ef4b05f049a7482e80f900f1966a1db8/FLAG4ca19cdf7 25.00/14.59 [2019-03-28 12:38:16,489 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/ef4b05f049a7482e80f900f1966a1db8 25.00/14.59 [2019-03-28 12:38:16,501 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 25.00/14.59 [2019-03-28 12:38:16,502 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 25.00/14.59 [2019-03-28 12:38:16,504 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 25.00/14.59 [2019-03-28 12:38:16,504 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 25.00/14.59 [2019-03-28 12:38:16,507 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 25.00/14.59 [2019-03-28 12:38:16,508 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:38:16" (1/1) ... 25.00/14.59 [2019-03-28 12:38:16,512 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c46efee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:38:16, skipping insertion in model container 25.00/14.60 [2019-03-28 12:38:16,512 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:38:16" (1/1) ... 25.00/14.60 [2019-03-28 12:38:16,520 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 25.00/14.60 [2019-03-28 12:38:16,536 INFO L176 MainTranslator]: Built tables and reachable declarations 25.00/14.60 [2019-03-28 12:38:16,699 INFO L206 PostProcessor]: Analyzing one entry point: main 25.00/14.60 [2019-03-28 12:38:16,712 INFO L191 MainTranslator]: Completed pre-run 25.00/14.60 [2019-03-28 12:38:16,789 INFO L206 PostProcessor]: Analyzing one entry point: main 25.00/14.60 [2019-03-28 12:38:16,807 INFO L195 MainTranslator]: Completed translation 25.00/14.60 [2019-03-28 12:38:16,808 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:38:16 WrapperNode 25.00/14.60 [2019-03-28 12:38:16,808 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 25.00/14.60 [2019-03-28 12:38:16,809 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 25.00/14.60 [2019-03-28 12:38:16,809 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 25.00/14.60 [2019-03-28 12:38:16,809 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 25.00/14.60 [2019-03-28 12:38:16,819 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:38:16" (1/1) ... 25.00/14.60 [2019-03-28 12:38:16,828 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:38:16" (1/1) ... 25.00/14.60 [2019-03-28 12:38:16,850 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 25.00/14.60 [2019-03-28 12:38:16,850 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 25.00/14.60 [2019-03-28 12:38:16,850 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 25.00/14.60 [2019-03-28 12:38:16,851 INFO L276 PluginConnector]: Boogie Preprocessor initialized 25.00/14.60 [2019-03-28 12:38:16,860 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:38:16" (1/1) ... 25.00/14.60 [2019-03-28 12:38:16,861 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:38:16" (1/1) ... 25.00/14.60 [2019-03-28 12:38:16,862 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:38:16" (1/1) ... 25.00/14.60 [2019-03-28 12:38:16,862 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:38:16" (1/1) ... 25.00/14.60 [2019-03-28 12:38:16,867 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:38:16" (1/1) ... 25.00/14.60 [2019-03-28 12:38:16,871 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:38:16" (1/1) ... 25.00/14.60 [2019-03-28 12:38:16,873 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:38:16" (1/1) ... 25.00/14.60 [2019-03-28 12:38:16,874 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 25.00/14.60 [2019-03-28 12:38:16,875 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 25.00/14.60 [2019-03-28 12:38:16,875 INFO L271 PluginConnector]: Initializing RCFGBuilder... 25.00/14.60 [2019-03-28 12:38:16,875 INFO L276 PluginConnector]: RCFGBuilder initialized 25.00/14.60 [2019-03-28 12:38:16,876 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:38:16" (1/1) ... 25.00/14.60 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 25.00/14.60 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 25.00/14.60 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 25.00/14.60 [2019-03-28 12:38:16,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~int 25.00/14.60 [2019-03-28 12:38:16,945 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 25.00/14.60 [2019-03-28 12:38:16,945 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 25.00/14.60 [2019-03-28 12:38:16,945 INFO L130 BoogieDeclarations]: Found specification of procedure read~int 25.00/14.60 [2019-03-28 12:38:16,946 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack 25.00/14.60 [2019-03-28 12:38:16,946 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc 25.00/14.60 [2019-03-28 12:38:17,183 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 25.00/14.60 [2019-03-28 12:38:17,184 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. 25.00/14.60 [2019-03-28 12:38:17,185 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:38:17 BoogieIcfgContainer 25.00/14.60 [2019-03-28 12:38:17,186 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 25.00/14.60 [2019-03-28 12:38:17,186 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 25.00/14.60 [2019-03-28 12:38:17,186 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 25.00/14.60 [2019-03-28 12:38:17,188 INFO L276 PluginConnector]: BlockEncodingV2 initialized 25.00/14.60 [2019-03-28 12:38:17,189 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:38:17" (1/1) ... 25.00/14.60 [2019-03-28 12:38:17,205 INFO L313 BlockEncoder]: Initial Icfg 35 locations, 36 edges 25.00/14.60 [2019-03-28 12:38:17,207 INFO L258 BlockEncoder]: Using Remove infeasible edges 25.00/14.60 [2019-03-28 12:38:17,207 INFO L263 BlockEncoder]: Using Maximize final states 25.00/14.60 [2019-03-28 12:38:17,208 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 25.00/14.60 [2019-03-28 12:38:17,208 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 25.00/14.60 [2019-03-28 12:38:17,210 INFO L296 BlockEncoder]: Using Remove sink states 25.00/14.60 [2019-03-28 12:38:17,211 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 25.00/14.60 [2019-03-28 12:38:17,211 INFO L179 BlockEncoder]: Using Rewrite not-equals 25.00/14.60 [2019-03-28 12:38:17,235 INFO L185 BlockEncoder]: Using Use SBE 25.00/14.60 [2019-03-28 12:38:17,267 INFO L200 BlockEncoder]: SBE split 18 edges 25.00/14.60 [2019-03-28 12:38:17,275 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility 25.00/14.60 [2019-03-28 12:38:17,277 INFO L71 MaximizeFinalStates]: 0 new accepting states 25.00/14.60 [2019-03-28 12:38:17,322 INFO L100 BaseMinimizeStates]: Removed 12 edges and 6 locations by large block encoding 25.00/14.60 [2019-03-28 12:38:17,325 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states 25.00/14.60 [2019-03-28 12:38:17,327 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 25.00/14.60 [2019-03-28 12:38:17,327 INFO L71 MaximizeFinalStates]: 0 new accepting states 25.00/14.60 [2019-03-28 12:38:17,328 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 25.00/14.60 [2019-03-28 12:38:17,328 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 25.00/14.60 [2019-03-28 12:38:17,329 INFO L313 BlockEncoder]: Encoded RCFG 28 locations, 50 edges 25.00/14.60 [2019-03-28 12:38:17,329 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:38:17 BasicIcfg 25.00/14.60 [2019-03-28 12:38:17,329 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 25.00/14.60 [2019-03-28 12:38:17,330 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 25.00/14.60 [2019-03-28 12:38:17,330 INFO L271 PluginConnector]: Initializing TraceAbstraction... 25.00/14.60 [2019-03-28 12:38:17,334 INFO L276 PluginConnector]: TraceAbstraction initialized 25.00/14.60 [2019-03-28 12:38:17,334 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:38:16" (1/4) ... 25.00/14.60 [2019-03-28 12:38:17,335 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56060d0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:38:17, skipping insertion in model container 25.00/14.60 [2019-03-28 12:38:17,335 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:38:16" (2/4) ... 25.00/14.60 [2019-03-28 12:38:17,335 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56060d0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:38:17, skipping insertion in model container 25.00/14.60 [2019-03-28 12:38:17,336 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:38:17" (3/4) ... 25.00/14.60 [2019-03-28 12:38:17,336 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56060d0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:38:17, skipping insertion in model container 25.00/14.60 [2019-03-28 12:38:17,336 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:38:17" (4/4) ... 25.00/14.60 [2019-03-28 12:38:17,338 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 25.00/14.60 [2019-03-28 12:38:17,348 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 25.00/14.60 [2019-03-28 12:38:17,356 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. 25.00/14.60 [2019-03-28 12:38:17,373 INFO L257 AbstractCegarLoop]: Starting to check reachability of 16 error locations. 25.00/14.60 [2019-03-28 12:38:17,402 INFO L133 ementStrategyFactory]: Using default assertion order modulation 25.00/14.60 [2019-03-28 12:38:17,403 INFO L382 AbstractCegarLoop]: Interprodecural is true 25.00/14.60 [2019-03-28 12:38:17,403 INFO L383 AbstractCegarLoop]: Hoare is true 25.00/14.60 [2019-03-28 12:38:17,404 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 25.00/14.60 [2019-03-28 12:38:17,404 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 25.00/14.60 [2019-03-28 12:38:17,404 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 25.00/14.60 [2019-03-28 12:38:17,404 INFO L387 AbstractCegarLoop]: Difference is false 25.00/14.60 [2019-03-28 12:38:17,404 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 25.00/14.60 [2019-03-28 12:38:17,404 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 25.00/14.60 [2019-03-28 12:38:17,420 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. 25.00/14.60 [2019-03-28 12:38:17,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 25.00/14.60 [2019-03-28 12:38:17,426 INFO L394 BasicCegarLoop]: Found error trace 25.00/14.60 [2019-03-28 12:38:17,426 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 25.00/14.60 [2019-03-28 12:38:17,427 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== 25.00/14.60 [2019-03-28 12:38:17,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.00/14.60 [2019-03-28 12:38:17,432 INFO L82 PathProgramCache]: Analyzing trace with hash 103244, now seen corresponding path program 1 times 25.00/14.60 [2019-03-28 12:38:17,434 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.00/14.60 [2019-03-28 12:38:17,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.00/14.60 [2019-03-28 12:38:17,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.00/14.60 [2019-03-28 12:38:17,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.00/14.60 [2019-03-28 12:38:17,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.00/14.60 [2019-03-28 12:38:17,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.00/14.60 [2019-03-28 12:38:17,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.00/14.60 [2019-03-28 12:38:17,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 25.00/14.60 [2019-03-28 12:38:17,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 25.00/14.60 [2019-03-28 12:38:17,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 25.00/14.60 [2019-03-28 12:38:17,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 25.00/14.60 [2019-03-28 12:38:17,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 25.00/14.60 [2019-03-28 12:38:17,640 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 3 states. 25.00/14.60 [2019-03-28 12:38:17,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 25.00/14.60 [2019-03-28 12:38:17,767 INFO L93 Difference]: Finished difference Result 45 states and 85 transitions. 25.00/14.60 [2019-03-28 12:38:17,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 25.00/14.60 [2019-03-28 12:38:17,769 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 25.00/14.60 [2019-03-28 12:38:17,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 25.00/14.60 [2019-03-28 12:38:17,782 INFO L225 Difference]: With dead ends: 45 25.00/14.60 [2019-03-28 12:38:17,783 INFO L226 Difference]: Without dead ends: 24 25.00/14.60 [2019-03-28 12:38:17,786 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 25.00/14.60 [2019-03-28 12:38:17,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. 25.00/14.60 [2019-03-28 12:38:17,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. 25.00/14.60 [2019-03-28 12:38:17,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. 25.00/14.60 [2019-03-28 12:38:17,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 41 transitions. 25.00/14.60 [2019-03-28 12:38:17,827 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 41 transitions. Word has length 3 25.00/14.60 [2019-03-28 12:38:17,828 INFO L84 Accepts]: Finished accepts. word is rejected. 25.00/14.60 [2019-03-28 12:38:17,828 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 41 transitions. 25.00/14.60 [2019-03-28 12:38:17,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 25.00/14.60 [2019-03-28 12:38:17,829 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 41 transitions. 25.00/14.60 [2019-03-28 12:38:17,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 25.00/14.60 [2019-03-28 12:38:17,829 INFO L394 BasicCegarLoop]: Found error trace 25.00/14.60 [2019-03-28 12:38:17,829 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 25.00/14.60 [2019-03-28 12:38:17,830 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== 25.00/14.60 [2019-03-28 12:38:17,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.00/14.60 [2019-03-28 12:38:17,830 INFO L82 PathProgramCache]: Analyzing trace with hash 103246, now seen corresponding path program 1 times 25.00/14.60 [2019-03-28 12:38:17,830 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.00/14.60 [2019-03-28 12:38:17,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.00/14.60 [2019-03-28 12:38:17,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.00/14.60 [2019-03-28 12:38:17,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.00/14.60 [2019-03-28 12:38:17,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.00/14.60 [2019-03-28 12:38:17,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.00/14.60 [2019-03-28 12:38:17,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.00/14.60 [2019-03-28 12:38:17,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 25.00/14.60 [2019-03-28 12:38:17,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 25.00/14.60 [2019-03-28 12:38:17,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 25.00/14.60 [2019-03-28 12:38:17,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 25.00/14.60 [2019-03-28 12:38:17,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 25.00/14.60 [2019-03-28 12:38:17,859 INFO L87 Difference]: Start difference. First operand 24 states and 41 transitions. Second operand 3 states. 25.00/14.60 [2019-03-28 12:38:17,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 25.00/14.60 [2019-03-28 12:38:17,935 INFO L93 Difference]: Finished difference Result 28 states and 41 transitions. 25.00/14.60 [2019-03-28 12:38:17,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 25.00/14.60 [2019-03-28 12:38:17,936 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 25.00/14.60 [2019-03-28 12:38:17,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 25.00/14.60 [2019-03-28 12:38:17,937 INFO L225 Difference]: With dead ends: 28 25.00/14.60 [2019-03-28 12:38:17,937 INFO L226 Difference]: Without dead ends: 24 25.00/14.60 [2019-03-28 12:38:17,938 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 25.00/14.60 [2019-03-28 12:38:17,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. 25.00/14.60 [2019-03-28 12:38:17,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. 25.00/14.60 [2019-03-28 12:38:17,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. 25.00/14.60 [2019-03-28 12:38:17,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 37 transitions. 25.00/14.60 [2019-03-28 12:38:17,942 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 37 transitions. Word has length 3 25.00/14.60 [2019-03-28 12:38:17,942 INFO L84 Accepts]: Finished accepts. word is rejected. 25.00/14.60 [2019-03-28 12:38:17,942 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 37 transitions. 25.00/14.60 [2019-03-28 12:38:17,942 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 25.00/14.60 [2019-03-28 12:38:17,943 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 37 transitions. 25.00/14.60 [2019-03-28 12:38:17,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 25.00/14.60 [2019-03-28 12:38:17,943 INFO L394 BasicCegarLoop]: Found error trace 25.00/14.60 [2019-03-28 12:38:17,943 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 25.00/14.60 [2019-03-28 12:38:17,943 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== 25.00/14.60 [2019-03-28 12:38:17,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.00/14.60 [2019-03-28 12:38:17,944 INFO L82 PathProgramCache]: Analyzing trace with hash 103247, now seen corresponding path program 1 times 25.00/14.60 [2019-03-28 12:38:17,944 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.00/14.60 [2019-03-28 12:38:17,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.00/14.60 [2019-03-28 12:38:17,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.00/14.60 [2019-03-28 12:38:17,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.00/14.60 [2019-03-28 12:38:17,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.00/14.60 [2019-03-28 12:38:17,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.00/14.60 [2019-03-28 12:38:17,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.00/14.60 [2019-03-28 12:38:17,976 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 25.00/14.60 [2019-03-28 12:38:17,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 25.00/14.60 [2019-03-28 12:38:17,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 25.00/14.60 [2019-03-28 12:38:17,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 25.00/14.60 [2019-03-28 12:38:17,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 25.00/14.60 [2019-03-28 12:38:17,978 INFO L87 Difference]: Start difference. First operand 24 states and 37 transitions. Second operand 3 states. 25.00/14.60 [2019-03-28 12:38:18,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 25.00/14.60 [2019-03-28 12:38:18,038 INFO L93 Difference]: Finished difference Result 24 states and 37 transitions. 25.00/14.60 [2019-03-28 12:38:18,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 25.00/14.60 [2019-03-28 12:38:18,038 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 25.00/14.60 [2019-03-28 12:38:18,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 25.00/14.60 [2019-03-28 12:38:18,039 INFO L225 Difference]: With dead ends: 24 25.00/14.60 [2019-03-28 12:38:18,039 INFO L226 Difference]: Without dead ends: 20 25.00/14.60 [2019-03-28 12:38:18,040 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 25.00/14.60 [2019-03-28 12:38:18,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. 25.00/14.60 [2019-03-28 12:38:18,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. 25.00/14.60 [2019-03-28 12:38:18,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. 25.00/14.60 [2019-03-28 12:38:18,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 33 transitions. 25.00/14.60 [2019-03-28 12:38:18,044 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 33 transitions. Word has length 3 25.00/14.60 [2019-03-28 12:38:18,044 INFO L84 Accepts]: Finished accepts. word is rejected. 25.00/14.60 [2019-03-28 12:38:18,044 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 33 transitions. 25.00/14.60 [2019-03-28 12:38:18,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 25.00/14.60 [2019-03-28 12:38:18,044 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 33 transitions. 25.00/14.60 [2019-03-28 12:38:18,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 25.00/14.60 [2019-03-28 12:38:18,045 INFO L394 BasicCegarLoop]: Found error trace 25.00/14.60 [2019-03-28 12:38:18,045 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 25.00/14.60 [2019-03-28 12:38:18,045 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== 25.00/14.60 [2019-03-28 12:38:18,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.00/14.60 [2019-03-28 12:38:18,045 INFO L82 PathProgramCache]: Analyzing trace with hash 3199033, now seen corresponding path program 1 times 25.00/14.60 [2019-03-28 12:38:18,046 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.00/14.60 [2019-03-28 12:38:18,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.00/14.60 [2019-03-28 12:38:18,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.00/14.60 [2019-03-28 12:38:18,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.00/14.60 [2019-03-28 12:38:18,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.00/14.60 [2019-03-28 12:38:18,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.00/14.60 [2019-03-28 12:38:18,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.00/14.60 [2019-03-28 12:38:18,073 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 25.00/14.60 [2019-03-28 12:38:18,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 25.00/14.60 [2019-03-28 12:38:18,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 25.00/14.60 [2019-03-28 12:38:18,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 25.00/14.60 [2019-03-28 12:38:18,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 25.00/14.60 [2019-03-28 12:38:18,074 INFO L87 Difference]: Start difference. First operand 20 states and 33 transitions. Second operand 3 states. 25.00/14.60 [2019-03-28 12:38:18,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 25.00/14.60 [2019-03-28 12:38:18,142 INFO L93 Difference]: Finished difference Result 20 states and 33 transitions. 25.00/14.60 [2019-03-28 12:38:18,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 25.00/14.60 [2019-03-28 12:38:18,143 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 25.00/14.60 [2019-03-28 12:38:18,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 25.00/14.60 [2019-03-28 12:38:18,143 INFO L225 Difference]: With dead ends: 20 25.00/14.60 [2019-03-28 12:38:18,143 INFO L226 Difference]: Without dead ends: 16 25.00/14.60 [2019-03-28 12:38:18,144 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 25.00/14.60 [2019-03-28 12:38:18,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. 25.00/14.60 [2019-03-28 12:38:18,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. 25.00/14.60 [2019-03-28 12:38:18,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. 25.00/14.60 [2019-03-28 12:38:18,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 25 transitions. 25.00/14.60 [2019-03-28 12:38:18,147 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 25 transitions. Word has length 4 25.00/14.60 [2019-03-28 12:38:18,147 INFO L84 Accepts]: Finished accepts. word is rejected. 25.00/14.60 [2019-03-28 12:38:18,147 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 25 transitions. 25.00/14.60 [2019-03-28 12:38:18,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 25.00/14.60 [2019-03-28 12:38:18,148 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 25 transitions. 25.00/14.60 [2019-03-28 12:38:18,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 25.00/14.60 [2019-03-28 12:38:18,148 INFO L394 BasicCegarLoop]: Found error trace 25.00/14.60 [2019-03-28 12:38:18,148 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 25.00/14.60 [2019-03-28 12:38:18,149 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== 25.00/14.60 [2019-03-28 12:38:18,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.00/14.60 [2019-03-28 12:38:18,149 INFO L82 PathProgramCache]: Analyzing trace with hash 3199034, now seen corresponding path program 1 times 25.00/14.60 [2019-03-28 12:38:18,149 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.00/14.60 [2019-03-28 12:38:18,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.00/14.60 [2019-03-28 12:38:18,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.00/14.60 [2019-03-28 12:38:18,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.00/14.60 [2019-03-28 12:38:18,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.00/14.60 [2019-03-28 12:38:18,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.00/14.60 [2019-03-28 12:38:18,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.00/14.60 [2019-03-28 12:38:18,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 25.00/14.60 [2019-03-28 12:38:18,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 25.00/14.60 [2019-03-28 12:38:18,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 25.00/14.60 [2019-03-28 12:38:18,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 25.00/14.60 [2019-03-28 12:38:18,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 25.00/14.60 [2019-03-28 12:38:18,179 INFO L87 Difference]: Start difference. First operand 16 states and 25 transitions. Second operand 3 states. 25.00/14.60 [2019-03-28 12:38:18,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 25.00/14.60 [2019-03-28 12:38:18,209 INFO L93 Difference]: Finished difference Result 20 states and 25 transitions. 25.00/14.60 [2019-03-28 12:38:18,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 25.00/14.60 [2019-03-28 12:38:18,209 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 25.00/14.60 [2019-03-28 12:38:18,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 25.00/14.60 [2019-03-28 12:38:18,210 INFO L225 Difference]: With dead ends: 20 25.00/14.60 [2019-03-28 12:38:18,210 INFO L226 Difference]: Without dead ends: 16 25.00/14.60 [2019-03-28 12:38:18,211 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 25.00/14.60 [2019-03-28 12:38:18,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. 25.00/14.60 [2019-03-28 12:38:18,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. 25.00/14.60 [2019-03-28 12:38:18,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. 25.00/14.60 [2019-03-28 12:38:18,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. 25.00/14.60 [2019-03-28 12:38:18,214 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 21 transitions. Word has length 4 25.00/14.60 [2019-03-28 12:38:18,214 INFO L84 Accepts]: Finished accepts. word is rejected. 25.00/14.60 [2019-03-28 12:38:18,214 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 21 transitions. 25.00/14.60 [2019-03-28 12:38:18,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 25.00/14.60 [2019-03-28 12:38:18,214 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 21 transitions. 25.00/14.60 [2019-03-28 12:38:18,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 25.00/14.60 [2019-03-28 12:38:18,215 INFO L394 BasicCegarLoop]: Found error trace 25.00/14.60 [2019-03-28 12:38:18,215 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 25.00/14.60 [2019-03-28 12:38:18,215 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== 25.00/14.60 [2019-03-28 12:38:18,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.00/14.60 [2019-03-28 12:38:18,215 INFO L82 PathProgramCache]: Analyzing trace with hash 3199035, now seen corresponding path program 1 times 25.00/14.60 [2019-03-28 12:38:18,216 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.00/14.60 [2019-03-28 12:38:18,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.00/14.60 [2019-03-28 12:38:18,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.00/14.60 [2019-03-28 12:38:18,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.00/14.60 [2019-03-28 12:38:18,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.00/14.60 [2019-03-28 12:38:18,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.00/14.60 [2019-03-28 12:38:18,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.00/14.60 [2019-03-28 12:38:18,244 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 25.00/14.60 [2019-03-28 12:38:18,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 25.00/14.60 [2019-03-28 12:38:18,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 25.00/14.60 [2019-03-28 12:38:18,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 25.00/14.60 [2019-03-28 12:38:18,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 25.00/14.60 [2019-03-28 12:38:18,245 INFO L87 Difference]: Start difference. First operand 16 states and 21 transitions. Second operand 3 states. 25.00/14.60 [2019-03-28 12:38:18,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 25.00/14.60 [2019-03-28 12:38:18,283 INFO L93 Difference]: Finished difference Result 16 states and 21 transitions. 25.00/14.60 [2019-03-28 12:38:18,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 25.00/14.60 [2019-03-28 12:38:18,283 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 25.00/14.60 [2019-03-28 12:38:18,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 25.00/14.60 [2019-03-28 12:38:18,284 INFO L225 Difference]: With dead ends: 16 25.00/14.60 [2019-03-28 12:38:18,284 INFO L226 Difference]: Without dead ends: 0 25.00/14.60 [2019-03-28 12:38:18,284 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 25.00/14.60 [2019-03-28 12:38:18,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. 25.00/14.60 [2019-03-28 12:38:18,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. 25.00/14.60 [2019-03-28 12:38:18,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. 25.00/14.60 [2019-03-28 12:38:18,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. 25.00/14.60 [2019-03-28 12:38:18,285 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 4 25.00/14.60 [2019-03-28 12:38:18,286 INFO L84 Accepts]: Finished accepts. word is rejected. 25.00/14.60 [2019-03-28 12:38:18,286 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. 25.00/14.60 [2019-03-28 12:38:18,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 25.00/14.60 [2019-03-28 12:38:18,286 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. 25.00/14.60 [2019-03-28 12:38:18,286 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 25.00/14.60 [2019-03-28 12:38:18,291 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. 25.00/14.60 [2019-03-28 12:38:18,316 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 25.00/14.60 [2019-03-28 12:38:18,316 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 25.00/14.60 [2019-03-28 12:38:18,316 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 25.00/14.60 [2019-03-28 12:38:18,317 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 25.00/14.60 [2019-03-28 12:38:18,317 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 25.00/14.60 [2019-03-28 12:38:18,317 INFO L448 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. 25.00/14.60 [2019-03-28 12:38:18,317 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 25.00/14.60 [2019-03-28 12:38:18,317 INFO L448 ceAbstractionStarter]: For program point L11(lines 11 14) no Hoare annotation was computed. 25.00/14.60 [2019-03-28 12:38:18,317 INFO L448 ceAbstractionStarter]: For program point L13-2(line 13) no Hoare annotation was computed. 25.00/14.60 [2019-03-28 12:38:18,317 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 25.00/14.60 [2019-03-28 12:38:18,317 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 25.00/14.60 [2019-03-28 12:38:18,318 INFO L448 ceAbstractionStarter]: For program point L9(line 9) no Hoare annotation was computed. 25.00/14.60 [2019-03-28 12:38:18,318 INFO L444 ceAbstractionStarter]: At program point L11-2(lines 10 14) the Hoare annotation is: (and (= 0 ULTIMATE.start_mlog_~x_ref~0.offset) (= (select |#length| ULTIMATE.start_mlog_~res~0.base) 4) (= 0 ULTIMATE.start_mlog_~res~0.offset) (= 1 (select |#valid| ULTIMATE.start_mlog_~x_ref~0.base)) (= 4 (select |#length| ULTIMATE.start_mlog_~x_ref~0.base)) (= (select |#valid| ULTIMATE.start_mlog_~res~0.base) 1)) 25.00/14.60 [2019-03-28 12:38:18,318 INFO L448 ceAbstractionStarter]: For program point L9-1(line 9) no Hoare annotation was computed. 25.00/14.60 [2019-03-28 12:38:18,318 INFO L448 ceAbstractionStarter]: For program point L11-3(lines 11 14) no Hoare annotation was computed. 25.00/14.60 [2019-03-28 12:38:18,318 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. 25.00/14.60 [2019-03-28 12:38:18,319 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 25.00/14.60 [2019-03-28 12:38:18,319 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. 25.00/14.60 [2019-03-28 12:38:18,319 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. 25.00/14.60 [2019-03-28 12:38:18,319 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. 25.00/14.60 [2019-03-28 12:38:18,319 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. 25.00/14.60 [2019-03-28 12:38:18,319 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 25.00/14.60 [2019-03-28 12:38:18,319 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 25.00/14.60 [2019-03-28 12:38:18,319 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. 25.00/14.60 [2019-03-28 12:38:18,320 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. 25.00/14.60 [2019-03-28 12:38:18,320 INFO L448 ceAbstractionStarter]: For program point L12(line 12) no Hoare annotation was computed. 25.00/14.60 [2019-03-28 12:38:18,320 INFO L448 ceAbstractionStarter]: For program point L12-1(line 12) no Hoare annotation was computed. 25.00/14.60 [2019-03-28 12:38:18,320 INFO L448 ceAbstractionStarter]: For program point L12-2(line 12) no Hoare annotation was computed. 25.00/14.60 [2019-03-28 12:38:18,320 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg 25.00/14.60 [2019-03-28 12:38:18,329 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.00/14.60 [2019-03-28 12:38:18,330 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.00/14.60 [2019-03-28 12:38:18,336 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.00/14.60 [2019-03-28 12:38:18,336 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.00/14.60 [2019-03-28 12:38:18,338 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:38:18 BasicIcfg 25.00/14.60 [2019-03-28 12:38:18,339 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 25.00/14.60 [2019-03-28 12:38:18,339 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 25.00/14.60 [2019-03-28 12:38:18,339 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 25.00/14.60 [2019-03-28 12:38:18,343 INFO L276 PluginConnector]: BuchiAutomizer initialized 25.00/14.60 [2019-03-28 12:38:18,344 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 25.00/14.60 [2019-03-28 12:38:18,344 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 12:38:16" (1/5) ... 25.00/14.60 [2019-03-28 12:38:18,345 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1fe96ee7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:38:18, skipping insertion in model container 25.00/14.60 [2019-03-28 12:38:18,345 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 25.00/14.60 [2019-03-28 12:38:18,345 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:38:16" (2/5) ... 25.00/14.60 [2019-03-28 12:38:18,345 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1fe96ee7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:38:18, skipping insertion in model container 25.00/14.60 [2019-03-28 12:38:18,345 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 25.00/14.60 [2019-03-28 12:38:18,345 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:38:17" (3/5) ... 25.00/14.60 [2019-03-28 12:38:18,346 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1fe96ee7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:38:18, skipping insertion in model container 25.00/14.60 [2019-03-28 12:38:18,346 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 25.00/14.60 [2019-03-28 12:38:18,346 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:38:17" (4/5) ... 25.00/14.60 [2019-03-28 12:38:18,346 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1fe96ee7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:38:18, skipping insertion in model container 25.00/14.60 [2019-03-28 12:38:18,347 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 25.00/14.60 [2019-03-28 12:38:18,347 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:38:18" (5/5) ... 25.00/14.60 [2019-03-28 12:38:18,348 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 25.00/14.60 [2019-03-28 12:38:18,370 INFO L133 ementStrategyFactory]: Using default assertion order modulation 25.00/14.60 [2019-03-28 12:38:18,370 INFO L374 BuchiCegarLoop]: Interprodecural is true 25.00/14.60 [2019-03-28 12:38:18,370 INFO L375 BuchiCegarLoop]: Hoare is true 25.00/14.60 [2019-03-28 12:38:18,370 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 25.00/14.60 [2019-03-28 12:38:18,370 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 25.00/14.60 [2019-03-28 12:38:18,370 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 25.00/14.60 [2019-03-28 12:38:18,371 INFO L379 BuchiCegarLoop]: Difference is false 25.00/14.60 [2019-03-28 12:38:18,371 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 25.00/14.60 [2019-03-28 12:38:18,371 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 25.00/14.60 [2019-03-28 12:38:18,375 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states. 25.00/14.60 [2019-03-28 12:38:18,380 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 25.00/14.60 [2019-03-28 12:38:18,381 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 25.00/14.60 [2019-03-28 12:38:18,381 INFO L119 BuchiIsEmpty]: Starting construction of run 25.00/14.60 [2019-03-28 12:38:18,385 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 25.00/14.60 [2019-03-28 12:38:18,385 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] 25.00/14.60 [2019-03-28 12:38:18,386 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 25.00/14.60 [2019-03-28 12:38:18,386 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states. 25.00/14.60 [2019-03-28 12:38:18,388 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 25.00/14.60 [2019-03-28 12:38:18,388 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 25.00/14.60 [2019-03-28 12:38:18,388 INFO L119 BuchiIsEmpty]: Starting construction of run 25.00/14.60 [2019-03-28 12:38:18,389 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 25.00/14.60 [2019-03-28 12:38:18,389 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] 25.00/14.60 [2019-03-28 12:38:18,394 INFO L794 eck$LassoCheckResult]: Stem: 22#ULTIMATE.startENTRYtrue [73] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 12#L-1true [106] L-1-->L9: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_mlog_#t~malloc0.base_1| 1))) (and (= 0 |v_ULTIMATE.start_mlog_#t~malloc0.offset_1|) (> 0 |v_ULTIMATE.start_mlog_#t~malloc0.base_1|) (= (store (store |v_#length_3| |v_ULTIMATE.start_mlog_#t~malloc0.base_1| 4) |v_ULTIMATE.start_mlog_#t~malloc1.base_1| 4) |v_#length_1|) (< |v_ULTIMATE.start_mlog_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_mlog_#in~x_1| |v_ULTIMATE.start_main_#t~nondet7_1|) (= v_ULTIMATE.start_mlog_~x_1 |v_ULTIMATE.start_mlog_#in~x_1|) (= 0 |v_ULTIMATE.start_mlog_#t~malloc1.offset_1|) (= v_ULTIMATE.start_mlog_~res~0.offset_1 |v_ULTIMATE.start_mlog_#t~malloc1.offset_1|) (= v_ULTIMATE.start_mlog_~res~0.base_1 |v_ULTIMATE.start_mlog_#t~malloc1.base_1|) (= |v_#valid_3| (store .cse0 |v_ULTIMATE.start_mlog_#t~malloc1.base_1| 1)) (= (select .cse0 |v_ULTIMATE.start_mlog_#t~malloc1.base_1|) 0) (< |v_ULTIMATE.start_mlog_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_mlog_~x_ref~0.base_1 |v_ULTIMATE.start_mlog_#t~malloc0.base_1|) (> 0 |v_ULTIMATE.start_mlog_#t~malloc1.base_1|) (= v_ULTIMATE.start_mlog_~x_ref~0.offset_1 |v_ULTIMATE.start_mlog_#t~malloc0.offset_1|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_mlog_#t~malloc0.base_1|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_mlog_~x_ref~0.offset=v_ULTIMATE.start_mlog_~x_ref~0.offset_1, ULTIMATE.start_mlog_~res~0.offset=v_ULTIMATE.start_mlog_~res~0.offset_1, ULTIMATE.start_mlog_#t~mem6=|v_ULTIMATE.start_mlog_#t~mem6_1|, ULTIMATE.start_mlog_#t~mem2=|v_ULTIMATE.start_mlog_#t~mem2_1|, ULTIMATE.start_mlog_~res~0.base=v_ULTIMATE.start_mlog_~res~0.base_1, ULTIMATE.start_mlog_#t~mem4=|v_ULTIMATE.start_mlog_#t~mem4_1|, ULTIMATE.start_mlog_#t~mem3=|v_ULTIMATE.start_mlog_#t~mem3_1|, ULTIMATE.start_mlog_#t~malloc1.offset=|v_ULTIMATE.start_mlog_#t~malloc1.offset_1|, ULTIMATE.start_mlog_#res=|v_ULTIMATE.start_mlog_#res_1|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_1|, ULTIMATE.start_mlog_#t~post5=|v_ULTIMATE.start_mlog_#t~post5_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_mlog_#in~x=|v_ULTIMATE.start_mlog_#in~x_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_mlog_#t~malloc0.offset=|v_ULTIMATE.start_mlog_#t~malloc0.offset_1|, #valid=|v_#valid_3|, ULTIMATE.start_mlog_#t~malloc1.base=|v_ULTIMATE.start_mlog_#t~malloc1.base_1|, ULTIMATE.start_mlog_#t~malloc0.base=|v_ULTIMATE.start_mlog_#t~malloc0.base_1|, ULTIMATE.start_mlog_~x_ref~0.base=v_ULTIMATE.start_mlog_~x_ref~0.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~ret8=|v_ULTIMATE.start_main_#t~ret8_1|, ULTIMATE.start_mlog_~x=v_ULTIMATE.start_mlog_~x_1} AuxVars[] AssignedVars[ULTIMATE.start_mlog_~x_ref~0.offset, ULTIMATE.start_mlog_~res~0.offset, ULTIMATE.start_mlog_#t~mem6, ULTIMATE.start_mlog_#t~mem2, ULTIMATE.start_mlog_~res~0.base, ULTIMATE.start_mlog_#t~mem4, ULTIMATE.start_mlog_#t~mem3, ULTIMATE.start_mlog_#t~malloc1.offset, ULTIMATE.start_mlog_#res, ULTIMATE.start_main_#t~nondet7, ULTIMATE.start_mlog_#t~post5, ULTIMATE.start_mlog_#in~x, ULTIMATE.start_main_#res, ULTIMATE.start_mlog_#t~malloc0.offset, #valid, ULTIMATE.start_mlog_#t~malloc1.base, ULTIMATE.start_mlog_#t~malloc0.base, ULTIMATE.start_mlog_~x_ref~0.base, #length, ULTIMATE.start_main_#t~ret8, ULTIMATE.start_mlog_~x] 9#L9true [54] L9-->L9-1: Formula: (and (<= (+ v_ULTIMATE.start_mlog_~x_ref~0.offset_3 4) (select |v_#length_4| v_ULTIMATE.start_mlog_~x_ref~0.base_3)) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_mlog_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_mlog_~x_ref~0.base_3) v_ULTIMATE.start_mlog_~x_ref~0.offset_3 v_ULTIMATE.start_mlog_~x_3))) (= 1 (select |v_#valid_6| v_ULTIMATE.start_mlog_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_mlog_~x_ref~0.offset_3)) InVars {ULTIMATE.start_mlog_~x_ref~0.offset=v_ULTIMATE.start_mlog_~x_ref~0.offset_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_mlog_~x_ref~0.base=v_ULTIMATE.start_mlog_~x_ref~0.base_3, #length=|v_#length_4|, ULTIMATE.start_mlog_~x=v_ULTIMATE.start_mlog_~x_3} OutVars{ULTIMATE.start_mlog_~x_ref~0.offset=v_ULTIMATE.start_mlog_~x_ref~0.offset_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_mlog_~x_ref~0.base=v_ULTIMATE.start_mlog_~x_ref~0.base_3, #length=|v_#length_4|, ULTIMATE.start_mlog_~x=v_ULTIMATE.start_mlog_~x_3} AuxVars[] AssignedVars[#memory_int] 6#L9-1true [48] L9-1-->L11-2: Formula: (and (<= (+ v_ULTIMATE.start_mlog_~res~0.offset_3 4) (select |v_#length_6| v_ULTIMATE.start_mlog_~res~0.base_3)) (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_mlog_~res~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_mlog_~res~0.base_3) v_ULTIMATE.start_mlog_~res~0.offset_3 0))) (= 1 (select |v_#valid_8| v_ULTIMATE.start_mlog_~res~0.base_3)) (<= 0 v_ULTIMATE.start_mlog_~res~0.offset_3)) InVars {ULTIMATE.start_mlog_~res~0.offset=v_ULTIMATE.start_mlog_~res~0.offset_3, #memory_int=|v_#memory_int_4|, #length=|v_#length_6|, ULTIMATE.start_mlog_~res~0.base=v_ULTIMATE.start_mlog_~res~0.base_3, #valid=|v_#valid_8|} OutVars{ULTIMATE.start_mlog_~res~0.offset=v_ULTIMATE.start_mlog_~res~0.offset_3, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_mlog_~res~0.base=v_ULTIMATE.start_mlog_~res~0.base_3, #valid=|v_#valid_8|} AuxVars[] AssignedVars[#memory_int] 10#L11-2true 25.00/14.60 [2019-03-28 12:38:18,395 INFO L796 eck$LassoCheckResult]: Loop: 10#L11-2true [58] L11-2-->L11: Formula: (and (<= (+ v_ULTIMATE.start_mlog_~x_ref~0.offset_5 4) (select |v_#length_8| v_ULTIMATE.start_mlog_~x_ref~0.base_6)) (<= 0 v_ULTIMATE.start_mlog_~x_ref~0.offset_5) (= |v_ULTIMATE.start_mlog_#t~mem2_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_mlog_~x_ref~0.base_6) v_ULTIMATE.start_mlog_~x_ref~0.offset_5)) (= 1 (select |v_#valid_10| v_ULTIMATE.start_mlog_~x_ref~0.base_6))) InVars {ULTIMATE.start_mlog_~x_ref~0.offset=v_ULTIMATE.start_mlog_~x_ref~0.offset_5, #memory_int=|v_#memory_int_5|, ULTIMATE.start_mlog_~x_ref~0.base=v_ULTIMATE.start_mlog_~x_ref~0.base_6, #length=|v_#length_8|, #valid=|v_#valid_10|} OutVars{ULTIMATE.start_mlog_~x_ref~0.offset=v_ULTIMATE.start_mlog_~x_ref~0.offset_5, ULTIMATE.start_mlog_#t~mem2=|v_ULTIMATE.start_mlog_#t~mem2_2|, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_mlog_~x_ref~0.base=v_ULTIMATE.start_mlog_~x_ref~0.base_6, #length=|v_#length_8|} AuxVars[] AssignedVars[ULTIMATE.start_mlog_#t~mem2] 23#L11true [75] L11-->L12: Formula: (< 1 |v_ULTIMATE.start_mlog_#t~mem2_6|) InVars {ULTIMATE.start_mlog_#t~mem2=|v_ULTIMATE.start_mlog_#t~mem2_6|} OutVars{ULTIMATE.start_mlog_#t~mem2=|v_ULTIMATE.start_mlog_#t~mem2_5|} AuxVars[] AssignedVars[ULTIMATE.start_mlog_#t~mem2] 15#L12true [66] L12-->L12-1: Formula: (and (<= (+ v_ULTIMATE.start_mlog_~x_ref~0.offset_7 4) (select |v_#length_10| v_ULTIMATE.start_mlog_~x_ref~0.base_9)) (<= 0 v_ULTIMATE.start_mlog_~x_ref~0.offset_7) (= (select (select |v_#memory_int_6| v_ULTIMATE.start_mlog_~x_ref~0.base_9) v_ULTIMATE.start_mlog_~x_ref~0.offset_7) |v_ULTIMATE.start_mlog_#t~mem3_2|) (= 1 (select |v_#valid_12| v_ULTIMATE.start_mlog_~x_ref~0.base_9))) InVars {ULTIMATE.start_mlog_~x_ref~0.offset=v_ULTIMATE.start_mlog_~x_ref~0.offset_7, #memory_int=|v_#memory_int_6|, ULTIMATE.start_mlog_~x_ref~0.base=v_ULTIMATE.start_mlog_~x_ref~0.base_9, #length=|v_#length_10|, #valid=|v_#valid_12|} OutVars{ULTIMATE.start_mlog_~x_ref~0.offset=v_ULTIMATE.start_mlog_~x_ref~0.offset_7, ULTIMATE.start_mlog_#t~mem3=|v_ULTIMATE.start_mlog_#t~mem3_2|, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_mlog_~x_ref~0.base=v_ULTIMATE.start_mlog_~x_ref~0.base_9, #length=|v_#length_10|} AuxVars[] AssignedVars[ULTIMATE.start_mlog_#t~mem3] 14#L12-1true [128] L12-1-->L12-2: Formula: (and (= (store |v_#memory_int_8| v_ULTIMATE.start_mlog_~x_ref~0.base_12 (store (select |v_#memory_int_8| v_ULTIMATE.start_mlog_~x_ref~0.base_12) v_ULTIMATE.start_mlog_~x_ref~0.offset_9 (+ (div |v_ULTIMATE.start_mlog_#t~mem3_3| 2) 1))) |v_#memory_int_7|) (<= (+ v_ULTIMATE.start_mlog_~x_ref~0.offset_9 4) (select |v_#length_12| v_ULTIMATE.start_mlog_~x_ref~0.base_12)) (< |v_ULTIMATE.start_mlog_#t~mem3_3| 0) (< 0 (mod |v_ULTIMATE.start_mlog_#t~mem3_3| 2)) (<= 0 v_ULTIMATE.start_mlog_~x_ref~0.offset_9) (= 1 (select |v_#valid_14| v_ULTIMATE.start_mlog_~x_ref~0.base_12))) InVars {ULTIMATE.start_mlog_~x_ref~0.offset=v_ULTIMATE.start_mlog_~x_ref~0.offset_9, #valid=|v_#valid_14|, ULTIMATE.start_mlog_#t~mem3=|v_ULTIMATE.start_mlog_#t~mem3_3|, #memory_int=|v_#memory_int_8|, #length=|v_#length_12|, ULTIMATE.start_mlog_~x_ref~0.base=v_ULTIMATE.start_mlog_~x_ref~0.base_12} OutVars{ULTIMATE.start_mlog_~x_ref~0.offset=v_ULTIMATE.start_mlog_~x_ref~0.offset_9, #valid=|v_#valid_14|, ULTIMATE.start_mlog_#t~mem3=|v_ULTIMATE.start_mlog_#t~mem3_3|, #memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_mlog_~x_ref~0.base=v_ULTIMATE.start_mlog_~x_ref~0.base_12} AuxVars[] AssignedVars[#memory_int] 13#L12-2true [62] L12-2-->L13: Formula: true InVars {} OutVars{ULTIMATE.start_mlog_#t~mem3=|v_ULTIMATE.start_mlog_#t~mem3_4|} AuxVars[] AssignedVars[ULTIMATE.start_mlog_#t~mem3] 28#L13true [146] L13-->L13-2: Formula: (and (<= 0 v_ULTIMATE.start_mlog_~res~0.offset_14) (= (select (select |v_#memory_int_16| v_ULTIMATE.start_mlog_~res~0.base_18) v_ULTIMATE.start_mlog_~res~0.offset_14) |v_ULTIMATE.start_mlog_#t~mem4_5|) (= |v_ULTIMATE.start_mlog_#t~post5_5| |v_ULTIMATE.start_mlog_#t~mem4_5|) (= (select |v_#valid_31| v_ULTIMATE.start_mlog_~res~0.base_18) 1) (<= (+ v_ULTIMATE.start_mlog_~res~0.offset_14 4) (select |v_#length_23| v_ULTIMATE.start_mlog_~res~0.base_18))) InVars {ULTIMATE.start_mlog_~res~0.offset=v_ULTIMATE.start_mlog_~res~0.offset_14, ULTIMATE.start_mlog_~res~0.base=v_ULTIMATE.start_mlog_~res~0.base_18, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_16|, #length=|v_#length_23|} OutVars{ULTIMATE.start_mlog_~res~0.offset=v_ULTIMATE.start_mlog_~res~0.offset_14, ULTIMATE.start_mlog_~res~0.base=v_ULTIMATE.start_mlog_~res~0.base_18, ULTIMATE.start_mlog_#t~mem4=|v_ULTIMATE.start_mlog_#t~mem4_5|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_16|, #length=|v_#length_23|, ULTIMATE.start_mlog_#t~post5=|v_ULTIMATE.start_mlog_#t~post5_5|} AuxVars[] AssignedVars[ULTIMATE.start_mlog_#t~mem4, ULTIMATE.start_mlog_#t~post5] 25#L13-2true [148] L13-2-->L11-2: Formula: (and (= (select |v_#valid_34| v_ULTIMATE.start_mlog_~res~0.base_20) 1) (<= 0 v_ULTIMATE.start_mlog_~res~0.offset_16) (<= (+ v_ULTIMATE.start_mlog_~res~0.offset_16 4) (select |v_#length_25| v_ULTIMATE.start_mlog_~res~0.base_20)) (= (store |v_#memory_int_19| v_ULTIMATE.start_mlog_~res~0.base_20 (store (select |v_#memory_int_19| v_ULTIMATE.start_mlog_~res~0.base_20) v_ULTIMATE.start_mlog_~res~0.offset_16 (+ |v_ULTIMATE.start_mlog_#t~post5_7| 1))) |v_#memory_int_18|)) InVars {ULTIMATE.start_mlog_~res~0.offset=v_ULTIMATE.start_mlog_~res~0.offset_16, ULTIMATE.start_mlog_~res~0.base=v_ULTIMATE.start_mlog_~res~0.base_20, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_19|, #length=|v_#length_25|, ULTIMATE.start_mlog_#t~post5=|v_ULTIMATE.start_mlog_#t~post5_7|} OutVars{ULTIMATE.start_mlog_~res~0.offset=v_ULTIMATE.start_mlog_~res~0.offset_16, ULTIMATE.start_mlog_~res~0.base=v_ULTIMATE.start_mlog_~res~0.base_20, ULTIMATE.start_mlog_#t~mem4=|v_ULTIMATE.start_mlog_#t~mem4_6|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_18|, #length=|v_#length_25|, ULTIMATE.start_mlog_#t~post5=|v_ULTIMATE.start_mlog_#t~post5_6|} AuxVars[] AssignedVars[ULTIMATE.start_mlog_#t~mem4, #memory_int, ULTIMATE.start_mlog_#t~post5] 10#L11-2true 25.00/14.60 [2019-03-28 12:38:18,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.00/14.60 [2019-03-28 12:38:18,396 INFO L82 PathProgramCache]: Analyzing trace with hash 3201852, now seen corresponding path program 1 times 25.00/14.60 [2019-03-28 12:38:18,396 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.00/14.60 [2019-03-28 12:38:18,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.00/14.60 [2019-03-28 12:38:18,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.00/14.60 [2019-03-28 12:38:18,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.00/14.60 [2019-03-28 12:38:18,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.00/14.60 [2019-03-28 12:38:18,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.00/14.60 [2019-03-28 12:38:18,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.00/14.60 [2019-03-28 12:38:18,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.00/14.60 [2019-03-28 12:38:18,442 INFO L82 PathProgramCache]: Analyzing trace with hash -404534800, now seen corresponding path program 1 times 25.00/14.60 [2019-03-28 12:38:18,442 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.00/14.60 [2019-03-28 12:38:18,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.00/14.60 [2019-03-28 12:38:18,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.00/14.60 [2019-03-28 12:38:18,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.00/14.60 [2019-03-28 12:38:18,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.00/14.60 [2019-03-28 12:38:18,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.00/14.60 [2019-03-28 12:38:18,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.00/14.60 [2019-03-28 12:38:18,487 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 25.00/14.60 [2019-03-28 12:38:18,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 25.00/14.60 [2019-03-28 12:38:18,488 INFO L811 eck$LassoCheckResult]: loop already infeasible 25.00/14.60 [2019-03-28 12:38:18,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 25.00/14.60 [2019-03-28 12:38:18,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 25.00/14.60 [2019-03-28 12:38:18,489 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 5 states. 25.00/14.60 [2019-03-28 12:38:18,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 25.00/14.60 [2019-03-28 12:38:18,662 INFO L93 Difference]: Finished difference Result 28 states and 48 transitions. 25.00/14.60 [2019-03-28 12:38:18,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 25.00/14.60 [2019-03-28 12:38:18,665 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 48 transitions. 25.00/14.60 [2019-03-28 12:38:18,666 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 25.00/14.60 [2019-03-28 12:38:18,667 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 11 states and 15 transitions. 25.00/14.60 [2019-03-28 12:38:18,668 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 25.00/14.60 [2019-03-28 12:38:18,668 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 25.00/14.60 [2019-03-28 12:38:18,669 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 15 transitions. 25.00/14.60 [2019-03-28 12:38:18,669 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 25.00/14.60 [2019-03-28 12:38:18,670 INFO L706 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. 25.00/14.60 [2019-03-28 12:38:18,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 15 transitions. 25.00/14.60 [2019-03-28 12:38:18,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. 25.00/14.60 [2019-03-28 12:38:18,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. 25.00/14.60 [2019-03-28 12:38:18,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. 25.00/14.60 [2019-03-28 12:38:18,672 INFO L729 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. 25.00/14.60 [2019-03-28 12:38:18,672 INFO L609 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. 25.00/14.60 [2019-03-28 12:38:18,672 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 25.00/14.60 [2019-03-28 12:38:18,672 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 15 transitions. 25.00/14.60 [2019-03-28 12:38:18,673 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 25.00/14.60 [2019-03-28 12:38:18,674 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 25.00/14.60 [2019-03-28 12:38:18,674 INFO L119 BuchiIsEmpty]: Starting construction of run 25.00/14.60 [2019-03-28 12:38:18,674 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 25.00/14.60 [2019-03-28 12:38:18,674 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] 25.00/14.60 [2019-03-28 12:38:18,675 INFO L794 eck$LassoCheckResult]: Stem: 73#ULTIMATE.startENTRY [73] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 69#L-1 [106] L-1-->L9: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_mlog_#t~malloc0.base_1| 1))) (and (= 0 |v_ULTIMATE.start_mlog_#t~malloc0.offset_1|) (> 0 |v_ULTIMATE.start_mlog_#t~malloc0.base_1|) (= (store (store |v_#length_3| |v_ULTIMATE.start_mlog_#t~malloc0.base_1| 4) |v_ULTIMATE.start_mlog_#t~malloc1.base_1| 4) |v_#length_1|) (< |v_ULTIMATE.start_mlog_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_mlog_#in~x_1| |v_ULTIMATE.start_main_#t~nondet7_1|) (= v_ULTIMATE.start_mlog_~x_1 |v_ULTIMATE.start_mlog_#in~x_1|) (= 0 |v_ULTIMATE.start_mlog_#t~malloc1.offset_1|) (= v_ULTIMATE.start_mlog_~res~0.offset_1 |v_ULTIMATE.start_mlog_#t~malloc1.offset_1|) (= v_ULTIMATE.start_mlog_~res~0.base_1 |v_ULTIMATE.start_mlog_#t~malloc1.base_1|) (= |v_#valid_3| (store .cse0 |v_ULTIMATE.start_mlog_#t~malloc1.base_1| 1)) (= (select .cse0 |v_ULTIMATE.start_mlog_#t~malloc1.base_1|) 0) (< |v_ULTIMATE.start_mlog_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_mlog_~x_ref~0.base_1 |v_ULTIMATE.start_mlog_#t~malloc0.base_1|) (> 0 |v_ULTIMATE.start_mlog_#t~malloc1.base_1|) (= v_ULTIMATE.start_mlog_~x_ref~0.offset_1 |v_ULTIMATE.start_mlog_#t~malloc0.offset_1|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_mlog_#t~malloc0.base_1|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_mlog_~x_ref~0.offset=v_ULTIMATE.start_mlog_~x_ref~0.offset_1, ULTIMATE.start_mlog_~res~0.offset=v_ULTIMATE.start_mlog_~res~0.offset_1, ULTIMATE.start_mlog_#t~mem6=|v_ULTIMATE.start_mlog_#t~mem6_1|, ULTIMATE.start_mlog_#t~mem2=|v_ULTIMATE.start_mlog_#t~mem2_1|, ULTIMATE.start_mlog_~res~0.base=v_ULTIMATE.start_mlog_~res~0.base_1, ULTIMATE.start_mlog_#t~mem4=|v_ULTIMATE.start_mlog_#t~mem4_1|, ULTIMATE.start_mlog_#t~mem3=|v_ULTIMATE.start_mlog_#t~mem3_1|, ULTIMATE.start_mlog_#t~malloc1.offset=|v_ULTIMATE.start_mlog_#t~malloc1.offset_1|, ULTIMATE.start_mlog_#res=|v_ULTIMATE.start_mlog_#res_1|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_1|, ULTIMATE.start_mlog_#t~post5=|v_ULTIMATE.start_mlog_#t~post5_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_mlog_#in~x=|v_ULTIMATE.start_mlog_#in~x_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_mlog_#t~malloc0.offset=|v_ULTIMATE.start_mlog_#t~malloc0.offset_1|, #valid=|v_#valid_3|, ULTIMATE.start_mlog_#t~malloc1.base=|v_ULTIMATE.start_mlog_#t~malloc1.base_1|, ULTIMATE.start_mlog_#t~malloc0.base=|v_ULTIMATE.start_mlog_#t~malloc0.base_1|, ULTIMATE.start_mlog_~x_ref~0.base=v_ULTIMATE.start_mlog_~x_ref~0.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~ret8=|v_ULTIMATE.start_main_#t~ret8_1|, ULTIMATE.start_mlog_~x=v_ULTIMATE.start_mlog_~x_1} AuxVars[] AssignedVars[ULTIMATE.start_mlog_~x_ref~0.offset, ULTIMATE.start_mlog_~res~0.offset, ULTIMATE.start_mlog_#t~mem6, ULTIMATE.start_mlog_#t~mem2, ULTIMATE.start_mlog_~res~0.base, ULTIMATE.start_mlog_#t~mem4, ULTIMATE.start_mlog_#t~mem3, ULTIMATE.start_mlog_#t~malloc1.offset, ULTIMATE.start_mlog_#res, ULTIMATE.start_main_#t~nondet7, ULTIMATE.start_mlog_#t~post5, ULTIMATE.start_mlog_#in~x, ULTIMATE.start_main_#res, ULTIMATE.start_mlog_#t~malloc0.offset, #valid, ULTIMATE.start_mlog_#t~malloc1.base, ULTIMATE.start_mlog_#t~malloc0.base, ULTIMATE.start_mlog_~x_ref~0.base, #length, ULTIMATE.start_main_#t~ret8, ULTIMATE.start_mlog_~x] 70#L9 [54] L9-->L9-1: Formula: (and (<= (+ v_ULTIMATE.start_mlog_~x_ref~0.offset_3 4) (select |v_#length_4| v_ULTIMATE.start_mlog_~x_ref~0.base_3)) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_mlog_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_mlog_~x_ref~0.base_3) v_ULTIMATE.start_mlog_~x_ref~0.offset_3 v_ULTIMATE.start_mlog_~x_3))) (= 1 (select |v_#valid_6| v_ULTIMATE.start_mlog_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_mlog_~x_ref~0.offset_3)) InVars {ULTIMATE.start_mlog_~x_ref~0.offset=v_ULTIMATE.start_mlog_~x_ref~0.offset_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_mlog_~x_ref~0.base=v_ULTIMATE.start_mlog_~x_ref~0.base_3, #length=|v_#length_4|, ULTIMATE.start_mlog_~x=v_ULTIMATE.start_mlog_~x_3} OutVars{ULTIMATE.start_mlog_~x_ref~0.offset=v_ULTIMATE.start_mlog_~x_ref~0.offset_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_mlog_~x_ref~0.base=v_ULTIMATE.start_mlog_~x_ref~0.base_3, #length=|v_#length_4|, ULTIMATE.start_mlog_~x=v_ULTIMATE.start_mlog_~x_3} AuxVars[] AssignedVars[#memory_int] 79#L9-1 [48] L9-1-->L11-2: Formula: (and (<= (+ v_ULTIMATE.start_mlog_~res~0.offset_3 4) (select |v_#length_6| v_ULTIMATE.start_mlog_~res~0.base_3)) (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_mlog_~res~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_mlog_~res~0.base_3) v_ULTIMATE.start_mlog_~res~0.offset_3 0))) (= 1 (select |v_#valid_8| v_ULTIMATE.start_mlog_~res~0.base_3)) (<= 0 v_ULTIMATE.start_mlog_~res~0.offset_3)) InVars {ULTIMATE.start_mlog_~res~0.offset=v_ULTIMATE.start_mlog_~res~0.offset_3, #memory_int=|v_#memory_int_4|, #length=|v_#length_6|, ULTIMATE.start_mlog_~res~0.base=v_ULTIMATE.start_mlog_~res~0.base_3, #valid=|v_#valid_8|} OutVars{ULTIMATE.start_mlog_~res~0.offset=v_ULTIMATE.start_mlog_~res~0.offset_3, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_mlog_~res~0.base=v_ULTIMATE.start_mlog_~res~0.base_3, #valid=|v_#valid_8|} AuxVars[] AssignedVars[#memory_int] 75#L11-2 25.00/14.60 [2019-03-28 12:38:18,675 INFO L796 eck$LassoCheckResult]: Loop: 75#L11-2 [58] L11-2-->L11: Formula: (and (<= (+ v_ULTIMATE.start_mlog_~x_ref~0.offset_5 4) (select |v_#length_8| v_ULTIMATE.start_mlog_~x_ref~0.base_6)) (<= 0 v_ULTIMATE.start_mlog_~x_ref~0.offset_5) (= |v_ULTIMATE.start_mlog_#t~mem2_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_mlog_~x_ref~0.base_6) v_ULTIMATE.start_mlog_~x_ref~0.offset_5)) (= 1 (select |v_#valid_10| v_ULTIMATE.start_mlog_~x_ref~0.base_6))) InVars {ULTIMATE.start_mlog_~x_ref~0.offset=v_ULTIMATE.start_mlog_~x_ref~0.offset_5, #memory_int=|v_#memory_int_5|, ULTIMATE.start_mlog_~x_ref~0.base=v_ULTIMATE.start_mlog_~x_ref~0.base_6, #length=|v_#length_8|, #valid=|v_#valid_10|} OutVars{ULTIMATE.start_mlog_~x_ref~0.offset=v_ULTIMATE.start_mlog_~x_ref~0.offset_5, ULTIMATE.start_mlog_#t~mem2=|v_ULTIMATE.start_mlog_#t~mem2_2|, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_mlog_~x_ref~0.base=v_ULTIMATE.start_mlog_~x_ref~0.base_6, #length=|v_#length_8|} AuxVars[] AssignedVars[ULTIMATE.start_mlog_#t~mem2] 76#L11 [75] L11-->L12: Formula: (< 1 |v_ULTIMATE.start_mlog_#t~mem2_6|) InVars {ULTIMATE.start_mlog_#t~mem2=|v_ULTIMATE.start_mlog_#t~mem2_6|} OutVars{ULTIMATE.start_mlog_#t~mem2=|v_ULTIMATE.start_mlog_#t~mem2_5|} AuxVars[] AssignedVars[ULTIMATE.start_mlog_#t~mem2] 77#L12 [66] L12-->L12-1: Formula: (and (<= (+ v_ULTIMATE.start_mlog_~x_ref~0.offset_7 4) (select |v_#length_10| v_ULTIMATE.start_mlog_~x_ref~0.base_9)) (<= 0 v_ULTIMATE.start_mlog_~x_ref~0.offset_7) (= (select (select |v_#memory_int_6| v_ULTIMATE.start_mlog_~x_ref~0.base_9) v_ULTIMATE.start_mlog_~x_ref~0.offset_7) |v_ULTIMATE.start_mlog_#t~mem3_2|) (= 1 (select |v_#valid_12| v_ULTIMATE.start_mlog_~x_ref~0.base_9))) InVars {ULTIMATE.start_mlog_~x_ref~0.offset=v_ULTIMATE.start_mlog_~x_ref~0.offset_7, #memory_int=|v_#memory_int_6|, ULTIMATE.start_mlog_~x_ref~0.base=v_ULTIMATE.start_mlog_~x_ref~0.base_9, #length=|v_#length_10|, #valid=|v_#valid_12|} OutVars{ULTIMATE.start_mlog_~x_ref~0.offset=v_ULTIMATE.start_mlog_~x_ref~0.offset_7, ULTIMATE.start_mlog_#t~mem3=|v_ULTIMATE.start_mlog_#t~mem3_2|, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_mlog_~x_ref~0.base=v_ULTIMATE.start_mlog_~x_ref~0.base_9, #length=|v_#length_10|} AuxVars[] AssignedVars[ULTIMATE.start_mlog_#t~mem3] 78#L12-1 [129] L12-1-->L12-2: Formula: (and (= |v_#memory_int_7| (store |v_#memory_int_8| v_ULTIMATE.start_mlog_~x_ref~0.base_12 (store (select |v_#memory_int_8| v_ULTIMATE.start_mlog_~x_ref~0.base_12) v_ULTIMATE.start_mlog_~x_ref~0.offset_9 (div |v_ULTIMATE.start_mlog_#t~mem3_3| 2)))) (<= (+ v_ULTIMATE.start_mlog_~x_ref~0.offset_9 4) (select |v_#length_12| v_ULTIMATE.start_mlog_~x_ref~0.base_12)) (= 0 (mod |v_ULTIMATE.start_mlog_#t~mem3_3| 2)) (<= 0 v_ULTIMATE.start_mlog_~x_ref~0.offset_9) (= 1 (select |v_#valid_14| v_ULTIMATE.start_mlog_~x_ref~0.base_12))) InVars {ULTIMATE.start_mlog_~x_ref~0.offset=v_ULTIMATE.start_mlog_~x_ref~0.offset_9, #valid=|v_#valid_14|, ULTIMATE.start_mlog_#t~mem3=|v_ULTIMATE.start_mlog_#t~mem3_3|, #memory_int=|v_#memory_int_8|, #length=|v_#length_12|, ULTIMATE.start_mlog_~x_ref~0.base=v_ULTIMATE.start_mlog_~x_ref~0.base_12} OutVars{ULTIMATE.start_mlog_~x_ref~0.offset=v_ULTIMATE.start_mlog_~x_ref~0.offset_9, #valid=|v_#valid_14|, ULTIMATE.start_mlog_#t~mem3=|v_ULTIMATE.start_mlog_#t~mem3_3|, #memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_mlog_~x_ref~0.base=v_ULTIMATE.start_mlog_~x_ref~0.base_12} AuxVars[] AssignedVars[#memory_int] 71#L12-2 [62] L12-2-->L13: Formula: true InVars {} OutVars{ULTIMATE.start_mlog_#t~mem3=|v_ULTIMATE.start_mlog_#t~mem3_4|} AuxVars[] AssignedVars[ULTIMATE.start_mlog_#t~mem3] 72#L13 [146] L13-->L13-2: Formula: (and (<= 0 v_ULTIMATE.start_mlog_~res~0.offset_14) (= (select (select |v_#memory_int_16| v_ULTIMATE.start_mlog_~res~0.base_18) v_ULTIMATE.start_mlog_~res~0.offset_14) |v_ULTIMATE.start_mlog_#t~mem4_5|) (= |v_ULTIMATE.start_mlog_#t~post5_5| |v_ULTIMATE.start_mlog_#t~mem4_5|) (= (select |v_#valid_31| v_ULTIMATE.start_mlog_~res~0.base_18) 1) (<= (+ v_ULTIMATE.start_mlog_~res~0.offset_14 4) (select |v_#length_23| v_ULTIMATE.start_mlog_~res~0.base_18))) InVars {ULTIMATE.start_mlog_~res~0.offset=v_ULTIMATE.start_mlog_~res~0.offset_14, ULTIMATE.start_mlog_~res~0.base=v_ULTIMATE.start_mlog_~res~0.base_18, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_16|, #length=|v_#length_23|} OutVars{ULTIMATE.start_mlog_~res~0.offset=v_ULTIMATE.start_mlog_~res~0.offset_14, ULTIMATE.start_mlog_~res~0.base=v_ULTIMATE.start_mlog_~res~0.base_18, ULTIMATE.start_mlog_#t~mem4=|v_ULTIMATE.start_mlog_#t~mem4_5|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_16|, #length=|v_#length_23|, ULTIMATE.start_mlog_#t~post5=|v_ULTIMATE.start_mlog_#t~post5_5|} AuxVars[] AssignedVars[ULTIMATE.start_mlog_#t~mem4, ULTIMATE.start_mlog_#t~post5] 74#L13-2 [148] L13-2-->L11-2: Formula: (and (= (select |v_#valid_34| v_ULTIMATE.start_mlog_~res~0.base_20) 1) (<= 0 v_ULTIMATE.start_mlog_~res~0.offset_16) (<= (+ v_ULTIMATE.start_mlog_~res~0.offset_16 4) (select |v_#length_25| v_ULTIMATE.start_mlog_~res~0.base_20)) (= (store |v_#memory_int_19| v_ULTIMATE.start_mlog_~res~0.base_20 (store (select |v_#memory_int_19| v_ULTIMATE.start_mlog_~res~0.base_20) v_ULTIMATE.start_mlog_~res~0.offset_16 (+ |v_ULTIMATE.start_mlog_#t~post5_7| 1))) |v_#memory_int_18|)) InVars {ULTIMATE.start_mlog_~res~0.offset=v_ULTIMATE.start_mlog_~res~0.offset_16, ULTIMATE.start_mlog_~res~0.base=v_ULTIMATE.start_mlog_~res~0.base_20, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_19|, #length=|v_#length_25|, ULTIMATE.start_mlog_#t~post5=|v_ULTIMATE.start_mlog_#t~post5_7|} OutVars{ULTIMATE.start_mlog_~res~0.offset=v_ULTIMATE.start_mlog_~res~0.offset_16, ULTIMATE.start_mlog_~res~0.base=v_ULTIMATE.start_mlog_~res~0.base_20, ULTIMATE.start_mlog_#t~mem4=|v_ULTIMATE.start_mlog_#t~mem4_6|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_18|, #length=|v_#length_25|, ULTIMATE.start_mlog_#t~post5=|v_ULTIMATE.start_mlog_#t~post5_6|} AuxVars[] AssignedVars[ULTIMATE.start_mlog_#t~mem4, #memory_int, ULTIMATE.start_mlog_#t~post5] 75#L11-2 25.00/14.60 [2019-03-28 12:38:18,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.00/14.60 [2019-03-28 12:38:18,676 INFO L82 PathProgramCache]: Analyzing trace with hash 3201852, now seen corresponding path program 2 times 25.00/14.60 [2019-03-28 12:38:18,676 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.00/14.60 [2019-03-28 12:38:18,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.00/14.60 [2019-03-28 12:38:18,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.00/14.60 [2019-03-28 12:38:18,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.00/14.60 [2019-03-28 12:38:18,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.00/14.60 [2019-03-28 12:38:18,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.00/14.60 [2019-03-28 12:38:18,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.00/14.60 [2019-03-28 12:38:18,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.00/14.60 [2019-03-28 12:38:18,696 INFO L82 PathProgramCache]: Analyzing trace with hash -404505009, now seen corresponding path program 1 times 25.00/14.60 [2019-03-28 12:38:18,696 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.00/14.60 [2019-03-28 12:38:18,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.00/14.60 [2019-03-28 12:38:18,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.00/14.60 [2019-03-28 12:38:18,697 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 25.00/14.60 [2019-03-28 12:38:18,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.00/14.60 [2019-03-28 12:38:18,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.00/14.60 [2019-03-28 12:38:18,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.00/14.60 [2019-03-28 12:38:18,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.00/14.60 [2019-03-28 12:38:18,714 INFO L82 PathProgramCache]: Analyzing trace with hash -470033740, now seen corresponding path program 1 times 25.00/14.60 [2019-03-28 12:38:18,714 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.00/14.60 [2019-03-28 12:38:18,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.00/14.60 [2019-03-28 12:38:18,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.00/14.60 [2019-03-28 12:38:18,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.00/14.60 [2019-03-28 12:38:18,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.00/14.60 [2019-03-28 12:38:18,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.00/14.60 [2019-03-28 12:38:18,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.00/14.60 [2019-03-28 12:38:19,015 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 63 25.00/14.60 [2019-03-28 12:38:19,110 INFO L216 LassoAnalysis]: Preferences: 25.00/14.60 [2019-03-28 12:38:19,111 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 25.00/14.60 [2019-03-28 12:38:19,111 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 25.00/14.60 [2019-03-28 12:38:19,111 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 25.00/14.60 [2019-03-28 12:38:19,111 INFO L127 ssoRankerPreferences]: Use exernal solver: false 25.00/14.60 [2019-03-28 12:38:19,112 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 25.00/14.60 [2019-03-28 12:38:19,112 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 25.00/14.60 [2019-03-28 12:38:19,112 INFO L130 ssoRankerPreferences]: Path of dumped script: 25.00/14.60 [2019-03-28 12:38:19,112 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Lasso 25.00/14.60 [2019-03-28 12:38:19,112 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 25.00/14.60 [2019-03-28 12:38:19,112 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 25.00/14.60 [2019-03-28 12:38:19,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.00/14.60 [2019-03-28 12:38:19,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.00/14.60 [2019-03-28 12:38:19,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.00/14.60 [2019-03-28 12:38:19,333 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 25.00/14.60 [2019-03-28 12:38:19,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.00/14.60 [2019-03-28 12:38:19,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.00/14.60 [2019-03-28 12:38:19,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.00/14.60 [2019-03-28 12:38:19,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.00/14.60 [2019-03-28 12:38:19,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.00/14.60 [2019-03-28 12:38:19,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.00/14.60 [2019-03-28 12:38:19,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.00/14.60 [2019-03-28 12:38:19,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.00/14.60 [2019-03-28 12:38:19,724 INFO L300 LassoAnalysis]: Preprocessing complete. 25.00/14.60 [2019-03-28 12:38:19,729 INFO L497 LassoAnalysis]: Using template 'affine'. 25.00/14.60 [2019-03-28 12:38:19,732 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.00/14.60 Termination analysis: LINEAR_WITH_GUESSES 25.00/14.60 Number of strict supporting invariants: 0 25.00/14.60 Number of non-strict supporting invariants: 1 25.00/14.60 Consider only non-deceasing supporting invariants: true 25.00/14.60 Simplify termination arguments: true 25.00/14.60 Simplify supporting invariants: trueOverapproximate stem: false 25.00/14.60 [2019-03-28 12:38:19,733 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.00/14.60 [2019-03-28 12:38:19,734 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 25.00/14.60 [2019-03-28 12:38:19,734 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.00/14.60 [2019-03-28 12:38:19,734 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.00/14.60 [2019-03-28 12:38:19,734 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.00/14.60 [2019-03-28 12:38:19,737 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 25.00/14.60 [2019-03-28 12:38:19,737 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 25.00/14.60 [2019-03-28 12:38:19,739 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.00/14.60 [2019-03-28 12:38:19,739 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.00/14.60 Termination analysis: LINEAR_WITH_GUESSES 25.00/14.60 Number of strict supporting invariants: 0 25.00/14.60 Number of non-strict supporting invariants: 1 25.00/14.60 Consider only non-deceasing supporting invariants: true 25.00/14.60 Simplify termination arguments: true 25.00/14.60 Simplify supporting invariants: trueOverapproximate stem: false 25.00/14.60 [2019-03-28 12:38:19,740 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.00/14.60 [2019-03-28 12:38:19,740 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 25.00/14.60 [2019-03-28 12:38:19,740 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.00/14.60 [2019-03-28 12:38:19,740 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.00/14.60 [2019-03-28 12:38:19,740 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.00/14.60 [2019-03-28 12:38:19,741 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 25.00/14.60 [2019-03-28 12:38:19,741 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 25.00/14.60 [2019-03-28 12:38:19,742 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.00/14.60 [2019-03-28 12:38:19,742 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.00/14.60 Termination analysis: LINEAR_WITH_GUESSES 25.00/14.60 Number of strict supporting invariants: 0 25.00/14.60 Number of non-strict supporting invariants: 1 25.00/14.60 Consider only non-deceasing supporting invariants: true 25.00/14.60 Simplify termination arguments: true 25.00/14.60 Simplify supporting invariants: trueOverapproximate stem: false 25.00/14.60 [2019-03-28 12:38:19,743 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.00/14.60 [2019-03-28 12:38:19,743 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.00/14.60 [2019-03-28 12:38:19,743 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.00/14.60 [2019-03-28 12:38:19,743 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.00/14.60 [2019-03-28 12:38:19,747 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 25.00/14.60 [2019-03-28 12:38:19,748 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 25.00/14.60 [2019-03-28 12:38:19,766 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.00/14.60 [2019-03-28 12:38:19,766 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.00/14.60 Termination analysis: LINEAR_WITH_GUESSES 25.00/14.60 Number of strict supporting invariants: 0 25.00/14.60 Number of non-strict supporting invariants: 1 25.00/14.60 Consider only non-deceasing supporting invariants: true 25.00/14.60 Simplify termination arguments: true 25.00/14.60 Simplify supporting invariants: trueOverapproximate stem: false 25.00/14.60 [2019-03-28 12:38:19,767 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.00/14.60 [2019-03-28 12:38:19,767 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.00/14.60 [2019-03-28 12:38:19,767 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.00/14.60 [2019-03-28 12:38:19,768 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.00/14.60 [2019-03-28 12:38:19,773 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 25.00/14.60 [2019-03-28 12:38:19,773 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 25.00/14.60 [2019-03-28 12:38:19,796 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.00/14.60 [2019-03-28 12:38:19,796 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.00/14.60 Termination analysis: LINEAR_WITH_GUESSES 25.00/14.60 Number of strict supporting invariants: 0 25.00/14.60 Number of non-strict supporting invariants: 1 25.00/14.60 Consider only non-deceasing supporting invariants: true 25.00/14.60 Simplify termination arguments: true 25.00/14.60 Simplify supporting invariants: trueOverapproximate stem: false 25.00/14.60 [2019-03-28 12:38:19,797 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.00/14.60 [2019-03-28 12:38:19,797 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.00/14.60 [2019-03-28 12:38:19,797 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.00/14.60 [2019-03-28 12:38:19,797 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.00/14.60 [2019-03-28 12:38:19,800 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 25.00/14.60 [2019-03-28 12:38:19,800 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 25.00/14.60 [2019-03-28 12:38:19,825 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 25.00/14.60 [2019-03-28 12:38:19,844 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. 25.00/14.60 [2019-03-28 12:38:19,844 INFO L444 ModelExtractionUtils]: 10 out of 16 variables were initially zero. Simplification set additionally 4 variables to zero. 25.00/14.60 [2019-03-28 12:38:19,847 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 25.00/14.60 [2019-03-28 12:38:19,848 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 25.00/14.60 [2019-03-28 12:38:19,849 INFO L518 LassoAnalysis]: Proved termination. 25.00/14.60 [2019-03-28 12:38:19,849 INFO L520 LassoAnalysis]: Termination argument consisting of: 25.00/14.60 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_mlog_~x_ref~0.base) ULTIMATE.start_mlog_~x_ref~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_mlog_~x_ref~0.base) ULTIMATE.start_mlog_~x_ref~0.offset)_1 25.00/14.60 Supporting invariants [] 25.00/14.60 [2019-03-28 12:38:19,883 INFO L297 tatePredicateManager]: 9 out of 11 supporting invariants were superfluous and have been removed 25.00/14.60 [2019-03-28 12:38:19,889 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 25.00/14.60 [2019-03-28 12:38:19,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.00/14.60 [2019-03-28 12:38:19,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.00/14.60 [2019-03-28 12:38:19,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 8 conjunts are in the unsatisfiable core 25.00/14.60 [2019-03-28 12:38:19,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.00/14.60 [2019-03-28 12:38:19,983 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 25.00/14.60 [2019-03-28 12:38:19,983 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 25.00/14.60 [2019-03-28 12:38:19,992 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 25.00/14.60 [2019-03-28 12:38:19,993 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 25.00/14.60 [2019-03-28 12:38:19,993 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 25.00/14.60 [2019-03-28 12:38:20,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.00/14.60 [2019-03-28 12:38:20,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 10 conjunts are in the unsatisfiable core 25.00/14.60 [2019-03-28 12:38:20,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.00/14.60 [2019-03-28 12:38:20,071 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 25.00/14.60 [2019-03-28 12:38:20,072 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 25.00/14.60 [2019-03-28 12:38:20,082 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 25.00/14.60 [2019-03-28 12:38:20,083 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 25.00/14.60 [2019-03-28 12:38:20,084 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:23 25.00/14.60 [2019-03-28 12:38:22,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.00/14.60 [2019-03-28 12:38:26,376 WARN L860 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_mlog_#t~mem3| Int)) (and (= (div |ULTIMATE.start_mlog_#t~mem3| 2) (select (select |c_#memory_int| c_ULTIMATE.start_mlog_~x_ref~0.base) c_ULTIMATE.start_mlog_~x_ref~0.offset)) (<= |ULTIMATE.start_mlog_#t~mem3| c_oldRank0))) is different from true 25.00/14.60 [2019-03-28 12:38:26,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.00/14.60 [2019-03-28 12:38:26,393 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 25.00/14.60 [2019-03-28 12:38:26,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.00/14.60 [2019-03-28 12:38:26,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 10 conjunts are in the unsatisfiable core 25.00/14.60 [2019-03-28 12:38:26,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.00/14.60 [2019-03-28 12:38:26,413 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 25.00/14.60 [2019-03-28 12:38:26,414 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 25.00/14.60 [2019-03-28 12:38:26,425 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 25.00/14.60 [2019-03-28 12:38:26,426 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 25.00/14.60 [2019-03-28 12:38:26,426 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:15 25.00/14.60 [2019-03-28 12:38:26,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.00/14.60 [2019-03-28 12:38:26,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 10 conjunts are in the unsatisfiable core 25.00/14.60 [2019-03-28 12:38:26,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.00/14.60 [2019-03-28 12:38:26,452 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 25.00/14.60 [2019-03-28 12:38:26,453 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 25.00/14.60 [2019-03-28 12:38:26,463 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 25.00/14.60 [2019-03-28 12:38:26,464 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 25.00/14.60 [2019-03-28 12:38:26,464 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:15 25.00/14.60 [2019-03-28 12:38:26,484 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 25.00/14.60 [2019-03-28 12:38:26,485 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 25.00/14.60 [2019-03-28 12:38:26,498 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 25.00/14.60 [2019-03-28 12:38:26,499 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 25.00/14.60 [2019-03-28 12:38:26,500 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:23 25.00/14.60 [2019-03-28 12:38:26,503 INFO L98 LoopCannibalizer]: 8 predicates before loop cannibalization 8 predicates after loop cannibalization 25.00/14.60 [2019-03-28 12:38:26,507 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 8 loop predicates 25.00/14.60 [2019-03-28 12:38:26,508 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 11 states and 15 transitions. cyclomatic complexity: 5 Second operand 7 states. 25.00/14.60 [2019-03-28 12:38:26,674 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 11 states and 15 transitions. cyclomatic complexity: 5. Second operand 7 states. Result 19 states and 24 transitions. Complement of second has 11 states. 25.00/14.60 [2019-03-28 12:38:26,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states 25.00/14.60 [2019-03-28 12:38:26,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. 25.00/14.60 [2019-03-28 12:38:26,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 25 transitions. 25.00/14.60 [2019-03-28 12:38:26,677 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 25 transitions. Stem has 4 letters. Loop has 7 letters. 25.00/14.60 [2019-03-28 12:38:26,678 INFO L116 BuchiAccepts]: Finished buchiAccepts. 25.00/14.60 [2019-03-28 12:38:26,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 25 transitions. Stem has 11 letters. Loop has 7 letters. 25.00/14.60 [2019-03-28 12:38:26,678 INFO L116 BuchiAccepts]: Finished buchiAccepts. 25.00/14.60 [2019-03-28 12:38:26,679 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 25 transitions. Stem has 4 letters. Loop has 14 letters. 25.00/14.60 [2019-03-28 12:38:26,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. 25.00/14.60 [2019-03-28 12:38:26,686 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 24 transitions. 25.00/14.60 [2019-03-28 12:38:26,687 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 25.00/14.60 [2019-03-28 12:38:26,687 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 0 states and 0 transitions. 25.00/14.60 [2019-03-28 12:38:26,687 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 25.00/14.60 [2019-03-28 12:38:26,687 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 25.00/14.60 [2019-03-28 12:38:26,687 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 25.00/14.60 [2019-03-28 12:38:26,688 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 25.00/14.60 [2019-03-28 12:38:26,688 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 25.00/14.60 [2019-03-28 12:38:26,688 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 25.00/14.60 [2019-03-28 12:38:26,688 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 25.00/14.60 [2019-03-28 12:38:26,688 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 25.00/14.60 [2019-03-28 12:38:26,688 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 25.00/14.60 [2019-03-28 12:38:26,688 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 25.00/14.60 [2019-03-28 12:38:26,688 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 25.00/14.60 [2019-03-28 12:38:26,694 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:38:26 BasicIcfg 25.00/14.60 [2019-03-28 12:38:26,694 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 25.00/14.60 [2019-03-28 12:38:26,695 INFO L168 Benchmark]: Toolchain (without parser) took 10193.59 ms. Allocated memory was 649.6 MB in the beginning and 749.7 MB in the end (delta: 100.1 MB). Free memory was 565.0 MB in the beginning and 496.5 MB in the end (delta: 68.5 MB). Peak memory consumption was 168.6 MB. Max. memory is 50.3 GB. 25.00/14.60 [2019-03-28 12:38:26,696 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 649.6 MB. Free memory is still 585.4 MB. There was no memory consumed. Max. memory is 50.3 GB. 25.00/14.60 [2019-03-28 12:38:26,696 INFO L168 Benchmark]: CACSL2BoogieTranslator took 304.64 ms. Allocated memory was 649.6 MB in the beginning and 679.5 MB in the end (delta: 29.9 MB). Free memory was 565.0 MB in the beginning and 646.1 MB in the end (delta: -81.1 MB). Peak memory consumption was 29.8 MB. Max. memory is 50.3 GB. 25.00/14.60 [2019-03-28 12:38:26,697 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.42 ms. Allocated memory is still 679.5 MB. Free memory was 644.7 MB in the beginning and 641.6 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. 25.00/14.60 [2019-03-28 12:38:26,697 INFO L168 Benchmark]: Boogie Preprocessor took 24.28 ms. Allocated memory is still 679.5 MB. Free memory was 641.6 MB in the beginning and 640.3 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 50.3 GB. 25.00/14.60 [2019-03-28 12:38:26,698 INFO L168 Benchmark]: RCFGBuilder took 310.68 ms. Allocated memory is still 679.5 MB. Free memory was 640.3 MB in the beginning and 619.2 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 50.3 GB. 25.00/14.60 [2019-03-28 12:38:26,699 INFO L168 Benchmark]: BlockEncodingV2 took 143.55 ms. Allocated memory is still 679.5 MB. Free memory was 619.2 MB in the beginning and 609.8 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 50.3 GB. 25.00/14.60 [2019-03-28 12:38:26,699 INFO L168 Benchmark]: TraceAbstraction took 1008.37 ms. Allocated memory is still 679.5 MB. Free memory was 609.8 MB in the beginning and 510.4 MB in the end (delta: 99.4 MB). Peak memory consumption was 99.4 MB. Max. memory is 50.3 GB. 25.00/14.60 [2019-03-28 12:38:26,700 INFO L168 Benchmark]: BuchiAutomizer took 8355.16 ms. Allocated memory was 679.5 MB in the beginning and 749.7 MB in the end (delta: 70.3 MB). Free memory was 510.4 MB in the beginning and 496.5 MB in the end (delta: 13.9 MB). Peak memory consumption was 84.2 MB. Max. memory is 50.3 GB. 25.00/14.60 [2019-03-28 12:38:26,704 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 25.00/14.60 --- Results --- 25.00/14.60 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 25.00/14.60 - StatisticsResult: Initial Icfg 25.00/14.60 35 locations, 36 edges 25.00/14.60 - StatisticsResult: Encoded RCFG 25.00/14.60 28 locations, 50 edges 25.00/14.60 * Results from de.uni_freiburg.informatik.ultimate.core: 25.00/14.60 - StatisticsResult: Toolchain Benchmarks 25.00/14.60 Benchmark results are: 25.00/14.60 * CDTParser took 0.18 ms. Allocated memory is still 649.6 MB. Free memory is still 585.4 MB. There was no memory consumed. Max. memory is 50.3 GB. 25.00/14.60 * CACSL2BoogieTranslator took 304.64 ms. Allocated memory was 649.6 MB in the beginning and 679.5 MB in the end (delta: 29.9 MB). Free memory was 565.0 MB in the beginning and 646.1 MB in the end (delta: -81.1 MB). Peak memory consumption was 29.8 MB. Max. memory is 50.3 GB. 25.00/14.60 * Boogie Procedure Inliner took 41.42 ms. Allocated memory is still 679.5 MB. Free memory was 644.7 MB in the beginning and 641.6 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. 25.00/14.60 * Boogie Preprocessor took 24.28 ms. Allocated memory is still 679.5 MB. Free memory was 641.6 MB in the beginning and 640.3 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 50.3 GB. 25.00/14.60 * RCFGBuilder took 310.68 ms. Allocated memory is still 679.5 MB. Free memory was 640.3 MB in the beginning and 619.2 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 50.3 GB. 25.00/14.60 * BlockEncodingV2 took 143.55 ms. Allocated memory is still 679.5 MB. Free memory was 619.2 MB in the beginning and 609.8 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 50.3 GB. 25.00/14.60 * TraceAbstraction took 1008.37 ms. Allocated memory is still 679.5 MB. Free memory was 609.8 MB in the beginning and 510.4 MB in the end (delta: 99.4 MB). Peak memory consumption was 99.4 MB. Max. memory is 50.3 GB. 25.00/14.60 * BuchiAutomizer took 8355.16 ms. Allocated memory was 679.5 MB in the beginning and 749.7 MB in the end (delta: 70.3 MB). Free memory was 510.4 MB in the beginning and 496.5 MB in the end (delta: 13.9 MB). Peak memory consumption was 84.2 MB. Max. memory is 50.3 GB. 25.00/14.60 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: 25.00/14.60 - GenericResult: Unfinished Backtranslation 25.00/14.60 unknown boogie variable #length 25.00/14.60 - GenericResult: Unfinished Backtranslation 25.00/14.60 unknown boogie variable #length 25.00/14.60 - GenericResult: Unfinished Backtranslation 25.00/14.60 unknown boogie variable #length 25.00/14.60 - GenericResult: Unfinished Backtranslation 25.00/14.60 unknown boogie variable #length 25.00/14.60 - GenericResult: Unfinished Backtranslation 25.00/14.60 unknown boogie variable #memory_int 25.00/14.60 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 25.00/14.60 - PositiveResult [Line: 10]: pointer dereference always succeeds 25.00/14.60 For all program executions holds that pointer dereference always succeeds at this location 25.00/14.60 - PositiveResult [Line: 9]: pointer dereference always succeeds 25.00/14.60 For all program executions holds that pointer dereference always succeeds at this location 25.00/14.60 - PositiveResult [Line: 13]: pointer dereference always succeeds 25.00/14.60 For all program executions holds that pointer dereference always succeeds at this location 25.00/14.60 - PositiveResult [Line: 13]: pointer dereference always succeeds 25.00/14.60 For all program executions holds that pointer dereference always succeeds at this location 25.00/14.60 - PositiveResult [Line: 9]: pointer dereference always succeeds 25.00/14.60 For all program executions holds that pointer dereference always succeeds at this location 25.00/14.60 - PositiveResult [Line: 15]: pointer dereference always succeeds 25.00/14.60 For all program executions holds that pointer dereference always succeeds at this location 25.00/14.60 - PositiveResult [Line: 11]: pointer dereference always succeeds 25.00/14.60 For all program executions holds that pointer dereference always succeeds at this location 25.00/14.60 - PositiveResult [Line: 15]: pointer dereference always succeeds 25.00/14.60 For all program executions holds that pointer dereference always succeeds at this location 25.00/14.60 - PositiveResult [Line: 10]: pointer dereference always succeeds 25.00/14.60 For all program executions holds that pointer dereference always succeeds at this location 25.00/14.60 - PositiveResult [Line: 13]: pointer dereference always succeeds 25.00/14.60 For all program executions holds that pointer dereference always succeeds at this location 25.00/14.60 - PositiveResult [Line: 12]: pointer dereference always succeeds 25.00/14.60 For all program executions holds that pointer dereference always succeeds at this location 25.00/14.60 - PositiveResult [Line: 12]: pointer dereference always succeeds 25.00/14.60 For all program executions holds that pointer dereference always succeeds at this location 25.00/14.60 - PositiveResult [Line: 11]: pointer dereference always succeeds 25.00/14.60 For all program executions holds that pointer dereference always succeeds at this location 25.00/14.60 - PositiveResult [Line: 13]: pointer dereference always succeeds 25.00/14.60 For all program executions holds that pointer dereference always succeeds at this location 25.00/14.60 - PositiveResult [Line: 12]: pointer dereference always succeeds 25.00/14.60 For all program executions holds that pointer dereference always succeeds at this location 25.00/14.60 - PositiveResult [Line: 12]: pointer dereference always succeeds 25.00/14.60 For all program executions holds that pointer dereference always succeeds at this location 25.00/14.60 - AllSpecificationsHoldResult: All specifications hold 25.00/14.60 16 specifications checked. All of them hold 25.00/14.60 - InvariantResult [Line: 10]: Loop Invariant 25.00/14.60 [2019-03-28 12:38:26,713 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.00/14.60 [2019-03-28 12:38:26,713 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.00/14.60 [2019-03-28 12:38:26,714 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.00/14.60 [2019-03-28 12:38:26,714 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.00/14.60 Derived loop invariant: ((((0 == x_ref && unknown-#length-unknown[res] == 4) && 0 == res) && 1 == \valid[x_ref]) && 4 == unknown-#length-unknown[x_ref]) && \valid[res] == 1 25.00/14.60 - StatisticsResult: Ultimate Automizer benchmark data 25.00/14.60 CFG has 1 procedures, 28 locations, 16 error locations. SAFE Result, 0.9s OverallTime, 6 OverallIterations, 1 TraceHistogramMax, 0.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 24 SDtfs, 141 SDslu, 4 SDs, 0 SdLazy, 152 SolverSat, 45 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 2 NumberOfFragments, 27 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 21 NumberOfCodeBlocks, 21 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 15 ConstructedInterpolants, 0 QuantifiedInterpolants, 151 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available 25.00/14.60 - StatisticsResult: Constructed decomposition of program 25.00/14.60 Your program was decomposed into 2 terminating modules (1 trivial, 0 deterministic, 1 nondeterministic). One nondeterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 7 locations. 1 modules have a trivial ranking function, the largest among these consists of 5 locations. 25.00/14.60 - StatisticsResult: Timing statistics 25.00/14.60 BüchiAutomizer plugin needed 8.3s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 1.3s. Construction of modules took 0.1s. Büchi inclusion checks took 6.7s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 11 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 11 SDtfs, 62 SDslu, 72 SDs, 0 SdLazy, 205 SolverSat, 27 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital223 mio100 ax100 hnf100 lsp97 ukn61 mio100 lsp39 div186 bol100 ite100 ukn100 eq136 hnf61 smp92 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 23ms VariablesStem: 5 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s 25.00/14.60 - TerminationAnalysisResult: Termination proven 25.00/14.60 Buchi Automizer proved that your program is terminating 25.00/14.60 RESULT: Ultimate proved your program to be correct! 25.00/14.60 !SESSION 2019-03-28 12:38:13.248 ----------------------------------------------- 25.00/14.60 eclipse.buildId=unknown 25.00/14.60 java.version=1.8.0_181 25.00/14.60 java.vendor=Oracle Corporation 25.00/14.60 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 25.00/14.60 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 25.00/14.60 Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c 25.00/14.60 25.00/14.60 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 12:38:26.941 25.00/14.60 !MESSAGE The workspace will exit with unsaved changes in this session. 25.00/14.60 Received shutdown request... 25.00/14.60 Ultimate: 25.00/14.60 GTK+ Version Check 25.00/14.60 EOF