./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/reducercommutativity/max05_true-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_b51fd940-b14a-42e8-8f29-5d5b11667247/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b51fd940-b14a-42e8-8f29-5d5b11667247/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b51fd940-b14a-42e8-8f29-5d5b11667247/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b51fd940-b14a-42e8-8f29-5d5b11667247/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/reducercommutativity/max05_true-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_b51fd940-b14a-42e8-8f29-5d5b11667247/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b51fd940-b14a-42e8-8f29-5d5b11667247/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d02fdead04c3e6f93d11e2edd6641f56f1584022 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 11:51:00,551 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:51:00,552 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:51:00,558 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:51:00,558 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:51:00,559 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:51:00,560 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:51:00,561 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:51:00,562 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:51:00,563 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:51:00,563 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:51:00,563 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:51:00,564 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:51:00,565 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:51:00,565 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:51:00,566 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:51:00,566 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:51:00,568 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:51:00,569 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:51:00,570 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:51:00,571 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:51:00,572 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:51:00,573 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:51:00,573 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:51:00,573 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:51:00,573 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:51:00,574 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:51:00,575 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:51:00,575 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:51:00,576 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:51:00,576 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:51:00,577 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:51:00,577 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:51:00,577 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:51:00,577 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:51:00,578 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:51:00,578 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b51fd940-b14a-42e8-8f29-5d5b11667247/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-23 11:51:00,587 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:51:00,588 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:51:00,589 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:51:00,589 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:51:00,589 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:51:00,589 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 11:51:00,589 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 11:51:00,589 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 11:51:00,589 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 11:51:00,590 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 11:51:00,590 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 11:51:00,590 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:51:00,590 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:51:00,590 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 11:51:00,590 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 11:51:00,590 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:51:00,591 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:51:00,591 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 11:51:00,591 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 11:51:00,591 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 11:51:00,591 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:51:00,591 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:51:00,591 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 11:51:00,591 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:51:00,592 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 11:51:00,592 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:51:00,592 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:51:00,592 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 11:51:00,592 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:51:00,592 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 11:51:00,592 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 11:51:00,593 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 11:51:00,593 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_b51fd940-b14a-42e8-8f29-5d5b11667247/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d02fdead04c3e6f93d11e2edd6641f56f1584022 [2018-11-23 11:51:00,620 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:51:00,629 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:51:00,631 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:51:00,632 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:51:00,632 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:51:00,633 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b51fd940-b14a-42e8-8f29-5d5b11667247/bin-2019/uautomizer/../../sv-benchmarks/c/reducercommutativity/max05_true-unreach-call_true-termination.i [2018-11-23 11:51:00,670 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b51fd940-b14a-42e8-8f29-5d5b11667247/bin-2019/uautomizer/data/299e8c5d9/faae7a3b36224cef8f6d9fedfbb38894/FLAG92f84489d [2018-11-23 11:51:01,070 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:51:01,071 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b51fd940-b14a-42e8-8f29-5d5b11667247/sv-benchmarks/c/reducercommutativity/max05_true-unreach-call_true-termination.i [2018-11-23 11:51:01,075 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b51fd940-b14a-42e8-8f29-5d5b11667247/bin-2019/uautomizer/data/299e8c5d9/faae7a3b36224cef8f6d9fedfbb38894/FLAG92f84489d [2018-11-23 11:51:01,085 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b51fd940-b14a-42e8-8f29-5d5b11667247/bin-2019/uautomizer/data/299e8c5d9/faae7a3b36224cef8f6d9fedfbb38894 [2018-11-23 11:51:01,088 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:51:01,089 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:51:01,090 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:51:01,090 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:51:01,093 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:51:01,094 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:51:01" (1/1) ... [2018-11-23 11:51:01,096 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4007e260 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:01, skipping insertion in model container [2018-11-23 11:51:01,096 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:51:01" (1/1) ... [2018-11-23 11:51:01,104 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:51:01,124 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:51:01,238 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:51:01,243 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:51:01,257 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:51:01,267 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:51:01,268 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:01 WrapperNode [2018-11-23 11:51:01,268 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:51:01,268 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:51:01,268 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:51:01,268 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:51:01,273 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:01" (1/1) ... [2018-11-23 11:51:01,279 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:01" (1/1) ... [2018-11-23 11:51:01,331 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:51:01,332 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:51:01,332 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:51:01,332 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:51:01,338 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:01" (1/1) ... [2018-11-23 11:51:01,338 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:01" (1/1) ... [2018-11-23 11:51:01,340 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:01" (1/1) ... [2018-11-23 11:51:01,340 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:01" (1/1) ... [2018-11-23 11:51:01,345 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:01" (1/1) ... [2018-11-23 11:51:01,349 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:01" (1/1) ... [2018-11-23 11:51:01,350 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:01" (1/1) ... [2018-11-23 11:51:01,352 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:51:01,352 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:51:01,352 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:51:01,352 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:51:01,353 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:01" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b51fd940-b14a-42e8-8f29-5d5b11667247/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 11:51:01,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 11:51:01,387 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:51:01,387 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:51:01,387 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:51:01,387 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 11:51:01,387 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 11:51:01,593 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:51:01,593 INFO L280 CfgBuilder]: Removed 15 assue(true) statements. [2018-11-23 11:51:01,594 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:51:01 BoogieIcfgContainer [2018-11-23 11:51:01,594 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:51:01,594 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 11:51:01,594 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 11:51:01,597 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 11:51:01,598 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 11:51:01,598 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 11:51:01" (1/3) ... [2018-11-23 11:51:01,599 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3a28d567 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 11:51:01, skipping insertion in model container [2018-11-23 11:51:01,599 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 11:51:01,599 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:01" (2/3) ... [2018-11-23 11:51:01,600 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3a28d567 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 11:51:01, skipping insertion in model container [2018-11-23 11:51:01,600 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 11:51:01,600 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:51:01" (3/3) ... [2018-11-23 11:51:01,601 INFO L375 chiAutomizerObserver]: Analyzing ICFG max05_true-unreach-call_true-termination.i [2018-11-23 11:51:01,642 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:51:01,642 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 11:51:01,643 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 11:51:01,643 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 11:51:01,643 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:51:01,643 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:51:01,643 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 11:51:01,643 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:51:01,643 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 11:51:01,653 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states. [2018-11-23 11:51:01,668 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 16 [2018-11-23 11:51:01,668 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 11:51:01,668 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 11:51:01,673 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 11:51:01,673 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 11:51:01,673 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 11:51:01,673 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states. [2018-11-23 11:51:01,675 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 16 [2018-11-23 11:51:01,675 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 11:51:01,675 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 11:51:01,675 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 11:51:01,675 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 11:51:01,680 INFO L794 eck$LassoCheckResult]: Stem: 31#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7#L-1true havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 30#L23-3true [2018-11-23 11:51:01,680 INFO L796 eck$LassoCheckResult]: Loop: 30#L23-3true assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 10#L23-2true main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 30#L23-3true [2018-11-23 11:51:01,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:01,685 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-23 11:51:01,686 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:01,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:01,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:01,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:01,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:01,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:51:01,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:51:01,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:01,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2018-11-23 11:51:01,752 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:01,752 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:01,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:01,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:01,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:01,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:51:01,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:51:01,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:01,771 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2018-11-23 11:51:01,771 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:01,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:01,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:01,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:01,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:01,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:51:01,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:51:01,907 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 11:51:01,908 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 11:51:01,908 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 11:51:01,908 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 11:51:01,909 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 11:51:01,909 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 11:51:01,909 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 11:51:01,909 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 11:51:01,909 INFO L131 ssoRankerPreferences]: Filename of dumped script: max05_true-unreach-call_true-termination.i_Iteration1_Lasso [2018-11-23 11:51:01,909 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 11:51:01,910 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 11:51:01,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:51:01,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:51:01,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:51:01,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:51:01,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:51:01,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:51:01,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:51:01,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:51:01,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:51:02,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:51:02,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:51:02,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:51:02,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:51:02,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:51:02,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:51:02,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:51:02,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:51:02,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:51:02,136 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 11:51:02,139 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 11:51:02,141 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 11:51:02,142 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:51:02,142 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 11:51:02,142 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:51:02,142 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:51:02,142 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:51:02,144 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 11:51:02,144 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 11:51:02,147 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:51:02,147 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 11:51:02,148 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:51:02,148 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 11:51:02,148 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:51:02,148 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:51:02,148 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:51:02,149 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 11:51:02,149 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 11:51:02,150 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:51:02,150 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 11:51:02,150 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:51:02,151 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 11:51:02,151 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:51:02,151 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:51:02,151 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:51:02,151 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 11:51:02,151 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 11:51:02,152 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:51:02,152 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 11:51:02,153 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:51:02,153 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 11:51:02,153 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:51:02,153 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:51:02,153 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:51:02,154 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 11:51:02,154 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 11:51:02,155 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:51:02,155 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 11:51:02,155 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:51:02,156 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 11:51:02,156 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:51:02,156 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:51:02,156 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:51:02,156 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 11:51:02,157 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 11:51:02,158 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:51:02,158 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 11:51:02,158 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:51:02,158 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:51:02,159 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:51:02,159 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:51:02,161 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 11:51:02,161 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 11:51:02,164 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:51:02,165 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 11:51:02,165 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:51:02,165 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 11:51:02,165 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:51:02,166 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:51:02,167 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 11:51:02,168 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 11:51:02,173 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:51:02,173 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 11:51:02,174 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:51:02,174 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:51:02,174 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:51:02,174 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:51:02,177 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 11:51:02,177 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 11:51:02,202 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 11:51:02,225 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-23 11:51:02,225 INFO L444 ModelExtractionUtils]: 7 out of 13 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-23 11:51:02,227 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 11:51:02,229 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 11:51:02,229 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 11:51:02,229 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#x~0.base)_1, ULTIMATE.start_main_~i~1) = 9*v_rep(select #length ULTIMATE.start_main_~#x~0.base)_1 - 8*ULTIMATE.start_main_~i~1 Supporting invariants [] [2018-11-23 11:51:02,232 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2018-11-23 11:51:02,237 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 11:51:02,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:02,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:02,299 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:51:02,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:02,310 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:51:02,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:51:02,334 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 11:51:02,335 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states. Second operand 3 states. [2018-11-23 11:51:02,411 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states.. Second operand 3 states. Result 84 states and 119 transitions. Complement of second has 8 states. [2018-11-23 11:51:02,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 11:51:02,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:51:02,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 79 transitions. [2018-11-23 11:51:02,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 79 transitions. Stem has 2 letters. Loop has 2 letters. [2018-11-23 11:51:02,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 11:51:02,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 79 transitions. Stem has 4 letters. Loop has 2 letters. [2018-11-23 11:51:02,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 11:51:02,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 79 transitions. Stem has 2 letters. Loop has 4 letters. [2018-11-23 11:51:02,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 11:51:02,416 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 119 transitions. [2018-11-23 11:51:02,419 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2018-11-23 11:51:02,423 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 25 states and 33 transitions. [2018-11-23 11:51:02,424 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-11-23 11:51:02,424 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-11-23 11:51:02,424 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 33 transitions. [2018-11-23 11:51:02,425 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 11:51:02,425 INFO L705 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2018-11-23 11:51:02,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 33 transitions. [2018-11-23 11:51:02,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-11-23 11:51:02,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 11:51:02,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2018-11-23 11:51:02,443 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2018-11-23 11:51:02,443 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2018-11-23 11:51:02,443 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 11:51:02,443 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 33 transitions. [2018-11-23 11:51:02,443 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2018-11-23 11:51:02,443 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 11:51:02,443 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 11:51:02,444 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-23 11:51:02,444 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 11:51:02,444 INFO L794 eck$LassoCheckResult]: Stem: 181#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 178#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 175#L23-3 assume !(main_~i~1 < 5); 174#L23-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 163#L9-3 [2018-11-23 11:51:02,444 INFO L796 eck$LassoCheckResult]: Loop: 163#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 164#L10 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 173#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 168#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 163#L9-3 [2018-11-23 11:51:02,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:02,445 INFO L82 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2018-11-23 11:51:02,445 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:02,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:02,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:02,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:02,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:02,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:02,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:51:02,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:51:02,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:51:02,482 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 11:51:02,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:02,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 1 times [2018-11-23 11:51:02,482 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:02,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:02,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:02,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:02,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:02,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:51:02,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:51:02,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:51:02,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:51:02,533 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. cyclomatic complexity: 13 Second operand 3 states. [2018-11-23 11:51:02,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:02,540 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2018-11-23 11:51:02,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:51:02,541 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 33 transitions. [2018-11-23 11:51:02,542 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2018-11-23 11:51:02,542 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 33 transitions. [2018-11-23 11:51:02,542 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-11-23 11:51:02,543 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-11-23 11:51:02,543 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 33 transitions. [2018-11-23 11:51:02,543 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 11:51:02,543 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2018-11-23 11:51:02,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 33 transitions. [2018-11-23 11:51:02,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2018-11-23 11:51:02,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 11:51:02,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2018-11-23 11:51:02,545 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2018-11-23 11:51:02,545 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2018-11-23 11:51:02,545 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 11:51:02,545 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 32 transitions. [2018-11-23 11:51:02,546 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2018-11-23 11:51:02,546 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 11:51:02,546 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 11:51:02,546 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-23 11:51:02,546 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 11:51:02,546 INFO L794 eck$LassoCheckResult]: Stem: 238#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 235#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 232#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 233#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 234#L23-3 assume !(main_~i~1 < 5); 231#L23-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 220#L9-3 [2018-11-23 11:51:02,547 INFO L796 eck$LassoCheckResult]: Loop: 220#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 221#L10 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 230#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 225#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 220#L9-3 [2018-11-23 11:51:02,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:02,547 INFO L82 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2018-11-23 11:51:02,547 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:02,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:02,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:02,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:02,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:02,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:02,565 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:51:02,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:51:02,566 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b51fd940-b14a-42e8-8f29-5d5b11667247/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:51:02,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:02,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:02,584 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:51:02,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:51:02,605 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:51:02,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 11:51:02,606 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 11:51:02,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:02,606 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 2 times [2018-11-23 11:51:02,606 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:02,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:02,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:02,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:02,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:02,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:51:02,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:51:02,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:51:02,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:51:02,646 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. cyclomatic complexity: 12 Second operand 5 states. [2018-11-23 11:51:02,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:02,659 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2018-11-23 11:51:02,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 11:51:02,659 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 35 transitions. [2018-11-23 11:51:02,660 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2018-11-23 11:51:02,660 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 35 transitions. [2018-11-23 11:51:02,660 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-11-23 11:51:02,660 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-11-23 11:51:02,661 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 35 transitions. [2018-11-23 11:51:02,661 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 11:51:02,661 INFO L705 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2018-11-23 11:51:02,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 35 transitions. [2018-11-23 11:51:02,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2018-11-23 11:51:02,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 11:51:02,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2018-11-23 11:51:02,663 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2018-11-23 11:51:02,663 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2018-11-23 11:51:02,663 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 11:51:02,663 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 34 transitions. [2018-11-23 11:51:02,663 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2018-11-23 11:51:02,663 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 11:51:02,664 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 11:51:02,664 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2018-11-23 11:51:02,664 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 11:51:02,664 INFO L794 eck$LassoCheckResult]: Stem: 313#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 312#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 308#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 309#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 310#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 311#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 318#L23-3 assume !(main_~i~1 < 5); 307#L23-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 296#L9-3 [2018-11-23 11:51:02,664 INFO L796 eck$LassoCheckResult]: Loop: 296#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 297#L10 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 306#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 301#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 296#L9-3 [2018-11-23 11:51:02,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:02,665 INFO L82 PathProgramCache]: Analyzing trace with hash 265236367, now seen corresponding path program 2 times [2018-11-23 11:51:02,665 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:02,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:02,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:02,665 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:51:02,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:02,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:02,689 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:51:02,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:51:02,689 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b51fd940-b14a-42e8-8f29-5d5b11667247/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:51:02,695 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:51:02,703 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:51:02,704 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:51:02,705 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:51:02,710 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:51:02,724 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:51:02,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 11:51:02,725 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 11:51:02,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:02,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 3 times [2018-11-23 11:51:02,725 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:02,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:02,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:02,726 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:51:02,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:02,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:51:02,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:51:02,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:51:02,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:51:02,778 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. cyclomatic complexity: 12 Second operand 6 states. [2018-11-23 11:51:02,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:02,795 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2018-11-23 11:51:02,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 11:51:02,797 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 37 transitions. [2018-11-23 11:51:02,798 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2018-11-23 11:51:02,798 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 37 transitions. [2018-11-23 11:51:02,798 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-11-23 11:51:02,798 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-11-23 11:51:02,798 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 37 transitions. [2018-11-23 11:51:02,799 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 11:51:02,799 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 37 transitions. [2018-11-23 11:51:02,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 37 transitions. [2018-11-23 11:51:02,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-11-23 11:51:02,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 11:51:02,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2018-11-23 11:51:02,802 INFO L728 BuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2018-11-23 11:51:02,803 INFO L608 BuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2018-11-23 11:51:02,803 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 11:51:02,803 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 36 transitions. [2018-11-23 11:51:02,803 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2018-11-23 11:51:02,803 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 11:51:02,804 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 11:51:02,804 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1] [2018-11-23 11:51:02,804 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 11:51:02,804 INFO L794 eck$LassoCheckResult]: Stem: 401#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 399#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 395#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 396#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 397#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 398#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 400#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 407#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 406#L23-3 assume !(main_~i~1 < 5); 394#L23-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 383#L9-3 [2018-11-23 11:51:02,804 INFO L796 eck$LassoCheckResult]: Loop: 383#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 384#L10 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 393#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 388#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 383#L9-3 [2018-11-23 11:51:02,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:02,805 INFO L82 PathProgramCache]: Analyzing trace with hash 1489134225, now seen corresponding path program 3 times [2018-11-23 11:51:02,805 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:02,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:02,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:02,806 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:51:02,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:02,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:02,845 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:51:02,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:51:02,845 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b51fd940-b14a-42e8-8f29-5d5b11667247/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:51:02,862 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:51:02,888 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 11:51:02,889 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:51:02,890 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:51:02,910 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:51:02,925 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:51:02,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-23 11:51:02,925 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 11:51:02,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:02,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 4 times [2018-11-23 11:51:02,926 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:02,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:02,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:02,927 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:51:02,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:02,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:51:02,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:51:02,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 11:51:02,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:51:02,970 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. cyclomatic complexity: 12 Second operand 7 states. [2018-11-23 11:51:02,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:02,985 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2018-11-23 11:51:02,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:51:02,986 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 39 transitions. [2018-11-23 11:51:02,986 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2018-11-23 11:51:02,987 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 32 states and 39 transitions. [2018-11-23 11:51:02,987 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-11-23 11:51:02,987 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-11-23 11:51:02,987 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 39 transitions. [2018-11-23 11:51:02,988 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 11:51:02,988 INFO L705 BuchiCegarLoop]: Abstraction has 32 states and 39 transitions. [2018-11-23 11:51:02,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 39 transitions. [2018-11-23 11:51:02,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2018-11-23 11:51:02,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 11:51:02,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2018-11-23 11:51:02,990 INFO L728 BuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2018-11-23 11:51:02,990 INFO L608 BuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2018-11-23 11:51:02,990 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-23 11:51:02,990 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 38 transitions. [2018-11-23 11:51:02,990 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2018-11-23 11:51:02,991 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 11:51:02,991 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 11:51:02,991 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2018-11-23 11:51:02,991 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 11:51:02,991 INFO L794 eck$LassoCheckResult]: Stem: 501#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 497#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 493#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 494#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 495#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 496#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 498#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 507#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 506#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 505#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 504#L23-3 assume !(main_~i~1 < 5); 492#L23-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 481#L9-3 [2018-11-23 11:51:02,991 INFO L796 eck$LassoCheckResult]: Loop: 481#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 482#L10 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 491#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 486#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 481#L9-3 [2018-11-23 11:51:02,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:02,992 INFO L82 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 4 times [2018-11-23 11:51:02,992 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:02,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:02,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:02,993 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:51:02,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:02,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:03,033 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:51:03,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:51:03,034 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b51fd940-b14a-42e8-8f29-5d5b11667247/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:51:03,041 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:51:03,050 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:51:03,050 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:51:03,051 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:51:03,056 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:51:03,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:51:03,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 11:51:03,071 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 11:51:03,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:03,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 5 times [2018-11-23 11:51:03,072 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:03,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:03,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:03,073 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:51:03,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:03,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:51:03,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:51:03,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 11:51:03,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:51:03,103 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. cyclomatic complexity: 12 Second operand 8 states. [2018-11-23 11:51:03,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:03,120 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2018-11-23 11:51:03,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 11:51:03,121 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 40 transitions. [2018-11-23 11:51:03,121 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2018-11-23 11:51:03,122 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 40 transitions. [2018-11-23 11:51:03,122 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-11-23 11:51:03,122 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-11-23 11:51:03,122 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 40 transitions. [2018-11-23 11:51:03,123 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 11:51:03,123 INFO L705 BuchiCegarLoop]: Abstraction has 33 states and 40 transitions. [2018-11-23 11:51:03,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 40 transitions. [2018-11-23 11:51:03,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-23 11:51:03,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 11:51:03,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2018-11-23 11:51:03,124 INFO L728 BuchiCegarLoop]: Abstraction has 33 states and 40 transitions. [2018-11-23 11:51:03,124 INFO L608 BuchiCegarLoop]: Abstraction has 33 states and 40 transitions. [2018-11-23 11:51:03,124 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-23 11:51:03,124 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 40 transitions. [2018-11-23 11:51:03,125 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2018-11-23 11:51:03,125 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 11:51:03,125 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 11:51:03,125 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1] [2018-11-23 11:51:03,125 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 11:51:03,126 INFO L794 eck$LassoCheckResult]: Stem: 606#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 605#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 601#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 602#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 603#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 604#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 617#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 616#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 615#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 614#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 613#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 612#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 611#L23-3 assume !(main_~i~1 < 5); 600#L23-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 589#L9-3 [2018-11-23 11:51:03,126 INFO L796 eck$LassoCheckResult]: Loop: 589#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 590#L10 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 599#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 594#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 589#L9-3 [2018-11-23 11:51:03,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:03,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1745699051, now seen corresponding path program 5 times [2018-11-23 11:51:03,126 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:03,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:03,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:03,127 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:51:03,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:03,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:51:03,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:51:03,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:03,145 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 6 times [2018-11-23 11:51:03,145 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:03,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:03,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:03,145 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:51:03,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:03,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:51:03,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:51:03,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:03,152 INFO L82 PathProgramCache]: Analyzing trace with hash -743539014, now seen corresponding path program 1 times [2018-11-23 11:51:03,152 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:03,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:03,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:03,153 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:51:03,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:03,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:51:03,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:51:03,478 WARN L180 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 100 [2018-11-23 11:51:03,530 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 11:51:03,530 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 11:51:03,530 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 11:51:03,531 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 11:51:03,531 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 11:51:03,531 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 11:51:03,531 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 11:51:03,531 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 11:51:03,531 INFO L131 ssoRankerPreferences]: Filename of dumped script: max05_true-unreach-call_true-termination.i_Iteration7_Lasso [2018-11-23 11:51:03,531 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 11:51:03,531 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 11:51:03,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:51:03,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:51:03,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:51:03,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:51:03,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:51:03,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:51:03,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:51:03,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:51:03,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:51:03,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:51:03,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:51:03,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:51:03,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:51:03,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:51:03,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:51:03,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:51:03,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:51:03,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:51:03,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:51:03,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:51:03,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:51:03,610 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:51:03,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:51:03,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:51:03,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:51:03,753 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 11:51:03,753 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 11:51:03,754 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 11:51:03,755 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:51:03,755 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 11:51:03,755 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:51:03,755 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:51:03,755 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:51:03,756 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 11:51:03,756 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 11:51:03,756 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:51:03,756 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 11:51:03,757 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:51:03,757 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 11:51:03,757 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:51:03,757 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:51:03,757 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:51:03,757 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 11:51:03,758 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 11:51:03,758 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:51:03,758 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 11:51:03,759 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:51:03,759 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 11:51:03,759 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:51:03,759 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:51:03,759 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:51:03,759 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 11:51:03,759 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 11:51:03,760 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:51:03,760 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 11:51:03,760 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:51:03,760 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 11:51:03,760 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:51:03,760 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:51:03,760 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:51:03,761 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 11:51:03,761 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 11:51:03,761 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:51:03,761 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 11:51:03,762 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:51:03,762 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:51:03,762 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:51:03,762 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:51:03,763 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 11:51:03,763 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 11:51:03,765 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:51:03,765 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 11:51:03,765 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:51:03,765 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 11:51:03,766 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:51:03,766 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:51:03,766 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:51:03,766 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 11:51:03,766 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 11:51:03,767 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:51:03,767 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 11:51:03,767 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:51:03,767 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 11:51:03,767 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:51:03,767 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:51:03,768 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:51:03,768 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 11:51:03,768 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 11:51:03,768 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:51:03,769 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 11:51:03,769 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:51:03,769 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 11:51:03,769 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:51:03,769 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:51:03,769 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:51:03,770 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 11:51:03,770 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 11:51:03,770 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:51:03,770 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 11:51:03,771 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:51:03,771 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 11:51:03,771 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:51:03,771 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:51:03,771 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:51:03,771 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 11:51:03,771 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 11:51:03,772 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:51:03,772 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 11:51:03,773 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:51:03,773 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:51:03,773 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:51:03,773 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:51:03,774 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 11:51:03,774 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 11:51:03,775 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:51:03,776 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 11:51:03,776 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:51:03,776 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:51:03,776 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:51:03,776 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:51:03,777 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 11:51:03,777 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 11:51:03,779 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:51:03,780 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 11:51:03,780 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:51:03,780 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 11:51:03,780 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:51:03,780 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:51:03,780 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:51:03,781 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 11:51:03,781 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 11:51:03,781 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:51:03,781 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 11:51:03,782 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:51:03,782 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 11:51:03,782 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:51:03,782 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:51:03,782 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:51:03,783 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 11:51:03,783 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 11:51:03,783 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:51:03,783 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 11:51:03,784 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:51:03,784 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 11:51:03,784 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:51:03,784 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:51:03,784 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:51:03,784 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 11:51:03,784 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 11:51:03,785 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:51:03,785 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 11:51:03,786 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:51:03,786 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 11:51:03,786 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:51:03,786 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:51:03,786 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:51:03,786 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 11:51:03,786 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 11:51:03,787 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:51:03,787 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 11:51:03,787 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:51:03,788 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 11:51:03,788 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:51:03,788 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:51:03,788 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:51:03,788 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 11:51:03,788 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 11:51:03,789 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:51:03,789 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 11:51:03,789 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:51:03,789 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 11:51:03,790 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:51:03,790 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:51:03,790 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:51:03,790 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 11:51:03,790 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 11:51:03,791 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:51:03,791 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 11:51:03,791 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:51:03,791 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 11:51:03,792 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:51:03,792 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:51:03,792 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:51:03,792 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 11:51:03,792 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 11:51:03,793 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:51:03,793 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 11:51:03,793 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:51:03,793 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 11:51:03,793 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:51:03,793 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:51:03,794 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:51:03,794 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 11:51:03,794 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 11:51:03,794 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:51:03,795 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 11:51:03,795 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:51:03,795 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 11:51:03,795 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:51:03,795 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:51:03,795 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:51:03,796 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 11:51:03,796 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 11:51:03,796 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:51:03,796 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 11:51:03,797 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:51:03,797 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:51:03,797 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:51:03,797 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:51:03,798 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 11:51:03,798 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 11:51:03,804 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:51:03,804 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 11:51:03,805 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:51:03,805 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:51:03,805 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:51:03,805 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:51:03,807 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 11:51:03,807 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 11:51:03,819 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 11:51:03,830 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-23 11:51:03,830 INFO L444 ModelExtractionUtils]: 16 out of 22 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-23 11:51:03,830 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 11:51:03,831 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 11:51:03,831 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 11:51:03,831 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_max_~i~0) = -2*ULTIMATE.start_max_~i~0 + 9 Supporting invariants [] [2018-11-23 11:51:03,848 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-23 11:51:03,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:03,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:03,875 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:51:03,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:03,880 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:51:03,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:51:03,886 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 11:51:03,886 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 40 transitions. cyclomatic complexity: 12 Second operand 3 states. [2018-11-23 11:51:03,900 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 40 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 39 states and 50 transitions. Complement of second has 7 states. [2018-11-23 11:51:03,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 11:51:03,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:51:03,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2018-11-23 11:51:03,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 14 letters. Loop has 4 letters. [2018-11-23 11:51:03,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 11:51:03,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 18 letters. Loop has 4 letters. [2018-11-23 11:51:03,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 11:51:03,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 14 letters. Loop has 8 letters. [2018-11-23 11:51:03,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 11:51:03,903 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 50 transitions. [2018-11-23 11:51:03,903 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2018-11-23 11:51:03,904 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 34 states and 42 transitions. [2018-11-23 11:51:03,904 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-11-23 11:51:03,904 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-23 11:51:03,904 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 42 transitions. [2018-11-23 11:51:03,904 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 11:51:03,904 INFO L705 BuchiCegarLoop]: Abstraction has 34 states and 42 transitions. [2018-11-23 11:51:03,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 42 transitions. [2018-11-23 11:51:03,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-11-23 11:51:03,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 11:51:03,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2018-11-23 11:51:03,906 INFO L728 BuchiCegarLoop]: Abstraction has 34 states and 42 transitions. [2018-11-23 11:51:03,906 INFO L608 BuchiCegarLoop]: Abstraction has 34 states and 42 transitions. [2018-11-23 11:51:03,906 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-23 11:51:03,906 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 42 transitions. [2018-11-23 11:51:03,907 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2018-11-23 11:51:03,907 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 11:51:03,907 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 11:51:03,907 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:51:03,907 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 11:51:03,907 INFO L794 eck$LassoCheckResult]: Stem: 771#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 768#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 764#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 765#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 766#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 767#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 780#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 779#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 778#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 777#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 776#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 775#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 774#L23-3 assume !(main_~i~1 < 5); 763#L23-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 751#L9-3 assume !(max_~i~0 < 5); 747#L9-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 748#L12 main_#t~ret6 := max_#res;main_~ret~1 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem8, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem8;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 772#L9-8 [2018-11-23 11:51:03,908 INFO L796 eck$LassoCheckResult]: Loop: 772#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 758#L10-3 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 749#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 750#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 772#L9-8 [2018-11-23 11:51:03,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:03,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1638581251, now seen corresponding path program 1 times [2018-11-23 11:51:03,908 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:03,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:03,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:03,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:03,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:03,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:03,926 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-23 11:51:03,926 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:51:03,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:51:03,926 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 11:51:03,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:03,926 INFO L82 PathProgramCache]: Analyzing trace with hash 2373478, now seen corresponding path program 1 times [2018-11-23 11:51:03,926 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:03,927 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:03,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:03,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:03,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:03,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:51:03,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:51:03,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:51:03,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:51:03,995 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. cyclomatic complexity: 13 Second operand 3 states. [2018-11-23 11:51:04,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:04,019 INFO L93 Difference]: Finished difference Result 45 states and 55 transitions. [2018-11-23 11:51:04,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:51:04,020 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 55 transitions. [2018-11-23 11:51:04,025 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2018-11-23 11:51:04,025 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 45 states and 55 transitions. [2018-11-23 11:51:04,025 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2018-11-23 11:51:04,026 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-11-23 11:51:04,026 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 55 transitions. [2018-11-23 11:51:04,026 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 11:51:04,026 INFO L705 BuchiCegarLoop]: Abstraction has 45 states and 55 transitions. [2018-11-23 11:51:04,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 55 transitions. [2018-11-23 11:51:04,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 35. [2018-11-23 11:51:04,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 11:51:04,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2018-11-23 11:51:04,028 INFO L728 BuchiCegarLoop]: Abstraction has 35 states and 42 transitions. [2018-11-23 11:51:04,028 INFO L608 BuchiCegarLoop]: Abstraction has 35 states and 42 transitions. [2018-11-23 11:51:04,028 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-23 11:51:04,028 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 42 transitions. [2018-11-23 11:51:04,029 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2018-11-23 11:51:04,029 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 11:51:04,029 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 11:51:04,029 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:51:04,029 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 11:51:04,029 INFO L794 eck$LassoCheckResult]: Stem: 854#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 853#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 849#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 850#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 851#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 852#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 866#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 865#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 864#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 863#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 862#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 861#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 860#L23-3 assume !(main_~i~1 < 5); 848#L23-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 836#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 837#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 847#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 842#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 838#L9-3 assume !(max_~i~0 < 5); 832#L9-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 833#L12 main_#t~ret6 := max_#res;main_~ret~1 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem8, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem8;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 857#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 843#L10-3 [2018-11-23 11:51:04,030 INFO L796 eck$LassoCheckResult]: Loop: 843#L10-3 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 834#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 835#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 858#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 843#L10-3 [2018-11-23 11:51:04,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:04,030 INFO L82 PathProgramCache]: Analyzing trace with hash -1336698829, now seen corresponding path program 1 times [2018-11-23 11:51:04,030 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:04,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:04,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:04,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:04,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:04,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:04,075 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-23 11:51:04,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:51:04,075 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b51fd940-b14a-42e8-8f29-5d5b11667247/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:51:04,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:04,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:04,109 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:51:04,131 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-23 11:51:04,155 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:51:04,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 11:51:04,156 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 11:51:04,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:04,156 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 2 times [2018-11-23 11:51:04,156 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:04,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:04,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:04,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:04,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:04,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:51:04,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:51:04,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:51:04,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:51:04,214 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. cyclomatic complexity: 12 Second operand 5 states. [2018-11-23 11:51:04,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:04,244 INFO L93 Difference]: Finished difference Result 57 states and 70 transitions. [2018-11-23 11:51:04,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 11:51:04,244 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 70 transitions. [2018-11-23 11:51:04,244 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2018-11-23 11:51:04,245 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 57 states and 70 transitions. [2018-11-23 11:51:04,245 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2018-11-23 11:51:04,245 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2018-11-23 11:51:04,245 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 70 transitions. [2018-11-23 11:51:04,245 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 11:51:04,245 INFO L705 BuchiCegarLoop]: Abstraction has 57 states and 70 transitions. [2018-11-23 11:51:04,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 70 transitions. [2018-11-23 11:51:04,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 43. [2018-11-23 11:51:04,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 11:51:04,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 52 transitions. [2018-11-23 11:51:04,247 INFO L728 BuchiCegarLoop]: Abstraction has 43 states and 52 transitions. [2018-11-23 11:51:04,247 INFO L608 BuchiCegarLoop]: Abstraction has 43 states and 52 transitions. [2018-11-23 11:51:04,248 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-23 11:51:04,248 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 52 transitions. [2018-11-23 11:51:04,248 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2018-11-23 11:51:04,248 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 11:51:04,248 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 11:51:04,249 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:51:04,249 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 11:51:04,249 INFO L794 eck$LassoCheckResult]: Stem: 1020#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1018#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1014#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1015#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1016#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1017#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1019#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1035#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1034#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1033#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1031#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1030#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1029#L23-3 assume !(main_~i~1 < 5); 1013#L23-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 999#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1000#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1032#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 1006#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1001#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1002#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1011#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 1012#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1027#L9-3 assume !(max_~i~0 < 5); 995#L9-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 996#L12 main_#t~ret6 := max_#res;main_~ret~1 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem8, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem8;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1024#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1037#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1036#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 1025#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1023#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1007#L10-3 [2018-11-23 11:51:04,249 INFO L796 eck$LassoCheckResult]: Loop: 1007#L10-3 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 997#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 998#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1028#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1007#L10-3 [2018-11-23 11:51:04,249 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:04,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1525547091, now seen corresponding path program 1 times [2018-11-23 11:51:04,250 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:04,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:04,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:04,250 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:51:04,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:04,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:04,276 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-23 11:51:04,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:51:04,276 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b51fd940-b14a-42e8-8f29-5d5b11667247/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:51:04,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:04,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:04,315 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:51:04,324 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-23 11:51:04,350 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:51:04,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 11:51:04,350 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 11:51:04,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:04,350 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 3 times [2018-11-23 11:51:04,350 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:04,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:04,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:04,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:04,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:04,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:51:04,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:51:04,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:51:04,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:51:04,406 INFO L87 Difference]: Start difference. First operand 43 states and 52 transitions. cyclomatic complexity: 14 Second operand 6 states. [2018-11-23 11:51:04,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:04,457 INFO L93 Difference]: Finished difference Result 69 states and 85 transitions. [2018-11-23 11:51:04,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 11:51:04,458 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 85 transitions. [2018-11-23 11:51:04,459 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2018-11-23 11:51:04,459 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 69 states and 85 transitions. [2018-11-23 11:51:04,459 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2018-11-23 11:51:04,461 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2018-11-23 11:51:04,461 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 85 transitions. [2018-11-23 11:51:04,461 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 11:51:04,461 INFO L705 BuchiCegarLoop]: Abstraction has 69 states and 85 transitions. [2018-11-23 11:51:04,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 85 transitions. [2018-11-23 11:51:04,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 51. [2018-11-23 11:51:04,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 11:51:04,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 62 transitions. [2018-11-23 11:51:04,463 INFO L728 BuchiCegarLoop]: Abstraction has 51 states and 62 transitions. [2018-11-23 11:51:04,464 INFO L608 BuchiCegarLoop]: Abstraction has 51 states and 62 transitions. [2018-11-23 11:51:04,464 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-23 11:51:04,464 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 62 transitions. [2018-11-23 11:51:04,464 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2018-11-23 11:51:04,464 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 11:51:04,464 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 11:51:04,465 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:51:04,465 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 11:51:04,465 INFO L794 eck$LassoCheckResult]: Stem: 1230#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1227#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1223#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1224#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1225#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1226#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1248#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1247#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1246#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1245#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1244#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1243#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1242#L23-3 assume !(main_~i~1 < 5); 1222#L23-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1207#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1208#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1220#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 1221#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1209#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1210#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1253#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 1214#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1215#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1237#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1252#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 1238#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1236#L9-3 assume !(max_~i~0 < 5); 1203#L9-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1204#L12 main_#t~ret6 := max_#res;main_~ret~1 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem8, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem8;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1231#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1232#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1251#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 1233#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1234#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1216#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1205#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 1206#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1250#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1240#L10-3 [2018-11-23 11:51:04,465 INFO L796 eck$LassoCheckResult]: Loop: 1240#L10-3 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 1249#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 1241#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1239#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1240#L10-3 [2018-11-23 11:51:04,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:04,465 INFO L82 PathProgramCache]: Analyzing trace with hash 452444531, now seen corresponding path program 2 times [2018-11-23 11:51:04,465 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:04,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:04,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:04,466 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:51:04,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:04,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:04,507 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-23 11:51:04,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:51:04,508 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b51fd940-b14a-42e8-8f29-5d5b11667247/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:51:04,524 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:51:04,547 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:51:04,548 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:51:04,550 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:51:04,581 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-23 11:51:04,606 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:51:04,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-23 11:51:04,606 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 11:51:04,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:04,607 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 4 times [2018-11-23 11:51:04,607 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:04,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:04,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:04,607 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:51:04,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:04,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:51:04,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:51:04,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 11:51:04,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:51:04,664 INFO L87 Difference]: Start difference. First operand 51 states and 62 transitions. cyclomatic complexity: 16 Second operand 7 states. [2018-11-23 11:51:04,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:04,738 INFO L93 Difference]: Finished difference Result 81 states and 100 transitions. [2018-11-23 11:51:04,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:51:04,739 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 100 transitions. [2018-11-23 11:51:04,740 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2018-11-23 11:51:04,740 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 81 states and 100 transitions. [2018-11-23 11:51:04,740 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2018-11-23 11:51:04,740 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2018-11-23 11:51:04,740 INFO L73 IsDeterministic]: Start isDeterministic. Operand 81 states and 100 transitions. [2018-11-23 11:51:04,741 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 11:51:04,741 INFO L705 BuchiCegarLoop]: Abstraction has 81 states and 100 transitions. [2018-11-23 11:51:04,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states and 100 transitions. [2018-11-23 11:51:04,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 59. [2018-11-23 11:51:04,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-23 11:51:04,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 72 transitions. [2018-11-23 11:51:04,743 INFO L728 BuchiCegarLoop]: Abstraction has 59 states and 72 transitions. [2018-11-23 11:51:04,743 INFO L608 BuchiCegarLoop]: Abstraction has 59 states and 72 transitions. [2018-11-23 11:51:04,743 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-23 11:51:04,743 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 72 transitions. [2018-11-23 11:51:04,744 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2018-11-23 11:51:04,744 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 11:51:04,744 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 11:51:04,749 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:51:04,749 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 11:51:04,749 INFO L794 eck$LassoCheckResult]: Stem: 1481#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1478#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1474#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1475#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1476#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1477#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1497#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1496#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1495#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1494#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1493#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1492#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1491#L23-3 assume !(main_~i~1 < 5); 1473#L23-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1460#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1461#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1472#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 1467#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1462#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1463#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1513#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 1511#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1509#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1507#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1505#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 1503#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1501#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1486#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1499#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 1487#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1485#L9-3 assume !(max_~i~0 < 5); 1458#L9-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1459#L12 main_#t~ret6 := max_#res;main_~ret~1 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem8, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem8;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1482#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1468#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1456#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 1457#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1483#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1514#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1512#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 1510#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1508#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1506#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1504#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 1502#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1500#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1489#L10-3 [2018-11-23 11:51:04,749 INFO L796 eck$LassoCheckResult]: Loop: 1489#L10-3 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 1498#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 1490#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1488#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1489#L10-3 [2018-11-23 11:51:04,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:04,749 INFO L82 PathProgramCache]: Analyzing trace with hash 2023971731, now seen corresponding path program 3 times [2018-11-23 11:51:04,749 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:04,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:04,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:04,750 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:51:04,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:04,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:04,792 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-23 11:51:04,792 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:51:04,793 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b51fd940-b14a-42e8-8f29-5d5b11667247/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:51:04,802 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:51:04,838 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-23 11:51:04,838 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:51:04,840 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:51:04,850 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-23 11:51:04,875 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:51:04,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 11:51:04,876 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 11:51:04,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:04,876 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 5 times [2018-11-23 11:51:04,876 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:04,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:04,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:04,877 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:51:04,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:04,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:51:04,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:51:04,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 11:51:04,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:51:04,940 INFO L87 Difference]: Start difference. First operand 59 states and 72 transitions. cyclomatic complexity: 18 Second operand 8 states. [2018-11-23 11:51:05,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:05,025 INFO L93 Difference]: Finished difference Result 84 states and 103 transitions. [2018-11-23 11:51:05,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 11:51:05,026 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 103 transitions. [2018-11-23 11:51:05,027 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2018-11-23 11:51:05,027 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 84 states and 103 transitions. [2018-11-23 11:51:05,027 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2018-11-23 11:51:05,028 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2018-11-23 11:51:05,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 84 states and 103 transitions. [2018-11-23 11:51:05,028 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 11:51:05,028 INFO L705 BuchiCegarLoop]: Abstraction has 84 states and 103 transitions. [2018-11-23 11:51:05,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states and 103 transitions. [2018-11-23 11:51:05,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 67. [2018-11-23 11:51:05,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-23 11:51:05,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 82 transitions. [2018-11-23 11:51:05,030 INFO L728 BuchiCegarLoop]: Abstraction has 67 states and 82 transitions. [2018-11-23 11:51:05,030 INFO L608 BuchiCegarLoop]: Abstraction has 67 states and 82 transitions. [2018-11-23 11:51:05,031 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-23 11:51:05,031 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 82 transitions. [2018-11-23 11:51:05,031 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2018-11-23 11:51:05,031 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 11:51:05,031 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 11:51:05,032 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:51:05,032 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 11:51:05,032 INFO L794 eck$LassoCheckResult]: Stem: 1771#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1768#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1764#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1765#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1766#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1767#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1793#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1791#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1789#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1787#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1785#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1783#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1782#L23-3 assume !(main_~i~1 < 5); 1763#L23-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1749#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1750#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1811#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 1810#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1751#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1752#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1762#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 1756#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1757#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1809#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1808#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 1807#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1806#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1805#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1803#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 1801#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1799#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1776#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1796#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 1777#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1775#L9-3 assume !(max_~i~0 < 5); 1745#L9-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1746#L12 main_#t~ret6 := max_#res;main_~ret~1 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem8, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem8;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1772#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1758#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1747#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 1748#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1773#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1804#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1802#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 1800#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1798#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1797#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1795#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 1794#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1792#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1790#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1788#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 1786#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1784#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1779#L10-3 [2018-11-23 11:51:05,032 INFO L796 eck$LassoCheckResult]: Loop: 1779#L10-3 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 1781#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 1780#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1778#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1779#L10-3 [2018-11-23 11:51:05,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:05,036 INFO L82 PathProgramCache]: Analyzing trace with hash 669208243, now seen corresponding path program 4 times [2018-11-23 11:51:05,036 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:05,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:05,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:05,037 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:51:05,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:05,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:51:05,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:51:05,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:05,102 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 6 times [2018-11-23 11:51:05,102 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:05,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:05,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:05,103 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:51:05,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:05,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:51:05,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:51:05,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:05,107 INFO L82 PathProgramCache]: Analyzing trace with hash -746698386, now seen corresponding path program 1 times [2018-11-23 11:51:05,107 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:05,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:05,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:05,108 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:51:05,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:05,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:05,196 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-23 11:51:05,197 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:51:05,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 11:51:05,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 11:51:05,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:51:05,231 INFO L87 Difference]: Start difference. First operand 67 states and 82 transitions. cyclomatic complexity: 20 Second operand 10 states. [2018-11-23 11:51:05,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:05,351 INFO L93 Difference]: Finished difference Result 84 states and 100 transitions. [2018-11-23 11:51:05,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 11:51:05,352 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 100 transitions. [2018-11-23 11:51:05,352 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 11:51:05,353 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 62 states and 73 transitions. [2018-11-23 11:51:05,353 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2018-11-23 11:51:05,353 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2018-11-23 11:51:05,353 INFO L73 IsDeterministic]: Start isDeterministic. Operand 62 states and 73 transitions. [2018-11-23 11:51:05,353 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 11:51:05,354 INFO L705 BuchiCegarLoop]: Abstraction has 62 states and 73 transitions. [2018-11-23 11:51:05,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states and 73 transitions. [2018-11-23 11:51:05,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-11-23 11:51:05,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-23 11:51:05,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 73 transitions. [2018-11-23 11:51:05,356 INFO L728 BuchiCegarLoop]: Abstraction has 62 states and 73 transitions. [2018-11-23 11:51:05,356 INFO L608 BuchiCegarLoop]: Abstraction has 62 states and 73 transitions. [2018-11-23 11:51:05,356 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-23 11:51:05,356 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 62 states and 73 transitions. [2018-11-23 11:51:05,357 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 11:51:05,357 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 11:51:05,357 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 11:51:05,358 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:51:05,358 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 11:51:05,358 INFO L794 eck$LassoCheckResult]: Stem: 1941#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1940#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1936#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1937#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1938#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1939#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1961#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1958#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1955#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1952#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1950#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1948#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1947#L23-3 assume !(main_~i~1 < 5); 1935#L23-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1927#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1928#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1934#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 1929#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1930#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1984#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1983#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 1981#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1979#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1977#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1975#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 1973#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1971#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1969#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1967#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 1965#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1963#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1960#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1957#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 1954#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1946#L9-3 assume !(max_~i~0 < 5); 1923#L9-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1924#L12 main_#t~ret6 := max_#res;main_~ret~1 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem8, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem8;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1944#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1931#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1925#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 1926#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1945#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1982#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1980#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 1978#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1976#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1974#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1972#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 1970#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1968#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1966#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1964#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 1962#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1959#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1956#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1953#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 1951#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1949#L9-8 assume !(max_~i~0 < 5); 1942#L9-9 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1943#L12-1 main_#t~ret9 := max_#res;main_~ret2~0 := main_#t~ret9;havoc main_#t~ret9;call main_#t~mem10 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem10;havoc main_#t~mem10;main_~i~2 := 0; 1932#L32-3 [2018-11-23 11:51:05,358 INFO L796 eck$LassoCheckResult]: Loop: 1932#L32-3 assume !!(main_~i~2 < 4);call main_#t~mem12 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~2), 4);call write~int(main_#t~mem12, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~2, 4);havoc main_#t~mem12; 1933#L32-2 main_#t~post11 := main_~i~2;main_~i~2 := 1 + main_#t~post11;havoc main_#t~post11; 1932#L32-3 [2018-11-23 11:51:05,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:05,358 INFO L82 PathProgramCache]: Analyzing trace with hash -260352212, now seen corresponding path program 1 times [2018-11-23 11:51:05,358 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:05,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:05,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:05,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:05,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:05,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:51:05,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:51:05,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:05,412 INFO L82 PathProgramCache]: Analyzing trace with hash 3203, now seen corresponding path program 1 times [2018-11-23 11:51:05,412 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:05,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:05,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:05,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:05,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:05,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:51:05,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:51:05,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:05,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1090370322, now seen corresponding path program 1 times [2018-11-23 11:51:05,418 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:05,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:05,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:05,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:05,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:05,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:51:05,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:51:06,984 WARN L180 SmtUtils]: Spent 1.48 s on a formula simplification. DAG size of input: 369 DAG size of output: 281 [2018-11-23 11:51:07,268 WARN L180 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 98 [2018-11-23 11:51:07,269 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 11:51:07,269 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 11:51:07,269 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 11:51:07,269 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 11:51:07,270 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 11:51:07,270 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 11:51:07,270 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 11:51:07,270 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 11:51:07,270 INFO L131 ssoRankerPreferences]: Filename of dumped script: max05_true-unreach-call_true-termination.i_Iteration14_Lasso [2018-11-23 11:51:07,270 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 11:51:07,270 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 11:51:07,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:51:07,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:51:07,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:51:07,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:51:07,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:51:07,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:51:07,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:51:07,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:51:07,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:51:07,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:51:07,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:51:07,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:51:07,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:51:07,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:51:07,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:51:07,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:51:07,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:51:07,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:51:07,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:51:07,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:51:07,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:51:07,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:51:07,633 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 11:51:07,633 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 11:51:07,633 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 11:51:07,634 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:51:07,634 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 11:51:07,634 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:51:07,634 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:51:07,634 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:51:07,634 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 11:51:07,634 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 11:51:07,635 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:51:07,635 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 11:51:07,635 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:51:07,635 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:51:07,635 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:51:07,635 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:51:07,635 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 11:51:07,636 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 11:51:07,636 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:51:07,640 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 11:51:07,641 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:51:07,641 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:51:07,641 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:51:07,641 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:51:07,641 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 11:51:07,641 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 11:51:07,643 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:51:07,644 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 11:51:07,644 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:51:07,644 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:51:07,644 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:51:07,645 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:51:07,646 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 11:51:07,646 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 11:51:07,649 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:51:07,649 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 11:51:07,649 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:51:07,650 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 11:51:07,650 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:51:07,650 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:51:07,651 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 11:51:07,651 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 11:51:07,654 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:51:07,655 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 11:51:07,655 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:51:07,655 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:51:07,655 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:51:07,655 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:51:07,657 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 11:51:07,657 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 11:51:07,662 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 11:51:07,670 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-23 11:51:07,670 INFO L444 ModelExtractionUtils]: 12 out of 19 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-23 11:51:07,671 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 11:51:07,671 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 11:51:07,672 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 11:51:07,672 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~2, v_rep(select #length ULTIMATE.start_main_~#x~0.base)_3) = -16*ULTIMATE.start_main_~i~2 + 7*v_rep(select #length ULTIMATE.start_main_~#x~0.base)_3 Supporting invariants [] [2018-11-23 11:51:07,703 INFO L297 tatePredicateManager]: 14 out of 14 supporting invariants were superfluous and have been removed [2018-11-23 11:51:07,708 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 11:51:07,718 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:07,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:07,753 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:51:07,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:07,759 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:51:07,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:51:07,773 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 11:51:07,773 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 62 states and 73 transitions. cyclomatic complexity: 13 Second operand 3 states. [2018-11-23 11:51:07,780 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 62 states and 73 transitions. cyclomatic complexity: 13. Second operand 3 states. Result 64 states and 76 transitions. Complement of second has 4 states. [2018-11-23 11:51:07,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 11:51:07,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:51:07,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2018-11-23 11:51:07,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 24 transitions. Stem has 60 letters. Loop has 2 letters. [2018-11-23 11:51:07,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 11:51:07,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 24 transitions. Stem has 62 letters. Loop has 2 letters. [2018-11-23 11:51:07,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 11:51:07,783 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 24 transitions. Stem has 60 letters. Loop has 4 letters. [2018-11-23 11:51:07,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 11:51:07,783 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 76 transitions. [2018-11-23 11:51:07,784 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 11:51:07,784 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 0 states and 0 transitions. [2018-11-23 11:51:07,784 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-23 11:51:07,784 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-23 11:51:07,784 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-23 11:51:07,784 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 11:51:07,784 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 11:51:07,784 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 11:51:07,784 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 11:51:07,784 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-11-23 11:51:07,784 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:51:07,784 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 11:51:07,785 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-23 11:51:07,790 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 11:51:07 BoogieIcfgContainer [2018-11-23 11:51:07,790 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 11:51:07,790 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 11:51:07,790 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 11:51:07,791 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 11:51:07,791 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:51:01" (3/4) ... [2018-11-23 11:51:07,794 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 11:51:07,794 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 11:51:07,795 INFO L168 Benchmark]: Toolchain (without parser) took 6706.62 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 232.8 MB). Free memory was 961.9 MB in the beginning and 1.1 GB in the end (delta: -144.8 MB). Peak memory consumption was 88.0 MB. Max. memory is 11.5 GB. [2018-11-23 11:51:07,796 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 11:51:07,796 INFO L168 Benchmark]: CACSL2BoogieTranslator took 178.21 ms. Allocated memory is still 1.0 GB. Free memory was 961.9 MB in the beginning and 951.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 11:51:07,796 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -181.8 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. [2018-11-23 11:51:07,797 INFO L168 Benchmark]: Boogie Preprocessor took 20.30 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 11:51:07,797 INFO L168 Benchmark]: RCFGBuilder took 241.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2018-11-23 11:51:07,798 INFO L168 Benchmark]: BuchiAutomizer took 6195.99 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 100.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.2 MB). Peak memory consumption was 101.3 MB. Max. memory is 11.5 GB. [2018-11-23 11:51:07,798 INFO L168 Benchmark]: Witness Printer took 3.83 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 11:51:07,801 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 178.21 ms. Allocated memory is still 1.0 GB. Free memory was 961.9 MB in the beginning and 951.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 63.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -181.8 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.30 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 241.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6195.99 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 100.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.2 MB). Peak memory consumption was 101.3 MB. Max. memory is 11.5 GB. * Witness Printer took 3.83 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 14 terminating modules (11 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function 9 * unknown-#length-unknown[x] + -8 * i and consists of 5 locations. One deterministic module has affine ranking function -2 * i + 9 and consists of 4 locations. One deterministic module has affine ranking function -16 * i + 7 * unknown-#length-unknown[x] and consists of 3 locations. 11 modules have a trivial ranking function, the largest among these consists of 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.1s and 15 iterations. TraceHistogramMax:5. Analysis of lassos took 5.2s. Construction of modules took 0.3s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 14. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 85 StatesRemovedByMinimization, 9 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 67 states and ocurred in iteration 12. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 346 SDtfs, 400 SDslu, 704 SDs, 0 SdLazy, 441 SolverSat, 91 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU10 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital205 mio100 ax100 hnf100 lsp94 ukn50 mio100 lsp60 div100 bol100 ite100 ukn100 eq156 hnf90 smp94 dnf100 smp100 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 8ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...