./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/reducercommutativity/max10_true-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_70c304d3-61b8-49bb-b266-abb530e94177/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_70c304d3-61b8-49bb-b266-abb530e94177/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_70c304d3-61b8-49bb-b266-abb530e94177/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_70c304d3-61b8-49bb-b266-abb530e94177/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/reducercommutativity/max10_true-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_70c304d3-61b8-49bb-b266-abb530e94177/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_70c304d3-61b8-49bb-b266-abb530e94177/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 9f5fbba39a6c3cc8a650e9b9b88c73e3f7d08064 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 10:24:33,355 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 10:24:33,356 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 10:24:33,362 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 10:24:33,362 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 10:24:33,363 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 10:24:33,364 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 10:24:33,365 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 10:24:33,366 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 10:24:33,366 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 10:24:33,366 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 10:24:33,367 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 10:24:33,367 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 10:24:33,367 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 10:24:33,368 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 10:24:33,368 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 10:24:33,369 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 10:24:33,370 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 10:24:33,371 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 10:24:33,371 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 10:24:33,372 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 10:24:33,373 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 10:24:33,374 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 10:24:33,374 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 10:24:33,374 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 10:24:33,374 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 10:24:33,375 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 10:24:33,375 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 10:24:33,376 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 10:24:33,376 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 10:24:33,377 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 10:24:33,377 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 10:24:33,377 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 10:24:33,377 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 10:24:33,378 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 10:24:33,378 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 10:24:33,378 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_70c304d3-61b8-49bb-b266-abb530e94177/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-12-09 10:24:33,386 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 10:24:33,386 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 10:24:33,387 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 10:24:33,387 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 10:24:33,387 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 10:24:33,387 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-09 10:24:33,387 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-09 10:24:33,387 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-09 10:24:33,388 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-09 10:24:33,388 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-09 10:24:33,388 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-09 10:24:33,388 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 10:24:33,388 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 10:24:33,388 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 10:24:33,388 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 10:24:33,388 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 10:24:33,388 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 10:24:33,388 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-09 10:24:33,388 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-09 10:24:33,388 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-09 10:24:33,389 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 10:24:33,389 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 10:24:33,389 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-09 10:24:33,389 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 10:24:33,389 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-09 10:24:33,389 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 10:24:33,389 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 10:24:33,389 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-09 10:24:33,389 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 10:24:33,389 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-09 10:24:33,389 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-09 10:24:33,390 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-09 10:24:33,390 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_70c304d3-61b8-49bb-b266-abb530e94177/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 -> 9f5fbba39a6c3cc8a650e9b9b88c73e3f7d08064 [2018-12-09 10:24:33,406 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 10:24:33,413 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 10:24:33,415 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 10:24:33,416 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 10:24:33,416 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 10:24:33,416 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_70c304d3-61b8-49bb-b266-abb530e94177/bin-2019/uautomizer/../../sv-benchmarks/c/reducercommutativity/max10_true-unreach-call_true-termination.i [2018-12-09 10:24:33,449 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_70c304d3-61b8-49bb-b266-abb530e94177/bin-2019/uautomizer/data/49356a7fd/569a75e995bb47b8a883f8a491f45810/FLAGee20add3a [2018-12-09 10:24:33,791 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 10:24:33,791 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_70c304d3-61b8-49bb-b266-abb530e94177/sv-benchmarks/c/reducercommutativity/max10_true-unreach-call_true-termination.i [2018-12-09 10:24:33,797 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_70c304d3-61b8-49bb-b266-abb530e94177/bin-2019/uautomizer/data/49356a7fd/569a75e995bb47b8a883f8a491f45810/FLAGee20add3a [2018-12-09 10:24:34,180 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_70c304d3-61b8-49bb-b266-abb530e94177/bin-2019/uautomizer/data/49356a7fd/569a75e995bb47b8a883f8a491f45810 [2018-12-09 10:24:34,182 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 10:24:34,183 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 10:24:34,184 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 10:24:34,184 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 10:24:34,186 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 10:24:34,186 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 10:24:34" (1/1) ... [2018-12-09 10:24:34,188 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15319f4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:24:34, skipping insertion in model container [2018-12-09 10:24:34,188 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 10:24:34" (1/1) ... [2018-12-09 10:24:34,193 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 10:24:34,202 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 10:24:34,293 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 10:24:34,299 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 10:24:34,311 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 10:24:34,320 INFO L195 MainTranslator]: Completed translation [2018-12-09 10:24:34,320 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:24:34 WrapperNode [2018-12-09 10:24:34,320 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 10:24:34,321 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 10:24:34,321 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 10:24:34,321 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 10:24:34,327 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:24:34" (1/1) ... [2018-12-09 10:24:34,333 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:24:34" (1/1) ... [2018-12-09 10:24:34,380 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 10:24:34,380 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 10:24:34,380 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 10:24:34,380 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 10:24:34,389 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:24:34" (1/1) ... [2018-12-09 10:24:34,389 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:24:34" (1/1) ... [2018-12-09 10:24:34,391 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:24:34" (1/1) ... [2018-12-09 10:24:34,391 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:24:34" (1/1) ... [2018-12-09 10:24:34,396 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:24:34" (1/1) ... [2018-12-09 10:24:34,401 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:24:34" (1/1) ... [2018-12-09 10:24:34,402 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:24:34" (1/1) ... [2018-12-09 10:24:34,403 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 10:24:34,403 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 10:24:34,403 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 10:24:34,403 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 10:24:34,404 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:24:34" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_70c304d3-61b8-49bb-b266-abb530e94177/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-12-09 10:24:34,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 10:24:34,435 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 10:24:34,435 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 10:24:34,435 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 10:24:34,435 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 10:24:34,435 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 10:24:34,586 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 10:24:34,586 INFO L280 CfgBuilder]: Removed 15 assue(true) statements. [2018-12-09 10:24:34,587 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 10:24:34 BoogieIcfgContainer [2018-12-09 10:24:34,587 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 10:24:34,587 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-09 10:24:34,588 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-09 10:24:34,591 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-09 10:24:34,592 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 10:24:34,592 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.12 10:24:34" (1/3) ... [2018-12-09 10:24:34,593 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@32a03360 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.12 10:24:34, skipping insertion in model container [2018-12-09 10:24:34,593 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 10:24:34,593 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:24:34" (2/3) ... [2018-12-09 10:24:34,594 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@32a03360 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.12 10:24:34, skipping insertion in model container [2018-12-09 10:24:34,594 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 10:24:34,594 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 10:24:34" (3/3) ... [2018-12-09 10:24:34,595 INFO L375 chiAutomizerObserver]: Analyzing ICFG max10_true-unreach-call_true-termination.i [2018-12-09 10:24:34,640 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 10:24:34,640 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-09 10:24:34,640 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-09 10:24:34,640 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-09 10:24:34,641 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 10:24:34,641 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 10:24:34,641 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-09 10:24:34,641 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 10:24:34,641 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-09 10:24:34,653 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states. [2018-12-09 10:24:34,671 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 16 [2018-12-09 10:24:34,671 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 10:24:34,671 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 10:24:34,675 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-09 10:24:34,675 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-09 10:24:34,675 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-09 10:24:34,675 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states. [2018-12-09 10:24:34,677 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 16 [2018-12-09 10:24:34,677 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 10:24:34,677 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 10:24:34,677 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-09 10:24:34,677 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-09 10:24:34,682 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(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 30#L23-3true [2018-12-09 10:24:34,682 INFO L796 eck$LassoCheckResult]: Loop: 30#L23-3true assume !!(main_~i~1 < 10);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-12-09 10:24:34,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:24:34,685 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-12-09 10:24:34,686 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:24:34,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:24:34,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:34,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:24:34,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:34,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:24:34,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:24:34,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:24:34,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2018-12-09 10:24:34,750 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:24:34,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:24:34,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:34,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:24:34,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:34,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:24:34,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:24:34,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:24:34,765 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2018-12-09 10:24:34,766 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:24:34,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:24:34,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:34,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:24:34,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:34,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:24:34,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:24:34,856 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 10:24:34,857 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 10:24:34,857 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 10:24:34,857 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 10:24:34,857 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 10:24:34,857 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 10:24:34,857 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 10:24:34,857 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 10:24:34,858 INFO L131 ssoRankerPreferences]: Filename of dumped script: max10_true-unreach-call_true-termination.i_Iteration1_Lasso [2018-12-09 10:24:34,858 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 10:24:34,858 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 10:24:34,872 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:24:34,876 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:24:34,877 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:24:34,880 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:24:34,881 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:24:34,882 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:24:34,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:24:34,887 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:24:34,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:24:34,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:24:34,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:24:34,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:24:34,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:24:34,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:24:34,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:24:34,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:24:34,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:24:34,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:24:35,017 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 10:24:35,021 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 10:24:35,023 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-12-09 10:24:35,024 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:24:35,024 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:24:35,024 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:24:35,024 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:24:35,025 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:24:35,026 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:24:35,026 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:24:35,029 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:24:35,030 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-12-09 10:24:35,030 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:24:35,030 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:24:35,030 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:24:35,030 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:24:35,031 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:24:35,031 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:24:35,031 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:24:35,032 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:24:35,032 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-12-09 10:24:35,032 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:24:35,033 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:24:35,033 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:24:35,033 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:24:35,033 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:24:35,033 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:24:35,033 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:24:35,034 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:24:35,034 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-12-09 10:24:35,034 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:24:35,034 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:24:35,034 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:24:35,035 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:24:35,035 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:24:35,035 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:24:35,035 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:24:35,035 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:24:35,036 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-12-09 10:24:35,036 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:24:35,036 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:24:35,036 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:24:35,036 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:24:35,036 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:24:35,037 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:24:35,037 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:24:35,037 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:24:35,037 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-12-09 10:24:35,038 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:24:35,038 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:24:35,038 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:24:35,038 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:24:35,038 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:24:35,038 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:24:35,038 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:24:35,039 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:24:35,039 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-12-09 10:24:35,040 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:24:35,040 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:24:35,040 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:24:35,040 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:24:35,041 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:24:35,041 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:24:35,044 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:24:35,044 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-12-09 10:24:35,044 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:24:35,045 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:24:35,045 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:24:35,045 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:24:35,045 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:24:35,045 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:24:35,045 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:24:35,046 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:24:35,046 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-12-09 10:24:35,046 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:24:35,046 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:24:35,046 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:24:35,047 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:24:35,047 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:24:35,047 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:24:35,047 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:24:35,047 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:24:35,048 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-12-09 10:24:35,048 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:24:35,048 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:24:35,048 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:24:35,048 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:24:35,048 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:24:35,049 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:24:35,049 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:24:35,049 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:24:35,049 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-12-09 10:24:35,050 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:24:35,050 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 10:24:35,050 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:24:35,050 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:24:35,051 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 10:24:35,051 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:24:35,055 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:24:35,055 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-12-09 10:24:35,056 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:24:35,056 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:24:35,056 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:24:35,056 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:24:35,056 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:24:35,056 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:24:35,056 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:24:35,057 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:24:35,057 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-12-09 10:24:35,058 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:24:35,058 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:24:35,058 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:24:35,058 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:24:35,059 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:24:35,059 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:24:35,061 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:24:35,061 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-12-09 10:24:35,061 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:24:35,061 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:24:35,061 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:24:35,062 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:24:35,063 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:24:35,063 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:24:35,070 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:24:35,071 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-12-09 10:24:35,071 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:24:35,071 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:24:35,071 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:24:35,072 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:24:35,072 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:24:35,072 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:24:35,072 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:24:35,073 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:24:35,073 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-12-09 10:24:35,073 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:24:35,073 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:24:35,073 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:24:35,073 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:24:35,075 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:24:35,075 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:24:35,089 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 10:24:35,102 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-09 10:24:35,102 INFO L444 ModelExtractionUtils]: 9 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-09 10:24:35,103 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 10:24:35,104 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 10:24:35,104 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 10:24:35,105 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1) = -2*ULTIMATE.start_main_~i~1 + 19 Supporting invariants [] [2018-12-09 10:24:35,109 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2018-12-09 10:24:35,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:24:35,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:24:35,133 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:24:35,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:24:35,141 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:24:35,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:24:35,164 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-12-09 10:24:35,164 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states. Second operand 3 states. [2018-12-09 10:24:35,198 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states.. Second operand 3 states. Result 87 states and 122 transitions. Complement of second has 7 states. [2018-12-09 10:24:35,198 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-12-09 10:24:35,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-09 10:24:35,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 82 transitions. [2018-12-09 10:24:35,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 82 transitions. Stem has 2 letters. Loop has 2 letters. [2018-12-09 10:24:35,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:24:35,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 82 transitions. Stem has 4 letters. Loop has 2 letters. [2018-12-09 10:24:35,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:24:35,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 82 transitions. Stem has 2 letters. Loop has 4 letters. [2018-12-09 10:24:35,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:24:35,202 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 87 states and 122 transitions. [2018-12-09 10:24:35,204 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2018-12-09 10:24:35,207 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 87 states to 25 states and 33 transitions. [2018-12-09 10:24:35,208 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-12-09 10:24:35,208 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-12-09 10:24:35,208 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 33 transitions. [2018-12-09 10:24:35,208 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 10:24:35,208 INFO L705 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2018-12-09 10:24:35,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 33 transitions. [2018-12-09 10:24:35,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-12-09 10:24:35,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-09 10:24:35,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2018-12-09 10:24:35,224 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2018-12-09 10:24:35,224 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2018-12-09 10:24:35,224 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-09 10:24:35,224 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 33 transitions. [2018-12-09 10:24:35,225 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2018-12-09 10:24:35,225 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 10:24:35,225 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 10:24:35,225 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-12-09 10:24:35,225 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-09 10:24:35,225 INFO L794 eck$LassoCheckResult]: Stem: 183#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 180#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(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 177#L23-3 assume !(main_~i~1 < 10); 176#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; 165#L9-3 [2018-12-09 10:24:35,225 INFO L796 eck$LassoCheckResult]: Loop: 165#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 166#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; 175#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 170#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 165#L9-3 [2018-12-09 10:24:35,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:24:35,225 INFO L82 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2018-12-09 10:24:35,226 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:24:35,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:24:35,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:35,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:24:35,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:35,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:24:35,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:24:35,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:24:35,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 10:24:35,247 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 10:24:35,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:24:35,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 1 times [2018-12-09 10:24:35,248 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:24:35,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:24:35,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:35,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:24:35,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:35,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:24:35,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:24:35,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 10:24:35,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 10:24:35,287 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. cyclomatic complexity: 13 Second operand 3 states. [2018-12-09 10:24:35,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:24:35,297 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2018-12-09 10:24:35,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 10:24:35,297 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 33 transitions. [2018-12-09 10:24:35,298 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2018-12-09 10:24:35,298 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 33 transitions. [2018-12-09 10:24:35,298 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-12-09 10:24:35,299 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-12-09 10:24:35,299 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 33 transitions. [2018-12-09 10:24:35,299 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 10:24:35,299 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2018-12-09 10:24:35,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 33 transitions. [2018-12-09 10:24:35,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2018-12-09 10:24:35,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-09 10:24:35,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2018-12-09 10:24:35,300 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2018-12-09 10:24:35,300 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2018-12-09 10:24:35,300 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-09 10:24:35,301 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 32 transitions. [2018-12-09 10:24:35,301 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2018-12-09 10:24:35,301 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 10:24:35,301 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 10:24:35,301 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-12-09 10:24:35,301 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-09 10:24:35,302 INFO L794 eck$LassoCheckResult]: Stem: 238#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 237#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(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 234#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 235#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 236#L23-3 assume !(main_~i~1 < 10); 233#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; 222#L9-3 [2018-12-09 10:24:35,302 INFO L796 eck$LassoCheckResult]: Loop: 222#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 223#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; 232#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 227#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 222#L9-3 [2018-12-09 10:24:35,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:24:35,302 INFO L82 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2018-12-09 10:24:35,302 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:24:35,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:24:35,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:35,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:24:35,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:35,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:24:35,325 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:24:35,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 10:24:35,325 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_70c304d3-61b8-49bb-b266-abb530e94177/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-12-09 10:24:35,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:24:35,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:24:35,338 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:24:35,346 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:24:35,360 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 10:24:35,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-12-09 10:24:35,360 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 10:24:35,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:24:35,361 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 2 times [2018-12-09 10:24:35,361 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:24:35,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:24:35,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:35,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:24:35,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:35,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:24:35,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:24:35,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 10:24:35,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-09 10:24:35,406 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. cyclomatic complexity: 12 Second operand 5 states. [2018-12-09 10:24:35,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:24:35,418 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2018-12-09 10:24:35,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 10:24:35,418 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 35 transitions. [2018-12-09 10:24:35,419 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2018-12-09 10:24:35,419 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 35 transitions. [2018-12-09 10:24:35,419 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-12-09 10:24:35,419 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-12-09 10:24:35,420 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 35 transitions. [2018-12-09 10:24:35,420 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 10:24:35,420 INFO L705 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2018-12-09 10:24:35,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 35 transitions. [2018-12-09 10:24:35,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2018-12-09 10:24:35,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-09 10:24:35,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2018-12-09 10:24:35,421 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2018-12-09 10:24:35,421 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2018-12-09 10:24:35,421 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-09 10:24:35,421 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 34 transitions. [2018-12-09 10:24:35,422 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2018-12-09 10:24:35,422 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 10:24:35,422 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 10:24:35,422 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2018-12-09 10:24:35,422 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-09 10:24:35,422 INFO L794 eck$LassoCheckResult]: Stem: 315#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 314#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(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 310#L23-3 assume !!(main_~i~1 < 10);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; 312#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 313#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 320#L23-3 assume !(main_~i~1 < 10); 309#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; 298#L9-3 [2018-12-09 10:24:35,422 INFO L796 eck$LassoCheckResult]: Loop: 298#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 299#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; 308#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 303#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 298#L9-3 [2018-12-09 10:24:35,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:24:35,422 INFO L82 PathProgramCache]: Analyzing trace with hash 265236367, now seen corresponding path program 2 times [2018-12-09 10:24:35,423 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:24:35,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:24:35,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:35,423 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:24:35,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:35,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:24:35,438 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:24:35,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 10:24:35,439 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_70c304d3-61b8-49bb-b266-abb530e94177/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-12-09 10:24:35,444 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 10:24:35,452 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 10:24:35,453 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 10:24:35,453 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:24:35,459 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:24:35,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 10:24:35,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-12-09 10:24:35,474 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 10:24:35,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:24:35,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 3 times [2018-12-09 10:24:35,474 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:24:35,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:24:35,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:35,475 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:24:35,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:35,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:24:35,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:24:35,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 10:24:35,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-09 10:24:35,505 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. cyclomatic complexity: 12 Second operand 6 states. [2018-12-09 10:24:35,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:24:35,519 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2018-12-09 10:24:35,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 10:24:35,520 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 37 transitions. [2018-12-09 10:24:35,520 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2018-12-09 10:24:35,520 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 37 transitions. [2018-12-09 10:24:35,520 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-12-09 10:24:35,521 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-12-09 10:24:35,521 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 37 transitions. [2018-12-09 10:24:35,521 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 10:24:35,521 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 37 transitions. [2018-12-09 10:24:35,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 37 transitions. [2018-12-09 10:24:35,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-12-09 10:24:35,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-09 10:24:35,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2018-12-09 10:24:35,522 INFO L728 BuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2018-12-09 10:24:35,522 INFO L608 BuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2018-12-09 10:24:35,522 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-09 10:24:35,522 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 36 transitions. [2018-12-09 10:24:35,523 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2018-12-09 10:24:35,523 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 10:24:35,523 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 10:24:35,523 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1] [2018-12-09 10:24:35,523 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-09 10:24:35,523 INFO L794 eck$LassoCheckResult]: Stem: 403#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 401#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(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 397#L23-3 assume !!(main_~i~1 < 10);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; 399#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 400#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 402#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 409#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 408#L23-3 assume !(main_~i~1 < 10); 396#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; 385#L9-3 [2018-12-09 10:24:35,523 INFO L796 eck$LassoCheckResult]: Loop: 385#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 386#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; 395#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 390#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 385#L9-3 [2018-12-09 10:24:35,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:24:35,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1489134225, now seen corresponding path program 3 times [2018-12-09 10:24:35,524 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:24:35,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:24:35,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:35,524 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:24:35,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:35,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:24:35,550 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:24:35,550 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 10:24:35,551 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_70c304d3-61b8-49bb-b266-abb530e94177/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-12-09 10:24:35,558 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 10:24:35,568 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-09 10:24:35,568 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 10:24:35,569 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:24:35,575 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:24:35,590 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 10:24:35,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-12-09 10:24:35,591 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 10:24:35,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:24:35,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 4 times [2018-12-09 10:24:35,591 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:24:35,591 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:24:35,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:35,592 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:24:35,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:35,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:24:35,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:24:35,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 10:24:35,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-12-09 10:24:35,624 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. cyclomatic complexity: 12 Second operand 7 states. [2018-12-09 10:24:35,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:24:35,636 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2018-12-09 10:24:35,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 10:24:35,636 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 39 transitions. [2018-12-09 10:24:35,637 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2018-12-09 10:24:35,637 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 32 states and 39 transitions. [2018-12-09 10:24:35,637 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-12-09 10:24:35,637 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-12-09 10:24:35,637 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 39 transitions. [2018-12-09 10:24:35,638 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 10:24:35,638 INFO L705 BuchiCegarLoop]: Abstraction has 32 states and 39 transitions. [2018-12-09 10:24:35,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 39 transitions. [2018-12-09 10:24:35,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2018-12-09 10:24:35,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-09 10:24:35,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2018-12-09 10:24:35,639 INFO L728 BuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2018-12-09 10:24:35,639 INFO L608 BuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2018-12-09 10:24:35,639 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-09 10:24:35,639 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 38 transitions. [2018-12-09 10:24:35,640 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2018-12-09 10:24:35,640 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 10:24:35,640 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 10:24:35,640 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2018-12-09 10:24:35,640 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-09 10:24:35,640 INFO L794 eck$LassoCheckResult]: Stem: 503#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 499#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(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 495#L23-3 assume !!(main_~i~1 < 10);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; 497#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 498#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 500#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 509#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 508#L23-3 assume !!(main_~i~1 < 10);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 < 10); 494#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; 483#L9-3 [2018-12-09 10:24:35,641 INFO L796 eck$LassoCheckResult]: Loop: 483#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 484#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; 493#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 488#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 483#L9-3 [2018-12-09 10:24:35,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:24:35,641 INFO L82 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 4 times [2018-12-09 10:24:35,641 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:24:35,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:24:35,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:35,642 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:24:35,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:35,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:24:35,677 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:24:35,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 10:24:35,677 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_70c304d3-61b8-49bb-b266-abb530e94177/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-12-09 10:24:35,683 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-09 10:24:35,693 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-09 10:24:35,693 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 10:24:35,694 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:24:35,705 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:24:35,719 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 10:24:35,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-12-09 10:24:35,720 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 10:24:35,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:24:35,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 5 times [2018-12-09 10:24:35,720 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:24:35,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:24:35,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:35,721 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:24:35,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:35,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:24:35,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:24:35,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 10:24:35,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-09 10:24:35,752 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. cyclomatic complexity: 12 Second operand 8 states. [2018-12-09 10:24:35,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:24:35,769 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2018-12-09 10:24:35,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 10:24:35,770 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 41 transitions. [2018-12-09 10:24:35,770 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2018-12-09 10:24:35,771 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 41 transitions. [2018-12-09 10:24:35,771 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-12-09 10:24:35,771 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-12-09 10:24:35,771 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 41 transitions. [2018-12-09 10:24:35,771 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 10:24:35,771 INFO L705 BuchiCegarLoop]: Abstraction has 34 states and 41 transitions. [2018-12-09 10:24:35,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 41 transitions. [2018-12-09 10:24:35,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-12-09 10:24:35,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-09 10:24:35,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2018-12-09 10:24:35,773 INFO L728 BuchiCegarLoop]: Abstraction has 33 states and 40 transitions. [2018-12-09 10:24:35,773 INFO L608 BuchiCegarLoop]: Abstraction has 33 states and 40 transitions. [2018-12-09 10:24:35,773 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-09 10:24:35,773 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 40 transitions. [2018-12-09 10:24:35,774 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2018-12-09 10:24:35,774 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 10:24:35,774 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 10:24:35,774 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1] [2018-12-09 10:24:35,774 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-09 10:24:35,774 INFO L794 eck$LassoCheckResult]: Stem: 612#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 608#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(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 604#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 605#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 606#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 607#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 609#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 620#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 619#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 618#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 < 10);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 < 10); 603#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; 592#L9-3 [2018-12-09 10:24:35,774 INFO L796 eck$LassoCheckResult]: Loop: 592#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 593#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; 602#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 598#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 592#L9-3 [2018-12-09 10:24:35,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:24:35,775 INFO L82 PathProgramCache]: Analyzing trace with hash -1745699051, now seen corresponding path program 5 times [2018-12-09 10:24:35,775 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:24:35,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:24:35,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:35,776 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:24:35,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:35,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:24:35,816 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:24:35,816 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 10:24:35,816 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_70c304d3-61b8-49bb-b266-abb530e94177/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-12-09 10:24:35,822 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-12-09 10:24:35,834 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-12-09 10:24:35,834 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 10:24:35,835 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:24:35,851 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:24:35,865 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 10:24:35,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-12-09 10:24:35,865 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 10:24:35,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:24:35,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 6 times [2018-12-09 10:24:35,865 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:24:35,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:24:35,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:35,866 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:24:35,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:35,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:24:35,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:24:35,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 10:24:35,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-12-09 10:24:35,889 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. cyclomatic complexity: 12 Second operand 9 states. [2018-12-09 10:24:35,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:24:35,907 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2018-12-09 10:24:35,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 10:24:35,908 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 43 transitions. [2018-12-09 10:24:35,908 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2018-12-09 10:24:35,908 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 36 states and 43 transitions. [2018-12-09 10:24:35,908 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-12-09 10:24:35,908 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-12-09 10:24:35,909 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 43 transitions. [2018-12-09 10:24:35,909 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 10:24:35,909 INFO L705 BuchiCegarLoop]: Abstraction has 36 states and 43 transitions. [2018-12-09 10:24:35,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 43 transitions. [2018-12-09 10:24:35,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2018-12-09 10:24:35,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-09 10:24:35,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2018-12-09 10:24:35,911 INFO L728 BuchiCegarLoop]: Abstraction has 35 states and 42 transitions. [2018-12-09 10:24:35,911 INFO L608 BuchiCegarLoop]: Abstraction has 35 states and 42 transitions. [2018-12-09 10:24:35,911 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-12-09 10:24:35,911 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 42 transitions. [2018-12-09 10:24:35,911 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2018-12-09 10:24:35,911 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 10:24:35,912 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 10:24:35,912 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 1, 1, 1, 1] [2018-12-09 10:24:35,912 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-09 10:24:35,912 INFO L794 eck$LassoCheckResult]: Stem: 730#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 728#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(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 724#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 725#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 726#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 727#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 729#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 742#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 741#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 740#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 739#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 738#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 737#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 736#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 735#L23-3 assume !(main_~i~1 < 10); 723#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; 712#L9-3 [2018-12-09 10:24:35,912 INFO L796 eck$LassoCheckResult]: Loop: 712#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 713#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; 722#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 717#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 712#L9-3 [2018-12-09 10:24:35,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:24:35,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1715480727, now seen corresponding path program 6 times [2018-12-09 10:24:35,912 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:24:35,912 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:24:35,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:35,913 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:24:35,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:35,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:24:35,969 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:24:35,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 10:24:35,969 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_70c304d3-61b8-49bb-b266-abb530e94177/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-12-09 10:24:35,975 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-12-09 10:24:35,989 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-12-09 10:24:35,989 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 10:24:35,990 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:24:35,997 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:24:36,011 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 10:24:36,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-12-09 10:24:36,012 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 10:24:36,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:24:36,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 7 times [2018-12-09 10:24:36,012 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:24:36,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:24:36,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:36,012 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:24:36,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:36,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:24:36,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:24:36,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 10:24:36,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-09 10:24:36,041 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. cyclomatic complexity: 12 Second operand 10 states. [2018-12-09 10:24:36,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:24:36,058 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2018-12-09 10:24:36,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 10:24:36,058 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 45 transitions. [2018-12-09 10:24:36,058 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2018-12-09 10:24:36,059 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 38 states and 45 transitions. [2018-12-09 10:24:36,059 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-12-09 10:24:36,059 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-12-09 10:24:36,059 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 45 transitions. [2018-12-09 10:24:36,059 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 10:24:36,059 INFO L705 BuchiCegarLoop]: Abstraction has 38 states and 45 transitions. [2018-12-09 10:24:36,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 45 transitions. [2018-12-09 10:24:36,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-12-09 10:24:36,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-09 10:24:36,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2018-12-09 10:24:36,060 INFO L728 BuchiCegarLoop]: Abstraction has 37 states and 44 transitions. [2018-12-09 10:24:36,061 INFO L608 BuchiCegarLoop]: Abstraction has 37 states and 44 transitions. [2018-12-09 10:24:36,061 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-12-09 10:24:36,061 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 44 transitions. [2018-12-09 10:24:36,061 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2018-12-09 10:24:36,061 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 10:24:36,061 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 10:24:36,061 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [7, 7, 1, 1, 1, 1] [2018-12-09 10:24:36,061 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-09 10:24:36,062 INFO L794 eck$LassoCheckResult]: Stem: 861#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 859#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(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 855#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 856#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 857#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 858#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 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 875#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 874#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 873#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 872#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 871#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 870#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 869#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 868#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 867#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 < 10); 854#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; 843#L9-3 [2018-12-09 10:24:36,062 INFO L796 eck$LassoCheckResult]: Loop: 843#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 844#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; 853#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 848#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 843#L9-3 [2018-12-09 10:24:36,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:24:36,062 INFO L82 PathProgramCache]: Analyzing trace with hash -690407015, now seen corresponding path program 7 times [2018-12-09 10:24:36,062 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:24:36,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:24:36,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:36,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:24:36,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:36,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:24:36,100 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:24:36,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 10:24:36,100 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_70c304d3-61b8-49bb-b266-abb530e94177/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-12-09 10:24:36,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:24:36,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:24:36,125 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:24:36,131 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:24:36,146 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 10:24:36,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-12-09 10:24:36,146 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 10:24:36,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:24:36,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 8 times [2018-12-09 10:24:36,147 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:24:36,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:24:36,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:36,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:24:36,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:36,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:24:36,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:24:36,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 10:24:36,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-12-09 10:24:36,173 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. cyclomatic complexity: 12 Second operand 11 states. [2018-12-09 10:24:36,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:24:36,191 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2018-12-09 10:24:36,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 10:24:36,192 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 47 transitions. [2018-12-09 10:24:36,192 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2018-12-09 10:24:36,193 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 40 states and 47 transitions. [2018-12-09 10:24:36,193 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-12-09 10:24:36,193 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-12-09 10:24:36,193 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 47 transitions. [2018-12-09 10:24:36,193 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 10:24:36,193 INFO L705 BuchiCegarLoop]: Abstraction has 40 states and 47 transitions. [2018-12-09 10:24:36,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 47 transitions. [2018-12-09 10:24:36,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2018-12-09 10:24:36,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-09 10:24:36,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2018-12-09 10:24:36,195 INFO L728 BuchiCegarLoop]: Abstraction has 39 states and 46 transitions. [2018-12-09 10:24:36,195 INFO L608 BuchiCegarLoop]: Abstraction has 39 states and 46 transitions. [2018-12-09 10:24:36,195 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-12-09 10:24:36,196 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 46 transitions. [2018-12-09 10:24:36,196 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2018-12-09 10:24:36,196 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 10:24:36,196 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 10:24:36,196 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1, 1] [2018-12-09 10:24:36,196 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-09 10:24:36,196 INFO L794 eck$LassoCheckResult]: Stem: 1005#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1001#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(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 997#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 998#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 999#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1000#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1002#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1019#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1018#L23-3 assume !!(main_~i~1 < 10);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; 1016#L23-3 assume !!(main_~i~1 < 10);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; 1014#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1013#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1012#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1011#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1010#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1009#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1008#L23-3 assume !(main_~i~1 < 10); 996#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; 985#L9-3 [2018-12-09 10:24:36,197 INFO L796 eck$LassoCheckResult]: Loop: 985#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 986#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; 995#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 990#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 985#L9-3 [2018-12-09 10:24:36,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:24:36,197 INFO L82 PathProgramCache]: Analyzing trace with hash -2056121829, now seen corresponding path program 8 times [2018-12-09 10:24:36,197 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:24:36,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:24:36,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:36,198 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:24:36,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:36,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:24:36,256 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:24:36,256 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 10:24:36,257 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_70c304d3-61b8-49bb-b266-abb530e94177/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-12-09 10:24:36,264 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 10:24:36,275 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 10:24:36,275 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 10:24:36,276 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:24:36,288 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:24:36,308 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 10:24:36,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-12-09 10:24:36,309 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 10:24:36,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:24:36,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 9 times [2018-12-09 10:24:36,309 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:24:36,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:24:36,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:36,309 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:24:36,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:36,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:24:36,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:24:36,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 10:24:36,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-09 10:24:36,335 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. cyclomatic complexity: 12 Second operand 12 states. [2018-12-09 10:24:36,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:24:36,353 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2018-12-09 10:24:36,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 10:24:36,353 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 49 transitions. [2018-12-09 10:24:36,354 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2018-12-09 10:24:36,354 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 42 states and 49 transitions. [2018-12-09 10:24:36,354 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-12-09 10:24:36,354 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-12-09 10:24:36,354 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 49 transitions. [2018-12-09 10:24:36,355 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 10:24:36,355 INFO L705 BuchiCegarLoop]: Abstraction has 42 states and 49 transitions. [2018-12-09 10:24:36,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 49 transitions. [2018-12-09 10:24:36,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2018-12-09 10:24:36,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-09 10:24:36,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2018-12-09 10:24:36,357 INFO L728 BuchiCegarLoop]: Abstraction has 41 states and 48 transitions. [2018-12-09 10:24:36,357 INFO L608 BuchiCegarLoop]: Abstraction has 41 states and 48 transitions. [2018-12-09 10:24:36,357 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-12-09 10:24:36,357 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 48 transitions. [2018-12-09 10:24:36,357 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2018-12-09 10:24:36,357 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 10:24:36,357 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 10:24:36,358 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [9, 9, 1, 1, 1, 1] [2018-12-09 10:24:36,358 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-09 10:24:36,358 INFO L794 eck$LassoCheckResult]: Stem: 1156#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1154#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(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1150#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1151#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1152#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1153#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1155#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1174#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1173#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1172#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1171#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1170#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1169#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1168#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1167#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1166#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1165#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1164#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1163#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1162#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1161#L23-3 assume !(main_~i~1 < 10); 1149#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; 1138#L9-3 [2018-12-09 10:24:36,358 INFO L796 eck$LassoCheckResult]: Loop: 1138#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1139#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; 1148#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1143#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1138#L9-3 [2018-12-09 10:24:36,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:24:36,358 INFO L82 PathProgramCache]: Analyzing trace with hash -248065507, now seen corresponding path program 9 times [2018-12-09 10:24:36,358 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:24:36,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:24:36,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:36,359 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:24:36,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:36,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:24:36,442 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:24:36,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 10:24:36,442 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_70c304d3-61b8-49bb-b266-abb530e94177/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 10:24:36,448 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 10:24:36,481 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-12-09 10:24:36,481 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 10:24:36,483 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:24:36,489 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:24:36,504 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 10:24:36,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-12-09 10:24:36,504 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 10:24:36,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:24:36,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 10 times [2018-12-09 10:24:36,504 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:24:36,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:24:36,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:36,505 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:24:36,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:36,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:24:36,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:24:36,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-09 10:24:36,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-12-09 10:24:36,530 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. cyclomatic complexity: 12 Second operand 13 states. [2018-12-09 10:24:36,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:24:36,549 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2018-12-09 10:24:36,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 10:24:36,550 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 50 transitions. [2018-12-09 10:24:36,550 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2018-12-09 10:24:36,550 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 43 states and 50 transitions. [2018-12-09 10:24:36,550 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-12-09 10:24:36,551 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-12-09 10:24:36,551 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 50 transitions. [2018-12-09 10:24:36,551 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 10:24:36,551 INFO L705 BuchiCegarLoop]: Abstraction has 43 states and 50 transitions. [2018-12-09 10:24:36,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 50 transitions. [2018-12-09 10:24:36,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-09 10:24:36,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-09 10:24:36,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2018-12-09 10:24:36,553 INFO L728 BuchiCegarLoop]: Abstraction has 43 states and 50 transitions. [2018-12-09 10:24:36,553 INFO L608 BuchiCegarLoop]: Abstraction has 43 states and 50 transitions. [2018-12-09 10:24:36,553 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-12-09 10:24:36,553 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 50 transitions. [2018-12-09 10:24:36,553 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2018-12-09 10:24:36,554 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 10:24:36,554 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 10:24:36,554 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1] [2018-12-09 10:24:36,554 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-09 10:24:36,554 INFO L794 eck$LassoCheckResult]: Stem: 1321#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1317#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(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1313#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1314#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1315#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1316#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1318#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1339#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1338#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1337#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1336#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1335#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1334#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1333#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1332#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1331#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1330#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1329#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1328#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1327#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1326#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1325#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1324#L23-3 assume !(main_~i~1 < 10); 1312#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; 1301#L9-3 [2018-12-09 10:24:36,554 INFO L796 eck$LassoCheckResult]: Loop: 1301#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1302#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; 1311#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1306#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1301#L9-3 [2018-12-09 10:24:36,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:24:36,555 INFO L82 PathProgramCache]: Analyzing trace with hash 2127272351, now seen corresponding path program 10 times [2018-12-09 10:24:36,555 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:24:36,555 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:24:36,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:36,555 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:24:36,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:36,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:24:36,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:24:36,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:24:36,572 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 11 times [2018-12-09 10:24:36,572 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:24:36,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:24:36,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:36,573 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:24:36,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:36,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:24:36,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:24:36,577 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:24:36,577 INFO L82 PathProgramCache]: Analyzing trace with hash -1776090044, now seen corresponding path program 1 times [2018-12-09 10:24:36,577 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:24:36,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:24:36,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:36,578 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:24:36,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:36,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:24:36,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:24:38,956 WARN L180 SmtUtils]: Spent 2.33 s on a formula simplification. DAG size of input: 198 DAG size of output: 154 [2018-12-09 10:24:39,018 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 10:24:39,018 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 10:24:39,018 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 10:24:39,018 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 10:24:39,018 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 10:24:39,018 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 10:24:39,018 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 10:24:39,018 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 10:24:39,018 INFO L131 ssoRankerPreferences]: Filename of dumped script: max10_true-unreach-call_true-termination.i_Iteration12_Lasso [2018-12-09 10:24:39,018 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 10:24:39,018 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 10:24:39,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:24:39,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:24:39,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:24:39,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:24:39,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:24:39,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:24:39,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:24:39,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:24:39,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:24:39,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:24:39,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:24:39,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:24:39,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:24:39,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:24:39,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:24:39,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:24:39,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:24:39,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:24:39,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:24:39,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:24:39,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:24:39,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:24:39,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:24:39,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:24:39,209 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 10:24:39,209 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 10:24:39,209 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-12-09 10:24:39,209 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:24:39,210 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:24:39,210 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:24:39,210 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:24:39,210 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:24:39,210 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:24:39,210 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:24:39,210 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:24:39,211 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-12-09 10:24:39,211 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:24:39,211 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:24:39,211 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:24:39,211 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:24:39,211 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:24:39,211 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:24:39,211 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:24:39,211 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:24:39,212 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-12-09 10:24:39,212 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:24:39,212 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:24:39,212 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:24:39,212 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:24:39,212 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:24:39,212 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:24:39,212 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:24:39,213 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:24:39,213 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-12-09 10:24:39,213 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:24:39,213 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:24:39,213 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:24:39,213 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:24:39,213 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:24:39,213 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:24:39,213 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:24:39,214 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:24:39,214 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-12-09 10:24:39,214 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:24:39,214 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:24:39,214 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:24:39,214 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:24:39,215 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:24:39,215 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:24:39,215 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:24:39,215 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:24:39,216 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-12-09 10:24:39,216 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:24:39,216 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:24:39,216 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:24:39,216 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:24:39,217 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:24:39,217 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:24:39,218 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:24:39,218 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-12-09 10:24:39,219 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:24:39,219 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:24:39,219 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:24:39,219 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:24:39,219 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:24:39,219 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:24:39,220 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:24:39,220 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:24:39,220 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-12-09 10:24:39,220 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:24:39,220 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:24:39,221 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:24:39,221 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:24:39,221 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:24:39,221 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:24:39,221 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:24:39,221 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:24:39,222 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-12-09 10:24:39,222 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:24:39,222 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:24:39,222 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:24:39,222 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:24:39,222 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:24:39,222 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:24:39,223 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:24:39,223 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:24:39,223 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-12-09 10:24:39,223 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:24:39,224 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:24:39,224 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:24:39,224 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:24:39,225 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:24:39,225 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:24:39,226 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:24:39,226 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-12-09 10:24:39,227 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:24:39,227 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:24:39,227 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:24:39,227 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:24:39,227 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:24:39,227 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:24:39,227 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:24:39,228 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:24:39,228 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-12-09 10:24:39,229 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:24:39,229 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:24:39,229 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:24:39,229 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:24:39,229 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:24:39,229 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:24:39,229 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:24:39,230 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:24:39,230 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-12-09 10:24:39,231 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:24:39,231 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:24:39,231 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:24:39,231 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:24:39,231 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:24:39,232 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:24:39,232 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:24:39,232 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:24:39,233 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-12-09 10:24:39,233 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:24:39,233 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:24:39,233 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:24:39,233 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:24:39,233 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:24:39,234 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:24:39,234 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:24:39,234 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:24:39,235 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-12-09 10:24:39,235 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:24:39,235 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 10:24:39,235 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:24:39,235 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:24:39,236 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 10:24:39,237 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:24:39,240 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:24:39,240 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-12-09 10:24:39,241 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:24:39,241 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:24:39,241 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:24:39,241 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:24:39,242 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:24:39,242 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:24:39,246 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:24:39,247 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-12-09 10:24:39,247 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:24:39,247 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:24:39,247 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:24:39,247 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:24:39,249 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:24:39,249 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:24:39,257 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 10:24:39,265 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-09 10:24:39,265 INFO L444 ModelExtractionUtils]: 14 out of 22 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-12-09 10:24:39,265 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 10:24:39,266 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 10:24:39,266 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 10:24:39,266 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_max_~i~0) = -2*ULTIMATE.start_max_~i~0 + 19 Supporting invariants [] [2018-12-09 10:24:39,275 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-12-09 10:24:39,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:24:39,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:24:39,314 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:24:39,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:24:39,319 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:24:39,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:24:39,329 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-12-09 10:24:39,329 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 43 states and 50 transitions. cyclomatic complexity: 12 Second operand 3 states. [2018-12-09 10:24:39,341 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 43 states and 50 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 49 states and 60 transitions. Complement of second has 7 states. [2018-12-09 10:24:39,341 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-12-09 10:24:39,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-09 10:24:39,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2018-12-09 10:24:39,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 24 letters. Loop has 4 letters. [2018-12-09 10:24:39,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:24:39,343 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 28 letters. Loop has 4 letters. [2018-12-09 10:24:39,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:24:39,343 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 24 letters. Loop has 8 letters. [2018-12-09 10:24:39,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:24:39,343 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 60 transitions. [2018-12-09 10:24:39,344 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2018-12-09 10:24:39,344 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 44 states and 52 transitions. [2018-12-09 10:24:39,345 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-12-09 10:24:39,345 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-12-09 10:24:39,345 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 52 transitions. [2018-12-09 10:24:39,345 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 10:24:39,345 INFO L705 BuchiCegarLoop]: Abstraction has 44 states and 52 transitions. [2018-12-09 10:24:39,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 52 transitions. [2018-12-09 10:24:39,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-09 10:24:39,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-09 10:24:39,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2018-12-09 10:24:39,347 INFO L728 BuchiCegarLoop]: Abstraction has 44 states and 52 transitions. [2018-12-09 10:24:39,347 INFO L608 BuchiCegarLoop]: Abstraction has 44 states and 52 transitions. [2018-12-09 10:24:39,347 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-12-09 10:24:39,347 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 52 transitions. [2018-12-09 10:24:39,347 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2018-12-09 10:24:39,347 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 10:24:39,347 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 10:24:39,348 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:24:39,348 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-09 10:24:39,348 INFO L794 eck$LassoCheckResult]: Stem: 1534#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1530#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(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1526#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1527#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1528#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1529#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1531#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1552#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1551#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1550#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1549#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1548#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1547#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1546#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1545#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1544#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1543#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1542#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1541#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1540#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1539#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1538#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1537#L23-3 assume !(main_~i~1 < 10); 1525#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; 1513#L9-3 assume !(max_~i~0 < 10); 1509#L9-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1510#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; 1535#L9-8 [2018-12-09 10:24:39,348 INFO L796 eck$LassoCheckResult]: Loop: 1535#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1520#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; 1511#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1512#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1535#L9-8 [2018-12-09 10:24:39,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:24:39,349 INFO L82 PathProgramCache]: Analyzing trace with hash 1328178489, now seen corresponding path program 1 times [2018-12-09 10:24:39,349 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:24:39,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:24:39,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:39,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:24:39,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:39,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:24:39,373 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-09 10:24:39,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:24:39,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 10:24:39,373 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 10:24:39,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:24:39,374 INFO L82 PathProgramCache]: Analyzing trace with hash 2373478, now seen corresponding path program 1 times [2018-12-09 10:24:39,374 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:24:39,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:24:39,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:39,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:24:39,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:39,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:24:39,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:24:39,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 10:24:39,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 10:24:39,404 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. cyclomatic complexity: 13 Second operand 3 states. [2018-12-09 10:24:39,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:24:39,426 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2018-12-09 10:24:39,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 10:24:39,427 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 65 transitions. [2018-12-09 10:24:39,427 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2018-12-09 10:24:39,427 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 55 states and 65 transitions. [2018-12-09 10:24:39,427 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2018-12-09 10:24:39,428 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-12-09 10:24:39,428 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 65 transitions. [2018-12-09 10:24:39,428 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 10:24:39,428 INFO L705 BuchiCegarLoop]: Abstraction has 55 states and 65 transitions. [2018-12-09 10:24:39,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 65 transitions. [2018-12-09 10:24:39,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 45. [2018-12-09 10:24:39,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-09 10:24:39,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2018-12-09 10:24:39,430 INFO L728 BuchiCegarLoop]: Abstraction has 45 states and 52 transitions. [2018-12-09 10:24:39,430 INFO L608 BuchiCegarLoop]: Abstraction has 45 states and 52 transitions. [2018-12-09 10:24:39,430 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-12-09 10:24:39,430 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 52 transitions. [2018-12-09 10:24:39,430 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2018-12-09 10:24:39,430 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 10:24:39,430 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 10:24:39,431 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:24:39,431 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-09 10:24:39,431 INFO L794 eck$LassoCheckResult]: Stem: 1636#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1635#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(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1631#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1632#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1633#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1634#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1658#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1657#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1656#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1655#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1654#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1653#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1652#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1651#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1650#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1649#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1648#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1647#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1646#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1645#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1644#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1643#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1642#L23-3 assume !(main_~i~1 < 10); 1630#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; 1618#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1619#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1629#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1624#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1620#L9-3 assume !(max_~i~0 < 10); 1614#L9-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1615#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; 1639#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1625#L10-3 [2018-12-09 10:24:39,431 INFO L796 eck$LassoCheckResult]: Loop: 1625#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; 1616#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1617#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1640#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1625#L10-3 [2018-12-09 10:24:39,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:24:39,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1922451645, now seen corresponding path program 1 times [2018-12-09 10:24:39,432 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:24:39,432 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:24:39,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:39,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:24:39,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:39,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:24:39,457 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-09 10:24:39,457 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 10:24:39,457 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_70c304d3-61b8-49bb-b266-abb530e94177/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 10:24:39,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:24:39,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:24:39,487 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:24:39,495 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-09 10:24:39,520 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 10:24:39,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-12-09 10:24:39,521 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 10:24:39,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:24:39,521 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 2 times [2018-12-09 10:24:39,521 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:24:39,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:24:39,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:39,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:24:39,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:39,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:24:39,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:24:39,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 10:24:39,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-09 10:24:39,591 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. cyclomatic complexity: 12 Second operand 5 states. [2018-12-09 10:24:39,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:24:39,617 INFO L93 Difference]: Finished difference Result 67 states and 80 transitions. [2018-12-09 10:24:39,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 10:24:39,617 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 80 transitions. [2018-12-09 10:24:39,618 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2018-12-09 10:24:39,618 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 67 states and 80 transitions. [2018-12-09 10:24:39,618 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2018-12-09 10:24:39,619 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2018-12-09 10:24:39,619 INFO L73 IsDeterministic]: Start isDeterministic. Operand 67 states and 80 transitions. [2018-12-09 10:24:39,619 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 10:24:39,619 INFO L705 BuchiCegarLoop]: Abstraction has 67 states and 80 transitions. [2018-12-09 10:24:39,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states and 80 transitions. [2018-12-09 10:24:39,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 53. [2018-12-09 10:24:39,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-09 10:24:39,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 62 transitions. [2018-12-09 10:24:39,621 INFO L728 BuchiCegarLoop]: Abstraction has 53 states and 62 transitions. [2018-12-09 10:24:39,621 INFO L608 BuchiCegarLoop]: Abstraction has 53 states and 62 transitions. [2018-12-09 10:24:39,621 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-12-09 10:24:39,621 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 62 transitions. [2018-12-09 10:24:39,621 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2018-12-09 10:24:39,621 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 10:24:39,621 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 10:24:39,622 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:24:39,622 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-09 10:24:39,622 INFO L794 eck$LassoCheckResult]: Stem: 1853#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1850#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(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1846#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1847#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1848#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1849#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1879#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1878#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1877#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1876#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1875#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1874#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1873#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1872#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1871#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1870#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1869#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1868#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1867#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1866#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1864#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1863#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1862#L23-3 assume !(main_~i~1 < 10); 1845#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; 1831#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1832#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1865#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1838#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1833#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1834#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1843#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1844#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1858#L9-3 assume !(max_~i~0 < 10); 1827#L9-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1828#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; 1855#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1861#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1860#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1856#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1854#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1839#L10-3 [2018-12-09 10:24:39,622 INFO L796 eck$LassoCheckResult]: Loop: 1839#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; 1829#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1830#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1859#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1839#L10-3 [2018-12-09 10:24:39,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:24:39,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1268480291, now seen corresponding path program 1 times [2018-12-09 10:24:39,623 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:24:39,623 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:24:39,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:39,623 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:24:39,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:39,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:24:39,654 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2018-12-09 10:24:39,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 10:24:39,654 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_70c304d3-61b8-49bb-b266-abb530e94177/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 10:24:39,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:24:39,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:24:39,685 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:24:39,690 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2018-12-09 10:24:39,715 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 10:24:39,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-12-09 10:24:39,715 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 10:24:39,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:24:39,715 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 3 times [2018-12-09 10:24:39,715 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:24:39,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:24:39,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:39,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:24:39,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:39,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:24:39,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:24:39,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 10:24:39,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-09 10:24:39,763 INFO L87 Difference]: Start difference. First operand 53 states and 62 transitions. cyclomatic complexity: 14 Second operand 6 states. [2018-12-09 10:24:39,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:24:39,806 INFO L93 Difference]: Finished difference Result 79 states and 95 transitions. [2018-12-09 10:24:39,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 10:24:39,806 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 79 states and 95 transitions. [2018-12-09 10:24:39,807 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2018-12-09 10:24:39,807 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 79 states to 79 states and 95 transitions. [2018-12-09 10:24:39,807 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2018-12-09 10:24:39,807 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2018-12-09 10:24:39,807 INFO L73 IsDeterministic]: Start isDeterministic. Operand 79 states and 95 transitions. [2018-12-09 10:24:39,807 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 10:24:39,808 INFO L705 BuchiCegarLoop]: Abstraction has 79 states and 95 transitions. [2018-12-09 10:24:39,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states and 95 transitions. [2018-12-09 10:24:39,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 61. [2018-12-09 10:24:39,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-09 10:24:39,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 72 transitions. [2018-12-09 10:24:39,809 INFO L728 BuchiCegarLoop]: Abstraction has 61 states and 72 transitions. [2018-12-09 10:24:39,809 INFO L608 BuchiCegarLoop]: Abstraction has 61 states and 72 transitions. [2018-12-09 10:24:39,809 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2018-12-09 10:24:39,809 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 61 states and 72 transitions. [2018-12-09 10:24:39,810 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2018-12-09 10:24:39,810 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 10:24:39,810 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 10:24:39,810 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:24:39,810 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-09 10:24:39,810 INFO L794 eck$LassoCheckResult]: Stem: 2112#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2109#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(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 2105#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 2106#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 2107#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 2108#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 2140#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 2139#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 2138#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 2137#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 2136#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 2135#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 2134#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 2133#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 2132#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 2131#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 2130#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 2129#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 2128#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 2127#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 2126#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 2125#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 2124#L23-3 assume !(main_~i~1 < 10); 2104#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; 2089#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2090#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 2102#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 2103#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2091#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2092#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 2145#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 2096#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2097#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2119#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 2144#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 2120#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2118#L9-3 assume !(max_~i~0 < 10); 2087#L9-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 2088#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; 2113#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2114#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 2143#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 2115#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2116#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2098#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 2085#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 2086#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2142#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2122#L10-3 [2018-12-09 10:24:39,810 INFO L796 eck$LassoCheckResult]: Loop: 2122#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; 2141#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 2123#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2121#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2122#L10-3 [2018-12-09 10:24:39,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:24:39,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1567366653, now seen corresponding path program 2 times [2018-12-09 10:24:39,811 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:24:39,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:24:39,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:39,811 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:24:39,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:39,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:24:39,834 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2018-12-09 10:24:39,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 10:24:39,834 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_70c304d3-61b8-49bb-b266-abb530e94177/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 10:24:39,840 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 10:24:39,859 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 10:24:39,859 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 10:24:39,861 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:24:39,875 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2018-12-09 10:24:39,890 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 10:24:39,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-12-09 10:24:39,891 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 10:24:39,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:24:39,891 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 4 times [2018-12-09 10:24:39,891 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:24:39,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:24:39,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:39,891 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:24:39,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:39,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:24:39,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:24:39,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 10:24:39,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-12-09 10:24:39,930 INFO L87 Difference]: Start difference. First operand 61 states and 72 transitions. cyclomatic complexity: 16 Second operand 7 states. [2018-12-09 10:24:39,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:24:39,969 INFO L93 Difference]: Finished difference Result 91 states and 110 transitions. [2018-12-09 10:24:39,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 10:24:39,970 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 110 transitions. [2018-12-09 10:24:39,970 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2018-12-09 10:24:39,971 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 91 states and 110 transitions. [2018-12-09 10:24:39,971 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2018-12-09 10:24:39,971 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2018-12-09 10:24:39,971 INFO L73 IsDeterministic]: Start isDeterministic. Operand 91 states and 110 transitions. [2018-12-09 10:24:39,971 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 10:24:39,971 INFO L705 BuchiCegarLoop]: Abstraction has 91 states and 110 transitions. [2018-12-09 10:24:39,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states and 110 transitions. [2018-12-09 10:24:39,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 69. [2018-12-09 10:24:39,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-12-09 10:24:39,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 82 transitions. [2018-12-09 10:24:39,973 INFO L728 BuchiCegarLoop]: Abstraction has 69 states and 82 transitions. [2018-12-09 10:24:39,974 INFO L608 BuchiCegarLoop]: Abstraction has 69 states and 82 transitions. [2018-12-09 10:24:39,974 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ [2018-12-09 10:24:39,974 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states and 82 transitions. [2018-12-09 10:24:39,974 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2018-12-09 10:24:39,974 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 10:24:39,974 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 10:24:39,975 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:24:39,975 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-09 10:24:39,975 INFO L794 eck$LassoCheckResult]: Stem: 2414#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2411#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(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 2407#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 2408#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 2409#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 2410#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 2441#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 2440#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 2439#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 2438#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 2437#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 2436#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 2435#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 2434#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 2433#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 2432#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 2431#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 2430#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 2429#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 2428#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 2427#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 2426#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 2425#L23-3 assume !(main_~i~1 < 10); 2406#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; 2392#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2393#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 2456#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 2399#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2394#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2395#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 2404#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 2405#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2455#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2454#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 2453#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 2451#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2449#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2420#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 2443#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 2421#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2419#L9-3 assume !(max_~i~0 < 10); 2388#L9-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 2389#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; 2416#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2452#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 2450#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 2417#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2415#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2400#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 2390#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 2391#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2448#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2447#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 2446#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 2445#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2444#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2423#L10-3 [2018-12-09 10:24:39,975 INFO L796 eck$LassoCheckResult]: Loop: 2423#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; 2442#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 2424#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2422#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2423#L10-3 [2018-12-09 10:24:39,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:24:39,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1948283363, now seen corresponding path program 3 times [2018-12-09 10:24:39,976 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:24:39,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:24:39,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:39,976 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:24:39,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:39,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:24:40,008 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2018-12-09 10:24:40,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 10:24:40,009 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_70c304d3-61b8-49bb-b266-abb530e94177/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 10:24:40,019 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 10:24:40,050 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-09 10:24:40,050 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 10:24:40,052 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:24:40,060 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2018-12-09 10:24:40,085 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 10:24:40,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-12-09 10:24:40,085 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 10:24:40,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:24:40,086 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 5 times [2018-12-09 10:24:40,086 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:24:40,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:24:40,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:40,086 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:24:40,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:40,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:24:40,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:24:40,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 10:24:40,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-09 10:24:40,123 INFO L87 Difference]: Start difference. First operand 69 states and 82 transitions. cyclomatic complexity: 18 Second operand 8 states. [2018-12-09 10:24:40,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:24:40,167 INFO L93 Difference]: Finished difference Result 103 states and 125 transitions. [2018-12-09 10:24:40,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 10:24:40,168 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 103 states and 125 transitions. [2018-12-09 10:24:40,168 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2018-12-09 10:24:40,169 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 103 states to 103 states and 125 transitions. [2018-12-09 10:24:40,169 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 60 [2018-12-09 10:24:40,169 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 60 [2018-12-09 10:24:40,169 INFO L73 IsDeterministic]: Start isDeterministic. Operand 103 states and 125 transitions. [2018-12-09 10:24:40,169 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 10:24:40,169 INFO L705 BuchiCegarLoop]: Abstraction has 103 states and 125 transitions. [2018-12-09 10:24:40,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states and 125 transitions. [2018-12-09 10:24:40,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 77. [2018-12-09 10:24:40,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-09 10:24:40,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 92 transitions. [2018-12-09 10:24:40,171 INFO L728 BuchiCegarLoop]: Abstraction has 77 states and 92 transitions. [2018-12-09 10:24:40,171 INFO L608 BuchiCegarLoop]: Abstraction has 77 states and 92 transitions. [2018-12-09 10:24:40,171 INFO L442 BuchiCegarLoop]: ======== Iteration 18============ [2018-12-09 10:24:40,171 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 77 states and 92 transitions. [2018-12-09 10:24:40,172 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2018-12-09 10:24:40,172 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 10:24:40,172 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 10:24:40,172 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:24:40,172 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-09 10:24:40,173 INFO L794 eck$LassoCheckResult]: Stem: 2761#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2759#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(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 2755#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 2756#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 2757#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 2758#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 2790#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 2789#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 2788#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 2787#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 2786#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 2785#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 2784#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 2783#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 2782#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 2781#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 2780#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 2779#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 2778#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 2777#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 2776#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 2775#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 2774#L23-3 assume !(main_~i~1 < 10); 2754#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; 2740#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2741#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 2760#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 2812#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2742#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2743#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 2753#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 2747#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2748#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2811#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 2810#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 2809#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2808#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2807#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 2806#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 2805#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2804#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2769#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 2792#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 2770#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2768#L9-3 assume !(max_~i~0 < 10); 2736#L9-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 2737#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; 2766#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2749#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 2738#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 2739#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2764#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2765#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 2803#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 2802#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2801#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2800#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 2799#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 2798#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2797#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2796#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 2795#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 2794#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2793#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2772#L10-3 [2018-12-09 10:24:40,173 INFO L796 eck$LassoCheckResult]: Loop: 2772#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; 2791#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 2773#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2771#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2772#L10-3 [2018-12-09 10:24:40,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:24:40,173 INFO L82 PathProgramCache]: Analyzing trace with hash -1984866499, now seen corresponding path program 4 times [2018-12-09 10:24:40,173 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:24:40,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:24:40,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:40,173 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:24:40,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:40,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:24:40,228 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2018-12-09 10:24:40,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 10:24:40,228 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_70c304d3-61b8-49bb-b266-abb530e94177/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 10:24:40,235 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-09 10:24:40,255 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-09 10:24:40,255 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 10:24:40,257 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:24:40,263 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2018-12-09 10:24:40,288 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 10:24:40,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-12-09 10:24:40,288 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 10:24:40,288 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:24:40,288 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 6 times [2018-12-09 10:24:40,288 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:24:40,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:24:40,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:40,289 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:24:40,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:40,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:24:40,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:24:40,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 10:24:40,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-12-09 10:24:40,339 INFO L87 Difference]: Start difference. First operand 77 states and 92 transitions. cyclomatic complexity: 20 Second operand 9 states. [2018-12-09 10:24:40,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:24:40,405 INFO L93 Difference]: Finished difference Result 115 states and 140 transitions. [2018-12-09 10:24:40,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 10:24:40,406 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 115 states and 140 transitions. [2018-12-09 10:24:40,406 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2018-12-09 10:24:40,407 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 115 states to 115 states and 140 transitions. [2018-12-09 10:24:40,407 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2018-12-09 10:24:40,407 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2018-12-09 10:24:40,407 INFO L73 IsDeterministic]: Start isDeterministic. Operand 115 states and 140 transitions. [2018-12-09 10:24:40,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 10:24:40,408 INFO L705 BuchiCegarLoop]: Abstraction has 115 states and 140 transitions. [2018-12-09 10:24:40,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states and 140 transitions. [2018-12-09 10:24:40,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 85. [2018-12-09 10:24:40,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-12-09 10:24:40,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 102 transitions. [2018-12-09 10:24:40,410 INFO L728 BuchiCegarLoop]: Abstraction has 85 states and 102 transitions. [2018-12-09 10:24:40,410 INFO L608 BuchiCegarLoop]: Abstraction has 85 states and 102 transitions. [2018-12-09 10:24:40,410 INFO L442 BuchiCegarLoop]: ======== Iteration 19============ [2018-12-09 10:24:40,410 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 85 states and 102 transitions. [2018-12-09 10:24:40,410 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2018-12-09 10:24:40,410 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 10:24:40,411 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 10:24:40,411 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 6, 6, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:24:40,411 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-09 10:24:40,412 INFO L794 eck$LassoCheckResult]: Stem: 3156#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3152#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(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 3148#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 3149#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 3150#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 3151#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 3183#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 3182#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 3181#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 3180#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 3179#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 3178#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 3177#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 3176#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 3175#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 3174#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 3173#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 3172#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 3171#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 3170#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 3169#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 3168#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 3167#L23-3 assume !(main_~i~1 < 10); 3147#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; 3133#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3134#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 3153#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 3213#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 3135#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3136#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 3146#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 3141#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 3142#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3212#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 3211#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 3210#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 3209#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3208#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 3207#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 3206#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 3205#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3204#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 3202#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 3201#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 3199#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3162#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 3185#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 3163#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 3161#L9-3 assume !(max_~i~0 < 10); 3131#L9-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 3132#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; 3158#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3203#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 3200#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 3159#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 3157#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3140#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 3129#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 3130#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 3198#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3197#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 3196#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 3195#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 3194#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3193#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 3192#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 3191#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 3190#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3189#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 3188#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 3187#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 3186#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3165#L10-3 [2018-12-09 10:24:40,412 INFO L796 eck$LassoCheckResult]: Loop: 3165#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; 3184#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 3166#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 3164#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3165#L10-3 [2018-12-09 10:24:40,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:24:40,412 INFO L82 PathProgramCache]: Analyzing trace with hash -325846691, now seen corresponding path program 5 times [2018-12-09 10:24:40,412 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:24:40,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:24:40,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:40,413 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:24:40,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:40,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:24:40,455 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-12-09 10:24:40,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 10:24:40,455 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_70c304d3-61b8-49bb-b266-abb530e94177/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 10:24:40,464 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-12-09 10:24:40,511 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2018-12-09 10:24:40,511 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 10:24:40,513 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:24:40,523 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-12-09 10:24:40,538 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 10:24:40,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-12-09 10:24:40,538 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 10:24:40,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:24:40,538 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 7 times [2018-12-09 10:24:40,538 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:24:40,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:24:40,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:40,539 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:24:40,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:40,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:24:40,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:24:40,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 10:24:40,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-09 10:24:40,574 INFO L87 Difference]: Start difference. First operand 85 states and 102 transitions. cyclomatic complexity: 22 Second operand 10 states. [2018-12-09 10:24:40,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:24:40,635 INFO L93 Difference]: Finished difference Result 127 states and 155 transitions. [2018-12-09 10:24:40,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 10:24:40,635 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 127 states and 155 transitions. [2018-12-09 10:24:40,635 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2018-12-09 10:24:40,636 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 127 states to 127 states and 155 transitions. [2018-12-09 10:24:40,636 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 76 [2018-12-09 10:24:40,636 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 76 [2018-12-09 10:24:40,636 INFO L73 IsDeterministic]: Start isDeterministic. Operand 127 states and 155 transitions. [2018-12-09 10:24:40,636 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 10:24:40,636 INFO L705 BuchiCegarLoop]: Abstraction has 127 states and 155 transitions. [2018-12-09 10:24:40,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states and 155 transitions. [2018-12-09 10:24:40,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 93. [2018-12-09 10:24:40,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-12-09 10:24:40,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 112 transitions. [2018-12-09 10:24:40,638 INFO L728 BuchiCegarLoop]: Abstraction has 93 states and 112 transitions. [2018-12-09 10:24:40,638 INFO L608 BuchiCegarLoop]: Abstraction has 93 states and 112 transitions. [2018-12-09 10:24:40,638 INFO L442 BuchiCegarLoop]: ======== Iteration 20============ [2018-12-09 10:24:40,638 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 93 states and 112 transitions. [2018-12-09 10:24:40,638 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2018-12-09 10:24:40,638 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 10:24:40,638 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 10:24:40,639 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 7, 7, 7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:24:40,639 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-09 10:24:40,639 INFO L794 eck$LassoCheckResult]: Stem: 3592#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3590#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(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 3586#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 3587#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 3588#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 3589#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 3621#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 3620#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 3619#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 3618#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 3617#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 3616#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 3615#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 3614#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 3613#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 3612#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 3611#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 3610#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 3609#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 3608#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 3607#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 3606#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 3605#L23-3 assume !(main_~i~1 < 10); 3585#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; 3571#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3572#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 3591#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 3659#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 3573#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3574#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 3584#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 3578#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 3579#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3658#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 3657#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 3656#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 3655#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3654#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 3653#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 3652#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 3651#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3650#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 3649#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 3648#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 3647#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3646#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 3645#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 3644#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 3643#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3600#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 3623#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 3601#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 3599#L9-3 assume !(max_~i~0 < 10); 3567#L9-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 3568#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; 3597#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3580#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 3569#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 3570#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 3595#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3596#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 3642#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 3641#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 3640#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3639#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 3638#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 3637#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 3636#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3635#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 3634#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 3633#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 3632#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3631#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 3630#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 3629#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 3628#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3627#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 3626#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 3625#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 3624#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3603#L10-3 [2018-12-09 10:24:40,639 INFO L796 eck$LassoCheckResult]: Loop: 3603#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; 3622#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 3604#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 3602#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3603#L10-3 [2018-12-09 10:24:40,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:24:40,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1241910147, now seen corresponding path program 6 times [2018-12-09 10:24:40,639 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:24:40,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:24:40,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:40,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:24:40,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:40,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:24:40,685 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2018-12-09 10:24:40,686 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 10:24:40,686 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_70c304d3-61b8-49bb-b266-abb530e94177/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 10:24:40,693 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-12-09 10:24:40,793 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2018-12-09 10:24:40,793 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 10:24:40,795 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:24:40,809 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2018-12-09 10:24:40,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 10:24:40,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-12-09 10:24:40,824 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 10:24:40,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:24:40,824 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 8 times [2018-12-09 10:24:40,824 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:24:40,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:24:40,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:40,825 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:24:40,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:40,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:24:40,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:24:40,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 10:24:40,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-12-09 10:24:40,862 INFO L87 Difference]: Start difference. First operand 93 states and 112 transitions. cyclomatic complexity: 24 Second operand 11 states. [2018-12-09 10:24:40,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:24:40,925 INFO L93 Difference]: Finished difference Result 139 states and 170 transitions. [2018-12-09 10:24:40,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 10:24:40,925 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 139 states and 170 transitions. [2018-12-09 10:24:40,926 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2018-12-09 10:24:40,926 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 139 states to 139 states and 170 transitions. [2018-12-09 10:24:40,926 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 84 [2018-12-09 10:24:40,926 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 84 [2018-12-09 10:24:40,926 INFO L73 IsDeterministic]: Start isDeterministic. Operand 139 states and 170 transitions. [2018-12-09 10:24:40,927 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 10:24:40,927 INFO L705 BuchiCegarLoop]: Abstraction has 139 states and 170 transitions. [2018-12-09 10:24:40,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states and 170 transitions. [2018-12-09 10:24:40,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 101. [2018-12-09 10:24:40,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-12-09 10:24:40,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 122 transitions. [2018-12-09 10:24:40,928 INFO L728 BuchiCegarLoop]: Abstraction has 101 states and 122 transitions. [2018-12-09 10:24:40,929 INFO L608 BuchiCegarLoop]: Abstraction has 101 states and 122 transitions. [2018-12-09 10:24:40,929 INFO L442 BuchiCegarLoop]: ======== Iteration 21============ [2018-12-09 10:24:40,929 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 101 states and 122 transitions. [2018-12-09 10:24:40,929 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2018-12-09 10:24:40,929 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 10:24:40,929 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 10:24:40,930 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 8, 8, 8, 8, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:24:40,930 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-09 10:24:40,931 INFO L794 eck$LassoCheckResult]: Stem: 4075#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 4073#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(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 4069#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 4070#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 4071#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 4072#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 4104#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 4103#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 4102#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 4101#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 4100#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 4099#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 4098#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 4097#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 4096#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 4095#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 4094#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 4093#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 4092#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 4091#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 4090#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 4089#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 4088#L23-3 assume !(main_~i~1 < 10); 4068#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; 4054#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4055#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4074#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 4150#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4056#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4057#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4067#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 4061#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4062#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4149#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4148#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 4147#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4146#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4145#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4144#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 4143#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4142#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4141#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4140#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 4139#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4138#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4137#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4136#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 4135#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4134#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4133#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4132#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 4131#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4130#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4083#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4106#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 4084#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4082#L9-3 assume !(max_~i~0 < 10); 4050#L9-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 4051#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; 4080#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4063#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4052#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 4053#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4078#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4079#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4129#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 4128#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4127#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4126#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4125#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 4124#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4123#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4122#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4121#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 4120#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4119#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4118#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4117#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 4116#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4115#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4114#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4113#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 4112#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4111#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4110#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4109#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 4108#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4107#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4086#L10-3 [2018-12-09 10:24:40,931 INFO L796 eck$LassoCheckResult]: Loop: 4086#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; 4105#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 4087#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4085#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4086#L10-3 [2018-12-09 10:24:40,931 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:24:40,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1930807453, now seen corresponding path program 7 times [2018-12-09 10:24:40,931 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:24:40,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:24:40,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:40,932 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:24:40,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:40,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:24:40,996 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked. [2018-12-09 10:24:40,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 10:24:40,996 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_70c304d3-61b8-49bb-b266-abb530e94177/bin-2019/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 10:24:41,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:24:41,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:24:41,041 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:24:41,053 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked. [2018-12-09 10:24:41,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 10:24:41,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-12-09 10:24:41,069 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 10:24:41,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:24:41,069 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 9 times [2018-12-09 10:24:41,069 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:24:41,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:24:41,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:41,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:24:41,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:41,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:24:41,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:24:41,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 10:24:41,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-09 10:24:41,106 INFO L87 Difference]: Start difference. First operand 101 states and 122 transitions. cyclomatic complexity: 26 Second operand 12 states. [2018-12-09 10:24:41,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:24:41,189 INFO L93 Difference]: Finished difference Result 151 states and 185 transitions. [2018-12-09 10:24:41,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 10:24:41,189 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 151 states and 185 transitions. [2018-12-09 10:24:41,190 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2018-12-09 10:24:41,190 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 151 states to 151 states and 185 transitions. [2018-12-09 10:24:41,190 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 92 [2018-12-09 10:24:41,190 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 92 [2018-12-09 10:24:41,190 INFO L73 IsDeterministic]: Start isDeterministic. Operand 151 states and 185 transitions. [2018-12-09 10:24:41,191 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 10:24:41,191 INFO L705 BuchiCegarLoop]: Abstraction has 151 states and 185 transitions. [2018-12-09 10:24:41,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states and 185 transitions. [2018-12-09 10:24:41,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 109. [2018-12-09 10:24:41,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-12-09 10:24:41,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 132 transitions. [2018-12-09 10:24:41,192 INFO L728 BuchiCegarLoop]: Abstraction has 109 states and 132 transitions. [2018-12-09 10:24:41,192 INFO L608 BuchiCegarLoop]: Abstraction has 109 states and 132 transitions. [2018-12-09 10:24:41,192 INFO L442 BuchiCegarLoop]: ======== Iteration 22============ [2018-12-09 10:24:41,192 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 109 states and 132 transitions. [2018-12-09 10:24:41,193 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2018-12-09 10:24:41,193 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 10:24:41,193 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 10:24:41,193 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 9, 9, 9, 9, 9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:24:41,193 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-09 10:24:41,194 INFO L794 eck$LassoCheckResult]: Stem: 4603#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 4601#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(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 4597#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 4598#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 4599#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 4600#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 4632#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 4631#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 4630#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 4629#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 4628#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 4627#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 4626#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 4625#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 4624#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 4623#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 4622#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 4621#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 4620#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 4619#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 4618#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 4617#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 4616#L23-3 assume !(main_~i~1 < 10); 4596#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; 4582#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4583#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4602#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 4686#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4584#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4585#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4595#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 4589#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4590#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4685#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4684#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 4683#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4682#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4681#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4680#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 4679#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4678#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4677#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4676#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 4675#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4674#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4673#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4672#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 4671#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4670#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4669#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4668#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 4667#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4666#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4665#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4664#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 4663#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4662#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4611#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4634#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 4612#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4610#L9-3 assume !(max_~i~0 < 10); 4578#L9-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 4579#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; 4608#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4591#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4580#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 4581#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4606#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4607#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4661#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 4660#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4659#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4658#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4657#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 4656#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4655#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4654#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4653#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 4652#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4651#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4650#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4649#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 4648#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4647#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4646#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4645#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 4644#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4643#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4642#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4641#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 4640#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4639#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4638#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4637#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 4636#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4635#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4614#L10-3 [2018-12-09 10:24:41,194 INFO L796 eck$LassoCheckResult]: Loop: 4614#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; 4633#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 4615#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4613#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4614#L10-3 [2018-12-09 10:24:41,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:24:41,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1557788093, now seen corresponding path program 8 times [2018-12-09 10:24:41,194 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:24:41,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:24:41,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:41,195 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:24:41,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:41,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:24:41,264 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-12-09 10:24:41,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 10:24:41,264 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_70c304d3-61b8-49bb-b266-abb530e94177/bin-2019/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 10:24:41,277 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 10:24:41,311 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 10:24:41,311 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 10:24:41,313 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:24:41,325 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-12-09 10:24:41,340 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 10:24:41,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-12-09 10:24:41,341 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 10:24:41,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:24:41,341 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 10 times [2018-12-09 10:24:41,341 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:24:41,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:24:41,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:41,342 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:24:41,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:41,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:24:41,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:24:41,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-09 10:24:41,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-12-09 10:24:41,381 INFO L87 Difference]: Start difference. First operand 109 states and 132 transitions. cyclomatic complexity: 28 Second operand 13 states. [2018-12-09 10:24:41,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:24:41,453 INFO L93 Difference]: Finished difference Result 154 states and 188 transitions. [2018-12-09 10:24:41,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 10:24:41,453 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 154 states and 188 transitions. [2018-12-09 10:24:41,454 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2018-12-09 10:24:41,455 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 154 states to 154 states and 188 transitions. [2018-12-09 10:24:41,455 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 94 [2018-12-09 10:24:41,455 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 94 [2018-12-09 10:24:41,455 INFO L73 IsDeterministic]: Start isDeterministic. Operand 154 states and 188 transitions. [2018-12-09 10:24:41,455 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 10:24:41,455 INFO L705 BuchiCegarLoop]: Abstraction has 154 states and 188 transitions. [2018-12-09 10:24:41,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states and 188 transitions. [2018-12-09 10:24:41,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 117. [2018-12-09 10:24:41,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-12-09 10:24:41,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 142 transitions. [2018-12-09 10:24:41,458 INFO L728 BuchiCegarLoop]: Abstraction has 117 states and 142 transitions. [2018-12-09 10:24:41,458 INFO L608 BuchiCegarLoop]: Abstraction has 117 states and 142 transitions. [2018-12-09 10:24:41,458 INFO L442 BuchiCegarLoop]: ======== Iteration 23============ [2018-12-09 10:24:41,458 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 117 states and 142 transitions. [2018-12-09 10:24:41,458 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2018-12-09 10:24:41,459 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 10:24:41,459 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 10:24:41,459 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:24:41,459 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-09 10:24:41,460 INFO L794 eck$LassoCheckResult]: Stem: 5167#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 5165#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(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 5161#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 5162#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 5163#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 5164#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 5258#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 5257#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 5256#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 5255#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 5254#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 5253#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 5252#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 5251#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 5250#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 5249#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 5248#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 5247#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 5246#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 5245#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 5244#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 5243#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 5242#L23-3 assume !(main_~i~1 < 10); 5160#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; 5146#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5147#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5166#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 5235#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5148#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5149#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5159#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 5153#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5154#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5232#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5230#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 5228#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5226#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5224#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5222#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 5220#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5218#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5216#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5214#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 5212#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5210#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5208#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5206#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 5204#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5202#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5200#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5198#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 5196#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5194#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5192#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5190#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 5188#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5186#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5184#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5183#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 5181#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5179#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5174#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5176#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 5175#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5173#L9-3 assume !(max_~i~0 < 10); 5142#L9-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 5143#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; 5170#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5155#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5144#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 5145#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5172#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5241#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5240#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 5239#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5238#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5237#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5236#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 5234#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5233#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5231#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5229#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 5227#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5225#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5223#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5221#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 5219#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5217#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5215#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5213#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 5211#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5209#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5207#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5205#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 5203#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5201#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5199#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5197#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 5195#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5193#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5191#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5189#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 5187#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5185#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5178#L10-3 [2018-12-09 10:24:41,460 INFO L796 eck$LassoCheckResult]: Loop: 5178#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; 5182#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 5180#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5177#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5178#L10-3 [2018-12-09 10:24:41,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:24:41,460 INFO L82 PathProgramCache]: Analyzing trace with hash 2012806109, now seen corresponding path program 9 times [2018-12-09 10:24:41,460 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:24:41,460 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:24:41,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:41,461 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:24:41,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:41,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:24:41,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:24:41,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:24:41,623 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 11 times [2018-12-09 10:24:41,623 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:24:41,623 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:24:41,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:41,623 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:24:41,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:41,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:24:41,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:24:41,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:24:41,626 INFO L82 PathProgramCache]: Analyzing trace with hash -1723510376, now seen corresponding path program 1 times [2018-12-09 10:24:41,626 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:24:41,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:24:41,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:41,626 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:24:41,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:41,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:24:41,759 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 190 proven. 0 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2018-12-09 10:24:41,759 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:24:41,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-12-09 10:24:41,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-09 10:24:41,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2018-12-09 10:24:41,796 INFO L87 Difference]: Start difference. First operand 117 states and 142 transitions. cyclomatic complexity: 30 Second operand 15 states. [2018-12-09 10:24:41,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:24:41,994 INFO L93 Difference]: Finished difference Result 154 states and 185 transitions. [2018-12-09 10:24:41,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 10:24:41,995 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 154 states and 185 transitions. [2018-12-09 10:24:41,995 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-09 10:24:41,995 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 154 states to 112 states and 133 transitions. [2018-12-09 10:24:41,995 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2018-12-09 10:24:41,996 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 92 [2018-12-09 10:24:41,996 INFO L73 IsDeterministic]: Start isDeterministic. Operand 112 states and 133 transitions. [2018-12-09 10:24:41,996 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 10:24:41,996 INFO L705 BuchiCegarLoop]: Abstraction has 112 states and 133 transitions. [2018-12-09 10:24:41,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states and 133 transitions. [2018-12-09 10:24:41,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-12-09 10:24:41,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-12-09 10:24:41,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 133 transitions. [2018-12-09 10:24:41,997 INFO L728 BuchiCegarLoop]: Abstraction has 112 states and 133 transitions. [2018-12-09 10:24:41,997 INFO L608 BuchiCegarLoop]: Abstraction has 112 states and 133 transitions. [2018-12-09 10:24:41,997 INFO L442 BuchiCegarLoop]: ======== Iteration 24============ [2018-12-09 10:24:41,997 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 112 states and 133 transitions. [2018-12-09 10:24:41,997 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-09 10:24:41,997 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 10:24:41,997 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 10:24:41,998 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:24:41,998 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-09 10:24:41,998 INFO L794 eck$LassoCheckResult]: Stem: 5476#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 5472#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(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 5468#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 5469#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 5470#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 5471#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 5511#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 5509#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 5507#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 5505#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 5503#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 5501#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 5499#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 5497#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 5495#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 5493#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 5491#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 5489#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 5487#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 5485#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 5483#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 5482#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 5481#L23-3 assume !(main_~i~1 < 10); 5466#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; 5467#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5546#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5465#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 5462#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5459#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5460#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5473#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 5543#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5541#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5539#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5537#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 5535#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5533#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5531#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5529#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 5527#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5525#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5523#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5521#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 5519#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5517#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5516#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5515#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 5514#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5513#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5512#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5510#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 5508#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5506#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5504#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5502#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 5500#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5498#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5496#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5494#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 5492#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5490#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5488#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5486#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 5484#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5480#L9-3 assume !(max_~i~0 < 10); 5457#L9-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 5458#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; 5478#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5566#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5565#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 5479#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5477#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5461#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5455#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 5456#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5564#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5563#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5562#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 5561#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5560#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5559#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5558#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 5557#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5556#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5555#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5554#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 5553#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5552#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5551#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5550#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 5549#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5548#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5547#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5545#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 5544#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5542#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5540#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5538#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 5536#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5534#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5532#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5530#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 5528#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5526#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5524#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5522#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 5520#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5518#L9-8 assume !(max_~i~0 < 10); 5474#L9-9 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 5475#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; 5463#L32-3 [2018-12-09 10:24:41,998 INFO L796 eck$LassoCheckResult]: Loop: 5463#L32-3 assume !!(main_~i~2 < 9);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; 5464#L32-2 main_#t~post11 := main_~i~2;main_~i~2 := 1 + main_#t~post11;havoc main_#t~post11; 5463#L32-3 [2018-12-09 10:24:41,998 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:24:41,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1621163222, now seen corresponding path program 1 times [2018-12-09 10:24:41,999 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:24:41,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:24:41,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:41,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:24:41,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:42,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:24:42,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:24:42,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:24:42,121 INFO L82 PathProgramCache]: Analyzing trace with hash 3203, now seen corresponding path program 1 times [2018-12-09 10:24:42,121 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:24:42,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:24:42,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:42,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:24:42,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:42,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:24:42,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:24:42,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:24:42,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1135269864, now seen corresponding path program 1 times [2018-12-09 10:24:42,123 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:24:42,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:24:42,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:42,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:24:42,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:42,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:24:42,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:25:05,843 WARN L180 SmtUtils]: Spent 23.53 s on a formula simplification. DAG size of input: 624 DAG size of output: 468 [2018-12-09 10:25:06,751 WARN L180 SmtUtils]: Spent 850.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 151 [2018-12-09 10:25:06,753 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 10:25:06,754 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 10:25:06,754 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 10:25:06,754 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 10:25:06,754 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 10:25:06,754 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 10:25:06,754 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 10:25:06,754 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 10:25:06,754 INFO L131 ssoRankerPreferences]: Filename of dumped script: max10_true-unreach-call_true-termination.i_Iteration24_Lasso [2018-12-09 10:25:06,754 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 10:25:06,754 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 10:25:06,756 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:25:06,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:25:06,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:25:06,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:25:07,671 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 94 [2018-12-09 10:25:07,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:25:07,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:25:07,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:25:07,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:25:07,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:25:07,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:25:07,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:25:07,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:25:07,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:25:07,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:25:07,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:25:07,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:25:07,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:25:07,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:25:07,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:25:07,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:25:07,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:25:07,969 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 10:25:07,969 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 10:25:07,969 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-12-09 10:25:07,969 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:25:07,969 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:25:07,970 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:25:07,970 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:25:07,970 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:25:07,970 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:25:07,970 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:25:07,970 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:25:07,970 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-12-09 10:25:07,971 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:25:07,971 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:25:07,971 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:25:07,971 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:25:07,971 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:25:07,971 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:25:07,971 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:25:07,971 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:25:07,971 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-12-09 10:25:07,972 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:25:07,972 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:25:07,972 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:25:07,972 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:25:07,972 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:25:07,972 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:25:07,973 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:25:07,973 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-12-09 10:25:07,973 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:25:07,973 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:25:07,973 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:25:07,973 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:25:07,974 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:25:07,974 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:25:07,975 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:25:07,975 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-12-09 10:25:07,975 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:25:07,975 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:25:07,976 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:25:07,976 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:25:07,976 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:25:07,976 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:25:07,979 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:25:07,979 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-12-09 10:25:07,979 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:25:07,980 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:25:07,980 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:25:07,980 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:25:07,980 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:25:07,980 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:25:07,981 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:25:07,981 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-12-09 10:25:07,982 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:25:07,982 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 10:25:07,982 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:25:07,982 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:25:07,982 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 10:25:07,983 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:25:07,984 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:25:07,984 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-12-09 10:25:07,985 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:25:07,985 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:25:07,985 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:25:07,985 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:25:07,985 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:25:07,985 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:25:07,985 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:25:07,985 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:25:07,986 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-12-09 10:25:07,986 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:25:07,986 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:25:07,986 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:25:07,986 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:25:07,986 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:25:07,986 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:25:07,987 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:25:07,987 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-12-09 10:25:07,987 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:25:07,987 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:25:07,987 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:25:07,987 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:25:07,987 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:25:07,988 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:25:07,988 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:25:07,988 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-12-09 10:25:07,988 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:25:07,989 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:25:07,989 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:25:07,989 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:25:07,989 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:25:07,989 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:25:07,989 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:25:07,990 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-12-09 10:25:07,990 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:25:07,990 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:25:07,990 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:25:07,990 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:25:07,990 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:25:07,990 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:25:07,991 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:25:07,991 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-12-09 10:25:07,991 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:25:07,991 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:25:07,991 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:25:07,991 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:25:07,992 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:25:07,992 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:25:07,992 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:25:07,992 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-12-09 10:25:07,993 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:25:07,993 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:25:07,993 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:25:07,993 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:25:07,993 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:25:07,993 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:25:07,997 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 10:25:08,002 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-09 10:25:08,002 INFO L444 ModelExtractionUtils]: 16 out of 22 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-12-09 10:25:08,002 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 10:25:08,002 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 10:25:08,003 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 10:25:08,003 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#x~0.base)_3, ULTIMATE.start_main_~i~2) = 17*v_rep(select #length ULTIMATE.start_main_~#x~0.base)_3 - 16*ULTIMATE.start_main_~i~2 Supporting invariants [] [2018-12-09 10:25:08,371 INFO L297 tatePredicateManager]: 123 out of 123 supporting invariants were superfluous and have been removed [2018-12-09 10:25:08,372 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-09 10:25:08,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:25:08,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:25:08,411 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:25:08,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:25:08,415 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:25:08,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:25:08,421 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-12-09 10:25:08,422 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 112 states and 133 transitions. cyclomatic complexity: 23 Second operand 3 states. [2018-12-09 10:25:08,428 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 112 states and 133 transitions. cyclomatic complexity: 23. Second operand 3 states. Result 114 states and 136 transitions. Complement of second has 4 states. [2018-12-09 10:25:08,428 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-12-09 10:25:08,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-09 10:25:08,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2018-12-09 10:25:08,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 24 transitions. Stem has 110 letters. Loop has 2 letters. [2018-12-09 10:25:08,429 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:25:08,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 24 transitions. Stem has 112 letters. Loop has 2 letters. [2018-12-09 10:25:08,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:25:08,430 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 24 transitions. Stem has 110 letters. Loop has 4 letters. [2018-12-09 10:25:08,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:25:08,430 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 114 states and 136 transitions. [2018-12-09 10:25:08,431 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-09 10:25:08,431 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 114 states to 0 states and 0 transitions. [2018-12-09 10:25:08,431 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-09 10:25:08,431 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-09 10:25:08,431 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-09 10:25:08,431 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 10:25:08,432 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 10:25:08,432 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 10:25:08,432 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 10:25:08,432 INFO L442 BuchiCegarLoop]: ======== Iteration 25============ [2018-12-09 10:25:08,432 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-09 10:25:08,432 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-09 10:25:08,432 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-09 10:25:08,436 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.12 10:25:08 BoogieIcfgContainer [2018-12-09 10:25:08,436 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-09 10:25:08,437 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 10:25:08,437 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 10:25:08,437 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 10:25:08,437 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 10:24:34" (3/4) ... [2018-12-09 10:25:08,440 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-09 10:25:08,440 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 10:25:08,440 INFO L168 Benchmark]: Toolchain (without parser) took 34257.70 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 441.5 MB). Free memory was 956.0 MB in the beginning and 1.0 GB in the end (delta: -86.4 MB). Peak memory consumption was 355.0 MB. Max. memory is 11.5 GB. [2018-12-09 10:25:08,441 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 10:25:08,441 INFO L168 Benchmark]: CACSL2BoogieTranslator took 136.70 ms. Allocated memory is still 1.0 GB. Free memory was 956.0 MB in the beginning and 945.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-09 10:25:08,441 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.51 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.0 MB). Free memory was 945.3 MB in the beginning and 1.1 GB in the end (delta: -168.9 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2018-12-09 10:25:08,442 INFO L168 Benchmark]: Boogie Preprocessor took 22.78 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-12-09 10:25:08,442 INFO L168 Benchmark]: RCFGBuilder took 183.90 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-12-09 10:25:08,443 INFO L168 Benchmark]: BuchiAutomizer took 33848.89 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 322.4 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 46.8 MB). Peak memory consumption was 369.3 MB. Max. memory is 11.5 GB. [2018-12-09 10:25:08,443 INFO L168 Benchmark]: Witness Printer took 3.10 ms. Allocated memory is still 1.5 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 10:25:08,446 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 136.70 ms. Allocated memory is still 1.0 GB. Free memory was 956.0 MB in the beginning and 945.3 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 59.51 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.0 MB). Free memory was 945.3 MB in the beginning and 1.1 GB in the end (delta: -168.9 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.78 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 183.90 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 33848.89 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 322.4 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 46.8 MB). Peak memory consumption was 369.3 MB. Max. memory is 11.5 GB. * Witness Printer took 3.10 ms. Allocated memory is still 1.5 GB. Free memory is still 1.0 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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 24 terminating modules (21 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i + 19 and consists of 5 locations. One deterministic module has affine ranking function -2 * i + 19 and consists of 4 locations. One deterministic module has affine ranking function 17 * unknown-#length-unknown[x] + -16 * i and consists of 3 locations. 21 modules have a trivial ranking function, the largest among these consists of 15 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 33.8s and 25 iterations. TraceHistogramMax:10. Analysis of lassos took 32.5s. Construction of modules took 0.6s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 24. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 23 MinimizatonAttempts, 280 StatesRemovedByMinimization, 19 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 117 states and ocurred in iteration 22. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 645 SDtfs, 1138 SDslu, 1993 SDs, 0 SdLazy, 1087 SolverSat, 222 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU20 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital350 mio100 ax100 hnf99 lsp95 ukn45 mio100 lsp54 div100 bol100 ite100 ukn100 eq165 hnf87 smp94 dnf100 smp100 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 5ms 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...