./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/reducercommutativity/max10-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_9b550e6a-2247-426e-aa16-ea7cf225410d/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_9b550e6a-2247-426e-aa16-ea7cf225410d/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_9b550e6a-2247-426e-aa16-ea7cf225410d/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_9b550e6a-2247-426e-aa16-ea7cf225410d/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/reducercommutativity/max10-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_9b550e6a-2247-426e-aa16-ea7cf225410d/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_9b550e6a-2247-426e-aa16-ea7cf225410d/bin/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.24-678e011 [2019-11-19 23:00:10,656 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 23:00:10,658 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 23:00:10,673 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 23:00:10,674 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 23:00:10,675 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 23:00:10,677 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 23:00:10,686 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 23:00:10,690 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 23:00:10,693 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 23:00:10,694 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 23:00:10,696 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 23:00:10,696 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 23:00:10,698 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 23:00:10,699 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 23:00:10,700 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 23:00:10,701 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 23:00:10,702 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 23:00:10,704 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 23:00:10,708 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 23:00:10,712 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 23:00:10,714 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 23:00:10,717 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 23:00:10,718 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 23:00:10,722 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 23:00:10,722 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 23:00:10,722 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 23:00:10,724 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 23:00:10,724 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 23:00:10,725 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 23:00:10,726 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 23:00:10,726 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 23:00:10,727 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 23:00:10,728 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 23:00:10,729 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 23:00:10,729 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 23:00:10,730 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 23:00:10,730 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 23:00:10,730 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 23:00:10,731 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 23:00:10,732 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 23:00:10,733 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_9b550e6a-2247-426e-aa16-ea7cf225410d/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-19 23:00:10,758 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 23:00:10,764 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 23:00:10,765 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 23:00:10,768 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 23:00:10,768 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 23:00:10,768 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-19 23:00:10,768 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-19 23:00:10,772 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-19 23:00:10,772 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-19 23:00:10,772 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-19 23:00:10,773 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-19 23:00:10,774 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 23:00:10,774 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 23:00:10,774 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-19 23:00:10,774 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 23:00:10,774 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 23:00:10,775 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 23:00:10,775 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-19 23:00:10,775 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-19 23:00:10,776 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-19 23:00:10,777 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 23:00:10,778 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 23:00:10,778 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-19 23:00:10,778 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 23:00:10,778 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-19 23:00:10,779 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 23:00:10,779 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 23:00:10,779 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-19 23:00:10,779 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 23:00:10,780 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 23:00:10,780 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-19 23:00:10,781 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-19 23:00:10,781 INFO L138 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/run_dir_9b550e6a-2247-426e-aa16-ea7cf225410d/bin/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 [2019-11-19 23:00:10,943 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 23:00:10,958 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 23:00:10,963 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 23:00:10,966 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 23:00:10,971 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 23:00:10,972 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_9b550e6a-2247-426e-aa16-ea7cf225410d/bin/uautomizer/../../sv-benchmarks/c/reducercommutativity/max10-1.i [2019-11-19 23:00:11,013 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9b550e6a-2247-426e-aa16-ea7cf225410d/bin/uautomizer/data/68e7a8b95/43d45924bb48457eabafa1fdd3d48caf/FLAGd3d788afc [2019-11-19 23:00:11,400 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 23:00:11,402 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_9b550e6a-2247-426e-aa16-ea7cf225410d/sv-benchmarks/c/reducercommutativity/max10-1.i [2019-11-19 23:00:11,407 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9b550e6a-2247-426e-aa16-ea7cf225410d/bin/uautomizer/data/68e7a8b95/43d45924bb48457eabafa1fdd3d48caf/FLAGd3d788afc [2019-11-19 23:00:11,767 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_9b550e6a-2247-426e-aa16-ea7cf225410d/bin/uautomizer/data/68e7a8b95/43d45924bb48457eabafa1fdd3d48caf [2019-11-19 23:00:11,770 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 23:00:11,771 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 23:00:11,773 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 23:00:11,773 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 23:00:11,776 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 23:00:11,777 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 11:00:11" (1/1) ... [2019-11-19 23:00:11,780 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c7b016e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:00:11, skipping insertion in model container [2019-11-19 23:00:11,780 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 11:00:11" (1/1) ... [2019-11-19 23:00:11,786 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 23:00:11,801 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 23:00:11,948 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 23:00:12,014 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 23:00:12,039 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 23:00:12,051 INFO L192 MainTranslator]: Completed translation [2019-11-19 23:00:12,051 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:00:12 WrapperNode [2019-11-19 23:00:12,051 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 23:00:12,052 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 23:00:12,052 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 23:00:12,052 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 23:00:12,058 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:00:12" (1/1) ... [2019-11-19 23:00:12,065 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:00:12" (1/1) ... [2019-11-19 23:00:12,088 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 23:00:12,089 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 23:00:12,089 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 23:00:12,089 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 23:00:12,098 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:00:12" (1/1) ... [2019-11-19 23:00:12,098 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:00:12" (1/1) ... [2019-11-19 23:00:12,101 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:00:12" (1/1) ... [2019-11-19 23:00:12,101 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:00:12" (1/1) ... [2019-11-19 23:00:12,108 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:00:12" (1/1) ... [2019-11-19 23:00:12,113 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:00:12" (1/1) ... [2019-11-19 23:00:12,115 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:00:12" (1/1) ... [2019-11-19 23:00:12,118 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 23:00:12,119 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 23:00:12,119 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 23:00:12,119 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 23:00:12,120 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:00:12" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9b550e6a-2247-426e-aa16-ea7cf225410d/bin/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 [2019-11-19 23:00:12,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-19 23:00:12,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 23:00:12,173 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 23:00:12,173 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-19 23:00:12,173 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-19 23:00:12,173 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-19 23:00:12,518 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 23:00:12,519 INFO L285 CfgBuilder]: Removed 15 assume(true) statements. [2019-11-19 23:00:12,520 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:00:12 BoogieIcfgContainer [2019-11-19 23:00:12,520 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 23:00:12,521 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-19 23:00:12,521 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-19 23:00:12,532 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-19 23:00:12,533 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-19 23:00:12,533 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.11 11:00:11" (1/3) ... [2019-11-19 23:00:12,534 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5757924e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 11:00:12, skipping insertion in model container [2019-11-19 23:00:12,534 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-19 23:00:12,534 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:00:12" (2/3) ... [2019-11-19 23:00:12,535 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5757924e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 11:00:12, skipping insertion in model container [2019-11-19 23:00:12,535 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-19 23:00:12,535 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:00:12" (3/3) ... [2019-11-19 23:00:12,537 INFO L371 chiAutomizerObserver]: Analyzing ICFG max10-1.i [2019-11-19 23:00:12,573 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-19 23:00:12,573 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-19 23:00:12,573 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-19 23:00:12,573 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 23:00:12,573 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 23:00:12,573 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-19 23:00:12,574 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 23:00:12,574 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-19 23:00:12,585 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states. [2019-11-19 23:00:12,603 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 16 [2019-11-19 23:00:12,604 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 23:00:12,604 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 23:00:12,609 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-19 23:00:12,609 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-19 23:00:12,609 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-19 23:00:12,609 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states. [2019-11-19 23:00:12,612 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 16 [2019-11-19 23:00:12,612 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 23:00:12,612 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 23:00:12,612 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-19 23:00:12,613 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-19 23:00:12,619 INFO L794 eck$LassoCheckResult]: Stem: 31#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 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.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 30#L23-3true [2019-11-19 23:00:12,619 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 [2019-11-19 23:00:12,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:00:12,624 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-11-19 23:00:12,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:00:12,630 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588992455] [2019-11-19 23:00:12,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:00:12,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:00:12,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:00:12,738 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 23:00:12,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:00:12,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2019-11-19 23:00:12,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:00:12,740 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481028130] [2019-11-19 23:00:12,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:00:12,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:00:12,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:00:12,755 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 23:00:12,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:00:12,756 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2019-11-19 23:00:12,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:00:12,757 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144904647] [2019-11-19 23:00:12,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:00:12,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:00:12,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:00:12,788 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 23:00:12,994 INFO L210 LassoAnalysis]: Preferences: [2019-11-19 23:00:12,996 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-19 23:00:12,996 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-19 23:00:12,996 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-19 23:00:12,996 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-19 23:00:12,996 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 23:00:12,997 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-19 23:00:12,997 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-19 23:00:12,997 INFO L133 ssoRankerPreferences]: Filename of dumped script: max10-1.i_Iteration1_Lasso [2019-11-19 23:00:12,997 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-19 23:00:12,997 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-19 23:00:13,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 23:00:13,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 23:00:13,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 23:00:13,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 23:00:13,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 23:00:13,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 23:00:13,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 23:00:13,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 23:00:13,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 23:00:13,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 23:00:13,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 23:00:13,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 23:00:13,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 23:00:13,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 23:00:13,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 23:00:13,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 23:00:13,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 23:00:13,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 23:00:13,350 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-19 23:00:13,354 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9b550e6a-2247-426e-aa16-ea7cf225410d/bin/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 23:00:13,360 INFO L120 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 [2019-11-19 23:00:13,363 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 23:00:13,363 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 23:00:13,363 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 23:00:13,364 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 23:00:13,364 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 23:00:13,366 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 23:00:13,366 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 23:00:13,370 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9b550e6a-2247-426e-aa16-ea7cf225410d/bin/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 23:00:13,393 INFO L120 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 [2019-11-19 23:00:13,396 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 23:00:13,396 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 23:00:13,397 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 23:00:13,397 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 23:00:13,403 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 23:00:13,404 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 23:00:13,412 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9b550e6a-2247-426e-aa16-ea7cf225410d/bin/uautomizer/z3 Starting monitored process 4 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 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 23:00:13,424 INFO L120 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 [2019-11-19 23:00:13,426 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 23:00:13,427 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 23:00:13,427 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 23:00:13,427 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 23:00:13,431 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 23:00:13,431 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 23:00:13,439 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9b550e6a-2247-426e-aa16-ea7cf225410d/bin/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 23:00:13,454 INFO L120 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 [2019-11-19 23:00:13,456 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 23:00:13,456 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 23:00:13,456 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 23:00:13,456 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 23:00:13,456 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 23:00:13,458 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 23:00:13,459 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 23:00:13,462 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9b550e6a-2247-426e-aa16-ea7cf225410d/bin/uautomizer/z3 Starting monitored process 6 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 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 23:00:13,477 INFO L120 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 [2019-11-19 23:00:13,479 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 23:00:13,479 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 23:00:13,480 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 23:00:13,480 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 23:00:13,483 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 23:00:13,483 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 23:00:13,488 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9b550e6a-2247-426e-aa16-ea7cf225410d/bin/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 23:00:13,501 INFO L120 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 Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 23:00:13,503 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 23:00:13,503 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 23:00:13,503 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 23:00:13,503 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 23:00:13,503 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 23:00:13,504 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 23:00:13,504 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 23:00:13,506 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9b550e6a-2247-426e-aa16-ea7cf225410d/bin/uautomizer/z3 Starting monitored process 8 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 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 23:00:13,520 INFO L120 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 [2019-11-19 23:00:13,522 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 23:00:13,522 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 23:00:13,522 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 23:00:13,522 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 23:00:13,529 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 23:00:13,529 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 23:00:13,538 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-19 23:00:13,575 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2019-11-19 23:00:13,575 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9b550e6a-2247-426e-aa16-ea7cf225410d/bin/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 23:00:13,581 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 23:00:13,585 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-19 23:00:13,585 INFO L510 LassoAnalysis]: Proved termination. [2019-11-19 23:00:13,586 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1, v_rep(select #length ULTIMATE.start_main_~#x~0.base)_1) = -8*ULTIMATE.start_main_~i~1 + 19*v_rep(select #length ULTIMATE.start_main_~#x~0.base)_1 Supporting invariants [] [2019-11-19 23:00:13,601 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2019-11-19 23:00:13,609 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-19 23:00:13,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:00:13,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:00:13,649 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 23:00:13,651 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:00:13,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:00:13,666 WARN L253 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-19 23:00:13,667 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:00:13,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:00:13,706 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 [2019-11-19 23:00:13,708 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states. Second operand 3 states. [2019-11-19 23:00:13,813 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. [2019-11-19 23:00:13,813 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 [2019-11-19 23:00:13,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-19 23:00:13,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 79 transitions. [2019-11-19 23:00:13,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 79 transitions. Stem has 2 letters. Loop has 2 letters. [2019-11-19 23:00:13,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 23:00:13,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 79 transitions. Stem has 4 letters. Loop has 2 letters. [2019-11-19 23:00:13,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 23:00:13,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 79 transitions. Stem has 2 letters. Loop has 4 letters. [2019-11-19 23:00:13,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 23:00:13,820 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 119 transitions. [2019-11-19 23:00:13,832 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2019-11-19 23:00:13,841 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 25 states and 33 transitions. [2019-11-19 23:00:13,842 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2019-11-19 23:00:13,842 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2019-11-19 23:00:13,842 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 33 transitions. [2019-11-19 23:00:13,843 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 23:00:13,843 INFO L688 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2019-11-19 23:00:13,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 33 transitions. [2019-11-19 23:00:13,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-11-19 23:00:13,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-19 23:00:13,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2019-11-19 23:00:13,865 INFO L711 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2019-11-19 23:00:13,865 INFO L591 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2019-11-19 23:00:13,865 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-19 23:00:13,865 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 33 transitions. [2019-11-19 23:00:13,866 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2019-11-19 23:00:13,866 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 23:00:13,866 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 23:00:13,866 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-19 23:00:13,866 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-19 23:00:13,866 INFO L794 eck$LassoCheckResult]: Stem: 181#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 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.allocOnStack(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 [2019-11-19 23:00:13,867 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~mem1;havoc max_#t~ite3; 168#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 163#L9-3 [2019-11-19 23:00:13,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:00:13,867 INFO L82 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2019-11-19 23:00:13,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:00:13,867 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839813979] [2019-11-19 23:00:13,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:00:13,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:00:13,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:00:13,908 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839813979] [2019-11-19 23:00:13,909 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:00:13,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:00:13,909 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150723047] [2019-11-19 23:00:13,912 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-19 23:00:13,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:00:13,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 1 times [2019-11-19 23:00:13,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:00:13,913 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263405020] [2019-11-19 23:00:13,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:00:13,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:00:13,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:00:13,939 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 23:00:13,994 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:00:13,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:00:13,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:00:13,998 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. cyclomatic complexity: 13 Second operand 3 states. [2019-11-19 23:00:14,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:00:14,011 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2019-11-19 23:00:14,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:00:14,012 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 33 transitions. [2019-11-19 23:00:14,013 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2019-11-19 23:00:14,013 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 33 transitions. [2019-11-19 23:00:14,014 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2019-11-19 23:00:14,014 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2019-11-19 23:00:14,014 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 33 transitions. [2019-11-19 23:00:14,014 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 23:00:14,014 INFO L688 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2019-11-19 23:00:14,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 33 transitions. [2019-11-19 23:00:14,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2019-11-19 23:00:14,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-19 23:00:14,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2019-11-19 23:00:14,017 INFO L711 BuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2019-11-19 23:00:14,017 INFO L591 BuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2019-11-19 23:00:14,017 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-19 23:00:14,018 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 32 transitions. [2019-11-19 23:00:14,018 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2019-11-19 23:00:14,018 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 23:00:14,019 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 23:00:14,019 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-19 23:00:14,019 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-19 23:00:14,019 INFO L794 eck$LassoCheckResult]: Stem: 238#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 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.allocOnStack(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 [2019-11-19 23:00:14,019 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~mem1;havoc max_#t~ite3; 225#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 220#L9-3 [2019-11-19 23:00:14,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:00:14,020 INFO L82 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2019-11-19 23:00:14,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:00:14,020 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588653322] [2019-11-19 23:00:14,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:00:14,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:00:14,056 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:00:14,056 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588653322] [2019-11-19 23:00:14,057 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1688690948] [2019-11-19 23:00:14,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9b550e6a-2247-426e-aa16-ea7cf225410d/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:00:14,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:00:14,096 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-19 23:00:14,097 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:00:14,108 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:00:14,108 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 23:00:14,108 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-11-19 23:00:14,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288105] [2019-11-19 23:00:14,109 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-19 23:00:14,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:00:14,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 2 times [2019-11-19 23:00:14,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:00:14,110 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714079923] [2019-11-19 23:00:14,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:00:14,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:00:14,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:00:14,122 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 23:00:14,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:00:14,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 23:00:14,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:00:14,180 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. cyclomatic complexity: 12 Second operand 5 states. [2019-11-19 23:00:14,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:00:14,200 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2019-11-19 23:00:14,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:00:14,202 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 35 transitions. [2019-11-19 23:00:14,203 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2019-11-19 23:00:14,204 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 35 transitions. [2019-11-19 23:00:14,204 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2019-11-19 23:00:14,204 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2019-11-19 23:00:14,205 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 35 transitions. [2019-11-19 23:00:14,205 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 23:00:14,205 INFO L688 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2019-11-19 23:00:14,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 35 transitions. [2019-11-19 23:00:14,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2019-11-19 23:00:14,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-19 23:00:14,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2019-11-19 23:00:14,208 INFO L711 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2019-11-19 23:00:14,208 INFO L591 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2019-11-19 23:00:14,208 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-19 23:00:14,208 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 34 transitions. [2019-11-19 23:00:14,209 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2019-11-19 23:00:14,209 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 23:00:14,209 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 23:00:14,209 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2019-11-19 23:00:14,209 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-19 23:00:14,210 INFO L794 eck$LassoCheckResult]: Stem: 313#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 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.allocOnStack(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 [2019-11-19 23:00:14,210 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~mem1;havoc max_#t~ite3; 301#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 296#L9-3 [2019-11-19 23:00:14,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:00:14,210 INFO L82 PathProgramCache]: Analyzing trace with hash 265236367, now seen corresponding path program 2 times [2019-11-19 23:00:14,210 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:00:14,211 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609696715] [2019-11-19 23:00:14,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:00:14,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:00:14,262 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:00:14,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609696715] [2019-11-19 23:00:14,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [737316394] [2019-11-19 23:00:14,263 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9b550e6a-2247-426e-aa16-ea7cf225410d/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:00:14,303 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-19 23:00:14,303 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 23:00:14,304 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-19 23:00:14,305 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:00:14,314 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:00:14,314 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 23:00:14,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-11-19 23:00:14,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549070184] [2019-11-19 23:00:14,315 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-19 23:00:14,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:00:14,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 3 times [2019-11-19 23:00:14,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:00:14,316 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339571231] [2019-11-19 23:00:14,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:00:14,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:00:14,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:00:14,329 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 23:00:14,375 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:00:14,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 23:00:14,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-19 23:00:14,376 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. cyclomatic complexity: 12 Second operand 6 states. [2019-11-19 23:00:14,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:00:14,400 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2019-11-19 23:00:14,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 23:00:14,404 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 37 transitions. [2019-11-19 23:00:14,405 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2019-11-19 23:00:14,405 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 37 transitions. [2019-11-19 23:00:14,406 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2019-11-19 23:00:14,406 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2019-11-19 23:00:14,406 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 37 transitions. [2019-11-19 23:00:14,406 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 23:00:14,406 INFO L688 BuchiCegarLoop]: Abstraction has 30 states and 37 transitions. [2019-11-19 23:00:14,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 37 transitions. [2019-11-19 23:00:14,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-11-19 23:00:14,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-19 23:00:14,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2019-11-19 23:00:14,409 INFO L711 BuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2019-11-19 23:00:14,410 INFO L591 BuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2019-11-19 23:00:14,410 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-19 23:00:14,410 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 36 transitions. [2019-11-19 23:00:14,411 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2019-11-19 23:00:14,411 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 23:00:14,411 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 23:00:14,412 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1] [2019-11-19 23:00:14,412 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-19 23:00:14,412 INFO L794 eck$LassoCheckResult]: Stem: 401#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 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.allocOnStack(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 [2019-11-19 23:00:14,412 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~mem1;havoc max_#t~ite3; 388#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 383#L9-3 [2019-11-19 23:00:14,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:00:14,413 INFO L82 PathProgramCache]: Analyzing trace with hash 1489134225, now seen corresponding path program 3 times [2019-11-19 23:00:14,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:00:14,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783365350] [2019-11-19 23:00:14,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:00:14,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:00:14,483 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:00:14,483 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783365350] [2019-11-19 23:00:14,483 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [7207677] [2019-11-19 23:00:14,484 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9b550e6a-2247-426e-aa16-ea7cf225410d/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:00:14,532 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-19 23:00:14,532 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 23:00:14,533 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-19 23:00:14,535 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:00:14,548 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:00:14,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 23:00:14,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-11-19 23:00:14,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427775408] [2019-11-19 23:00:14,549 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-19 23:00:14,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:00:14,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 4 times [2019-11-19 23:00:14,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:00:14,550 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021078992] [2019-11-19 23:00:14,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:00:14,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:00:14,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:00:14,571 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 23:00:14,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:00:14,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-19 23:00:14,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-19 23:00:14,638 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. cyclomatic complexity: 12 Second operand 7 states. [2019-11-19 23:00:14,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:00:14,662 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2019-11-19 23:00:14,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 23:00:14,663 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 39 transitions. [2019-11-19 23:00:14,663 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2019-11-19 23:00:14,664 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 32 states and 39 transitions. [2019-11-19 23:00:14,664 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2019-11-19 23:00:14,664 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2019-11-19 23:00:14,664 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 39 transitions. [2019-11-19 23:00:14,665 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 23:00:14,665 INFO L688 BuchiCegarLoop]: Abstraction has 32 states and 39 transitions. [2019-11-19 23:00:14,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 39 transitions. [2019-11-19 23:00:14,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-11-19 23:00:14,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-19 23:00:14,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2019-11-19 23:00:14,668 INFO L711 BuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2019-11-19 23:00:14,668 INFO L591 BuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2019-11-19 23:00:14,668 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-19 23:00:14,668 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 38 transitions. [2019-11-19 23:00:14,668 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2019-11-19 23:00:14,669 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 23:00:14,669 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 23:00:14,669 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2019-11-19 23:00:14,669 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-19 23:00:14,669 INFO L794 eck$LassoCheckResult]: Stem: 501#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 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.allocOnStack(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 [2019-11-19 23:00:14,670 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~mem1;havoc max_#t~ite3; 486#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 481#L9-3 [2019-11-19 23:00:14,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:00:14,673 INFO L82 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 4 times [2019-11-19 23:00:14,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:00:14,673 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471738135] [2019-11-19 23:00:14,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:00:14,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:00:14,748 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:00:14,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471738135] [2019-11-19 23:00:14,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [689742619] [2019-11-19 23:00:14,748 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9b550e6a-2247-426e-aa16-ea7cf225410d/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:00:14,800 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-19 23:00:14,801 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 23:00:14,801 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-19 23:00:14,803 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:00:14,812 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:00:14,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 23:00:14,815 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-11-19 23:00:14,815 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555105967] [2019-11-19 23:00:14,816 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-19 23:00:14,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:00:14,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 5 times [2019-11-19 23:00:14,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:00:14,817 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586643521] [2019-11-19 23:00:14,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:00:14,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:00:14,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:00:14,838 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 23:00:14,894 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:00:14,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-19 23:00:14,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-11-19 23:00:14,895 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. cyclomatic complexity: 12 Second operand 8 states. [2019-11-19 23:00:14,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:00:14,935 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2019-11-19 23:00:14,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-19 23:00:14,938 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 41 transitions. [2019-11-19 23:00:14,938 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2019-11-19 23:00:14,939 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 41 transitions. [2019-11-19 23:00:14,939 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2019-11-19 23:00:14,939 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2019-11-19 23:00:14,939 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 41 transitions. [2019-11-19 23:00:14,940 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 23:00:14,940 INFO L688 BuchiCegarLoop]: Abstraction has 34 states and 41 transitions. [2019-11-19 23:00:14,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 41 transitions. [2019-11-19 23:00:14,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-11-19 23:00:14,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-19 23:00:14,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2019-11-19 23:00:14,942 INFO L711 BuchiCegarLoop]: Abstraction has 33 states and 40 transitions. [2019-11-19 23:00:14,942 INFO L591 BuchiCegarLoop]: Abstraction has 33 states and 40 transitions. [2019-11-19 23:00:14,942 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-19 23:00:14,942 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 40 transitions. [2019-11-19 23:00:14,943 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2019-11-19 23:00:14,943 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 23:00:14,943 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 23:00:14,943 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1] [2019-11-19 23:00:14,944 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-19 23:00:14,944 INFO L794 eck$LassoCheckResult]: Stem: 608#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 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.allocOnStack(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 [2019-11-19 23:00:14,944 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~mem1;havoc max_#t~ite3; 595#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 590#L9-3 [2019-11-19 23:00:14,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:00:14,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1745699051, now seen corresponding path program 5 times [2019-11-19 23:00:14,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:00:14,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640449109] [2019-11-19 23:00:14,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:00:14,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:00:15,022 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:00:15,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640449109] [2019-11-19 23:00:15,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1120378136] [2019-11-19 23:00:15,023 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9b550e6a-2247-426e-aa16-ea7cf225410d/bin/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:00:15,077 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-11-19 23:00:15,077 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 23:00:15,079 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-19 23:00:15,080 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:00:15,096 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:00:15,096 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 23:00:15,096 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-11-19 23:00:15,096 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474444924] [2019-11-19 23:00:15,097 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-19 23:00:15,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:00:15,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 6 times [2019-11-19 23:00:15,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:00:15,097 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72092485] [2019-11-19 23:00:15,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:00:15,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:00:15,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:00:15,103 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 23:00:15,155 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:00:15,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-19 23:00:15,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-11-19 23:00:15,156 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. cyclomatic complexity: 12 Second operand 9 states. [2019-11-19 23:00:15,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:00:15,194 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2019-11-19 23:00:15,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-19 23:00:15,198 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 43 transitions. [2019-11-19 23:00:15,198 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2019-11-19 23:00:15,199 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 36 states and 43 transitions. [2019-11-19 23:00:15,199 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2019-11-19 23:00:15,199 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2019-11-19 23:00:15,199 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 43 transitions. [2019-11-19 23:00:15,200 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 23:00:15,200 INFO L688 BuchiCegarLoop]: Abstraction has 36 states and 43 transitions. [2019-11-19 23:00:15,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 43 transitions. [2019-11-19 23:00:15,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2019-11-19 23:00:15,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-19 23:00:15,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2019-11-19 23:00:15,202 INFO L711 BuchiCegarLoop]: Abstraction has 35 states and 42 transitions. [2019-11-19 23:00:15,202 INFO L591 BuchiCegarLoop]: Abstraction has 35 states and 42 transitions. [2019-11-19 23:00:15,202 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-19 23:00:15,203 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 42 transitions. [2019-11-19 23:00:15,203 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2019-11-19 23:00:15,203 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 23:00:15,203 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 23:00:15,204 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 1, 1, 1, 1] [2019-11-19 23:00:15,204 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-19 23:00:15,204 INFO L794 eck$LassoCheckResult]: Stem: 728#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 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.allocOnStack(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 [2019-11-19 23:00:15,204 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~mem1;havoc max_#t~ite3; 715#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 710#L9-3 [2019-11-19 23:00:15,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:00:15,208 INFO L82 PathProgramCache]: Analyzing trace with hash 1715480727, now seen corresponding path program 6 times [2019-11-19 23:00:15,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:00:15,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265257552] [2019-11-19 23:00:15,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:00:15,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:00:15,291 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:00:15,291 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265257552] [2019-11-19 23:00:15,291 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1049809923] [2019-11-19 23:00:15,291 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9b550e6a-2247-426e-aa16-ea7cf225410d/bin/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:00:15,346 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-11-19 23:00:15,346 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 23:00:15,347 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-19 23:00:15,349 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:00:15,359 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:00:15,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 23:00:15,359 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-11-19 23:00:15,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173211724] [2019-11-19 23:00:15,360 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-19 23:00:15,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:00:15,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 7 times [2019-11-19 23:00:15,360 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:00:15,361 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886511325] [2019-11-19 23:00:15,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:00:15,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:00:15,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:00:15,368 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 23:00:15,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:00:15,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-19 23:00:15,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-11-19 23:00:15,415 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. cyclomatic complexity: 12 Second operand 10 states. [2019-11-19 23:00:15,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:00:15,453 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2019-11-19 23:00:15,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-19 23:00:15,453 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 45 transitions. [2019-11-19 23:00:15,454 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2019-11-19 23:00:15,454 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 38 states and 45 transitions. [2019-11-19 23:00:15,455 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2019-11-19 23:00:15,455 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2019-11-19 23:00:15,455 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 45 transitions. [2019-11-19 23:00:15,455 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 23:00:15,455 INFO L688 BuchiCegarLoop]: Abstraction has 38 states and 45 transitions. [2019-11-19 23:00:15,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 45 transitions. [2019-11-19 23:00:15,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2019-11-19 23:00:15,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-11-19 23:00:15,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2019-11-19 23:00:15,458 INFO L711 BuchiCegarLoop]: Abstraction has 37 states and 44 transitions. [2019-11-19 23:00:15,458 INFO L591 BuchiCegarLoop]: Abstraction has 37 states and 44 transitions. [2019-11-19 23:00:15,458 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-19 23:00:15,458 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 44 transitions. [2019-11-19 23:00:15,459 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2019-11-19 23:00:15,459 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 23:00:15,459 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 23:00:15,459 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [7, 7, 1, 1, 1, 1] [2019-11-19 23:00:15,459 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-19 23:00:15,460 INFO L794 eck$LassoCheckResult]: Stem: 859#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 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.allocOnStack(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 [2019-11-19 23:00:15,460 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~mem1;havoc max_#t~ite3; 846#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 841#L9-3 [2019-11-19 23:00:15,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:00:15,460 INFO L82 PathProgramCache]: Analyzing trace with hash -690407015, now seen corresponding path program 7 times [2019-11-19 23:00:15,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:00:15,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427153800] [2019-11-19 23:00:15,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:00:15,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:00:15,559 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:00:15,559 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427153800] [2019-11-19 23:00:15,559 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2015699315] [2019-11-19 23:00:15,559 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9b550e6a-2247-426e-aa16-ea7cf225410d/bin/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:00:15,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:00:15,622 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-19 23:00:15,624 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:00:15,634 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:00:15,638 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 23:00:15,638 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-11-19 23:00:15,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807602616] [2019-11-19 23:00:15,641 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-19 23:00:15,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:00:15,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 8 times [2019-11-19 23:00:15,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:00:15,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168503327] [2019-11-19 23:00:15,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:00:15,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:00:15,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:00:15,653 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 23:00:15,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:00:15,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-19 23:00:15,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-11-19 23:00:15,699 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. cyclomatic complexity: 12 Second operand 11 states. [2019-11-19 23:00:15,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:00:15,734 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2019-11-19 23:00:15,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-19 23:00:15,736 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 47 transitions. [2019-11-19 23:00:15,736 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2019-11-19 23:00:15,737 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 40 states and 47 transitions. [2019-11-19 23:00:15,737 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2019-11-19 23:00:15,737 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2019-11-19 23:00:15,737 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 47 transitions. [2019-11-19 23:00:15,738 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 23:00:15,738 INFO L688 BuchiCegarLoop]: Abstraction has 40 states and 47 transitions. [2019-11-19 23:00:15,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 47 transitions. [2019-11-19 23:00:15,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2019-11-19 23:00:15,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-19 23:00:15,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2019-11-19 23:00:15,740 INFO L711 BuchiCegarLoop]: Abstraction has 39 states and 46 transitions. [2019-11-19 23:00:15,740 INFO L591 BuchiCegarLoop]: Abstraction has 39 states and 46 transitions. [2019-11-19 23:00:15,741 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-19 23:00:15,741 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 46 transitions. [2019-11-19 23:00:15,741 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2019-11-19 23:00:15,741 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 23:00:15,741 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 23:00:15,742 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1, 1] [2019-11-19 23:00:15,742 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-19 23:00:15,742 INFO L794 eck$LassoCheckResult]: Stem: 1003#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 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.allocOnStack(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 [2019-11-19 23:00:15,742 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~mem1;havoc max_#t~ite3; 988#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 983#L9-3 [2019-11-19 23:00:15,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:00:15,743 INFO L82 PathProgramCache]: Analyzing trace with hash -2056121829, now seen corresponding path program 8 times [2019-11-19 23:00:15,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:00:15,743 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490838862] [2019-11-19 23:00:15,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:00:15,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:00:15,861 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:00:15,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490838862] [2019-11-19 23:00:15,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [332190649] [2019-11-19 23:00:15,861 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9b550e6a-2247-426e-aa16-ea7cf225410d/bin/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:00:15,908 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-19 23:00:15,908 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 23:00:15,909 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-19 23:00:15,911 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:00:15,927 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:00:15,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 23:00:15,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-11-19 23:00:15,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000715621] [2019-11-19 23:00:15,930 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-19 23:00:15,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:00:15,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 9 times [2019-11-19 23:00:15,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:00:15,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597432143] [2019-11-19 23:00:15,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:00:15,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:00:15,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:00:15,946 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 23:00:15,994 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:00:15,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-19 23:00:15,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-11-19 23:00:15,994 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. cyclomatic complexity: 12 Second operand 12 states. [2019-11-19 23:00:16,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:00:16,034 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2019-11-19 23:00:16,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-19 23:00:16,035 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 49 transitions. [2019-11-19 23:00:16,036 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2019-11-19 23:00:16,036 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 42 states and 49 transitions. [2019-11-19 23:00:16,036 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2019-11-19 23:00:16,036 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2019-11-19 23:00:16,037 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 49 transitions. [2019-11-19 23:00:16,037 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 23:00:16,037 INFO L688 BuchiCegarLoop]: Abstraction has 42 states and 49 transitions. [2019-11-19 23:00:16,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 49 transitions. [2019-11-19 23:00:16,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2019-11-19 23:00:16,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-19 23:00:16,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2019-11-19 23:00:16,039 INFO L711 BuchiCegarLoop]: Abstraction has 41 states and 48 transitions. [2019-11-19 23:00:16,039 INFO L591 BuchiCegarLoop]: Abstraction has 41 states and 48 transitions. [2019-11-19 23:00:16,040 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-19 23:00:16,040 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 48 transitions. [2019-11-19 23:00:16,040 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2019-11-19 23:00:16,040 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 23:00:16,042 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 23:00:16,043 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [9, 9, 1, 1, 1, 1] [2019-11-19 23:00:16,043 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-19 23:00:16,043 INFO L794 eck$LassoCheckResult]: Stem: 1154#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 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.allocOnStack(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 [2019-11-19 23:00:16,044 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~mem1;havoc max_#t~ite3; 1141#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1136#L9-3 [2019-11-19 23:00:16,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:00:16,044 INFO L82 PathProgramCache]: Analyzing trace with hash -248065507, now seen corresponding path program 9 times [2019-11-19 23:00:16,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:00:16,044 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112519990] [2019-11-19 23:00:16,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:00:16,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:00:16,135 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:00:16,135 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112519990] [2019-11-19 23:00:16,135 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1807183198] [2019-11-19 23:00:16,135 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9b550e6a-2247-426e-aa16-ea7cf225410d/bin/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:00:16,205 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-11-19 23:00:16,205 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 23:00:16,206 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-19 23:00:16,207 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:00:16,219 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:00:16,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 23:00:16,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-11-19 23:00:16,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070680391] [2019-11-19 23:00:16,220 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-19 23:00:16,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:00:16,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 10 times [2019-11-19 23:00:16,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:00:16,221 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172501844] [2019-11-19 23:00:16,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:00:16,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:00:16,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:00:16,227 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 23:00:16,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:00:16,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-19 23:00:16,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-11-19 23:00:16,267 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. cyclomatic complexity: 12 Second operand 13 states. [2019-11-19 23:00:16,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:00:16,308 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2019-11-19 23:00:16,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-19 23:00:16,310 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 50 transitions. [2019-11-19 23:00:16,311 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2019-11-19 23:00:16,325 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 43 states and 50 transitions. [2019-11-19 23:00:16,325 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2019-11-19 23:00:16,325 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2019-11-19 23:00:16,325 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 50 transitions. [2019-11-19 23:00:16,326 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 23:00:16,326 INFO L688 BuchiCegarLoop]: Abstraction has 43 states and 50 transitions. [2019-11-19 23:00:16,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 50 transitions. [2019-11-19 23:00:16,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-11-19 23:00:16,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-19 23:00:16,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2019-11-19 23:00:16,328 INFO L711 BuchiCegarLoop]: Abstraction has 43 states and 50 transitions. [2019-11-19 23:00:16,328 INFO L591 BuchiCegarLoop]: Abstraction has 43 states and 50 transitions. [2019-11-19 23:00:16,328 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-11-19 23:00:16,329 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 50 transitions. [2019-11-19 23:00:16,329 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2019-11-19 23:00:16,329 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 23:00:16,329 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 23:00:16,330 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1] [2019-11-19 23:00:16,330 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-19 23:00:16,330 INFO L794 eck$LassoCheckResult]: Stem: 1319#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 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.allocOnStack(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 [2019-11-19 23:00:16,330 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~mem1;havoc max_#t~ite3; 1304#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1299#L9-3 [2019-11-19 23:00:16,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:00:16,331 INFO L82 PathProgramCache]: Analyzing trace with hash 2127272351, now seen corresponding path program 10 times [2019-11-19 23:00:16,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:00:16,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746582916] [2019-11-19 23:00:16,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:00:16,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:00:16,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:00:16,357 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 23:00:16,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:00:16,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 11 times [2019-11-19 23:00:16,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:00:16,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127538133] [2019-11-19 23:00:16,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:00:16,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:00:16,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:00:16,368 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 23:00:16,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:00:16,368 INFO L82 PathProgramCache]: Analyzing trace with hash -1776090044, now seen corresponding path program 1 times [2019-11-19 23:00:16,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:00:16,369 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301499400] [2019-11-19 23:00:16,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:00:16,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:00:16,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:00:16,430 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 23:00:20,656 WARN L191 SmtUtils]: Spent 4.18 s on a formula simplification. DAG size of input: 221 DAG size of output: 155 [2019-11-19 23:00:20,784 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-11-19 23:00:20,786 INFO L210 LassoAnalysis]: Preferences: [2019-11-19 23:00:20,786 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-19 23:00:20,786 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-19 23:00:20,786 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-19 23:00:20,786 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-19 23:00:20,786 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 23:00:20,786 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-19 23:00:20,786 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-19 23:00:20,786 INFO L133 ssoRankerPreferences]: Filename of dumped script: max10-1.i_Iteration12_Lasso [2019-11-19 23:00:20,786 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-19 23:00:20,786 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-19 23:00:20,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 23:00:20,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 23:00:20,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 23:00:20,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 23:00:20,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 23:00:20,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 23:00:20,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 23:00:20,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 23:00:20,812 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 23:00:20,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 23:00:20,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 23:00:20,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 23:00:20,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 23:00:20,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 23:00:20,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 23:00:20,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 23:00:20,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 23:00:20,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 23:00:20,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 23:00:20,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 23:00:20,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 23:00:20,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 23:00:20,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 23:00:20,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 23:00:21,181 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-19 23:00:21,181 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9b550e6a-2247-426e-aa16-ea7cf225410d/bin/uautomizer/z3 Starting monitored process 19 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 23:00:21,195 INFO L120 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 [2019-11-19 23:00:21,196 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 23:00:21,196 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 23:00:21,197 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 23:00:21,197 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 23:00:21,197 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 23:00:21,198 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 23:00:21,198 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 23:00:21,199 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9b550e6a-2247-426e-aa16-ea7cf225410d/bin/uautomizer/z3 Starting monitored process 20 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 23:00:21,206 INFO L120 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 [2019-11-19 23:00:21,207 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 23:00:21,207 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 23:00:21,207 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 23:00:21,207 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 23:00:21,207 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 23:00:21,208 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 23:00:21,208 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 23:00:21,209 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9b550e6a-2247-426e-aa16-ea7cf225410d/bin/uautomizer/z3 Starting monitored process 21 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 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 23:00:21,213 INFO L120 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 [2019-11-19 23:00:21,215 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 23:00:21,215 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 23:00:21,215 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 23:00:21,215 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 23:00:21,215 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 23:00:21,215 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 23:00:21,215 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 23:00:21,217 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9b550e6a-2247-426e-aa16-ea7cf225410d/bin/uautomizer/z3 Starting monitored process 22 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 23:00:21,233 INFO L120 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 [2019-11-19 23:00:21,235 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 23:00:21,235 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 23:00:21,235 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 23:00:21,235 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 23:00:21,235 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 23:00:21,236 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 23:00:21,236 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 23:00:21,240 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9b550e6a-2247-426e-aa16-ea7cf225410d/bin/uautomizer/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 23:00:21,255 INFO L120 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 [2019-11-19 23:00:21,256 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 23:00:21,256 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 23:00:21,256 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 23:00:21,256 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 23:00:21,257 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 23:00:21,257 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 23:00:21,257 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 23:00:21,260 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9b550e6a-2247-426e-aa16-ea7cf225410d/bin/uautomizer/z3 Starting monitored process 24 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 23:00:21,268 INFO L120 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 [2019-11-19 23:00:21,273 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 23:00:21,274 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 23:00:21,274 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 23:00:21,274 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 23:00:21,277 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 23:00:21,277 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 23:00:21,280 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9b550e6a-2247-426e-aa16-ea7cf225410d/bin/uautomizer/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 23:00:21,293 INFO L120 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 [2019-11-19 23:00:21,295 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 23:00:21,295 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 23:00:21,295 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 23:00:21,295 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 23:00:21,295 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 23:00:21,296 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 23:00:21,296 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 23:00:21,297 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9b550e6a-2247-426e-aa16-ea7cf225410d/bin/uautomizer/z3 Starting monitored process 26 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 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 23:00:21,309 INFO L120 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 [2019-11-19 23:00:21,311 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 23:00:21,311 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 23:00:21,311 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 23:00:21,311 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 23:00:21,311 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 23:00:21,312 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 23:00:21,312 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 23:00:21,316 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9b550e6a-2247-426e-aa16-ea7cf225410d/bin/uautomizer/z3 Starting monitored process 27 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 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 23:00:21,322 INFO L120 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 [2019-11-19 23:00:21,323 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 23:00:21,323 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 23:00:21,323 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 23:00:21,324 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 23:00:21,324 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 23:00:21,324 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 23:00:21,324 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 23:00:21,326 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9b550e6a-2247-426e-aa16-ea7cf225410d/bin/uautomizer/z3 Starting monitored process 28 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 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 23:00:21,331 INFO L120 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 [2019-11-19 23:00:21,333 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 23:00:21,333 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 23:00:21,333 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 23:00:21,333 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 23:00:21,335 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 23:00:21,335 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 23:00:21,340 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9b550e6a-2247-426e-aa16-ea7cf225410d/bin/uautomizer/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 23:00:21,349 INFO L120 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 [2019-11-19 23:00:21,351 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 23:00:21,351 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 23:00:21,351 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 23:00:21,351 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 23:00:21,352 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 23:00:21,352 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 23:00:21,352 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 23:00:21,354 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9b550e6a-2247-426e-aa16-ea7cf225410d/bin/uautomizer/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 23:00:21,364 INFO L120 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 [2019-11-19 23:00:21,367 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 23:00:21,367 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 23:00:21,367 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 23:00:21,367 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 23:00:21,367 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 23:00:21,368 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 23:00:21,369 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 23:00:21,370 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9b550e6a-2247-426e-aa16-ea7cf225410d/bin/uautomizer/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 23:00:21,387 INFO L120 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 [2019-11-19 23:00:21,389 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 23:00:21,389 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 23:00:21,389 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 23:00:21,389 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 23:00:21,389 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 23:00:21,390 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 23:00:21,390 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 23:00:21,391 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9b550e6a-2247-426e-aa16-ea7cf225410d/bin/uautomizer/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 23:00:21,398 INFO L120 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 [2019-11-19 23:00:21,399 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 23:00:21,399 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 23:00:21,399 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 23:00:21,400 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 23:00:21,400 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 23:00:21,400 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 23:00:21,400 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 23:00:21,402 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9b550e6a-2247-426e-aa16-ea7cf225410d/bin/uautomizer/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 23:00:21,407 INFO L120 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 [2019-11-19 23:00:21,409 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 23:00:21,409 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 23:00:21,409 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 23:00:21,409 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 23:00:21,409 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 23:00:21,409 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 23:00:21,410 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 23:00:21,411 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9b550e6a-2247-426e-aa16-ea7cf225410d/bin/uautomizer/z3 Starting monitored process 34 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 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 23:00:21,415 INFO L120 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 [2019-11-19 23:00:21,416 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 23:00:21,416 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 23:00:21,416 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 23:00:21,417 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 23:00:21,417 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 23:00:21,417 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 23:00:21,417 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 23:00:21,419 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9b550e6a-2247-426e-aa16-ea7cf225410d/bin/uautomizer/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 23:00:21,431 INFO L120 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 [2019-11-19 23:00:21,433 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 23:00:21,433 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 23:00:21,433 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 23:00:21,433 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 23:00:21,433 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 23:00:21,434 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 23:00:21,434 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 23:00:21,436 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9b550e6a-2247-426e-aa16-ea7cf225410d/bin/uautomizer/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 23:00:21,442 INFO L120 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 [2019-11-19 23:00:21,444 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 23:00:21,444 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 23:00:21,444 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 23:00:21,444 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 23:00:21,444 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 23:00:21,445 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 23:00:21,445 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 23:00:21,447 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9b550e6a-2247-426e-aa16-ea7cf225410d/bin/uautomizer/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 23:00:21,455 INFO L120 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 [2019-11-19 23:00:21,456 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 23:00:21,457 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 23:00:21,457 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 23:00:21,457 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 23:00:21,466 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 23:00:21,466 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 23:00:21,471 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9b550e6a-2247-426e-aa16-ea7cf225410d/bin/uautomizer/z3 Starting monitored process 38 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 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 23:00:21,480 INFO L120 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 [2019-11-19 23:00:21,481 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 23:00:21,482 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 23:00:21,482 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 23:00:21,482 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 23:00:21,486 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 23:00:21,486 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 23:00:21,495 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-19 23:00:21,507 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-11-19 23:00:21,507 INFO L444 ModelExtractionUtils]: 7 out of 22 variables were initially zero. Simplification set additionally 12 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9b550e6a-2247-426e-aa16-ea7cf225410d/bin/uautomizer/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 23:00:21,511 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 23:00:21,515 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-19 23:00:21,515 INFO L510 LassoAnalysis]: Proved termination. [2019-11-19 23:00:21,515 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_max_~i~0) = -2*ULTIMATE.start_max_~i~0 + 19 Supporting invariants [] [2019-11-19 23:00:21,521 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-11-19 23:00:21,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:00:21,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:00:21,554 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 23:00:21,555 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:00:21,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:00:21,562 INFO L255 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-19 23:00:21,563 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:00:21,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:00:21,571 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 [2019-11-19 23:00:21,571 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 43 states and 50 transitions. cyclomatic complexity: 12 Second operand 3 states. [2019-11-19 23:00:21,595 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. [2019-11-19 23:00:21,596 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 [2019-11-19 23:00:21,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-19 23:00:21,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2019-11-19 23:00:21,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 24 letters. Loop has 4 letters. [2019-11-19 23:00:21,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 23:00:21,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 28 letters. Loop has 4 letters. [2019-11-19 23:00:21,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 23:00:21,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 24 letters. Loop has 8 letters. [2019-11-19 23:00:21,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 23:00:21,598 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 60 transitions. [2019-11-19 23:00:21,599 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-11-19 23:00:21,599 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 44 states and 52 transitions. [2019-11-19 23:00:21,599 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2019-11-19 23:00:21,599 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-11-19 23:00:21,600 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 52 transitions. [2019-11-19 23:00:21,600 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 23:00:21,600 INFO L688 BuchiCegarLoop]: Abstraction has 44 states and 52 transitions. [2019-11-19 23:00:21,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 52 transitions. [2019-11-19 23:00:21,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-11-19 23:00:21,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-11-19 23:00:21,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2019-11-19 23:00:21,602 INFO L711 BuchiCegarLoop]: Abstraction has 44 states and 52 transitions. [2019-11-19 23:00:21,602 INFO L591 BuchiCegarLoop]: Abstraction has 44 states and 52 transitions. [2019-11-19 23:00:21,602 INFO L424 BuchiCegarLoop]: ======== Iteration 13============ [2019-11-19 23:00:21,603 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 52 transitions. [2019-11-19 23:00:21,603 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-11-19 23:00:21,603 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 23:00:21,603 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 23:00:21,604 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:00:21,604 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-19 23:00:21,604 INFO L794 eck$LassoCheckResult]: Stem: 1532#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 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.allocOnStack(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 [2019-11-19 23:00:21,605 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~mem1;havoc max_#t~ite3; 1510#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1533#L9-8 [2019-11-19 23:00:21,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:00:21,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1328178489, now seen corresponding path program 1 times [2019-11-19 23:00:21,605 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:00:21,605 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756824206] [2019-11-19 23:00:21,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:00:21,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:00:21,631 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-11-19 23:00:21,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756824206] [2019-11-19 23:00:21,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:00:21,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:00:21,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661214378] [2019-11-19 23:00:21,632 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-19 23:00:21,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:00:21,632 INFO L82 PathProgramCache]: Analyzing trace with hash 2373478, now seen corresponding path program 1 times [2019-11-19 23:00:21,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:00:21,633 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063225506] [2019-11-19 23:00:21,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:00:21,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:00:21,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:00:21,639 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 23:00:21,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:00:21,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:00:21,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:00:21,686 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. cyclomatic complexity: 13 Second operand 3 states. [2019-11-19 23:00:21,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:00:21,727 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2019-11-19 23:00:21,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:00:21,727 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 65 transitions. [2019-11-19 23:00:21,728 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-11-19 23:00:21,729 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 55 states and 65 transitions. [2019-11-19 23:00:21,729 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2019-11-19 23:00:21,729 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2019-11-19 23:00:21,729 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 65 transitions. [2019-11-19 23:00:21,729 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 23:00:21,729 INFO L688 BuchiCegarLoop]: Abstraction has 55 states and 65 transitions. [2019-11-19 23:00:21,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 65 transitions. [2019-11-19 23:00:21,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 45. [2019-11-19 23:00:21,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-19 23:00:21,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2019-11-19 23:00:21,732 INFO L711 BuchiCegarLoop]: Abstraction has 45 states and 52 transitions. [2019-11-19 23:00:21,732 INFO L591 BuchiCegarLoop]: Abstraction has 45 states and 52 transitions. [2019-11-19 23:00:21,732 INFO L424 BuchiCegarLoop]: ======== Iteration 14============ [2019-11-19 23:00:21,732 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 52 transitions. [2019-11-19 23:00:21,732 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-11-19 23:00:21,733 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 23:00:21,733 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 23:00:21,733 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:00:21,733 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-19 23:00:21,734 INFO L794 eck$LassoCheckResult]: Stem: 1634#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 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.allocOnStack(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~mem1;havoc max_#t~ite3; 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 [2019-11-19 23:00:21,734 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~mem1;havoc max_#t~ite3; 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 [2019-11-19 23:00:21,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:00:21,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1922451645, now seen corresponding path program 1 times [2019-11-19 23:00:21,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:00:21,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022104041] [2019-11-19 23:00:21,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:00:21,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:00:21,790 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-11-19 23:00:21,790 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022104041] [2019-11-19 23:00:21,791 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1524053294] [2019-11-19 23:00:21,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9b550e6a-2247-426e-aa16-ea7cf225410d/bin/uautomizer/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:00:21,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:00:21,842 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-19 23:00:21,844 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:00:21,858 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-11-19 23:00:21,858 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 23:00:21,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-11-19 23:00:21,858 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033078631] [2019-11-19 23:00:21,859 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-19 23:00:21,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:00:21,859 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 2 times [2019-11-19 23:00:21,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:00:21,859 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722235409] [2019-11-19 23:00:21,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:00:21,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:00:21,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:00:21,865 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 23:00:21,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:00:21,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 23:00:21,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:00:21,944 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. cyclomatic complexity: 12 Second operand 5 states. [2019-11-19 23:00:22,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:00:22,017 INFO L93 Difference]: Finished difference Result 67 states and 80 transitions. [2019-11-19 23:00:22,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:00:22,017 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 80 transitions. [2019-11-19 23:00:22,018 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-11-19 23:00:22,019 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 67 states and 80 transitions. [2019-11-19 23:00:22,019 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2019-11-19 23:00:22,019 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2019-11-19 23:00:22,019 INFO L73 IsDeterministic]: Start isDeterministic. Operand 67 states and 80 transitions. [2019-11-19 23:00:22,020 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 23:00:22,020 INFO L688 BuchiCegarLoop]: Abstraction has 67 states and 80 transitions. [2019-11-19 23:00:22,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states and 80 transitions. [2019-11-19 23:00:22,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 53. [2019-11-19 23:00:22,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-19 23:00:22,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 62 transitions. [2019-11-19 23:00:22,023 INFO L711 BuchiCegarLoop]: Abstraction has 53 states and 62 transitions. [2019-11-19 23:00:22,023 INFO L591 BuchiCegarLoop]: Abstraction has 53 states and 62 transitions. [2019-11-19 23:00:22,023 INFO L424 BuchiCegarLoop]: ======== Iteration 15============ [2019-11-19 23:00:22,024 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 62 transitions. [2019-11-19 23:00:22,024 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-11-19 23:00:22,024 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 23:00:22,024 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 23:00:22,025 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:00:22,026 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-19 23:00:22,026 INFO L794 eck$LassoCheckResult]: Stem: 1851#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 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.allocOnStack(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~mem1;havoc max_#t~ite3; 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~mem1;havoc max_#t~ite3; 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~mem1;havoc max_#t~ite3; 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 [2019-11-19 23:00:22,026 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~mem1;havoc max_#t~ite3; 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 [2019-11-19 23:00:22,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:00:22,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1268480291, now seen corresponding path program 1 times [2019-11-19 23:00:22,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:00:22,027 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423422096] [2019-11-19 23:00:22,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:00:22,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:00:22,076 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-11-19 23:00:22,076 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423422096] [2019-11-19 23:00:22,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [896134758] [2019-11-19 23:00:22,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9b550e6a-2247-426e-aa16-ea7cf225410d/bin/uautomizer/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:00:22,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:00:22,156 INFO L255 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-19 23:00:22,160 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:00:22,168 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-11-19 23:00:22,168 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 23:00:22,169 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-11-19 23:00:22,169 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114837605] [2019-11-19 23:00:22,169 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-19 23:00:22,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:00:22,169 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 3 times [2019-11-19 23:00:22,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:00:22,170 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070448263] [2019-11-19 23:00:22,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:00:22,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:00:22,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:00:22,176 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 23:00:22,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:00:22,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 23:00:22,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-19 23:00:22,254 INFO L87 Difference]: Start difference. First operand 53 states and 62 transitions. cyclomatic complexity: 14 Second operand 6 states. [2019-11-19 23:00:22,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:00:22,327 INFO L93 Difference]: Finished difference Result 79 states and 95 transitions. [2019-11-19 23:00:22,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 23:00:22,328 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 79 states and 95 transitions. [2019-11-19 23:00:22,328 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-11-19 23:00:22,329 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 79 states to 79 states and 95 transitions. [2019-11-19 23:00:22,329 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2019-11-19 23:00:22,329 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2019-11-19 23:00:22,329 INFO L73 IsDeterministic]: Start isDeterministic. Operand 79 states and 95 transitions. [2019-11-19 23:00:22,330 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 23:00:22,330 INFO L688 BuchiCegarLoop]: Abstraction has 79 states and 95 transitions. [2019-11-19 23:00:22,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states and 95 transitions. [2019-11-19 23:00:22,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 61. [2019-11-19 23:00:22,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-19 23:00:22,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 72 transitions. [2019-11-19 23:00:22,333 INFO L711 BuchiCegarLoop]: Abstraction has 61 states and 72 transitions. [2019-11-19 23:00:22,333 INFO L591 BuchiCegarLoop]: Abstraction has 61 states and 72 transitions. [2019-11-19 23:00:22,333 INFO L424 BuchiCegarLoop]: ======== Iteration 16============ [2019-11-19 23:00:22,333 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 61 states and 72 transitions. [2019-11-19 23:00:22,334 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-11-19 23:00:22,334 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 23:00:22,334 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 23:00:22,335 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:00:22,335 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-19 23:00:22,336 INFO L794 eck$LassoCheckResult]: Stem: 2112#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 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.allocOnStack(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~mem1;havoc max_#t~ite3; 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~mem1;havoc max_#t~ite3; 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~mem1;havoc max_#t~ite3; 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~mem1;havoc max_#t~ite3; 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~mem1;havoc max_#t~ite3; 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 [2019-11-19 23:00:22,336 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~mem1;havoc max_#t~ite3; 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 [2019-11-19 23:00:22,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:00:22,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1567366653, now seen corresponding path program 2 times [2019-11-19 23:00:22,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:00:22,336 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229651096] [2019-11-19 23:00:22,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:00:22,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:00:22,389 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-11-19 23:00:22,389 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229651096] [2019-11-19 23:00:22,389 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [51778687] [2019-11-19 23:00:22,389 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9b550e6a-2247-426e-aa16-ea7cf225410d/bin/uautomizer/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:00:22,452 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-19 23:00:22,453 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 23:00:22,453 INFO L255 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-19 23:00:22,455 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:00:22,497 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-11-19 23:00:22,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 23:00:22,500 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-11-19 23:00:22,500 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612004532] [2019-11-19 23:00:22,500 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-19 23:00:22,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:00:22,501 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 4 times [2019-11-19 23:00:22,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:00:22,502 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683501259] [2019-11-19 23:00:22,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:00:22,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:00:22,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:00:22,511 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 23:00:22,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:00:22,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-19 23:00:22,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-19 23:00:22,590 INFO L87 Difference]: Start difference. First operand 61 states and 72 transitions. cyclomatic complexity: 16 Second operand 7 states. [2019-11-19 23:00:22,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:00:22,686 INFO L93 Difference]: Finished difference Result 91 states and 110 transitions. [2019-11-19 23:00:22,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 23:00:22,686 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 110 transitions. [2019-11-19 23:00:22,687 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-11-19 23:00:22,688 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 91 states and 110 transitions. [2019-11-19 23:00:22,688 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2019-11-19 23:00:22,688 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2019-11-19 23:00:22,688 INFO L73 IsDeterministic]: Start isDeterministic. Operand 91 states and 110 transitions. [2019-11-19 23:00:22,689 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 23:00:22,689 INFO L688 BuchiCegarLoop]: Abstraction has 91 states and 110 transitions. [2019-11-19 23:00:22,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states and 110 transitions. [2019-11-19 23:00:22,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 69. [2019-11-19 23:00:22,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-11-19 23:00:22,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 82 transitions. [2019-11-19 23:00:22,692 INFO L711 BuchiCegarLoop]: Abstraction has 69 states and 82 transitions. [2019-11-19 23:00:22,692 INFO L591 BuchiCegarLoop]: Abstraction has 69 states and 82 transitions. [2019-11-19 23:00:22,692 INFO L424 BuchiCegarLoop]: ======== Iteration 17============ [2019-11-19 23:00:22,692 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states and 82 transitions. [2019-11-19 23:00:22,693 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-11-19 23:00:22,693 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 23:00:22,693 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 23:00:22,694 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:00:22,694 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-19 23:00:22,694 INFO L794 eck$LassoCheckResult]: Stem: 2412#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 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.allocOnStack(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~mem1;havoc max_#t~ite3; 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~mem1;havoc max_#t~ite3; 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~mem1;havoc max_#t~ite3; 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~mem1;havoc max_#t~ite3; 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~mem1;havoc max_#t~ite3; 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~mem1;havoc max_#t~ite3; 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~mem1;havoc max_#t~ite3; 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 [2019-11-19 23:00:22,695 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~mem1;havoc max_#t~ite3; 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 [2019-11-19 23:00:22,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:00:22,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1948283363, now seen corresponding path program 3 times [2019-11-19 23:00:22,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:00:22,695 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472840964] [2019-11-19 23:00:22,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:00:22,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:00:22,754 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2019-11-19 23:00:22,754 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472840964] [2019-11-19 23:00:22,754 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [849764556] [2019-11-19 23:00:22,754 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9b550e6a-2247-426e-aa16-ea7cf225410d/bin/uautomizer/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:00:22,826 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-11-19 23:00:22,826 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 23:00:22,827 INFO L255 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-19 23:00:22,829 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:00:22,843 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2019-11-19 23:00:22,845 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 23:00:22,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-11-19 23:00:22,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569082076] [2019-11-19 23:00:22,846 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-19 23:00:22,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:00:22,847 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 5 times [2019-11-19 23:00:22,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:00:22,849 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64491081] [2019-11-19 23:00:22,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:00:22,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:00:22,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:00:22,854 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 23:00:22,927 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:00:22,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-19 23:00:22,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-11-19 23:00:22,927 INFO L87 Difference]: Start difference. First operand 69 states and 82 transitions. cyclomatic complexity: 18 Second operand 8 states. [2019-11-19 23:00:23,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:00:23,026 INFO L93 Difference]: Finished difference Result 103 states and 125 transitions. [2019-11-19 23:00:23,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-19 23:00:23,026 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 103 states and 125 transitions. [2019-11-19 23:00:23,027 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-11-19 23:00:23,028 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 103 states to 103 states and 125 transitions. [2019-11-19 23:00:23,028 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 60 [2019-11-19 23:00:23,029 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 60 [2019-11-19 23:00:23,029 INFO L73 IsDeterministic]: Start isDeterministic. Operand 103 states and 125 transitions. [2019-11-19 23:00:23,029 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 23:00:23,029 INFO L688 BuchiCegarLoop]: Abstraction has 103 states and 125 transitions. [2019-11-19 23:00:23,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states and 125 transitions. [2019-11-19 23:00:23,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 77. [2019-11-19 23:00:23,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-11-19 23:00:23,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 92 transitions. [2019-11-19 23:00:23,037 INFO L711 BuchiCegarLoop]: Abstraction has 77 states and 92 transitions. [2019-11-19 23:00:23,038 INFO L591 BuchiCegarLoop]: Abstraction has 77 states and 92 transitions. [2019-11-19 23:00:23,038 INFO L424 BuchiCegarLoop]: ======== Iteration 18============ [2019-11-19 23:00:23,038 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 77 states and 92 transitions. [2019-11-19 23:00:23,039 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-11-19 23:00:23,039 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 23:00:23,039 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 23:00:23,040 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:00:23,044 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-19 23:00:23,044 INFO L794 eck$LassoCheckResult]: Stem: 2759#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 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.allocOnStack(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~mem1;havoc max_#t~ite3; 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~mem1;havoc max_#t~ite3; 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~mem1;havoc max_#t~ite3; 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~mem1;havoc max_#t~ite3; 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~mem1;havoc max_#t~ite3; 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~mem1;havoc max_#t~ite3; 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~mem1;havoc max_#t~ite3; 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~mem1;havoc max_#t~ite3; 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~mem1;havoc max_#t~ite3; 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 [2019-11-19 23:00:23,045 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~mem1;havoc max_#t~ite3; 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 [2019-11-19 23:00:23,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:00:23,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1984866499, now seen corresponding path program 4 times [2019-11-19 23:00:23,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:00:23,046 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54647833] [2019-11-19 23:00:23,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:00:23,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:00:23,125 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2019-11-19 23:00:23,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54647833] [2019-11-19 23:00:23,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1524584930] [2019-11-19 23:00:23,125 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9b550e6a-2247-426e-aa16-ea7cf225410d/bin/uautomizer/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:00:23,194 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-19 23:00:23,194 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 23:00:23,195 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-19 23:00:23,197 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:00:23,212 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2019-11-19 23:00:23,212 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 23:00:23,212 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-11-19 23:00:23,213 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123231189] [2019-11-19 23:00:23,213 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-19 23:00:23,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:00:23,213 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 6 times [2019-11-19 23:00:23,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:00:23,214 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053221809] [2019-11-19 23:00:23,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:00:23,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:00:23,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:00:23,220 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 23:00:23,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:00:23,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-19 23:00:23,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-11-19 23:00:23,292 INFO L87 Difference]: Start difference. First operand 77 states and 92 transitions. cyclomatic complexity: 20 Second operand 9 states. [2019-11-19 23:00:23,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:00:23,414 INFO L93 Difference]: Finished difference Result 115 states and 140 transitions. [2019-11-19 23:00:23,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-19 23:00:23,414 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 115 states and 140 transitions. [2019-11-19 23:00:23,415 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-11-19 23:00:23,416 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 115 states to 115 states and 140 transitions. [2019-11-19 23:00:23,416 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2019-11-19 23:00:23,417 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2019-11-19 23:00:23,417 INFO L73 IsDeterministic]: Start isDeterministic. Operand 115 states and 140 transitions. [2019-11-19 23:00:23,417 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 23:00:23,417 INFO L688 BuchiCegarLoop]: Abstraction has 115 states and 140 transitions. [2019-11-19 23:00:23,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states and 140 transitions. [2019-11-19 23:00:23,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 85. [2019-11-19 23:00:23,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-11-19 23:00:23,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 102 transitions. [2019-11-19 23:00:23,425 INFO L711 BuchiCegarLoop]: Abstraction has 85 states and 102 transitions. [2019-11-19 23:00:23,425 INFO L591 BuchiCegarLoop]: Abstraction has 85 states and 102 transitions. [2019-11-19 23:00:23,425 INFO L424 BuchiCegarLoop]: ======== Iteration 19============ [2019-11-19 23:00:23,425 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 85 states and 102 transitions. [2019-11-19 23:00:23,426 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-11-19 23:00:23,426 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 23:00:23,426 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 23:00:23,427 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 6, 6, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:00:23,429 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-19 23:00:23,430 INFO L794 eck$LassoCheckResult]: Stem: 3154#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 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.allocOnStack(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~mem1;havoc max_#t~ite3; 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~mem1;havoc max_#t~ite3; 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~mem1;havoc max_#t~ite3; 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~mem1;havoc max_#t~ite3; 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~mem1;havoc max_#t~ite3; 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~mem1;havoc max_#t~ite3; 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~mem1;havoc max_#t~ite3; 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~mem1;havoc max_#t~ite3; 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~mem1;havoc max_#t~ite3; 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~mem1;havoc max_#t~ite3; 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~mem1;havoc max_#t~ite3; 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 [2019-11-19 23:00:23,431 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~mem1;havoc max_#t~ite3; 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 [2019-11-19 23:00:23,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:00:23,434 INFO L82 PathProgramCache]: Analyzing trace with hash -325846691, now seen corresponding path program 5 times [2019-11-19 23:00:23,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:00:23,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967518690] [2019-11-19 23:00:23,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:00:23,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:00:23,576 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-11-19 23:00:23,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967518690] [2019-11-19 23:00:23,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [547988995] [2019-11-19 23:00:23,577 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9b550e6a-2247-426e-aa16-ea7cf225410d/bin/uautomizer/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:00:23,687 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2019-11-19 23:00:23,687 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 23:00:23,688 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-19 23:00:23,690 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:00:23,706 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-11-19 23:00:23,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 23:00:23,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-11-19 23:00:23,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961999580] [2019-11-19 23:00:23,708 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-19 23:00:23,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:00:23,709 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 7 times [2019-11-19 23:00:23,709 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:00:23,709 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617603404] [2019-11-19 23:00:23,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:00:23,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:00:23,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:00:23,721 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 23:00:23,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:00:23,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-19 23:00:23,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-11-19 23:00:23,795 INFO L87 Difference]: Start difference. First operand 85 states and 102 transitions. cyclomatic complexity: 22 Second operand 10 states. [2019-11-19 23:00:23,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:00:23,929 INFO L93 Difference]: Finished difference Result 127 states and 155 transitions. [2019-11-19 23:00:23,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-19 23:00:23,930 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 127 states and 155 transitions. [2019-11-19 23:00:23,931 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-11-19 23:00:23,932 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 127 states to 127 states and 155 transitions. [2019-11-19 23:00:23,932 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 76 [2019-11-19 23:00:23,932 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 76 [2019-11-19 23:00:23,933 INFO L73 IsDeterministic]: Start isDeterministic. Operand 127 states and 155 transitions. [2019-11-19 23:00:23,933 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 23:00:23,933 INFO L688 BuchiCegarLoop]: Abstraction has 127 states and 155 transitions. [2019-11-19 23:00:23,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states and 155 transitions. [2019-11-19 23:00:23,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 93. [2019-11-19 23:00:23,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-11-19 23:00:23,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 112 transitions. [2019-11-19 23:00:23,935 INFO L711 BuchiCegarLoop]: Abstraction has 93 states and 112 transitions. [2019-11-19 23:00:23,935 INFO L591 BuchiCegarLoop]: Abstraction has 93 states and 112 transitions. [2019-11-19 23:00:23,935 INFO L424 BuchiCegarLoop]: ======== Iteration 20============ [2019-11-19 23:00:23,936 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 93 states and 112 transitions. [2019-11-19 23:00:23,936 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-11-19 23:00:23,936 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 23:00:23,936 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 23:00:23,937 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 7, 7, 7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:00:23,937 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-19 23:00:23,938 INFO L794 eck$LassoCheckResult]: Stem: 3590#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 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.allocOnStack(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~mem1;havoc max_#t~ite3; 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~mem1;havoc max_#t~ite3; 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~mem1;havoc max_#t~ite3; 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~mem1;havoc max_#t~ite3; 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~mem1;havoc max_#t~ite3; 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~mem1;havoc max_#t~ite3; 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~mem1;havoc max_#t~ite3; 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~mem1;havoc max_#t~ite3; 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~mem1;havoc max_#t~ite3; 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~mem1;havoc max_#t~ite3; 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~mem1;havoc max_#t~ite3; 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~mem1;havoc max_#t~ite3; 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~mem1;havoc max_#t~ite3; 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 [2019-11-19 23:00:23,938 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~mem1;havoc max_#t~ite3; 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 [2019-11-19 23:00:23,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:00:23,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1241910147, now seen corresponding path program 6 times [2019-11-19 23:00:23,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:00:23,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802339063] [2019-11-19 23:00:23,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:00:23,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:00:24,057 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2019-11-19 23:00:24,057 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802339063] [2019-11-19 23:00:24,057 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1245905914] [2019-11-19 23:00:24,057 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9b550e6a-2247-426e-aa16-ea7cf225410d/bin/uautomizer/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:00:24,189 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2019-11-19 23:00:24,190 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 23:00:24,191 INFO L255 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-19 23:00:24,193 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:00:24,233 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 19 proven. 91 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2019-11-19 23:00:24,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 23:00:24,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 13 [2019-11-19 23:00:24,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139465237] [2019-11-19 23:00:24,235 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-19 23:00:24,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:00:24,235 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 8 times [2019-11-19 23:00:24,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:00:24,235 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681610833] [2019-11-19 23:00:24,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:00:24,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:00:24,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:00:24,241 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 23:00:24,319 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:00:24,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-19 23:00:24,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2019-11-19 23:00:24,320 INFO L87 Difference]: Start difference. First operand 93 states and 112 transitions. cyclomatic complexity: 24 Second operand 13 states. [2019-11-19 23:00:24,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:00:24,573 INFO L93 Difference]: Finished difference Result 139 states and 170 transitions. [2019-11-19 23:00:24,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-19 23:00:24,573 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 139 states and 170 transitions. [2019-11-19 23:00:24,575 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-11-19 23:00:24,576 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 139 states to 139 states and 170 transitions. [2019-11-19 23:00:24,576 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 84 [2019-11-19 23:00:24,576 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 84 [2019-11-19 23:00:24,576 INFO L73 IsDeterministic]: Start isDeterministic. Operand 139 states and 170 transitions. [2019-11-19 23:00:24,577 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 23:00:24,577 INFO L688 BuchiCegarLoop]: Abstraction has 139 states and 170 transitions. [2019-11-19 23:00:24,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states and 170 transitions. [2019-11-19 23:00:24,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 101. [2019-11-19 23:00:24,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-11-19 23:00:24,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 122 transitions. [2019-11-19 23:00:24,579 INFO L711 BuchiCegarLoop]: Abstraction has 101 states and 122 transitions. [2019-11-19 23:00:24,579 INFO L591 BuchiCegarLoop]: Abstraction has 101 states and 122 transitions. [2019-11-19 23:00:24,579 INFO L424 BuchiCegarLoop]: ======== Iteration 21============ [2019-11-19 23:00:24,579 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 101 states and 122 transitions. [2019-11-19 23:00:24,583 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-11-19 23:00:24,583 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 23:00:24,583 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 23:00:24,584 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 8, 8, 8, 8, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:00:24,584 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-19 23:00:24,585 INFO L794 eck$LassoCheckResult]: Stem: 4091#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 4089#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.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 4085#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 4086#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 4087#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 4088#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 4120#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 4119#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 4118#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 4117#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 4116#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 4115#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 4114#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 4113#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 4112#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 4111#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 4110#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 4109#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 4108#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 4107#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 4106#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 4105#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 4104#L23-3 assume !(main_~i~1 < 10); 4084#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; 4070#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4071#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4090#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 4166#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4072#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4073#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4083#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 4077#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4078#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4165#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4164#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 4163#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4162#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4161#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4160#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 4159#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4158#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4157#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4156#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 4155#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4154#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4153#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4152#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 4151#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4150#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4149#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4148#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 4147#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4146#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4099#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4122#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 4100#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4098#L9-3 assume !(max_~i~0 < 10); 4066#L9-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 4067#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; 4096#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4079#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4068#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 4069#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4094#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4095#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4145#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 4144#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4143#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4142#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4141#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 4140#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4139#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4138#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4137#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 4136#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4135#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4134#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4133#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 4132#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4131#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4130#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4129#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 4128#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4127#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4126#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4125#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 4124#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4123#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4102#L10-3 [2019-11-19 23:00:24,585 INFO L796 eck$LassoCheckResult]: Loop: 4102#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; 4121#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 4103#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4101#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4102#L10-3 [2019-11-19 23:00:24,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:00:24,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1930807453, now seen corresponding path program 7 times [2019-11-19 23:00:24,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:00:24,585 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563033440] [2019-11-19 23:00:24,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:00:24,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:00:24,734 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked. [2019-11-19 23:00:24,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563033440] [2019-11-19 23:00:24,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1962209582] [2019-11-19 23:00:24,735 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9b550e6a-2247-426e-aa16-ea7cf225410d/bin/uautomizer/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:00:24,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:00:24,807 INFO L255 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-19 23:00:24,809 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:00:24,826 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked. [2019-11-19 23:00:24,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 23:00:24,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-11-19 23:00:24,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242381043] [2019-11-19 23:00:24,827 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-19 23:00:24,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:00:24,827 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 9 times [2019-11-19 23:00:24,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:00:24,828 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930665131] [2019-11-19 23:00:24,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:00:24,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:00:24,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:00:24,833 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 23:00:24,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:00:24,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-19 23:00:24,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-11-19 23:00:24,911 INFO L87 Difference]: Start difference. First operand 101 states and 122 transitions. cyclomatic complexity: 26 Second operand 12 states. [2019-11-19 23:00:25,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:00:25,081 INFO L93 Difference]: Finished difference Result 151 states and 185 transitions. [2019-11-19 23:00:25,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-19 23:00:25,081 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 151 states and 185 transitions. [2019-11-19 23:00:25,083 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-11-19 23:00:25,084 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 151 states to 151 states and 185 transitions. [2019-11-19 23:00:25,084 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 92 [2019-11-19 23:00:25,084 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 92 [2019-11-19 23:00:25,084 INFO L73 IsDeterministic]: Start isDeterministic. Operand 151 states and 185 transitions. [2019-11-19 23:00:25,085 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 23:00:25,085 INFO L688 BuchiCegarLoop]: Abstraction has 151 states and 185 transitions. [2019-11-19 23:00:25,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states and 185 transitions. [2019-11-19 23:00:25,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 109. [2019-11-19 23:00:25,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-11-19 23:00:25,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 132 transitions. [2019-11-19 23:00:25,087 INFO L711 BuchiCegarLoop]: Abstraction has 109 states and 132 transitions. [2019-11-19 23:00:25,087 INFO L591 BuchiCegarLoop]: Abstraction has 109 states and 132 transitions. [2019-11-19 23:00:25,088 INFO L424 BuchiCegarLoop]: ======== Iteration 22============ [2019-11-19 23:00:25,088 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 109 states and 132 transitions. [2019-11-19 23:00:25,088 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-11-19 23:00:25,088 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 23:00:25,089 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 23:00:25,089 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 9, 9, 9, 9, 9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:00:25,090 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-19 23:00:25,090 INFO L794 eck$LassoCheckResult]: Stem: 4619#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 4617#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.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 4613#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 4614#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 4615#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 4616#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 4648#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 4647#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 4646#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 4645#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 4644#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 4643#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 4642#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 4641#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 4640#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 4639#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 4638#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 4637#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 4636#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 4635#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 4634#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 4633#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 4632#L23-3 assume !(main_~i~1 < 10); 4612#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; 4598#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4599#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4618#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 4702#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4600#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4601#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4611#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 4605#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4606#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4701#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4700#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 4699#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4698#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4697#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4696#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 4695#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4694#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4693#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4692#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 4691#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4690#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4689#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4688#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 4687#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4686#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4685#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4684#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 4683#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4682#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4681#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4680#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 4679#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4678#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4627#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4650#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 4628#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4626#L9-3 assume !(max_~i~0 < 10); 4594#L9-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 4595#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; 4624#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4607#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4596#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 4597#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4622#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4623#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4677#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 4676#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4675#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4674#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4673#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 4672#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4671#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4670#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4669#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 4668#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4667#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4666#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4665#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 4664#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4663#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4662#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4661#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 4660#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4659#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4658#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4657#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 4656#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4655#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4654#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4653#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 4652#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4651#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4630#L10-3 [2019-11-19 23:00:25,090 INFO L796 eck$LassoCheckResult]: Loop: 4630#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; 4649#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 4631#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4629#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4630#L10-3 [2019-11-19 23:00:25,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:00:25,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1557788093, now seen corresponding path program 8 times [2019-11-19 23:00:25,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:00:25,091 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49695552] [2019-11-19 23:00:25,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:00:25,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:00:25,237 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-11-19 23:00:25,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49695552] [2019-11-19 23:00:25,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [641832368] [2019-11-19 23:00:25,238 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9b550e6a-2247-426e-aa16-ea7cf225410d/bin/uautomizer/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:00:25,336 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-19 23:00:25,336 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 23:00:25,337 INFO L255 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-19 23:00:25,339 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:00:25,359 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-11-19 23:00:25,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 23:00:25,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-11-19 23:00:25,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279344940] [2019-11-19 23:00:25,360 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-19 23:00:25,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:00:25,360 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 10 times [2019-11-19 23:00:25,361 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:00:25,361 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354805865] [2019-11-19 23:00:25,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:00:25,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:00:25,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:00:25,371 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 23:00:25,447 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:00:25,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-19 23:00:25,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-11-19 23:00:25,448 INFO L87 Difference]: Start difference. First operand 109 states and 132 transitions. cyclomatic complexity: 28 Second operand 13 states. [2019-11-19 23:00:25,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:00:25,624 INFO L93 Difference]: Finished difference Result 154 states and 188 transitions. [2019-11-19 23:00:25,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-19 23:00:25,625 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 154 states and 188 transitions. [2019-11-19 23:00:25,626 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-11-19 23:00:25,627 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 154 states to 154 states and 188 transitions. [2019-11-19 23:00:25,627 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 94 [2019-11-19 23:00:25,628 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 94 [2019-11-19 23:00:25,628 INFO L73 IsDeterministic]: Start isDeterministic. Operand 154 states and 188 transitions. [2019-11-19 23:00:25,628 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 23:00:25,628 INFO L688 BuchiCegarLoop]: Abstraction has 154 states and 188 transitions. [2019-11-19 23:00:25,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states and 188 transitions. [2019-11-19 23:00:25,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 117. [2019-11-19 23:00:25,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-11-19 23:00:25,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 142 transitions. [2019-11-19 23:00:25,630 INFO L711 BuchiCegarLoop]: Abstraction has 117 states and 142 transitions. [2019-11-19 23:00:25,630 INFO L591 BuchiCegarLoop]: Abstraction has 117 states and 142 transitions. [2019-11-19 23:00:25,630 INFO L424 BuchiCegarLoop]: ======== Iteration 23============ [2019-11-19 23:00:25,631 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 117 states and 142 transitions. [2019-11-19 23:00:25,631 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-11-19 23:00:25,631 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 23:00:25,631 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 23:00:25,633 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:00:25,633 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-19 23:00:25,633 INFO L794 eck$LassoCheckResult]: Stem: 5183#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 5181#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.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 5177#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 5178#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 5179#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 5180#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 5274#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 5273#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 5272#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 5271#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 5270#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 5269#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 5268#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 5267#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 5266#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 5265#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 5264#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 5263#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 5262#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 5261#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 5260#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 5259#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 5258#L23-3 assume !(main_~i~1 < 10); 5176#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; 5162#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5163#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5182#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 5251#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5164#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5165#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5175#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 5169#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5170#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5248#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5246#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 5244#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5242#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5240#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5238#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 5236#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5234#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5232#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5230#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 5228#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5226#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5224#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5222#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 5220#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5218#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5216#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5214#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 5212#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5210#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5208#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5206#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 5204#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5202#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5200#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5199#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 5197#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5195#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; 5192#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 5191#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5189#L9-3 assume !(max_~i~0 < 10); 5158#L9-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 5159#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; 5186#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5171#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5160#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 5161#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5188#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5257#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5256#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 5255#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5254#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5253#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5252#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 5250#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5249#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5247#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5245#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 5243#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5241#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; 5237#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 5235#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5233#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5231#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5229#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 5227#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5225#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5223#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5221#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 5219#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5217#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5215#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5213#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 5211#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5209#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5207#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5205#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 5203#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5201#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5194#L10-3 [2019-11-19 23:00:25,633 INFO L796 eck$LassoCheckResult]: Loop: 5194#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; 5198#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 5196#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5193#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5194#L10-3 [2019-11-19 23:00:25,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:00:25,634 INFO L82 PathProgramCache]: Analyzing trace with hash 2012806109, now seen corresponding path program 9 times [2019-11-19 23:00:25,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:00:25,634 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635579469] [2019-11-19 23:00:25,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:00:25,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:00:25,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:00:25,782 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 23:00:25,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:00:25,782 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 11 times [2019-11-19 23:00:25,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:00:25,783 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985779406] [2019-11-19 23:00:25,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:00:25,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:00:25,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:00:25,788 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 23:00:25,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:00:25,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1723510376, now seen corresponding path program 1 times [2019-11-19 23:00:25,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:00:25,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121073723] [2019-11-19 23:00:25,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:00:25,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:00:26,068 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 190 proven. 0 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2019-11-19 23:00:26,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121073723] [2019-11-19 23:00:26,068 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:00:26,068 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-11-19 23:00:26,068 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645632635] [2019-11-19 23:00:26,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:00:26,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-19 23:00:26,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2019-11-19 23:00:26,119 INFO L87 Difference]: Start difference. First operand 117 states and 142 transitions. cyclomatic complexity: 30 Second operand 15 states. [2019-11-19 23:00:26,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:00:26,410 INFO L93 Difference]: Finished difference Result 154 states and 185 transitions. [2019-11-19 23:00:26,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-19 23:00:26,410 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 154 states and 185 transitions. [2019-11-19 23:00:26,412 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-19 23:00:26,414 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 154 states to 112 states and 133 transitions. [2019-11-19 23:00:26,414 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2019-11-19 23:00:26,414 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 92 [2019-11-19 23:00:26,414 INFO L73 IsDeterministic]: Start isDeterministic. Operand 112 states and 133 transitions. [2019-11-19 23:00:26,415 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 23:00:26,415 INFO L688 BuchiCegarLoop]: Abstraction has 112 states and 133 transitions. [2019-11-19 23:00:26,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states and 133 transitions. [2019-11-19 23:00:26,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2019-11-19 23:00:26,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-11-19 23:00:26,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 133 transitions. [2019-11-19 23:00:26,418 INFO L711 BuchiCegarLoop]: Abstraction has 112 states and 133 transitions. [2019-11-19 23:00:26,418 INFO L591 BuchiCegarLoop]: Abstraction has 112 states and 133 transitions. [2019-11-19 23:00:26,418 INFO L424 BuchiCegarLoop]: ======== Iteration 24============ [2019-11-19 23:00:26,418 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 112 states and 133 transitions. [2019-11-19 23:00:26,420 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-19 23:00:26,420 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 23:00:26,420 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 23:00:26,421 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:00:26,421 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-19 23:00:26,422 INFO L794 eck$LassoCheckResult]: Stem: 5492#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 5489#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.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 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; 5486#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 5487#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 5488#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 5527#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 5525#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 5523#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 5521#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 5519#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 5517#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 5515#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 5513#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 5511#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 5509#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 5507#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 5505#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 5503#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 5501#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 5499#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 5498#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); 5483#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; 5484#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5561#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5560#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 5477#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5475#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5476#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5481#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 5482#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5557#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5555#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5553#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 5551#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5549#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5547#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5545#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 5543#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5541#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5539#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5537#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 5535#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5533#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5532#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5531#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 5530#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5529#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5528#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5526#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 5524#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5522#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5520#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5518#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 5516#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5514#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5512#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5510#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 5508#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5506#L9-3 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5504#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5502#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 5500#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); 5471#L9-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 5472#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; 5494#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5582#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5581#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 5495#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5493#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5478#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5473#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 5474#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5580#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5579#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5578#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 5577#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5576#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5575#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5574#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 5573#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5572#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5571#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5570#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 5569#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5568#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5567#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5566#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 5565#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5564#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5563#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5562#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 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); 5556#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5554#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 5552#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); 5548#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5546#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 5544#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5542#L9-8 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5540#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5538#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 5536#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5534#L9-8 assume !(max_~i~0 < 10); 5490#L9-9 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 5491#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; 5479#L32-3 [2019-11-19 23:00:26,422 INFO L796 eck$LassoCheckResult]: Loop: 5479#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; 5480#L32-2 main_#t~post11 := main_~i~2;main_~i~2 := 1 + main_#t~post11;havoc main_#t~post11; 5479#L32-3 [2019-11-19 23:00:26,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:00:26,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1621163222, now seen corresponding path program 1 times [2019-11-19 23:00:26,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:00:26,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036041308] [2019-11-19 23:00:26,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:00:26,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:00:26,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:00:26,543 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 23:00:26,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:00:26,544 INFO L82 PathProgramCache]: Analyzing trace with hash 3203, now seen corresponding path program 1 times [2019-11-19 23:00:26,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:00:26,544 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610791910] [2019-11-19 23:00:26,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:00:26,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:00:26,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:00:26,548 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 23:00:26,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:00:26,549 INFO L82 PathProgramCache]: Analyzing trace with hash -1135269864, now seen corresponding path program 1 times [2019-11-19 23:00:26,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:00:26,549 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535025704] [2019-11-19 23:00:26,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:00:26,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:00:26,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:00:26,648 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 23:01:00,658 WARN L191 SmtUtils]: Spent 33.95 s on a formula simplification. DAG size of input: 687 DAG size of output: 472 [2019-11-19 23:01:01,819 WARN L191 SmtUtils]: Spent 962.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 152 [2019-11-19 23:01:01,824 INFO L210 LassoAnalysis]: Preferences: [2019-11-19 23:01:01,825 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-19 23:01:01,825 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-19 23:01:01,825 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-19 23:01:01,825 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-19 23:01:01,825 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 23:01:01,825 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-19 23:01:01,825 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-19 23:01:01,825 INFO L133 ssoRankerPreferences]: Filename of dumped script: max10-1.i_Iteration24_Lasso [2019-11-19 23:01:01,825 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-19 23:01:01,825 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-19 23:01:01,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 23:01:01,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 23:01:01,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 23:01:01,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 23:01:02,585 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 83 [2019-11-19 23:01:02,661 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 23:01:02,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 23:01:02,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 23:01:02,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 23:01:02,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 23:01:02,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 23:01:02,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 23:01:02,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 23:01:02,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 23:01:02,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 23:01:02,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 23:01:02,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 23:01:02,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 23:01:02,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 23:01:02,688 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 23:01:02,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 23:01:02,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 23:01:02,977 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-19 23:01:02,977 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9b550e6a-2247-426e-aa16-ea7cf225410d/bin/uautomizer/z3 Starting monitored process 49 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 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 23:01:02,984 INFO L120 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 [2019-11-19 23:01:02,986 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 23:01:02,986 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 23:01:02,986 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 23:01:02,986 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 23:01:02,986 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 23:01:02,987 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 23:01:02,987 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 23:01:02,988 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9b550e6a-2247-426e-aa16-ea7cf225410d/bin/uautomizer/z3 Starting monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 23:01:03,001 INFO L120 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 [2019-11-19 23:01:03,002 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 23:01:03,003 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 23:01:03,003 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 23:01:03,003 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 23:01:03,003 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 23:01:03,003 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 23:01:03,003 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 23:01:03,005 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9b550e6a-2247-426e-aa16-ea7cf225410d/bin/uautomizer/z3 Starting monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 23:01:03,011 INFO L120 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 [2019-11-19 23:01:03,012 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 23:01:03,013 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 23:01:03,013 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 23:01:03,013 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 23:01:03,015 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 23:01:03,015 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 23:01:03,018 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9b550e6a-2247-426e-aa16-ea7cf225410d/bin/uautomizer/z3 Starting monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 23:01:03,028 INFO L120 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 [2019-11-19 23:01:03,029 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 23:01:03,029 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 23:01:03,030 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 23:01:03,030 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 23:01:03,033 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 23:01:03,033 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 23:01:03,036 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9b550e6a-2247-426e-aa16-ea7cf225410d/bin/uautomizer/z3 Starting monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 23:01:03,040 INFO L120 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 [2019-11-19 23:01:03,042 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 23:01:03,042 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 23:01:03,043 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 23:01:03,043 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 23:01:03,047 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 23:01:03,047 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 23:01:03,056 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9b550e6a-2247-426e-aa16-ea7cf225410d/bin/uautomizer/z3 Starting monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 23:01:03,069 INFO L120 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 [2019-11-19 23:01:03,071 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 23:01:03,071 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 23:01:03,071 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 23:01:03,071 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 23:01:03,071 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 23:01:03,072 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 23:01:03,072 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 23:01:03,074 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9b550e6a-2247-426e-aa16-ea7cf225410d/bin/uautomizer/z3 Starting monitored process 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 23:01:03,079 INFO L120 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 [2019-11-19 23:01:03,081 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 23:01:03,081 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 23:01:03,082 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 23:01:03,082 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 23:01:03,084 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 23:01:03,084 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 23:01:03,088 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9b550e6a-2247-426e-aa16-ea7cf225410d/bin/uautomizer/z3 Starting monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 23:01:03,096 INFO L120 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 [2019-11-19 23:01:03,098 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 23:01:03,098 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 23:01:03,098 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 23:01:03,098 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 23:01:03,098 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 23:01:03,099 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 23:01:03,099 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 23:01:03,100 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9b550e6a-2247-426e-aa16-ea7cf225410d/bin/uautomizer/z3 Starting monitored process 57 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 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 23:01:03,105 INFO L120 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 [2019-11-19 23:01:03,106 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 23:01:03,106 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 23:01:03,106 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 23:01:03,106 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 23:01:03,108 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 23:01:03,108 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 23:01:03,113 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9b550e6a-2247-426e-aa16-ea7cf225410d/bin/uautomizer/z3 Starting monitored process 58 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 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 23:01:03,119 INFO L120 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 [2019-11-19 23:01:03,120 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 23:01:03,121 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 23:01:03,121 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 23:01:03,121 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 23:01:03,121 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 23:01:03,122 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 23:01:03,122 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 23:01:03,123 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9b550e6a-2247-426e-aa16-ea7cf225410d/bin/uautomizer/z3 Starting monitored process 59 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 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 23:01:03,129 INFO L120 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 [2019-11-19 23:01:03,130 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 23:01:03,131 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 23:01:03,131 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 23:01:03,131 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 23:01:03,131 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 23:01:03,132 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 23:01:03,132 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 23:01:03,133 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9b550e6a-2247-426e-aa16-ea7cf225410d/bin/uautomizer/z3 Starting monitored process 60 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 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 23:01:03,137 INFO L120 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 [2019-11-19 23:01:03,138 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 23:01:03,138 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 23:01:03,139 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 23:01:03,139 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 23:01:03,139 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 23:01:03,139 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 23:01:03,141 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9b550e6a-2247-426e-aa16-ea7cf225410d/bin/uautomizer/z3 Starting monitored process 61 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 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 23:01:03,146 INFO L120 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 [2019-11-19 23:01:03,147 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 23:01:03,147 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 23:01:03,147 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 23:01:03,147 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 23:01:03,148 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 23:01:03,148 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 23:01:03,150 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9b550e6a-2247-426e-aa16-ea7cf225410d/bin/uautomizer/z3 Starting monitored process 62 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 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 23:01:03,155 INFO L120 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 [2019-11-19 23:01:03,156 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 23:01:03,156 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 23:01:03,157 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 23:01:03,157 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 23:01:03,161 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 23:01:03,161 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 23:01:03,170 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-19 23:01:03,203 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2019-11-19 23:01:03,203 INFO L444 ModelExtractionUtils]: 9 out of 22 variables were initially zero. Simplification set additionally 10 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9b550e6a-2247-426e-aa16-ea7cf225410d/bin/uautomizer/z3 Starting monitored process 63 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 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 23:01:03,207 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-19 23:01:03,209 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-19 23:01:03,209 INFO L510 LassoAnalysis]: Proved termination. [2019-11-19 23:01:03,209 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#x~0.base)_3, ULTIMATE.start_main_~i~2) = 17*v_rep(select #length ULTIMATE.start_main_~#x~0.base)_3 - 16*ULTIMATE.start_main_~i~2 Supporting invariants [] [2019-11-19 23:01:03,423 INFO L297 tatePredicateManager]: 63 out of 63 supporting invariants were superfluous and have been removed [2019-11-19 23:01:03,425 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-19 23:01:03,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:01:03,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:01:03,528 INFO L255 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 23:01:03,530 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:01:03,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:01:03,541 WARN L253 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-19 23:01:03,542 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:01:03,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:01:03,560 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 [2019-11-19 23:01:03,561 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 112 states and 133 transitions. cyclomatic complexity: 23 Second operand 3 states. [2019-11-19 23:01:03,571 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. [2019-11-19 23:01:03,571 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 [2019-11-19 23:01:03,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-19 23:01:03,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2019-11-19 23:01:03,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 24 transitions. Stem has 110 letters. Loop has 2 letters. [2019-11-19 23:01:03,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 23:01:03,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 24 transitions. Stem has 112 letters. Loop has 2 letters. [2019-11-19 23:01:03,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 23:01:03,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 24 transitions. Stem has 110 letters. Loop has 4 letters. [2019-11-19 23:01:03,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 23:01:03,575 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 114 states and 136 transitions. [2019-11-19 23:01:03,576 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-19 23:01:03,576 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 114 states to 0 states and 0 transitions. [2019-11-19 23:01:03,576 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-19 23:01:03,577 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-19 23:01:03,577 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-19 23:01:03,577 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 23:01:03,577 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-19 23:01:03,577 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-19 23:01:03,577 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-19 23:01:03,577 INFO L424 BuchiCegarLoop]: ======== Iteration 25============ [2019-11-19 23:01:03,578 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-19 23:01:03,578 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-19 23:01:03,578 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-19 23:01:03,584 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 19.11 11:01:03 BoogieIcfgContainer [2019-11-19 23:01:03,584 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-19 23:01:03,584 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 23:01:03,585 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 23:01:03,585 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 23:01:03,585 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:00:12" (3/4) ... [2019-11-19 23:01:03,592 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-19 23:01:03,592 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 23:01:03,593 INFO L168 Benchmark]: Toolchain (without parser) took 51822.39 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 293.6 MB). Free memory was 944.7 MB in the beginning and 1.3 GB in the end (delta: -318.0 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 23:01:03,593 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 23:01:03,594 INFO L168 Benchmark]: CACSL2BoogieTranslator took 278.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -177.9 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. [2019-11-19 23:01:03,594 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.70 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 23:01:03,594 INFO L168 Benchmark]: Boogie Preprocessor took 29.74 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: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. [2019-11-19 23:01:03,595 INFO L168 Benchmark]: RCFGBuilder took 401.47 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: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2019-11-19 23:01:03,596 INFO L168 Benchmark]: BuchiAutomizer took 51063.53 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 167.2 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -170.5 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 23:01:03,596 INFO L168 Benchmark]: Witness Printer took 7.63 ms. Allocated memory is still 1.3 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 23:01:03,598 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 278.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -177.9 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 36.70 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.74 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: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 401.47 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: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 51063.53 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 167.2 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -170.5 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 7.63 ms. Allocated memory is still 1.3 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 24 terminating modules (21 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -8 * i + 19 * unknown-#length-unknown[x] and consists of 5 locations. One deterministic module has affine ranking function -2 * i + 19 and consists of 4 locations. One deterministic module has affine ranking function 17 * unknown-#length-unknown[x] + -16 * i and consists of 3 locations. 21 modules have a trivial ranking function, the largest among these consists of 15 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 51.0s and 25 iterations. TraceHistogramMax:10. Analysis of lassos took 48.3s. Construction of modules took 1.3s. Büchi inclusion checks took 0.9s. 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: 628 SDtfs, 1273 SDslu, 1958 SDs, 0 SdLazy, 1146 SolverSat, 251 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU20 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital344 mio100 ax100 hnf99 lsp95 ukn45 mio100 lsp58 div100 bol100 ite100 ukn100 eq171 hnf86 smp100 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 39ms VariablesStem: 2 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 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...