./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 aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_2d022fe4-7bac-4288-9777-1790a474ea02/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_2d022fe4-7bac-4288-9777-1790a474ea02/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_2d022fe4-7bac-4288-9777-1790a474ea02/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_2d022fe4-7bac-4288-9777-1790a474ea02/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_2d022fe4-7bac-4288-9777-1790a474ea02/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_2d022fe4-7bac-4288-9777-1790a474ea02/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-aa41828 [2018-11-23 13:32:16,980 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:32:16,981 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:32:16,988 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:32:16,988 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:32:16,989 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:32:16,990 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:32:16,991 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:32:16,992 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:32:16,992 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:32:16,993 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:32:16,993 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:32:16,994 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:32:16,994 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:32:16,995 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:32:16,996 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:32:16,996 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:32:16,997 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:32:16,999 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:32:17,000 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:32:17,000 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:32:17,001 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:32:17,003 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:32:17,003 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:32:17,003 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:32:17,004 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:32:17,004 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:32:17,005 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:32:17,005 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:32:17,006 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:32:17,006 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:32:17,007 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:32:17,007 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:32:17,007 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:32:17,008 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:32:17,008 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:32:17,009 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_2d022fe4-7bac-4288-9777-1790a474ea02/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-23 13:32:17,019 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:32:17,020 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:32:17,021 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:32:17,021 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:32:17,021 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:32:17,021 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 13:32:17,021 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 13:32:17,021 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 13:32:17,022 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 13:32:17,022 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 13:32:17,022 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 13:32:17,022 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:32:17,022 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:32:17,022 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 13:32:17,022 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:32:17,022 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:32:17,023 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:32:17,023 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 13:32:17,023 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 13:32:17,023 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 13:32:17,023 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:32:17,023 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:32:17,023 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 13:32:17,023 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:32:17,024 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 13:32:17,024 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:32:17,024 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:32:17,024 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 13:32:17,024 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:32:17,024 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:32:17,024 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 13:32:17,025 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 13:32:17,025 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_2d022fe4-7bac-4288-9777-1790a474ea02/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-11-23 13:32:17,047 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:32:17,055 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:32:17,057 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:32:17,058 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:32:17,058 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:32:17,058 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_2d022fe4-7bac-4288-9777-1790a474ea02/bin-2019/uautomizer/../../sv-benchmarks/c/reducercommutativity/max10_true-unreach-call_true-termination.i [2018-11-23 13:32:17,093 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2d022fe4-7bac-4288-9777-1790a474ea02/bin-2019/uautomizer/data/6a883d105/0ff2c2a7a0514e249632866ff357838a/FLAG829a3d563 [2018-11-23 13:32:17,487 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:32:17,487 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_2d022fe4-7bac-4288-9777-1790a474ea02/sv-benchmarks/c/reducercommutativity/max10_true-unreach-call_true-termination.i [2018-11-23 13:32:17,491 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2d022fe4-7bac-4288-9777-1790a474ea02/bin-2019/uautomizer/data/6a883d105/0ff2c2a7a0514e249632866ff357838a/FLAG829a3d563 [2018-11-23 13:32:17,500 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_2d022fe4-7bac-4288-9777-1790a474ea02/bin-2019/uautomizer/data/6a883d105/0ff2c2a7a0514e249632866ff357838a [2018-11-23 13:32:17,502 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:32:17,503 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:32:17,504 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:32:17,504 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:32:17,506 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:32:17,506 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:32:17" (1/1) ... [2018-11-23 13:32:17,508 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22877cf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:32:17, skipping insertion in model container [2018-11-23 13:32:17,508 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:32:17" (1/1) ... [2018-11-23 13:32:17,515 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:32:17,532 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:32:17,654 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:32:17,660 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:32:17,673 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:32:17,685 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:32:17,685 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:32:17 WrapperNode [2018-11-23 13:32:17,685 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:32:17,686 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:32:17,686 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:32:17,686 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:32:17,690 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:32:17" (1/1) ... [2018-11-23 13:32:17,696 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:32:17" (1/1) ... [2018-11-23 13:32:17,709 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:32:17,709 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:32:17,709 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:32:17,709 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:32:17,751 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:32:17" (1/1) ... [2018-11-23 13:32:17,752 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:32:17" (1/1) ... [2018-11-23 13:32:17,753 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:32:17" (1/1) ... [2018-11-23 13:32:17,753 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:32:17" (1/1) ... [2018-11-23 13:32:17,758 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:32:17" (1/1) ... [2018-11-23 13:32:17,762 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:32:17" (1/1) ... [2018-11-23 13:32:17,763 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:32:17" (1/1) ... [2018-11-23 13:32:17,765 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:32:17,766 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:32:17,766 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:32:17,766 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:32:17,766 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:32:17" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2d022fe4-7bac-4288-9777-1790a474ea02/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:32:17,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 13:32:17,800 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 13:32:17,800 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:32:17,800 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:32:17,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 13:32:17,800 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 13:32:17,988 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:32:17,988 INFO L280 CfgBuilder]: Removed 15 assue(true) statements. [2018-11-23 13:32:17,988 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:32:17 BoogieIcfgContainer [2018-11-23 13:32:17,988 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:32:17,989 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 13:32:17,989 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 13:32:17,991 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 13:32:17,992 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 13:32:17,992 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 01:32:17" (1/3) ... [2018-11-23 13:32:17,993 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6011561d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 01:32:17, skipping insertion in model container [2018-11-23 13:32:17,993 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 13:32:17,993 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:32:17" (2/3) ... [2018-11-23 13:32:17,993 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6011561d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 01:32:17, skipping insertion in model container [2018-11-23 13:32:17,993 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 13:32:17,993 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:32:17" (3/3) ... [2018-11-23 13:32:17,994 INFO L375 chiAutomizerObserver]: Analyzing ICFG max10_true-unreach-call_true-termination.i [2018-11-23 13:32:18,032 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:32:18,032 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 13:32:18,032 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 13:32:18,032 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 13:32:18,032 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:32:18,032 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:32:18,032 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 13:32:18,032 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:32:18,033 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 13:32:18,042 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states. [2018-11-23 13:32:18,056 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 16 [2018-11-23 13:32:18,056 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:32:18,056 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:32:18,060 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 13:32:18,060 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 13:32:18,060 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 13:32:18,060 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states. [2018-11-23 13:32:18,061 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 16 [2018-11-23 13:32:18,061 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:32:18,061 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:32:18,061 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 13:32:18,061 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 13:32:18,066 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-11-23 13:32:18,066 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-11-23 13:32:18,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:32:18,070 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-23 13:32:18,071 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:32:18,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:32:18,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:18,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:32:18,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:18,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:32:18,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:32:18,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:32:18,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2018-11-23 13:32:18,133 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:32:18,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:32:18,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:18,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:32:18,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:18,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:32:18,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:32:18,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:32:18,148 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2018-11-23 13:32:18,148 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:32:18,148 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:32:18,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:18,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:32:18,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:18,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:32:18,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:32:18,282 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 13:32:18,283 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 13:32:18,284 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 13:32:18,284 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 13:32:18,284 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 13:32:18,284 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:32:18,284 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 13:32:18,284 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 13:32:18,285 INFO L131 ssoRankerPreferences]: Filename of dumped script: max10_true-unreach-call_true-termination.i_Iteration1_Lasso [2018-11-23 13:32:18,285 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 13:32:18,285 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 13:32:18,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:32:18,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:32:18,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:32:18,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:32:18,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:32:18,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:32:18,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:32:18,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:32:18,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:32:18,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:32:18,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:32:18,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:32:18,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:32:18,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:32:18,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:32:18,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:32:18,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:32:18,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:32:18,527 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 13:32:18,531 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 13:32:18,532 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:32:18,533 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:32:18,533 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:32:18,534 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:32:18,534 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:32:18,534 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:32:18,535 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:32:18,535 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:32:18,538 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:32:18,539 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:32:18,539 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:32:18,539 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:32:18,540 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:32:18,540 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:32:18,540 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:32:18,540 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:32:18,540 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:32:18,541 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:32:18,542 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:32:18,543 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:32:18,543 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:32:18,543 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:32:18,543 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:32:18,543 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:32:18,544 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:32:18,544 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:32:18,544 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:32:18,545 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:32:18,545 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:32:18,545 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:32:18,545 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:32:18,546 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:32:18,546 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:32:18,547 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:32:18,548 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:32:18,548 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:32:18,549 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:32:18,549 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:32:18,549 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:32:18,549 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:32:18,549 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:32:18,549 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:32:18,550 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:32:18,550 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:32:18,551 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:32:18,551 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:32:18,551 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:32:18,551 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:32:18,552 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:32:18,552 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:32:18,554 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:32:18,554 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:32:18,557 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:32:18,558 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:32:18,558 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:32:18,558 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 13:32:18,558 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:32:18,558 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:32:18,560 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 13:32:18,560 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:32:18,567 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:32:18,568 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:32:18,568 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:32:18,568 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:32:18,568 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:32:18,569 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:32:18,573 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:32:18,573 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:32:18,602 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 13:32:18,624 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-23 13:32:18,624 INFO L444 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-23 13:32:18,626 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 13:32:18,628 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 13:32:18,628 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 13:32:18,628 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#x~0.base)_1, ULTIMATE.start_main_~i~1) = 19*v_rep(select #length ULTIMATE.start_main_~#x~0.base)_1 - 8*ULTIMATE.start_main_~i~1 Supporting invariants [] [2018-11-23 13:32:18,638 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2018-11-23 13:32:18,643 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 13:32:18,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:32:18,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:32:18,675 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:32:18,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:32:18,684 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:32:18,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:32:18,718 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 13:32:18,719 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states. Second operand 3 states. [2018-11-23 13:32:18,804 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states.. Second operand 3 states. Result 84 states and 119 transitions. Complement of second has 8 states. [2018-11-23 13:32:18,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 13:32:18,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:32:18,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 79 transitions. [2018-11-23 13:32:18,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 79 transitions. Stem has 2 letters. Loop has 2 letters. [2018-11-23 13:32:18,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:32:18,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 79 transitions. Stem has 4 letters. Loop has 2 letters. [2018-11-23 13:32:18,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:32:18,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 79 transitions. Stem has 2 letters. Loop has 4 letters. [2018-11-23 13:32:18,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:32:18,808 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 119 transitions. [2018-11-23 13:32:18,810 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2018-11-23 13:32:18,812 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 25 states and 33 transitions. [2018-11-23 13:32:18,813 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-11-23 13:32:18,813 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-11-23 13:32:18,814 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 33 transitions. [2018-11-23 13:32:18,814 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 13:32:18,814 INFO L705 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2018-11-23 13:32:18,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 33 transitions. [2018-11-23 13:32:18,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-11-23 13:32:18,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 13:32:18,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2018-11-23 13:32:18,830 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2018-11-23 13:32:18,830 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2018-11-23 13:32:18,830 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 13:32:18,830 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 33 transitions. [2018-11-23 13:32:18,831 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2018-11-23 13:32:18,831 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:32:18,831 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:32:18,831 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-23 13:32:18,831 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 13:32:18,832 INFO L794 eck$LassoCheckResult]: Stem: 181#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 178#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 175#L23-3 assume !(main_~i~1 < 10); 174#L23-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 163#L9-3 [2018-11-23 13:32:18,832 INFO L796 eck$LassoCheckResult]: Loop: 163#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 164#L10 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 173#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 168#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 163#L9-3 [2018-11-23 13:32:18,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:32:18,832 INFO L82 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2018-11-23 13:32:18,832 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:32:18,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:32:18,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:18,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:32:18,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:18,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:32:18,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:32:18,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:32:18,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 13:32:18,857 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 13:32:18,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:32:18,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 1 times [2018-11-23 13:32:18,858 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:32:18,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:32:18,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:18,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:32:18,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:18,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:32:18,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:32:18,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 13:32:18,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:32:18,905 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. cyclomatic complexity: 13 Second operand 3 states. [2018-11-23 13:32:18,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:32:18,913 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2018-11-23 13:32:18,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 13:32:18,914 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 33 transitions. [2018-11-23 13:32:18,914 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2018-11-23 13:32:18,916 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 33 transitions. [2018-11-23 13:32:18,916 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-11-23 13:32:18,916 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-11-23 13:32:18,916 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 33 transitions. [2018-11-23 13:32:18,917 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 13:32:18,917 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2018-11-23 13:32:18,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 33 transitions. [2018-11-23 13:32:18,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2018-11-23 13:32:18,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 13:32:18,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2018-11-23 13:32:18,919 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2018-11-23 13:32:18,919 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2018-11-23 13:32:18,919 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 13:32:18,919 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 32 transitions. [2018-11-23 13:32:18,920 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2018-11-23 13:32:18,920 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:32:18,921 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:32:18,921 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-23 13:32:18,921 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 13:32:18,921 INFO L794 eck$LassoCheckResult]: Stem: 238#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 235#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 232#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 233#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 234#L23-3 assume !(main_~i~1 < 10); 231#L23-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 220#L9-3 [2018-11-23 13:32:18,921 INFO L796 eck$LassoCheckResult]: Loop: 220#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 221#L10 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 230#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 225#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 220#L9-3 [2018-11-23 13:32:18,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:32:18,921 INFO L82 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2018-11-23 13:32:18,922 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:32:18,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:32:18,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:18,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:32:18,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:18,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:32:18,947 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:32:18,947 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:32:18,947 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2d022fe4-7bac-4288-9777-1790a474ea02/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:32:18,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:32:18,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:32:18,967 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:32:18,974 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:32:18,988 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:32:18,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 13:32:18,988 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 13:32:18,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:32:18,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 2 times [2018-11-23 13:32:18,989 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:32:18,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:32:18,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:18,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:32:18,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:18,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:32:18,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:32:19,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 13:32:19,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:32:19,031 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. cyclomatic complexity: 12 Second operand 5 states. [2018-11-23 13:32:19,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:32:19,044 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2018-11-23 13:32:19,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 13:32:19,044 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 35 transitions. [2018-11-23 13:32:19,044 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2018-11-23 13:32:19,045 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 35 transitions. [2018-11-23 13:32:19,045 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-11-23 13:32:19,045 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-11-23 13:32:19,045 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 35 transitions. [2018-11-23 13:32:19,045 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 13:32:19,045 INFO L705 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2018-11-23 13:32:19,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 35 transitions. [2018-11-23 13:32:19,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2018-11-23 13:32:19,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 13:32:19,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2018-11-23 13:32:19,047 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2018-11-23 13:32:19,047 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2018-11-23 13:32:19,047 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 13:32:19,047 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 34 transitions. [2018-11-23 13:32:19,048 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2018-11-23 13:32:19,048 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:32:19,048 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:32:19,048 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2018-11-23 13:32:19,048 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 13:32:19,048 INFO L794 eck$LassoCheckResult]: Stem: 313#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 312#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 308#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 309#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 310#L23-3 assume !!(main_~i~1 < 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; 318#L23-3 assume !(main_~i~1 < 10); 307#L23-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 296#L9-3 [2018-11-23 13:32:19,049 INFO L796 eck$LassoCheckResult]: Loop: 296#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 297#L10 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 306#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 301#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 296#L9-3 [2018-11-23 13:32:19,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:32:19,049 INFO L82 PathProgramCache]: Analyzing trace with hash 265236367, now seen corresponding path program 2 times [2018-11-23 13:32:19,049 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:32:19,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:32:19,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:19,050 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:32:19,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:19,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:32:19,068 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:32:19,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:32:19,068 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2d022fe4-7bac-4288-9777-1790a474ea02/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:32:19,074 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:32:19,082 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:32:19,082 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:32:19,083 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:32:19,089 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:32:19,104 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:32:19,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 13:32:19,104 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 13:32:19,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:32:19,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 3 times [2018-11-23 13:32:19,105 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:32:19,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:32:19,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:19,106 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:32:19,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:19,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:32:19,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:32:19,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 13:32:19,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:32:19,180 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. cyclomatic complexity: 12 Second operand 6 states. [2018-11-23 13:32:19,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:32:19,199 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2018-11-23 13:32:19,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 13:32:19,202 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 37 transitions. [2018-11-23 13:32:19,203 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2018-11-23 13:32:19,203 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 37 transitions. [2018-11-23 13:32:19,204 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-11-23 13:32:19,204 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-11-23 13:32:19,204 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 37 transitions. [2018-11-23 13:32:19,204 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 13:32:19,204 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 37 transitions. [2018-11-23 13:32:19,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 37 transitions. [2018-11-23 13:32:19,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-11-23 13:32:19,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 13:32:19,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2018-11-23 13:32:19,210 INFO L728 BuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2018-11-23 13:32:19,210 INFO L608 BuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2018-11-23 13:32:19,211 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 13:32:19,211 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 36 transitions. [2018-11-23 13:32:19,212 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2018-11-23 13:32:19,212 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:32:19,212 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:32:19,212 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1] [2018-11-23 13:32:19,213 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 13:32:19,213 INFO L794 eck$LassoCheckResult]: Stem: 401#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 399#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 395#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 396#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 397#L23-3 assume !!(main_~i~1 < 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; 400#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; 407#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 406#L23-3 assume !(main_~i~1 < 10); 394#L23-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 383#L9-3 [2018-11-23 13:32:19,213 INFO L796 eck$LassoCheckResult]: Loop: 383#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 384#L10 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 393#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 388#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 383#L9-3 [2018-11-23 13:32:19,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:32:19,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1489134225, now seen corresponding path program 3 times [2018-11-23 13:32:19,213 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:32:19,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:32:19,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:19,214 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:32:19,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:19,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:32:19,247 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:32:19,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:32:19,247 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2d022fe4-7bac-4288-9777-1790a474ea02/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:32:19,254 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:32:19,274 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 13:32:19,274 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:32:19,276 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:32:19,303 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:32:19,320 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:32:19,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-23 13:32:19,321 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 13:32:19,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:32:19,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 4 times [2018-11-23 13:32:19,321 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:32:19,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:32:19,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:19,322 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:32:19,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:19,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:32:19,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:32:19,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 13:32:19,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:32:19,352 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. cyclomatic complexity: 12 Second operand 7 states. [2018-11-23 13:32:19,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:32:19,369 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2018-11-23 13:32:19,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 13:32:19,372 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 39 transitions. [2018-11-23 13:32:19,373 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2018-11-23 13:32:19,373 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 32 states and 39 transitions. [2018-11-23 13:32:19,373 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-11-23 13:32:19,373 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-11-23 13:32:19,373 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 39 transitions. [2018-11-23 13:32:19,374 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 13:32:19,374 INFO L705 BuchiCegarLoop]: Abstraction has 32 states and 39 transitions. [2018-11-23 13:32:19,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 39 transitions. [2018-11-23 13:32:19,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2018-11-23 13:32:19,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 13:32:19,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2018-11-23 13:32:19,377 INFO L728 BuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2018-11-23 13:32:19,377 INFO L608 BuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2018-11-23 13:32:19,377 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-23 13:32:19,377 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 38 transitions. [2018-11-23 13:32:19,378 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2018-11-23 13:32:19,378 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:32:19,378 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:32:19,378 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2018-11-23 13:32:19,378 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 13:32:19,379 INFO L794 eck$LassoCheckResult]: Stem: 501#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 497#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 493#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 494#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 495#L23-3 assume !!(main_~i~1 < 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; 498#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);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 505#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 504#L23-3 assume !(main_~i~1 < 10); 492#L23-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 481#L9-3 [2018-11-23 13:32:19,379 INFO L796 eck$LassoCheckResult]: Loop: 481#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 482#L10 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 491#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 486#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 481#L9-3 [2018-11-23 13:32:19,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:32:19,379 INFO L82 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 4 times [2018-11-23 13:32:19,379 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:32:19,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:32:19,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:19,380 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:32:19,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:19,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:32:19,420 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:32:19,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:32:19,420 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2d022fe4-7bac-4288-9777-1790a474ea02/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:32:19,426 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 13:32:19,439 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 13:32:19,439 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:32:19,440 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:32:19,452 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:32:19,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:32:19,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 13:32:19,467 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 13:32:19,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:32:19,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 5 times [2018-11-23 13:32:19,467 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:32:19,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:32:19,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:19,468 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:32:19,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:19,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:32:19,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:32:19,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 13:32:19,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:32:19,499 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. cyclomatic complexity: 12 Second operand 8 states. [2018-11-23 13:32:19,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:32:19,519 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2018-11-23 13:32:19,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 13:32:19,521 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 41 transitions. [2018-11-23 13:32:19,522 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2018-11-23 13:32:19,522 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 41 transitions. [2018-11-23 13:32:19,522 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-11-23 13:32:19,522 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-11-23 13:32:19,523 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 41 transitions. [2018-11-23 13:32:19,523 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 13:32:19,523 INFO L705 BuchiCegarLoop]: Abstraction has 34 states and 41 transitions. [2018-11-23 13:32:19,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 41 transitions. [2018-11-23 13:32:19,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-11-23 13:32:19,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 13:32:19,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2018-11-23 13:32:19,525 INFO L728 BuchiCegarLoop]: Abstraction has 33 states and 40 transitions. [2018-11-23 13:32:19,525 INFO L608 BuchiCegarLoop]: Abstraction has 33 states and 40 transitions. [2018-11-23 13:32:19,525 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-23 13:32:19,525 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 40 transitions. [2018-11-23 13:32:19,525 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2018-11-23 13:32:19,526 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:32:19,526 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:32:19,526 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1] [2018-11-23 13:32:19,526 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 13:32:19,526 INFO L794 eck$LassoCheckResult]: Stem: 608#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 606#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; 602#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; 603#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 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; 607#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);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 614#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 613#L23-3 assume !(main_~i~1 < 10); 601#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; 590#L9-3 [2018-11-23 13:32:19,527 INFO L796 eck$LassoCheckResult]: Loop: 590#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 591#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; 600#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 595#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 590#L9-3 [2018-11-23 13:32:19,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:32:19,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1745699051, now seen corresponding path program 5 times [2018-11-23 13:32:19,527 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:32:19,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:32:19,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:19,528 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:32:19,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:19,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:32:19,565 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:32:19,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:32:19,565 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2d022fe4-7bac-4288-9777-1790a474ea02/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:32:19,572 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 13:32:19,590 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-23 13:32:19,590 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:32:19,592 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:32:19,612 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:32:19,627 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:32:19,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-23 13:32:19,627 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 13:32:19,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:32:19,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 6 times [2018-11-23 13:32:19,628 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:32:19,628 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:32:19,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:19,628 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:32:19,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:19,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:32:19,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:32:19,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 13:32:19,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 13:32:19,655 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. cyclomatic complexity: 12 Second operand 9 states. [2018-11-23 13:32:19,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:32:19,668 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2018-11-23 13:32:19,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 13:32:19,668 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 43 transitions. [2018-11-23 13:32:19,669 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2018-11-23 13:32:19,669 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 36 states and 43 transitions. [2018-11-23 13:32:19,669 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-11-23 13:32:19,669 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-11-23 13:32:19,669 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 43 transitions. [2018-11-23 13:32:19,670 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 13:32:19,670 INFO L705 BuchiCegarLoop]: Abstraction has 36 states and 43 transitions. [2018-11-23 13:32:19,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 43 transitions. [2018-11-23 13:32:19,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2018-11-23 13:32:19,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 13:32:19,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2018-11-23 13:32:19,673 INFO L728 BuchiCegarLoop]: Abstraction has 35 states and 42 transitions. [2018-11-23 13:32:19,673 INFO L608 BuchiCegarLoop]: Abstraction has 35 states and 42 transitions. [2018-11-23 13:32:19,673 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-23 13:32:19,673 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 42 transitions. [2018-11-23 13:32:19,673 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2018-11-23 13:32:19,674 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:32:19,674 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:32:19,674 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 1, 1, 1, 1] [2018-11-23 13:32:19,674 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 13:32:19,674 INFO L794 eck$LassoCheckResult]: Stem: 728#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 726#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; 722#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; 723#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 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; 727#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);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 734#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 733#L23-3 assume !(main_~i~1 < 10); 721#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; 710#L9-3 [2018-11-23 13:32:19,674 INFO L796 eck$LassoCheckResult]: Loop: 710#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 711#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; 720#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 715#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 710#L9-3 [2018-11-23 13:32:19,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:32:19,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1715480727, now seen corresponding path program 6 times [2018-11-23 13:32:19,675 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:32:19,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:32:19,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:19,675 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:32:19,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:19,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:32:19,715 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:32:19,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:32:19,715 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2d022fe4-7bac-4288-9777-1790a474ea02/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:32:19,724 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 13:32:19,748 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-23 13:32:19,748 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:32:19,749 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:32:19,758 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:32:19,783 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:32:19,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-23 13:32:19,784 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 13:32:19,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:32:19,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 7 times [2018-11-23 13:32:19,784 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:32:19,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:32:19,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:19,785 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:32:19,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:19,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:32:19,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:32:19,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 13:32:19,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 13:32:19,844 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. cyclomatic complexity: 12 Second operand 10 states. [2018-11-23 13:32:19,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:32:19,860 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2018-11-23 13:32:19,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 13:32:19,861 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 45 transitions. [2018-11-23 13:32:19,862 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2018-11-23 13:32:19,862 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 38 states and 45 transitions. [2018-11-23 13:32:19,862 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-11-23 13:32:19,862 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-11-23 13:32:19,862 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 45 transitions. [2018-11-23 13:32:19,863 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 13:32:19,863 INFO L705 BuchiCegarLoop]: Abstraction has 38 states and 45 transitions. [2018-11-23 13:32:19,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 45 transitions. [2018-11-23 13:32:19,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-11-23 13:32:19,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 13:32:19,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2018-11-23 13:32:19,865 INFO L728 BuchiCegarLoop]: Abstraction has 37 states and 44 transitions. [2018-11-23 13:32:19,865 INFO L608 BuchiCegarLoop]: Abstraction has 37 states and 44 transitions. [2018-11-23 13:32:19,865 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-23 13:32:19,865 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 44 transitions. [2018-11-23 13:32:19,865 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2018-11-23 13:32:19,865 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:32:19,865 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:32:19,866 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [7, 7, 1, 1, 1, 1] [2018-11-23 13:32:19,866 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 13:32:19,866 INFO L794 eck$LassoCheckResult]: Stem: 859#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 857#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; 853#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; 854#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 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; 858#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);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 865#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 864#L23-3 assume !(main_~i~1 < 10); 852#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; 841#L9-3 [2018-11-23 13:32:19,866 INFO L796 eck$LassoCheckResult]: Loop: 841#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 842#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; 851#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 846#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 841#L9-3 [2018-11-23 13:32:19,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:32:19,867 INFO L82 PathProgramCache]: Analyzing trace with hash -690407015, now seen corresponding path program 7 times [2018-11-23 13:32:19,867 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:32:19,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:32:19,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:19,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:32:19,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:19,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:32:19,930 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:32:19,931 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:32:19,931 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2d022fe4-7bac-4288-9777-1790a474ea02/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:32:19,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:32:19,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:32:19,948 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:32:19,968 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:32:19,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:32:19,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-23 13:32:19,984 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 13:32:19,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:32:19,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 8 times [2018-11-23 13:32:19,985 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:32:19,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:32:19,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:19,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:32:19,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:19,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:32:19,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:32:20,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 13:32:20,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 13:32:20,012 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. cyclomatic complexity: 12 Second operand 11 states. [2018-11-23 13:32:20,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:32:20,040 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2018-11-23 13:32:20,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 13:32:20,042 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 47 transitions. [2018-11-23 13:32:20,042 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2018-11-23 13:32:20,043 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 40 states and 47 transitions. [2018-11-23 13:32:20,043 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-11-23 13:32:20,043 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-11-23 13:32:20,043 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 47 transitions. [2018-11-23 13:32:20,043 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 13:32:20,043 INFO L705 BuchiCegarLoop]: Abstraction has 40 states and 47 transitions. [2018-11-23 13:32:20,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 47 transitions. [2018-11-23 13:32:20,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2018-11-23 13:32:20,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 13:32:20,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2018-11-23 13:32:20,045 INFO L728 BuchiCegarLoop]: Abstraction has 39 states and 46 transitions. [2018-11-23 13:32:20,045 INFO L608 BuchiCegarLoop]: Abstraction has 39 states and 46 transitions. [2018-11-23 13:32:20,045 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-23 13:32:20,045 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 46 transitions. [2018-11-23 13:32:20,046 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2018-11-23 13:32:20,046 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:32:20,046 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:32:20,046 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1, 1] [2018-11-23 13:32:20,046 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 13:32:20,046 INFO L794 eck$LassoCheckResult]: Stem: 1003#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 999#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; 995#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; 996#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 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; 1000#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);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1007#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1006#L23-3 assume !(main_~i~1 < 10); 994#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; 983#L9-3 [2018-11-23 13:32:20,046 INFO L796 eck$LassoCheckResult]: Loop: 983#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 984#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; 993#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 988#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 983#L9-3 [2018-11-23 13:32:20,047 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:32:20,047 INFO L82 PathProgramCache]: Analyzing trace with hash -2056121829, now seen corresponding path program 8 times [2018-11-23 13:32:20,047 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:32:20,047 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:32:20,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:20,047 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:32:20,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:20,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:32:20,104 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:32:20,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:32:20,105 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2d022fe4-7bac-4288-9777-1790a474ea02/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:32:20,122 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:32:20,138 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:32:20,138 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:32:20,139 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:32:20,160 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:32:20,176 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:32:20,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-23 13:32:20,177 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 13:32:20,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:32:20,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 9 times [2018-11-23 13:32:20,177 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:32:20,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:32:20,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:20,178 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:32:20,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:20,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:32:20,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:32:20,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 13:32:20,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 13:32:20,204 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. cyclomatic complexity: 12 Second operand 12 states. [2018-11-23 13:32:20,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:32:20,229 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2018-11-23 13:32:20,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 13:32:20,230 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 49 transitions. [2018-11-23 13:32:20,231 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2018-11-23 13:32:20,231 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 42 states and 49 transitions. [2018-11-23 13:32:20,231 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-11-23 13:32:20,231 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-11-23 13:32:20,231 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 49 transitions. [2018-11-23 13:32:20,231 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 13:32:20,231 INFO L705 BuchiCegarLoop]: Abstraction has 42 states and 49 transitions. [2018-11-23 13:32:20,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 49 transitions. [2018-11-23 13:32:20,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2018-11-23 13:32:20,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 13:32:20,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2018-11-23 13:32:20,233 INFO L728 BuchiCegarLoop]: Abstraction has 41 states and 48 transitions. [2018-11-23 13:32:20,233 INFO L608 BuchiCegarLoop]: Abstraction has 41 states and 48 transitions. [2018-11-23 13:32:20,233 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-23 13:32:20,233 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 48 transitions. [2018-11-23 13:32:20,237 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2018-11-23 13:32:20,238 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:32:20,238 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:32:20,238 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [9, 9, 1, 1, 1, 1] [2018-11-23 13:32:20,238 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 13:32:20,238 INFO L794 eck$LassoCheckResult]: Stem: 1154#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1152#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; 1148#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; 1149#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 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; 1153#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);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1160#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1159#L23-3 assume !(main_~i~1 < 10); 1147#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; 1136#L9-3 [2018-11-23 13:32:20,238 INFO L796 eck$LassoCheckResult]: Loop: 1136#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1137#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; 1146#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 1141#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1136#L9-3 [2018-11-23 13:32:20,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:32:20,239 INFO L82 PathProgramCache]: Analyzing trace with hash -248065507, now seen corresponding path program 9 times [2018-11-23 13:32:20,239 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:32:20,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:32:20,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:20,239 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:32:20,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:20,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:32:20,316 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:32:20,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:32:20,316 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2d022fe4-7bac-4288-9777-1790a474ea02/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-11-23 13:32:20,323 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:32:20,378 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-23 13:32:20,378 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:32:20,379 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:32:20,385 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:32:20,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:32:20,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-11-23 13:32:20,400 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 13:32:20,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:32:20,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 10 times [2018-11-23 13:32:20,401 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:32:20,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:32:20,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:20,401 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:32:20,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:20,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:32:20,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:32:20,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 13:32:20,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 13:32:20,431 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. cyclomatic complexity: 12 Second operand 13 states. [2018-11-23 13:32:20,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:32:20,457 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2018-11-23 13:32:20,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 13:32:20,458 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 50 transitions. [2018-11-23 13:32:20,459 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2018-11-23 13:32:20,459 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 43 states and 50 transitions. [2018-11-23 13:32:20,459 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-11-23 13:32:20,459 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-11-23 13:32:20,459 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 50 transitions. [2018-11-23 13:32:20,459 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 13:32:20,459 INFO L705 BuchiCegarLoop]: Abstraction has 43 states and 50 transitions. [2018-11-23 13:32:20,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 50 transitions. [2018-11-23 13:32:20,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-11-23 13:32:20,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 13:32:20,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2018-11-23 13:32:20,461 INFO L728 BuchiCegarLoop]: Abstraction has 43 states and 50 transitions. [2018-11-23 13:32:20,461 INFO L608 BuchiCegarLoop]: Abstraction has 43 states and 50 transitions. [2018-11-23 13:32:20,461 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-23 13:32:20,461 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 50 transitions. [2018-11-23 13:32:20,462 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2018-11-23 13:32:20,462 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:32:20,462 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:32:20,462 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1] [2018-11-23 13:32:20,462 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 13:32:20,462 INFO L794 eck$LassoCheckResult]: Stem: 1319#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1315#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; 1311#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; 1312#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 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; 1316#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);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1323#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1322#L23-3 assume !(main_~i~1 < 10); 1310#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; 1299#L9-3 [2018-11-23 13:32:20,463 INFO L796 eck$LassoCheckResult]: Loop: 1299#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1300#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; 1309#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 1304#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1299#L9-3 [2018-11-23 13:32:20,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:32:20,463 INFO L82 PathProgramCache]: Analyzing trace with hash 2127272351, now seen corresponding path program 10 times [2018-11-23 13:32:20,463 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:32:20,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:32:20,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:20,463 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:32:20,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:20,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:32:20,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:32:20,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:32:20,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 11 times [2018-11-23 13:32:20,476 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:32:20,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:32:20,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:20,477 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:32:20,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:20,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:32:20,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:32:20,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:32:20,480 INFO L82 PathProgramCache]: Analyzing trace with hash -1776090044, now seen corresponding path program 1 times [2018-11-23 13:32:20,481 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:32:20,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:32:20,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:20,481 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:32:20,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:20,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:32:20,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:32:22,962 WARN L180 SmtUtils]: Spent 2.42 s on a formula simplification. DAG size of input: 198 DAG size of output: 154 [2018-11-23 13:32:23,051 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 13:32:23,051 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 13:32:23,051 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 13:32:23,051 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 13:32:23,052 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 13:32:23,052 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:32:23,052 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 13:32:23,052 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 13:32:23,052 INFO L131 ssoRankerPreferences]: Filename of dumped script: max10_true-unreach-call_true-termination.i_Iteration12_Lasso [2018-11-23 13:32:23,052 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 13:32:23,052 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 13:32:23,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:32:23,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:32:23,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:32:23,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:32:23,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:32:23,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:32:23,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:32:23,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:32:23,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:32:23,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:32:23,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:32:23,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:32:23,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:32:23,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:32:23,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:32:23,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:32:23,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:32:23,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:32:23,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:32:23,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:32:23,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:32:23,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:32:23,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:32:23,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:32:23,299 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 13:32:23,299 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 13:32:23,300 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:32:23,300 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:32:23,301 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:32:23,301 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:32:23,301 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:32:23,301 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:32:23,301 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:32:23,302 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:32:23,303 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:32:23,303 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:32:23,303 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:32:23,304 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:32:23,304 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:32:23,304 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:32:23,304 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:32:23,310 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:32:23,310 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:32:23,311 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:32:23,311 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:32:23,311 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:32:23,311 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:32:23,312 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:32:23,312 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:32:23,312 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:32:23,312 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:32:23,312 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:32:23,313 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:32:23,313 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:32:23,314 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:32:23,314 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:32:23,316 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:32:23,317 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:32:23,317 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:32:23,317 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:32:23,317 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:32:23,318 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:32:23,318 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:32:23,318 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:32:23,319 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:32:23,319 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:32:23,319 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:32:23,319 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:32:23,319 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:32:23,319 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:32:23,320 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:32:23,320 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:32:23,320 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:32:23,321 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:32:23,321 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:32:23,321 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:32:23,326 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:32:23,327 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:32:23,328 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:32:23,328 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:32:23,329 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:32:23,329 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:32:23,329 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:32:23,329 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:32:23,329 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:32:23,330 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:32:23,335 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:32:23,336 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:32:23,336 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:32:23,336 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:32:23,337 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:32:23,337 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:32:23,337 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:32:23,338 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:32:23,339 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:32:23,345 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:32:23,345 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:32:23,346 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:32:23,346 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 13:32:23,346 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:32:23,346 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:32:23,348 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 13:32:23,348 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:32:23,352 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:32:23,353 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:32:23,353 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:32:23,353 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:32:23,353 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:32:23,354 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:32:23,356 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:32:23,356 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:32:23,364 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 13:32:23,373 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 13:32:23,373 INFO L444 ModelExtractionUtils]: 15 out of 22 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-23 13:32:23,374 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 13:32:23,375 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 13:32:23,375 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 13:32:23,375 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-11-23 13:32:23,393 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-23 13:32:23,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:32:23,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:32:23,422 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:32:23,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:32:23,429 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:32:23,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:32:23,437 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 13:32:23,437 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 43 states and 50 transitions. cyclomatic complexity: 12 Second operand 3 states. [2018-11-23 13:32:23,451 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-11-23 13:32:23,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 13:32:23,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:32:23,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2018-11-23 13:32:23,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 24 letters. Loop has 4 letters. [2018-11-23 13:32:23,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:32:23,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 28 letters. Loop has 4 letters. [2018-11-23 13:32:23,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:32:23,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 24 letters. Loop has 8 letters. [2018-11-23 13:32:23,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:32:23,455 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 60 transitions. [2018-11-23 13:32:23,455 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2018-11-23 13:32:23,456 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 44 states and 52 transitions. [2018-11-23 13:32:23,456 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-11-23 13:32:23,456 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-23 13:32:23,456 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 52 transitions. [2018-11-23 13:32:23,457 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 13:32:23,457 INFO L705 BuchiCegarLoop]: Abstraction has 44 states and 52 transitions. [2018-11-23 13:32:23,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 52 transitions. [2018-11-23 13:32:23,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-11-23 13:32:23,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 13:32:23,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2018-11-23 13:32:23,463 INFO L728 BuchiCegarLoop]: Abstraction has 44 states and 52 transitions. [2018-11-23 13:32:23,463 INFO L608 BuchiCegarLoop]: Abstraction has 44 states and 52 transitions. [2018-11-23 13:32:23,463 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-23 13:32:23,464 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 52 transitions. [2018-11-23 13:32:23,464 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2018-11-23 13:32:23,465 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:32:23,466 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:32:23,466 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:32:23,466 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 13:32:23,467 INFO L794 eck$LassoCheckResult]: Stem: 1532#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1528#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; 1524#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; 1525#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 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; 1529#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);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1536#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1535#L23-3 assume !(main_~i~1 < 10); 1523#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; 1511#L9-3 assume !(max_~i~0 < 10); 1507#L9-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1508#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; 1533#L9-8 [2018-11-23 13:32:23,467 INFO L796 eck$LassoCheckResult]: Loop: 1533#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1518#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; 1509#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 1510#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1533#L9-8 [2018-11-23 13:32:23,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:32:23,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1328178489, now seen corresponding path program 1 times [2018-11-23 13:32:23,467 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:32:23,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:32:23,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:23,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:32:23,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:23,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:32:23,513 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-23 13:32:23,513 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:32:23,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 13:32:23,513 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 13:32:23,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:32:23,514 INFO L82 PathProgramCache]: Analyzing trace with hash 2373478, now seen corresponding path program 1 times [2018-11-23 13:32:23,514 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:32:23,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:32:23,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:23,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:32:23,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:23,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:32:23,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:32:23,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 13:32:23,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:32:23,552 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. cyclomatic complexity: 13 Second operand 3 states. [2018-11-23 13:32:23,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:32:23,584 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2018-11-23 13:32:23,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 13:32:23,585 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 65 transitions. [2018-11-23 13:32:23,586 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2018-11-23 13:32:23,586 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 55 states and 65 transitions. [2018-11-23 13:32:23,586 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2018-11-23 13:32:23,586 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-11-23 13:32:23,587 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 65 transitions. [2018-11-23 13:32:23,587 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 13:32:23,587 INFO L705 BuchiCegarLoop]: Abstraction has 55 states and 65 transitions. [2018-11-23 13:32:23,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 65 transitions. [2018-11-23 13:32:23,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 45. [2018-11-23 13:32:23,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 13:32:23,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2018-11-23 13:32:23,590 INFO L728 BuchiCegarLoop]: Abstraction has 45 states and 52 transitions. [2018-11-23 13:32:23,590 INFO L608 BuchiCegarLoop]: Abstraction has 45 states and 52 transitions. [2018-11-23 13:32:23,590 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-23 13:32:23,590 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 52 transitions. [2018-11-23 13:32:23,590 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2018-11-23 13:32:23,590 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:32:23,591 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:32:23,591 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:32:23,591 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 13:32:23,592 INFO L794 eck$LassoCheckResult]: Stem: 1634#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1633#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; 1629#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; 1630#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 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; 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);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1641#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1640#L23-3 assume !(main_~i~1 < 10); 1628#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; 1616#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1617#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1627#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 1622#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1618#L9-3 assume !(max_~i~0 < 10); 1612#L9-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1613#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; 1637#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1623#L10-3 [2018-11-23 13:32:23,592 INFO L796 eck$LassoCheckResult]: Loop: 1623#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; 1614#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 1615#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1638#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1623#L10-3 [2018-11-23 13:32:23,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:32:23,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1922451645, now seen corresponding path program 1 times [2018-11-23 13:32:23,592 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:32:23,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:32:23,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:23,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:32:23,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:23,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:32:23,649 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-23 13:32:23,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:32:23,649 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2d022fe4-7bac-4288-9777-1790a474ea02/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-11-23 13:32:23,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:32:23,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:32:23,704 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:32:23,716 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-23 13:32:23,747 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:32:23,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 13:32:23,747 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 13:32:23,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:32:23,748 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 2 times [2018-11-23 13:32:23,748 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:32:23,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:32:23,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:23,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:32:23,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:23,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:32:23,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:32:23,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 13:32:23,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:32:23,820 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. cyclomatic complexity: 12 Second operand 5 states. [2018-11-23 13:32:23,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:32:23,857 INFO L93 Difference]: Finished difference Result 67 states and 80 transitions. [2018-11-23 13:32:23,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 13:32:23,858 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 80 transitions. [2018-11-23 13:32:23,859 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2018-11-23 13:32:23,859 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 67 states and 80 transitions. [2018-11-23 13:32:23,859 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2018-11-23 13:32:23,859 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2018-11-23 13:32:23,860 INFO L73 IsDeterministic]: Start isDeterministic. Operand 67 states and 80 transitions. [2018-11-23 13:32:23,860 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 13:32:23,860 INFO L705 BuchiCegarLoop]: Abstraction has 67 states and 80 transitions. [2018-11-23 13:32:23,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states and 80 transitions. [2018-11-23 13:32:23,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 53. [2018-11-23 13:32:23,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-23 13:32:23,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 62 transitions. [2018-11-23 13:32:23,862 INFO L728 BuchiCegarLoop]: Abstraction has 53 states and 62 transitions. [2018-11-23 13:32:23,862 INFO L608 BuchiCegarLoop]: Abstraction has 53 states and 62 transitions. [2018-11-23 13:32:23,862 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-11-23 13:32:23,863 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 62 transitions. [2018-11-23 13:32:23,863 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2018-11-23 13:32:23,863 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:32:23,863 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:32:23,864 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:32:23,864 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 13:32:23,864 INFO L794 eck$LassoCheckResult]: Stem: 1851#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1848#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; 1844#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; 1845#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 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; 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; 1865#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; 1864#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);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1861#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1860#L23-3 assume !(main_~i~1 < 10); 1843#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; 1829#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1830#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1863#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 1836#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 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; 1841#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 1842#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1856#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; 1853#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1859#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1858#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 1854#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1852#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1837#L10-3 [2018-11-23 13:32:23,864 INFO L796 eck$LassoCheckResult]: Loop: 1837#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; 1825#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 1826#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1857#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1837#L10-3 [2018-11-23 13:32:23,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:32:23,865 INFO L82 PathProgramCache]: Analyzing trace with hash -1268480291, now seen corresponding path program 1 times [2018-11-23 13:32:23,865 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:32:23,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:32:23,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:23,865 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:32:23,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:23,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:32:23,897 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2018-11-23 13:32:23,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:32:23,897 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2d022fe4-7bac-4288-9777-1790a474ea02/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-11-23 13:32:23,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:32:23,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:32:23,943 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:32:23,953 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2018-11-23 13:32:23,978 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:32:23,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 13:32:23,979 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 13:32:23,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:32:23,979 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 3 times [2018-11-23 13:32:23,979 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:32:23,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:32:23,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:23,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:32:23,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:23,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:32:23,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:32:24,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 13:32:24,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:32:24,056 INFO L87 Difference]: Start difference. First operand 53 states and 62 transitions. cyclomatic complexity: 14 Second operand 6 states. [2018-11-23 13:32:24,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:32:24,112 INFO L93 Difference]: Finished difference Result 79 states and 95 transitions. [2018-11-23 13:32:24,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 13:32:24,113 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 79 states and 95 transitions. [2018-11-23 13:32:24,114 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2018-11-23 13:32:24,114 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 79 states to 79 states and 95 transitions. [2018-11-23 13:32:24,115 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2018-11-23 13:32:24,115 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2018-11-23 13:32:24,115 INFO L73 IsDeterministic]: Start isDeterministic. Operand 79 states and 95 transitions. [2018-11-23 13:32:24,115 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 13:32:24,115 INFO L705 BuchiCegarLoop]: Abstraction has 79 states and 95 transitions. [2018-11-23 13:32:24,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states and 95 transitions. [2018-11-23 13:32:24,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 61. [2018-11-23 13:32:24,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-23 13:32:24,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 72 transitions. [2018-11-23 13:32:24,118 INFO L728 BuchiCegarLoop]: Abstraction has 61 states and 72 transitions. [2018-11-23 13:32:24,118 INFO L608 BuchiCegarLoop]: Abstraction has 61 states and 72 transitions. [2018-11-23 13:32:24,118 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2018-11-23 13:32:24,119 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 61 states and 72 transitions. [2018-11-23 13:32:24,119 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2018-11-23 13:32:24,119 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:32:24,119 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:32:24,120 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:32:24,120 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 13:32:24,120 INFO L794 eck$LassoCheckResult]: Stem: 2112#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2107#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; 2103#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; 2104#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 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; 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);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 2123#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 2122#L23-3 assume !(main_~i~1 < 10); 2102#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; 2087#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2088#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 2143#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 2095#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2096#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2108#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 2109#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 2139#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 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; 2100#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 2101#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); 2085#L9-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 2086#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; 2142#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 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); 2094#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 2083#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 2084#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2141#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2120#L10-3 [2018-11-23 13:32:24,121 INFO L796 eck$LassoCheckResult]: Loop: 2120#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; 2140#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 2121#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2119#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2120#L10-3 [2018-11-23 13:32:24,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:32:24,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1567366653, now seen corresponding path program 2 times [2018-11-23 13:32:24,121 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:32:24,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:32:24,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:24,122 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:32:24,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:24,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:32:24,166 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2018-11-23 13:32:24,166 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:32:24,167 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2d022fe4-7bac-4288-9777-1790a474ea02/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-11-23 13:32:24,184 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:32:24,219 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:32:24,219 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:32:24,223 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:32:24,238 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2018-11-23 13:32:24,256 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:32:24,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-23 13:32:24,256 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 13:32:24,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:32:24,257 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 4 times [2018-11-23 13:32:24,257 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:32:24,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:32:24,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:24,258 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:32:24,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:24,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:32:24,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:32:24,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 13:32:24,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:32:24,301 INFO L87 Difference]: Start difference. First operand 61 states and 72 transitions. cyclomatic complexity: 16 Second operand 7 states. [2018-11-23 13:32:24,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:32:24,342 INFO L93 Difference]: Finished difference Result 91 states and 110 transitions. [2018-11-23 13:32:24,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 13:32:24,343 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 110 transitions. [2018-11-23 13:32:24,343 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2018-11-23 13:32:24,344 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 91 states and 110 transitions. [2018-11-23 13:32:24,344 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2018-11-23 13:32:24,344 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2018-11-23 13:32:24,344 INFO L73 IsDeterministic]: Start isDeterministic. Operand 91 states and 110 transitions. [2018-11-23 13:32:24,345 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 13:32:24,345 INFO L705 BuchiCegarLoop]: Abstraction has 91 states and 110 transitions. [2018-11-23 13:32:24,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states and 110 transitions. [2018-11-23 13:32:24,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 69. [2018-11-23 13:32:24,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-23 13:32:24,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 82 transitions. [2018-11-23 13:32:24,347 INFO L728 BuchiCegarLoop]: Abstraction has 69 states and 82 transitions. [2018-11-23 13:32:24,347 INFO L608 BuchiCegarLoop]: Abstraction has 69 states and 82 transitions. [2018-11-23 13:32:24,347 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ [2018-11-23 13:32:24,347 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states and 82 transitions. [2018-11-23 13:32:24,348 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2018-11-23 13:32:24,348 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:32:24,348 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:32:24,348 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:32:24,348 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 13:32:24,349 INFO L794 eck$LassoCheckResult]: Stem: 2412#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2409#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; 2405#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; 2406#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 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; 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);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 2424#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 2423#L23-3 assume !(main_~i~1 < 10); 2404#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; 2390#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2391#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 2454#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 2397#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 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; 2402#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 2403#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2453#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2452#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 2451#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 2449#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2447#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2418#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 2441#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 2419#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2417#L9-3 assume !(max_~i~0 < 10); 2386#L9-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 2387#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; 2414#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2450#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 2448#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 2415#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2413#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2398#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 2388#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 2389#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2446#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2445#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 2444#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 2443#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2442#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2421#L10-3 [2018-11-23 13:32:24,349 INFO L796 eck$LassoCheckResult]: Loop: 2421#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; 2440#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 2422#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2420#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2421#L10-3 [2018-11-23 13:32:24,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:32:24,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1948283363, now seen corresponding path program 3 times [2018-11-23 13:32:24,349 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:32:24,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:32:24,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:24,349 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:32:24,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:24,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:32:24,400 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2018-11-23 13:32:24,400 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:32:24,400 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2d022fe4-7bac-4288-9777-1790a474ea02/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-11-23 13:32:24,413 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:32:24,444 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-23 13:32:24,444 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:32:24,446 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:32:24,460 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2018-11-23 13:32:24,475 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:32:24,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 13:32:24,475 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 13:32:24,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:32:24,476 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 5 times [2018-11-23 13:32:24,476 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:32:24,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:32:24,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:24,476 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:32:24,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:24,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:32:24,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:32:24,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 13:32:24,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:32:24,523 INFO L87 Difference]: Start difference. First operand 69 states and 82 transitions. cyclomatic complexity: 18 Second operand 8 states. [2018-11-23 13:32:24,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:32:24,598 INFO L93 Difference]: Finished difference Result 103 states and 125 transitions. [2018-11-23 13:32:24,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 13:32:24,599 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 103 states and 125 transitions. [2018-11-23 13:32:24,600 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2018-11-23 13:32:24,600 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 103 states to 103 states and 125 transitions. [2018-11-23 13:32:24,600 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 60 [2018-11-23 13:32:24,600 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 60 [2018-11-23 13:32:24,600 INFO L73 IsDeterministic]: Start isDeterministic. Operand 103 states and 125 transitions. [2018-11-23 13:32:24,601 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 13:32:24,601 INFO L705 BuchiCegarLoop]: Abstraction has 103 states and 125 transitions. [2018-11-23 13:32:24,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states and 125 transitions. [2018-11-23 13:32:24,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 77. [2018-11-23 13:32:24,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-23 13:32:24,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 92 transitions. [2018-11-23 13:32:24,603 INFO L728 BuchiCegarLoop]: Abstraction has 77 states and 92 transitions. [2018-11-23 13:32:24,603 INFO L608 BuchiCegarLoop]: Abstraction has 77 states and 92 transitions. [2018-11-23 13:32:24,603 INFO L442 BuchiCegarLoop]: ======== Iteration 18============ [2018-11-23 13:32:24,603 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 77 states and 92 transitions. [2018-11-23 13:32:24,604 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2018-11-23 13:32:24,604 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:32:24,604 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:32:24,605 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:32:24,605 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 13:32:24,605 INFO L794 eck$LassoCheckResult]: Stem: 2759#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2757#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; 2753#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; 2754#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 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; 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);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 2773#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 2772#L23-3 assume !(main_~i~1 < 10); 2752#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; 2738#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2739#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 2758#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 2810#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 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; 2751#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 2745#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2746#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2809#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 2808#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 2807#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2806#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2805#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 2804#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 2803#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2802#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2767#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 2790#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 2768#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2766#L9-3 assume !(max_~i~0 < 10); 2734#L9-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 2735#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; 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); 2747#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 2736#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 2737#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2762#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2763#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 2801#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 2800#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2799#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2798#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 2797#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 2796#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2795#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2794#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 2793#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 2792#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2791#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2770#L10-3 [2018-11-23 13:32:24,605 INFO L796 eck$LassoCheckResult]: Loop: 2770#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; 2789#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 2771#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2769#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2770#L10-3 [2018-11-23 13:32:24,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:32:24,605 INFO L82 PathProgramCache]: Analyzing trace with hash -1984866499, now seen corresponding path program 4 times [2018-11-23 13:32:24,605 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:32:24,605 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:32:24,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:24,606 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:32:24,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:24,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:32:24,670 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2018-11-23 13:32:24,670 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:32:24,670 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2d022fe4-7bac-4288-9777-1790a474ea02/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-11-23 13:32:24,679 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 13:32:24,698 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 13:32:24,699 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:32:24,700 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:32:24,708 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2018-11-23 13:32:24,723 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:32:24,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-23 13:32:24,724 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 13:32:24,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:32:24,724 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 6 times [2018-11-23 13:32:24,724 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:32:24,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:32:24,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:24,725 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:32:24,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:24,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:32:24,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:32:24,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 13:32:24,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 13:32:24,785 INFO L87 Difference]: Start difference. First operand 77 states and 92 transitions. cyclomatic complexity: 20 Second operand 9 states. [2018-11-23 13:32:24,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:32:24,851 INFO L93 Difference]: Finished difference Result 115 states and 140 transitions. [2018-11-23 13:32:24,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 13:32:24,852 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 115 states and 140 transitions. [2018-11-23 13:32:24,852 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2018-11-23 13:32:24,853 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 115 states to 115 states and 140 transitions. [2018-11-23 13:32:24,853 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2018-11-23 13:32:24,853 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2018-11-23 13:32:24,853 INFO L73 IsDeterministic]: Start isDeterministic. Operand 115 states and 140 transitions. [2018-11-23 13:32:24,853 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 13:32:24,853 INFO L705 BuchiCegarLoop]: Abstraction has 115 states and 140 transitions. [2018-11-23 13:32:24,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states and 140 transitions. [2018-11-23 13:32:24,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 85. [2018-11-23 13:32:24,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-11-23 13:32:24,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 102 transitions. [2018-11-23 13:32:24,856 INFO L728 BuchiCegarLoop]: Abstraction has 85 states and 102 transitions. [2018-11-23 13:32:24,856 INFO L608 BuchiCegarLoop]: Abstraction has 85 states and 102 transitions. [2018-11-23 13:32:24,856 INFO L442 BuchiCegarLoop]: ======== Iteration 19============ [2018-11-23 13:32:24,856 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 85 states and 102 transitions. [2018-11-23 13:32:24,856 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2018-11-23 13:32:24,856 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:32:24,856 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:32:24,857 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 6, 6, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:32:24,857 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 13:32:24,857 INFO L794 eck$LassoCheckResult]: Stem: 3154#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3150#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; 3146#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; 3147#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 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; 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);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 3166#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 3165#L23-3 assume !(main_~i~1 < 10); 3145#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; 3131#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3132#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 3151#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 3211#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 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; 3144#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 3139#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 3140#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3210#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 3209#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 3208#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 3207#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3206#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 3205#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 3204#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 3203#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3202#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 3200#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 3199#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 3197#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3160#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 3183#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 3161#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 3159#L9-3 assume !(max_~i~0 < 10); 3129#L9-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 3130#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; 3156#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3201#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 3198#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 3157#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 3155#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3138#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 3127#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 3128#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 3196#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3195#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 3194#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 3193#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 3192#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3191#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 3190#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 3189#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 3188#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3187#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 3186#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 3185#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 3184#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3163#L10-3 [2018-11-23 13:32:24,858 INFO L796 eck$LassoCheckResult]: Loop: 3163#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; 3182#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 3164#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 3162#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3163#L10-3 [2018-11-23 13:32:24,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:32:24,859 INFO L82 PathProgramCache]: Analyzing trace with hash -325846691, now seen corresponding path program 5 times [2018-11-23 13:32:24,859 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:32:24,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:32:24,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:24,859 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:32:24,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:24,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:32:24,924 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-11-23 13:32:24,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:32:24,924 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2d022fe4-7bac-4288-9777-1790a474ea02/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-11-23 13:32:24,943 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 13:32:25,017 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2018-11-23 13:32:25,017 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:32:25,019 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:32:25,028 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-11-23 13:32:25,045 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:32:25,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-23 13:32:25,045 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 13:32:25,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:32:25,045 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 7 times [2018-11-23 13:32:25,045 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:32:25,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:32:25,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:25,046 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:32:25,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:25,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:32:25,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:32:25,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 13:32:25,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 13:32:25,088 INFO L87 Difference]: Start difference. First operand 85 states and 102 transitions. cyclomatic complexity: 22 Second operand 10 states. [2018-11-23 13:32:25,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:32:25,142 INFO L93 Difference]: Finished difference Result 127 states and 155 transitions. [2018-11-23 13:32:25,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 13:32:25,142 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 127 states and 155 transitions. [2018-11-23 13:32:25,143 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2018-11-23 13:32:25,143 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 127 states to 127 states and 155 transitions. [2018-11-23 13:32:25,143 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 76 [2018-11-23 13:32:25,143 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 76 [2018-11-23 13:32:25,143 INFO L73 IsDeterministic]: Start isDeterministic. Operand 127 states and 155 transitions. [2018-11-23 13:32:25,144 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 13:32:25,144 INFO L705 BuchiCegarLoop]: Abstraction has 127 states and 155 transitions. [2018-11-23 13:32:25,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states and 155 transitions. [2018-11-23 13:32:25,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 93. [2018-11-23 13:32:25,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-23 13:32:25,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 112 transitions. [2018-11-23 13:32:25,146 INFO L728 BuchiCegarLoop]: Abstraction has 93 states and 112 transitions. [2018-11-23 13:32:25,146 INFO L608 BuchiCegarLoop]: Abstraction has 93 states and 112 transitions. [2018-11-23 13:32:25,146 INFO L442 BuchiCegarLoop]: ======== Iteration 20============ [2018-11-23 13:32:25,146 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 93 states and 112 transitions. [2018-11-23 13:32:25,146 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2018-11-23 13:32:25,147 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:32:25,147 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:32:25,148 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 7, 7, 7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:32:25,148 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 13:32:25,148 INFO L794 eck$LassoCheckResult]: Stem: 3590#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3588#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; 3584#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; 3585#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 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; 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);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 3604#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 3603#L23-3 assume !(main_~i~1 < 10); 3583#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; 3569#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3570#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 3589#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 3657#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 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; 3582#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 3576#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 3577#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3656#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 3655#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 3654#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 3653#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3652#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 3651#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 3650#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 3649#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3648#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 3647#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 3646#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 3645#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3644#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 3643#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 3642#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 3641#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3598#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 3621#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 3599#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 3597#L9-3 assume !(max_~i~0 < 10); 3565#L9-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 3566#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; 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); 3578#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 3567#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 3568#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 3593#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3594#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 3640#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 3639#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 3638#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3637#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 3636#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 3635#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 3634#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3633#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 3632#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 3631#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 3630#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3629#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 3628#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 3627#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 3626#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3625#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 3624#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 3623#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 3622#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3601#L10-3 [2018-11-23 13:32:25,148 INFO L796 eck$LassoCheckResult]: Loop: 3601#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; 3620#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 3602#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 3600#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3601#L10-3 [2018-11-23 13:32:25,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:32:25,148 INFO L82 PathProgramCache]: Analyzing trace with hash -1241910147, now seen corresponding path program 6 times [2018-11-23 13:32:25,148 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:32:25,148 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:32:25,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:25,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:32:25,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:25,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:32:25,219 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2018-11-23 13:32:25,219 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:32:25,219 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2d022fe4-7bac-4288-9777-1790a474ea02/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-11-23 13:32:25,225 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 13:32:25,352 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2018-11-23 13:32:25,352 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:32:25,354 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:32:25,362 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2018-11-23 13:32:25,386 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:32:25,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-23 13:32:25,387 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 13:32:25,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:32:25,387 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 8 times [2018-11-23 13:32:25,387 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:32:25,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:32:25,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:25,388 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:32:25,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:25,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:32:25,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:32:25,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 13:32:25,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 13:32:25,435 INFO L87 Difference]: Start difference. First operand 93 states and 112 transitions. cyclomatic complexity: 24 Second operand 11 states. [2018-11-23 13:32:25,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:32:25,514 INFO L93 Difference]: Finished difference Result 139 states and 170 transitions. [2018-11-23 13:32:25,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 13:32:25,514 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 139 states and 170 transitions. [2018-11-23 13:32:25,515 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2018-11-23 13:32:25,516 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 139 states to 139 states and 170 transitions. [2018-11-23 13:32:25,516 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 84 [2018-11-23 13:32:25,516 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 84 [2018-11-23 13:32:25,516 INFO L73 IsDeterministic]: Start isDeterministic. Operand 139 states and 170 transitions. [2018-11-23 13:32:25,516 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 13:32:25,516 INFO L705 BuchiCegarLoop]: Abstraction has 139 states and 170 transitions. [2018-11-23 13:32:25,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states and 170 transitions. [2018-11-23 13:32:25,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 101. [2018-11-23 13:32:25,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-11-23 13:32:25,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 122 transitions. [2018-11-23 13:32:25,518 INFO L728 BuchiCegarLoop]: Abstraction has 101 states and 122 transitions. [2018-11-23 13:32:25,518 INFO L608 BuchiCegarLoop]: Abstraction has 101 states and 122 transitions. [2018-11-23 13:32:25,519 INFO L442 BuchiCegarLoop]: ======== Iteration 21============ [2018-11-23 13:32:25,519 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 101 states and 122 transitions. [2018-11-23 13:32:25,519 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2018-11-23 13:32:25,519 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:32:25,519 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:32:25,520 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 8, 8, 8, 8, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:32:25,520 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 13:32:25,520 INFO L794 eck$LassoCheckResult]: Stem: 4073#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 4071#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; 4067#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; 4068#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 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; 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);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 4087#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 4086#L23-3 assume !(main_~i~1 < 10); 4066#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; 4052#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4053#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4072#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 4148#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 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; 4065#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 4059#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4060#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4147#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4146#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 4145#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4144#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4143#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4142#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 4141#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4140#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4139#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4138#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 4137#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4136#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4135#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4134#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 4133#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4132#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4131#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4130#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 4129#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4128#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4081#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4104#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 4082#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4080#L9-3 assume !(max_~i~0 < 10); 4048#L9-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 4049#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; 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); 4061#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4050#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 4051#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4076#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4077#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4127#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 4126#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4125#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4124#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4123#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 4122#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4121#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4120#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4119#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 4118#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4117#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4116#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4115#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 4114#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4113#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4112#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4111#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 4110#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4109#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4108#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4107#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 4106#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4105#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4084#L10-3 [2018-11-23 13:32:25,520 INFO L796 eck$LassoCheckResult]: Loop: 4084#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; 4103#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 4085#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4083#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4084#L10-3 [2018-11-23 13:32:25,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:32:25,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1930807453, now seen corresponding path program 7 times [2018-11-23 13:32:25,521 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:32:25,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:32:25,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:25,521 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:32:25,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:25,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:32:25,625 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked. [2018-11-23 13:32:25,625 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:32:25,625 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2d022fe4-7bac-4288-9777-1790a474ea02/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-11-23 13:32:25,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:32:25,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:32:25,684 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:32:25,706 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked. [2018-11-23 13:32:25,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:32:25,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-23 13:32:25,721 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 13:32:25,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:32:25,722 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 9 times [2018-11-23 13:32:25,722 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:32:25,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:32:25,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:25,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:32:25,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:25,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:32:25,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:32:25,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 13:32:25,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 13:32:25,761 INFO L87 Difference]: Start difference. First operand 101 states and 122 transitions. cyclomatic complexity: 26 Second operand 12 states. [2018-11-23 13:32:25,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:32:25,858 INFO L93 Difference]: Finished difference Result 151 states and 185 transitions. [2018-11-23 13:32:25,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 13:32:25,858 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 151 states and 185 transitions. [2018-11-23 13:32:25,859 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2018-11-23 13:32:25,860 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 151 states to 151 states and 185 transitions. [2018-11-23 13:32:25,860 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 92 [2018-11-23 13:32:25,860 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 92 [2018-11-23 13:32:25,860 INFO L73 IsDeterministic]: Start isDeterministic. Operand 151 states and 185 transitions. [2018-11-23 13:32:25,860 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 13:32:25,861 INFO L705 BuchiCegarLoop]: Abstraction has 151 states and 185 transitions. [2018-11-23 13:32:25,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states and 185 transitions. [2018-11-23 13:32:25,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 109. [2018-11-23 13:32:25,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-11-23 13:32:25,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 132 transitions. [2018-11-23 13:32:25,863 INFO L728 BuchiCegarLoop]: Abstraction has 109 states and 132 transitions. [2018-11-23 13:32:25,863 INFO L608 BuchiCegarLoop]: Abstraction has 109 states and 132 transitions. [2018-11-23 13:32:25,863 INFO L442 BuchiCegarLoop]: ======== Iteration 22============ [2018-11-23 13:32:25,863 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 109 states and 132 transitions. [2018-11-23 13:32:25,863 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2018-11-23 13:32:25,863 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:32:25,863 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:32:25,864 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 9, 9, 9, 9, 9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:32:25,864 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 13:32:25,864 INFO L794 eck$LassoCheckResult]: Stem: 4601#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 4599#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; 4595#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; 4596#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 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; 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);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 4615#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 4614#L23-3 assume !(main_~i~1 < 10); 4594#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; 4580#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4581#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4600#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 4684#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 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; 4593#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 4587#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4588#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4683#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4682#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 4681#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4680#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4679#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4678#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 4677#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4676#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4675#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4674#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 4673#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4672#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4671#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4670#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 4669#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4668#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4667#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4666#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 4665#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4664#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4663#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4662#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 4661#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4660#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4609#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4632#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 4610#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4608#L9-3 assume !(max_~i~0 < 10); 4576#L9-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 4577#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; 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); 4589#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4578#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 4579#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4604#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4605#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4659#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 4658#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4657#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4656#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4655#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 4654#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4653#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4652#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4651#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 4650#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4649#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4648#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4647#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 4646#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4645#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4644#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4643#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 4642#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4641#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4640#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4639#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 4638#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4637#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4636#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4635#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 4634#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4633#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4612#L10-3 [2018-11-23 13:32:25,864 INFO L796 eck$LassoCheckResult]: Loop: 4612#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; 4631#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 4613#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4611#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4612#L10-3 [2018-11-23 13:32:25,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:32:25,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1557788093, now seen corresponding path program 8 times [2018-11-23 13:32:25,865 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:32:25,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:32:25,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:25,865 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:32:25,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:25,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:32:25,933 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-23 13:32:25,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:32:25,934 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2d022fe4-7bac-4288-9777-1790a474ea02/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-11-23 13:32:25,949 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:32:25,982 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:32:25,982 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:32:25,984 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:32:26,005 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-23 13:32:26,020 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:32:26,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-11-23 13:32:26,021 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 13:32:26,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:32:26,021 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 10 times [2018-11-23 13:32:26,021 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:32:26,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:32:26,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:26,022 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:32:26,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:26,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:32:26,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:32:26,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 13:32:26,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 13:32:26,062 INFO L87 Difference]: Start difference. First operand 109 states and 132 transitions. cyclomatic complexity: 28 Second operand 13 states. [2018-11-23 13:32:26,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:32:26,150 INFO L93 Difference]: Finished difference Result 154 states and 188 transitions. [2018-11-23 13:32:26,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 13:32:26,151 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 154 states and 188 transitions. [2018-11-23 13:32:26,152 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2018-11-23 13:32:26,153 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 154 states to 154 states and 188 transitions. [2018-11-23 13:32:26,153 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 94 [2018-11-23 13:32:26,153 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 94 [2018-11-23 13:32:26,153 INFO L73 IsDeterministic]: Start isDeterministic. Operand 154 states and 188 transitions. [2018-11-23 13:32:26,153 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 13:32:26,153 INFO L705 BuchiCegarLoop]: Abstraction has 154 states and 188 transitions. [2018-11-23 13:32:26,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states and 188 transitions. [2018-11-23 13:32:26,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 117. [2018-11-23 13:32:26,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-11-23 13:32:26,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 142 transitions. [2018-11-23 13:32:26,156 INFO L728 BuchiCegarLoop]: Abstraction has 117 states and 142 transitions. [2018-11-23 13:32:26,156 INFO L608 BuchiCegarLoop]: Abstraction has 117 states and 142 transitions. [2018-11-23 13:32:26,156 INFO L442 BuchiCegarLoop]: ======== Iteration 23============ [2018-11-23 13:32:26,156 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 117 states and 142 transitions. [2018-11-23 13:32:26,156 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2018-11-23 13:32:26,156 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:32:26,156 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:32:26,157 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:32:26,157 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 13:32:26,157 INFO L794 eck$LassoCheckResult]: Stem: 5165#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 5163#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; 5159#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; 5160#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 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; 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);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 5241#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 5240#L23-3 assume !(main_~i~1 < 10); 5158#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; 5144#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5145#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5164#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 5233#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 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; 5157#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 5151#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5152#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5230#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5228#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 5226#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5224#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5222#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5220#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 5218#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5216#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5214#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5212#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 5210#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5208#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5206#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5204#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 5202#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5200#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5198#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5196#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 5194#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5192#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5190#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5188#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 5186#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5184#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5182#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5181#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 5179#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5177#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5172#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5174#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 5173#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5171#L9-3 assume !(max_~i~0 < 10); 5140#L9-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 5141#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; 5168#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5153#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5142#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 5143#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 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); 5239#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5238#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 5237#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5236#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5235#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5234#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 5232#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5231#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5229#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5227#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 5225#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5223#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5221#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5219#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 5217#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5215#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5213#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5211#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 5209#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5207#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5205#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5203#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 5201#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5199#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5197#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5195#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 5193#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5191#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5189#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5187#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 5185#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5183#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5176#L10-3 [2018-11-23 13:32:26,157 INFO L796 eck$LassoCheckResult]: Loop: 5176#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; 5180#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 5178#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5175#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5176#L10-3 [2018-11-23 13:32:26,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:32:26,158 INFO L82 PathProgramCache]: Analyzing trace with hash 2012806109, now seen corresponding path program 9 times [2018-11-23 13:32:26,158 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:32:26,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:32:26,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:26,158 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:32:26,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:26,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:32:26,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:32:26,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:32:26,353 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 11 times [2018-11-23 13:32:26,353 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:32:26,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:32:26,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:26,354 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:32:26,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:26,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:32:26,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:32:26,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:32:26,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1723510376, now seen corresponding path program 1 times [2018-11-23 13:32:26,357 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:32:26,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:32:26,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:26,357 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:32:26,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:26,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:32:26,503 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 190 proven. 0 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2018-11-23 13:32:26,503 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:32:26,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-23 13:32:26,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 13:32:26,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2018-11-23 13:32:26,538 INFO L87 Difference]: Start difference. First operand 117 states and 142 transitions. cyclomatic complexity: 30 Second operand 15 states. [2018-11-23 13:32:26,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:32:26,726 INFO L93 Difference]: Finished difference Result 154 states and 185 transitions. [2018-11-23 13:32:26,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 13:32:26,728 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 154 states and 185 transitions. [2018-11-23 13:32:26,729 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 13:32:26,729 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 154 states to 112 states and 133 transitions. [2018-11-23 13:32:26,729 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2018-11-23 13:32:26,730 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 92 [2018-11-23 13:32:26,730 INFO L73 IsDeterministic]: Start isDeterministic. Operand 112 states and 133 transitions. [2018-11-23 13:32:26,730 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 13:32:26,730 INFO L705 BuchiCegarLoop]: Abstraction has 112 states and 133 transitions. [2018-11-23 13:32:26,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states and 133 transitions. [2018-11-23 13:32:26,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-11-23 13:32:26,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-11-23 13:32:26,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 133 transitions. [2018-11-23 13:32:26,732 INFO L728 BuchiCegarLoop]: Abstraction has 112 states and 133 transitions. [2018-11-23 13:32:26,732 INFO L608 BuchiCegarLoop]: Abstraction has 112 states and 133 transitions. [2018-11-23 13:32:26,732 INFO L442 BuchiCegarLoop]: ======== Iteration 24============ [2018-11-23 13:32:26,732 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 112 states and 133 transitions. [2018-11-23 13:32:26,732 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 13:32:26,732 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:32:26,732 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:32:26,733 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-11-23 13:32:26,733 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 13:32:26,734 INFO L794 eck$LassoCheckResult]: Stem: 5474#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 5470#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; 5466#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; 5467#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 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; 5509#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; 5507#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 5505#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; 5503#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 5501#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; 5499#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 5497#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; 5495#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 5493#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; 5491#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 5489#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; 5487#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 5485#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; 5483#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);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 5480#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 5479#L23-3 assume !(main_~i~1 < 10); 5464#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; 5465#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5544#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5463#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 5460#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5457#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5458#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5471#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 5541#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5539#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5537#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5535#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 5533#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5531#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5529#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5527#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 5525#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5523#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5521#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5519#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 5517#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5515#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5514#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5513#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 5512#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5511#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5510#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5508#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 5506#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5504#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5502#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5500#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 5498#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5496#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5494#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5492#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 5490#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5488#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5486#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5484#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 5482#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5478#L9-3 assume !(max_~i~0 < 10); 5455#L9-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 5456#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; 5476#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5564#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5563#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 5477#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5475#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5459#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5453#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 5454#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5562#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5561#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5560#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 5559#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5558#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5557#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5556#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 5555#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5554#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5553#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5552#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 5551#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5550#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5549#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5548#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 5547#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5546#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5545#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5543#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 5542#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5540#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5538#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5536#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 5534#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5532#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5530#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5528#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 5526#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5524#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5522#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5520#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 5518#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5516#L9-8 assume !(max_~i~0 < 10); 5472#L9-9 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 5473#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; 5461#L32-3 [2018-11-23 13:32:26,734 INFO L796 eck$LassoCheckResult]: Loop: 5461#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; 5462#L32-2 main_#t~post11 := main_~i~2;main_~i~2 := 1 + main_#t~post11;havoc main_#t~post11; 5461#L32-3 [2018-11-23 13:32:26,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:32:26,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1621163222, now seen corresponding path program 1 times [2018-11-23 13:32:26,736 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:32:26,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:32:26,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:26,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:32:26,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:26,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:32:26,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:32:26,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:32:26,966 INFO L82 PathProgramCache]: Analyzing trace with hash 3203, now seen corresponding path program 1 times [2018-11-23 13:32:26,967 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:32:26,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:32:26,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:26,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:32:26,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:26,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:32:26,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:32:26,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:32:26,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1135269864, now seen corresponding path program 1 times [2018-11-23 13:32:26,971 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:32:26,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:32:26,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:26,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:32:26,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:27,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:32:27,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:32:46,158 WARN L180 SmtUtils]: Spent 18.82 s on a formula simplification. DAG size of input: 624 DAG size of output: 466 [2018-11-23 13:32:47,007 WARN L180 SmtUtils]: Spent 743.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 146 [2018-11-23 13:32:47,009 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 13:32:47,009 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 13:32:47,009 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 13:32:47,009 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 13:32:47,009 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 13:32:47,010 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:32:47,010 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 13:32:47,010 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 13:32:47,010 INFO L131 ssoRankerPreferences]: Filename of dumped script: max10_true-unreach-call_true-termination.i_Iteration24_Lasso [2018-11-23 13:32:47,010 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 13:32:47,010 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 13:32:47,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:32:47,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:32:47,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:32:47,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:32:47,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:32:47,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:32:47,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-11-23 13:32:47,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:32:47,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-11-23 13:32:47,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-11-23 13:32:47,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-11-23 13:32:47,848 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 95 [2018-11-23 13:32:47,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-11-23 13:32:47,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-11-23 13:32:47,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:32:47,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:32:47,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:32:47,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:32:47,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:32:47,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:32:47,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:32:47,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:32:48,144 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 13:32:48,145 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 13:32:48,145 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:32:48,145 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:32:48,145 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:32:48,146 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:32:48,146 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:32:48,146 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:32:48,146 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:32:48,146 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:32:48,147 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:32:48,147 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:32:48,147 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:32:48,147 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:32:48,147 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:32:48,147 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:32:48,148 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:32:48,148 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:32:48,149 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:32:48,149 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:32:48,149 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:32:48,149 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:32:48,149 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:32:48,149 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:32:48,149 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:32:48,149 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:32:48,149 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:32:48,150 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:32:48,150 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:32:48,150 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:32:48,150 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:32:48,150 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:32:48,150 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:32:48,150 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:32:48,151 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:32:48,151 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:32:48,151 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:32:48,151 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:32:48,151 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:32:48,152 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:32:48,152 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:32:48,152 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:32:48,152 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:32:48,152 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:32:48,152 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:32:48,152 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:32:48,153 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:32:48,153 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:32:48,153 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:32:48,153 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:32:48,153 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:32:48,153 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:32:48,153 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:32:48,154 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:32:48,154 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:32:48,154 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:32:48,154 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:32:48,154 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:32:48,155 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:32:48,155 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:32:48,155 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:32:48,155 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:32:48,155 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:32:48,156 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:32:48,156 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:32:48,156 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:32:48,156 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:32:48,156 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:32:48,156 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:32:48,157 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:32:48,157 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:32:48,158 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:32:48,158 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:32:48,158 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:32:48,158 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:32:48,158 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:32:48,158 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:32:48,159 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:32:48,159 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:32:48,159 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:32:48,159 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:32:48,159 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:32:48,160 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:32:48,160 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:32:48,160 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:32:48,160 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:32:48,160 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:32:48,160 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:32:48,161 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:32:48,161 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:32:48,162 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:32:48,162 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:32:48,162 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:32:48,162 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:32:48,163 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:32:48,163 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:32:48,164 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:32:48,164 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:32:48,164 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:32:48,165 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:32:48,165 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:32:48,165 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:32:48,165 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:32:48,165 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:32:48,169 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:32:48,169 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:32:48,170 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:32:48,170 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:32:48,170 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:32:48,170 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:32:48,171 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:32:48,171 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:32:48,173 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:32:48,173 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:32:48,173 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:32:48,173 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:32:48,173 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:32:48,173 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:32:48,174 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:32:48,174 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:32:48,176 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:32:48,176 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:32:48,176 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:32:48,177 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:32:48,177 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:32:48,177 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:32:48,177 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:32:48,177 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:32:48,178 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:32:48,179 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:32:48,179 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:32:48,179 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:32:48,179 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:32:48,179 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:32:48,180 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:32:48,180 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:32:48,181 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:32:48,182 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:32:48,182 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:32:48,182 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:32:48,182 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:32:48,182 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:32:48,183 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:32:48,183 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:32:48,184 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:32:48,185 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:32:48,185 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:32:48,185 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:32:48,185 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:32:48,185 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:32:48,185 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:32:48,186 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:32:48,186 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:32:48,187 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:32:48,187 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:32:48,187 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:32:48,187 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:32:48,187 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:32:48,188 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:32:48,188 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:32:48,189 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:32:48,189 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:32:48,189 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:32:48,190 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:32:48,190 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:32:48,190 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:32:48,190 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:32:48,190 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:32:48,190 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:32:48,191 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:32:48,191 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:32:48,191 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:32:48,191 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:32:48,191 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:32:48,191 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:32:48,192 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:32:48,192 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:32:48,194 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:32:48,194 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:32:48,194 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:32:48,194 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:32:48,195 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:32:48,195 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:32:48,196 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:32:48,196 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:32:48,202 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 13:32:48,207 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 13:32:48,207 INFO L444 ModelExtractionUtils]: 16 out of 22 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-23 13:32:48,207 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 13:32:48,208 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 13:32:48,208 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 13:32:48,208 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~2) = -2*ULTIMATE.start_main_~i~2 + 17 Supporting invariants [] [2018-11-23 13:32:48,732 INFO L297 tatePredicateManager]: 138 out of 138 supporting invariants were superfluous and have been removed [2018-11-23 13:32:48,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:32:48,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:32:48,775 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:32:48,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:32:48,780 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:32:48,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:32:48,786 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 13:32:48,786 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 112 states and 133 transitions. cyclomatic complexity: 23 Second operand 3 states. [2018-11-23 13:32:48,792 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-11-23 13:32:48,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 13:32:48,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:32:48,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2018-11-23 13:32:48,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 24 transitions. Stem has 110 letters. Loop has 2 letters. [2018-11-23 13:32:48,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:32:48,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 24 transitions. Stem has 112 letters. Loop has 2 letters. [2018-11-23 13:32:48,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:32:48,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 24 transitions. Stem has 110 letters. Loop has 4 letters. [2018-11-23 13:32:48,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:32:48,795 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 114 states and 136 transitions. [2018-11-23 13:32:48,795 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 13:32:48,796 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 114 states to 0 states and 0 transitions. [2018-11-23 13:32:48,796 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-23 13:32:48,796 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-23 13:32:48,796 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-23 13:32:48,796 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 13:32:48,796 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 13:32:48,796 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 13:32:48,796 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 13:32:48,796 INFO L442 BuchiCegarLoop]: ======== Iteration 25============ [2018-11-23 13:32:48,796 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:32:48,796 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 13:32:48,796 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-23 13:32:48,801 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 01:32:48 BoogieIcfgContainer [2018-11-23 13:32:48,802 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 13:32:48,802 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 13:32:48,802 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 13:32:48,802 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 13:32:48,802 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:32:17" (3/4) ... [2018-11-23 13:32:48,805 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 13:32:48,805 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 13:32:48,806 INFO L168 Benchmark]: Toolchain (without parser) took 31303.31 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 418.9 MB). Free memory was 953.8 MB in the beginning and 1.4 GB in the end (delta: -396.6 MB). Peak memory consumption was 22.3 MB. Max. memory is 11.5 GB. [2018-11-23 13:32:48,810 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 13:32:48,810 INFO L168 Benchmark]: CACSL2BoogieTranslator took 181.66 ms. Allocated memory is still 1.0 GB. Free memory was 953.8 MB in the beginning and 943.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 13:32:48,811 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.24 ms. Allocated memory is still 1.0 GB. Free memory is still 940.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 13:32:48,811 INFO L168 Benchmark]: Boogie Preprocessor took 56.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 940.3 MB in the beginning and 1.1 GB in the end (delta: -206.1 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. [2018-11-23 13:32:48,811 INFO L168 Benchmark]: RCFGBuilder took 222.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. [2018-11-23 13:32:48,812 INFO L168 Benchmark]: BuchiAutomizer took 30812.74 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 267.4 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -225.4 MB). Peak memory consumption was 42.0 MB. Max. memory is 11.5 GB. [2018-11-23 13:32:48,812 INFO L168 Benchmark]: Witness Printer took 3.60 ms. Allocated memory is still 1.4 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 681.4 kB). Peak memory consumption was 681.4 kB. Max. memory is 11.5 GB. [2018-11-23 13:32:48,815 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 181.66 ms. Allocated memory is still 1.0 GB. Free memory was 953.8 MB in the beginning and 943.0 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 23.24 ms. Allocated memory is still 1.0 GB. Free memory is still 940.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 56.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 940.3 MB in the beginning and 1.1 GB in the end (delta: -206.1 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 222.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 30812.74 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 267.4 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -225.4 MB). Peak memory consumption was 42.0 MB. Max. memory is 11.5 GB. * Witness Printer took 3.60 ms. Allocated memory is still 1.4 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 681.4 kB). Peak memory consumption was 681.4 kB. 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 19 * unknown-#length-unknown[x] + -8 * i 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 -2 * i + 17 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 30.7s and 25 iterations. TraceHistogramMax:10. Analysis of lassos took 29.2s. Construction of modules took 0.7s. Büchi inclusion checks took 0.5s. 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: 631 SDtfs, 1167 SDslu, 1932 SDs, 0 SdLazy, 1113 SolverSat, 230 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU20 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital356 mio100 ax100 hnf99 lsp95 ukn45 mio100 lsp53 div100 bol100 ite100 ukn100 eq170 hnf84 smp100 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 9ms 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...