./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/reducercommutativity/avg05-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_e2b88b96-4150-41f8-aef5-2b0b817ff1c8/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_e2b88b96-4150-41f8-aef5-2b0b817ff1c8/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_e2b88b96-4150-41f8-aef5-2b0b817ff1c8/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_e2b88b96-4150-41f8-aef5-2b0b817ff1c8/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/reducercommutativity/avg05-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_e2b88b96-4150-41f8-aef5-2b0b817ff1c8/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_e2b88b96-4150-41f8-aef5-2b0b817ff1c8/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 3cd0186843eb184a03f25fecfe7ca0b9c84c33a9 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 22:32:02,740 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:32:02,741 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:32:02,751 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:32:02,752 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:32:02,753 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:32:02,754 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:32:02,756 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:32:02,758 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:32:02,759 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:32:02,759 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:32:02,761 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:32:02,761 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:32:02,762 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:32:02,763 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:32:02,764 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:32:02,764 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:32:02,765 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:32:02,767 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:32:02,769 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:32:02,771 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:32:02,772 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:32:02,773 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:32:02,774 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:32:02,777 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:32:02,777 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:32:02,778 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:32:02,778 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:32:02,779 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:32:02,780 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:32:02,780 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:32:02,781 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:32:02,782 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:32:02,782 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:32:02,784 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:32:02,784 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:32:02,785 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:32:02,785 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:32:02,785 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:32:02,786 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:32:02,787 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:32:02,787 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_e2b88b96-4150-41f8-aef5-2b0b817ff1c8/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-15 22:32:02,804 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:32:02,804 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:32:02,806 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:32:02,806 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:32:02,806 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:32:02,806 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 22:32:02,807 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 22:32:02,807 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 22:32:02,807 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 22:32:02,807 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 22:32:02,808 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 22:32:02,808 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:32:02,808 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 22:32:02,808 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 22:32:02,809 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 22:32:02,809 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 22:32:02,809 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:32:02,809 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 22:32:02,810 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 22:32:02,810 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 22:32:02,810 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 22:32:02,810 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 22:32:02,811 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 22:32:02,811 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:32:02,811 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 22:32:02,811 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:32:02,812 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:32:02,812 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 22:32:02,812 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:32:02,812 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 22:32:02,813 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 22:32:02,814 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 22:32:02,814 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_e2b88b96-4150-41f8-aef5-2b0b817ff1c8/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 -> 3cd0186843eb184a03f25fecfe7ca0b9c84c33a9 [2019-11-15 22:32:02,841 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:32:02,851 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:32:02,854 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:32:02,855 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:32:02,856 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:32:02,856 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_e2b88b96-4150-41f8-aef5-2b0b817ff1c8/bin/uautomizer/../../sv-benchmarks/c/reducercommutativity/avg05-1.i [2019-11-15 22:32:02,904 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e2b88b96-4150-41f8-aef5-2b0b817ff1c8/bin/uautomizer/data/484c18ecf/c58d8c1f8514495580455c5a23ca0269/FLAGffe33ed83 [2019-11-15 22:32:03,323 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:32:03,325 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_e2b88b96-4150-41f8-aef5-2b0b817ff1c8/sv-benchmarks/c/reducercommutativity/avg05-1.i [2019-11-15 22:32:03,330 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e2b88b96-4150-41f8-aef5-2b0b817ff1c8/bin/uautomizer/data/484c18ecf/c58d8c1f8514495580455c5a23ca0269/FLAGffe33ed83 [2019-11-15 22:32:03,709 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_e2b88b96-4150-41f8-aef5-2b0b817ff1c8/bin/uautomizer/data/484c18ecf/c58d8c1f8514495580455c5a23ca0269 [2019-11-15 22:32:03,712 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:32:03,713 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 22:32:03,714 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:32:03,714 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:32:03,717 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:32:03,718 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:32:03" (1/1) ... [2019-11-15 22:32:03,720 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35863ec4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:32:03, skipping insertion in model container [2019-11-15 22:32:03,721 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:32:03" (1/1) ... [2019-11-15 22:32:03,728 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:32:03,744 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:32:03,946 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:32:04,023 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:32:04,059 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:32:04,074 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:32:04,074 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:32:04 WrapperNode [2019-11-15 22:32:04,075 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:32:04,077 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 22:32:04,077 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 22:32:04,077 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 22:32:04,085 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:32:04" (1/1) ... [2019-11-15 22:32:04,092 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:32:04" (1/1) ... [2019-11-15 22:32:04,118 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 22:32:04,119 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:32:04,120 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:32:04,120 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:32:04,129 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:32:04" (1/1) ... [2019-11-15 22:32:04,129 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:32:04" (1/1) ... [2019-11-15 22:32:04,132 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:32:04" (1/1) ... [2019-11-15 22:32:04,132 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:32:04" (1/1) ... [2019-11-15 22:32:04,138 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:32:04" (1/1) ... [2019-11-15 22:32:04,143 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:32:04" (1/1) ... [2019-11-15 22:32:04,144 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:32:04" (1/1) ... [2019-11-15 22:32:04,147 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:32:04,147 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:32:04,147 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:32:04,147 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:32:04,148 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:32:04" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2b88b96-4150-41f8-aef5-2b0b817ff1c8/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-15 22:32:04,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 22:32:04,196 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:32:04,196 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:32:04,197 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 22:32:04,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 22:32:04,197 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 22:32:04,497 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:32:04,497 INFO L284 CfgBuilder]: Removed 15 assume(true) statements. [2019-11-15 22:32:04,498 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:32:04 BoogieIcfgContainer [2019-11-15 22:32:04,499 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:32:04,499 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 22:32:04,499 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 22:32:04,503 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 22:32:04,504 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 22:32:04,504 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 10:32:03" (1/3) ... [2019-11-15 22:32:04,505 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@782c209c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 10:32:04, skipping insertion in model container [2019-11-15 22:32:04,505 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 22:32:04,505 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:32:04" (2/3) ... [2019-11-15 22:32:04,506 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@782c209c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 10:32:04, skipping insertion in model container [2019-11-15 22:32:04,506 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 22:32:04,506 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:32:04" (3/3) ... [2019-11-15 22:32:04,508 INFO L371 chiAutomizerObserver]: Analyzing ICFG avg05-1.i [2019-11-15 22:32:04,572 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 22:32:04,573 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 22:32:04,573 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 22:32:04,574 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:32:04,574 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:32:04,574 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 22:32:04,574 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:32:04,574 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 22:32:04,589 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2019-11-15 22:32:04,609 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2019-11-15 22:32:04,609 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:32:04,609 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:32:04,617 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 22:32:04,617 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 22:32:04,617 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 22:32:04,617 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2019-11-15 22:32:04,620 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2019-11-15 22:32:04,620 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:32:04,620 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:32:04,621 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 22:32:04,621 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 22:32:04,627 INFO L791 eck$LassoCheckResult]: Stem: 27#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7#L-1true havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, 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(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 26#L23-3true [2019-11-15 22:32:04,627 INFO L793 eck$LassoCheckResult]: Loop: 26#L23-3true assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 9#L23-2true main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 26#L23-3true [2019-11-15 22:32:04,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:32:04,632 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-11-15 22:32:04,638 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:32:04,639 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351646453] [2019-11-15 22:32:04,639 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:04,639 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:04,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:32:04,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:32:04,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:32:04,755 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:32:04,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:32:04,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2019-11-15 22:32:04,757 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:32:04,757 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155366254] [2019-11-15 22:32:04,757 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:04,757 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:04,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:32:04,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:32:04,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:32:04,778 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:32:04,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:32:04,780 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2019-11-15 22:32:04,780 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:32:04,780 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528263647] [2019-11-15 22:32:04,781 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:04,781 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:04,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:32:04,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:32:04,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:32:04,823 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:32:05,022 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:32:05,023 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:32:05,024 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:32:05,024 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:32:05,024 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:32:05,025 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:32:05,025 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:32:05,026 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:32:05,026 INFO L131 ssoRankerPreferences]: Filename of dumped script: avg05-1.i_Iteration1_Lasso [2019-11-15 22:32:05,026 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:32:05,026 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:32:05,058 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-15 22:32:05,065 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-15 22:32:05,068 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-15 22:32:05,071 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-15 22:32:05,074 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-15 22:32:05,078 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-15 22:32:05,081 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-15 22:32:05,083 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-15 22:32:05,086 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-15 22:32:05,088 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-15 22:32:05,092 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-15 22:32:05,095 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-15 22:32:05,097 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-15 22:32:05,100 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-15 22:32:05,102 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-15 22:32:05,152 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-15 22:32:05,153 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-15 22:32:05,158 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-15 22:32:05,336 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:32:05,341 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 22:32:05,342 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-15 22:32:05,344 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:32:05,344 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:32:05,345 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:32:05,345 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:32:05,345 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:32:05,347 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:32:05,347 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:32:05,350 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:32:05,350 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-15 22:32:05,354 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:32:05,354 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:32:05,354 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:32:05,354 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:32:05,355 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:32:05,356 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:32:05,360 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:32:05,362 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:32:05,363 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-15 22:32:05,364 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:32:05,365 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:32:05,365 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:32:05,366 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:32:05,366 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:32:05,367 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:32:05,367 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:32:05,368 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:32:05,369 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-15 22:32:05,372 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:32:05,372 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:32:05,372 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:32:05,372 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:32:05,372 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:32:05,373 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:32:05,373 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:32:05,374 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:32:05,374 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-15 22:32:05,375 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:32:05,375 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:32:05,375 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:32:05,375 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:32:05,381 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:32:05,382 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:32:05,386 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:32:05,386 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-15 22:32:05,387 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:32:05,387 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:32:05,387 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:32:05,387 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:32:05,388 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:32:05,388 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:32:05,388 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:32:05,389 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:32:05,389 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-15 22:32:05,390 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:32:05,390 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:32:05,390 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:32:05,390 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:32:05,391 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:32:05,391 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:32:05,391 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:32:05,396 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:32:05,397 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-15 22:32:05,398 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:32:05,398 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:32:05,398 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:32:05,398 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:32:05,398 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:32:05,399 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:32:05,399 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:32:05,400 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:32:05,400 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-15 22:32:05,401 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:32:05,401 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:32:05,401 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:32:05,401 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:32:05,401 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:32:05,402 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:32:05,402 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:32:05,403 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:32:05,403 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-15 22:32:05,403 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:32:05,404 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:32:05,404 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:32:05,404 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:32:05,406 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:32:05,406 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:32:05,410 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:32:05,411 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-15 22:32:05,411 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:32:05,411 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:32:05,411 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:32:05,412 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:32:05,412 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:32:05,412 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:32:05,412 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:32:05,413 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:32:05,413 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-15 22:32:05,414 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:32:05,414 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:32:05,414 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:32:05,414 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:32:05,415 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:32:05,415 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:32:05,415 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:32:05,416 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:32:05,416 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-15 22:32:05,417 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:32:05,417 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:32:05,417 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:32:05,417 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:32:05,417 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:32:05,418 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:32:05,418 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:32:05,419 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:32:05,419 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-15 22:32:05,420 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:32:05,420 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:32:05,420 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:32:05,420 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:32:05,420 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:32:05,421 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:32:05,421 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:32:05,422 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:32:05,422 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-15 22:32:05,423 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:32:05,423 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-15 22:32:05,423 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:32:05,423 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:32:05,425 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-15 22:32:05,426 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:32:05,436 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:32:05,436 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-15 22:32:05,437 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:32:05,437 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:32:05,437 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:32:05,437 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:32:05,439 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:32:05,439 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:32:05,443 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:32:05,443 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-15 22:32:05,444 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:32:05,444 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:32:05,444 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:32:05,444 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:32:05,444 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:32:05,452 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:32:05,453 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:32:05,455 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:32:05,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-15 22:32:05,460 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:32:05,460 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:32:05,461 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:32:05,461 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:32:05,461 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:32:05,463 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:32:05,463 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:32:05,469 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:32:05,469 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-15 22:32:05,470 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:32:05,470 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:32:05,470 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:32:05,470 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:32:05,472 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:32:05,472 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:32:05,482 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:32:05,483 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-15 22:32:05,483 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:32:05,483 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:32:05,484 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:32:05,484 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:32:05,500 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:32:05,501 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:32:05,584 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 22:32:05,619 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-11-15 22:32:05,619 INFO L444 ModelExtractionUtils]: 7 out of 13 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-11-15 22:32:05,621 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 22:32:05,623 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 22:32:05,624 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 22:32:05,624 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 + 9*v_rep(select #length ULTIMATE.start_main_~#x~0.base)_1 Supporting invariants [] [2019-11-15 22:32:05,629 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2019-11-15 22:32:05,637 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-15 22:32:05,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:32:05,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:32:05,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:32:05,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:32:05,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:32:05,687 WARN L254 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 22:32:05,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:32:05,718 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-15 22:32:05,734 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-15 22:32:05,735 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states. Second operand 3 states. [2019-11-15 22:32:05,856 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states.. Second operand 3 states. Result 66 states and 92 transitions. Complement of second has 8 states. [2019-11-15 22:32:05,856 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-15 22:32:05,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 22:32:05,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2019-11-15 22:32:05,860 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 61 transitions. Stem has 2 letters. Loop has 2 letters. [2019-11-15 22:32:05,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:32:05,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 61 transitions. Stem has 4 letters. Loop has 2 letters. [2019-11-15 22:32:05,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:32:05,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 61 transitions. Stem has 2 letters. Loop has 4 letters. [2019-11-15 22:32:05,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:32:05,862 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 92 transitions. [2019-11-15 22:32:05,867 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-11-15 22:32:05,871 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 19 states and 24 transitions. [2019-11-15 22:32:05,872 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-11-15 22:32:05,872 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-11-15 22:32:05,873 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 24 transitions. [2019-11-15 22:32:05,873 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:32:05,873 INFO L688 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2019-11-15 22:32:05,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 24 transitions. [2019-11-15 22:32:05,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-11-15 22:32:05,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-15 22:32:05,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2019-11-15 22:32:05,898 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2019-11-15 22:32:05,899 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2019-11-15 22:32:05,899 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 22:32:05,899 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. [2019-11-15 22:32:05,905 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-11-15 22:32:05,905 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:32:05,905 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:32:05,905 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-15 22:32:05,905 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 22:32:05,906 INFO L791 eck$LassoCheckResult]: Stem: 151#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 148#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, 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(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 145#L23-3 assume !(main_~i~1 < 5); 144#L23-4 avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 137#L9-3 [2019-11-15 22:32:05,906 INFO L793 eck$LassoCheckResult]: Loop: 137#L9-3 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 138#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 137#L9-3 [2019-11-15 22:32:05,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:32:05,906 INFO L82 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2019-11-15 22:32:05,907 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:32:05,907 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282814151] [2019-11-15 22:32:05,907 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:05,908 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:05,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:32:05,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:32:05,960 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-15 22:32:05,960 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282814151] [2019-11-15 22:32:05,961 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:32:05,961 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:32:05,961 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364359450] [2019-11-15 22:32:05,963 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 22:32:05,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:32:05,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 1 times [2019-11-15 22:32:05,964 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:32:05,964 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877807634] [2019-11-15 22:32:05,964 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:05,964 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:05,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:32:05,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:32:05,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:32:05,972 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:32:06,008 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:32:06,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:32:06,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:32:06,011 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. cyclomatic complexity: 10 Second operand 3 states. [2019-11-15 22:32:06,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:32:06,025 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2019-11-15 22:32:06,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:32:06,026 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 24 transitions. [2019-11-15 22:32:06,027 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-11-15 22:32:06,028 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 24 transitions. [2019-11-15 22:32:06,028 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-11-15 22:32:06,028 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-11-15 22:32:06,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 24 transitions. [2019-11-15 22:32:06,029 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:32:06,029 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 24 transitions. [2019-11-15 22:32:06,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 24 transitions. [2019-11-15 22:32:06,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2019-11-15 22:32:06,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-15 22:32:06,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2019-11-15 22:32:06,031 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2019-11-15 22:32:06,031 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2019-11-15 22:32:06,031 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 22:32:06,031 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 23 transitions. [2019-11-15 22:32:06,032 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-11-15 22:32:06,032 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:32:06,032 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:32:06,032 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-15 22:32:06,032 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 22:32:06,033 INFO L791 eck$LassoCheckResult]: Stem: 194#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 193#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, 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(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 190#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 191#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 192#L23-3 assume !(main_~i~1 < 5); 189#L23-4 avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 182#L9-3 [2019-11-15 22:32:06,033 INFO L793 eck$LassoCheckResult]: Loop: 182#L9-3 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 183#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 182#L9-3 [2019-11-15 22:32:06,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:32:06,033 INFO L82 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2019-11-15 22:32:06,033 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:32:06,033 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895812069] [2019-11-15 22:32:06,034 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:06,034 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:06,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:32:06,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:32:06,080 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-15 22:32:06,080 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895812069] [2019-11-15 22:32:06,081 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2132017833] [2019-11-15 22:32:06,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2b88b96-4150-41f8-aef5-2b0b817ff1c8/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:32:06,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:32:06,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 22:32:06,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:32:06,143 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-15 22:32:06,144 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:32:06,144 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-11-15 22:32:06,144 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518804102] [2019-11-15 22:32:06,145 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 22:32:06,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:32:06,145 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 2 times [2019-11-15 22:32:06,145 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:32:06,145 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94866812] [2019-11-15 22:32:06,146 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:06,146 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:06,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:32:06,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:32:06,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:32:06,163 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:32:06,203 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:32:06,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:32:06,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:32:06,203 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. cyclomatic complexity: 9 Second operand 5 states. [2019-11-15 22:32:06,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:32:06,223 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2019-11-15 22:32:06,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:32:06,225 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 26 transitions. [2019-11-15 22:32:06,226 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-11-15 22:32:06,227 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 26 transitions. [2019-11-15 22:32:06,227 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-11-15 22:32:06,227 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-11-15 22:32:06,227 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 26 transitions. [2019-11-15 22:32:06,227 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:32:06,228 INFO L688 BuchiCegarLoop]: Abstraction has 22 states and 26 transitions. [2019-11-15 22:32:06,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 26 transitions. [2019-11-15 22:32:06,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-11-15 22:32:06,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-15 22:32:06,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2019-11-15 22:32:06,230 INFO L711 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-11-15 22:32:06,230 INFO L591 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-11-15 22:32:06,230 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 22:32:06,230 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 25 transitions. [2019-11-15 22:32:06,231 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-11-15 22:32:06,231 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:32:06,231 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:32:06,232 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2019-11-15 22:32:06,232 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 22:32:06,232 INFO L791 eck$LassoCheckResult]: Stem: 261#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 258#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, 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(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 254#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 255#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 256#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 257#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 264#L23-3 assume !(main_~i~1 < 5); 253#L23-4 avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 246#L9-3 [2019-11-15 22:32:06,232 INFO L793 eck$LassoCheckResult]: Loop: 246#L9-3 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 247#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 246#L9-3 [2019-11-15 22:32:06,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:32:06,234 INFO L82 PathProgramCache]: Analyzing trace with hash 265236367, now seen corresponding path program 2 times [2019-11-15 22:32:06,235 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:32:06,235 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382707867] [2019-11-15 22:32:06,235 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:06,235 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:06,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:32:06,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:32:06,282 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-15 22:32:06,283 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382707867] [2019-11-15 22:32:06,283 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1713025068] [2019-11-15 22:32:06,283 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2b88b96-4150-41f8-aef5-2b0b817ff1c8/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:32:06,347 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 22:32:06,347 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:32:06,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 22:32:06,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:32:06,358 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-15 22:32:06,358 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:32:06,358 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-11-15 22:32:06,358 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639026987] [2019-11-15 22:32:06,359 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 22:32:06,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:32:06,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 3 times [2019-11-15 22:32:06,359 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:32:06,359 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368099082] [2019-11-15 22:32:06,360 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:06,360 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:06,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:32:06,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:32:06,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:32:06,367 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:32:06,404 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:32:06,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:32:06,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:32:06,404 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. cyclomatic complexity: 9 Second operand 6 states. [2019-11-15 22:32:06,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:32:06,433 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2019-11-15 22:32:06,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:32:06,434 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 28 transitions. [2019-11-15 22:32:06,434 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-11-15 22:32:06,435 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 28 transitions. [2019-11-15 22:32:06,435 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-11-15 22:32:06,435 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-11-15 22:32:06,436 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 28 transitions. [2019-11-15 22:32:06,436 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:32:06,436 INFO L688 BuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2019-11-15 22:32:06,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 28 transitions. [2019-11-15 22:32:06,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-11-15 22:32:06,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-15 22:32:06,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2019-11-15 22:32:06,438 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2019-11-15 22:32:06,438 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2019-11-15 22:32:06,439 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-15 22:32:06,439 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 27 transitions. [2019-11-15 22:32:06,439 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-11-15 22:32:06,440 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:32:06,440 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:32:06,440 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1] [2019-11-15 22:32:06,440 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 22:32:06,440 INFO L791 eck$LassoCheckResult]: Stem: 334#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 333#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, 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(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 329#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 330#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 331#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 332#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 341#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 340#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 339#L23-3 assume !(main_~i~1 < 5); 328#L23-4 avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 321#L9-3 [2019-11-15 22:32:06,441 INFO L793 eck$LassoCheckResult]: Loop: 321#L9-3 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 322#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 321#L9-3 [2019-11-15 22:32:06,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:32:06,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1489134225, now seen corresponding path program 3 times [2019-11-15 22:32:06,441 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:32:06,441 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72705535] [2019-11-15 22:32:06,442 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:06,442 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:06,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:32:06,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:32:06,509 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-15 22:32:06,509 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72705535] [2019-11-15 22:32:06,509 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [600339877] [2019-11-15 22:32:06,509 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2b88b96-4150-41f8-aef5-2b0b817ff1c8/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:32:06,560 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-15 22:32:06,560 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:32:06,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 22:32:06,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:32:06,572 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-15 22:32:06,572 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:32:06,572 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-11-15 22:32:06,572 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009023956] [2019-11-15 22:32:06,573 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 22:32:06,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:32:06,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 4 times [2019-11-15 22:32:06,573 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:32:06,574 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859135468] [2019-11-15 22:32:06,574 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:06,574 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:06,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:32:06,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:32:06,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:32:06,580 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:32:06,620 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:32:06,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 22:32:06,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:32:06,620 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. cyclomatic complexity: 9 Second operand 7 states. [2019-11-15 22:32:06,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:32:06,646 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2019-11-15 22:32:06,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 22:32:06,650 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 30 transitions. [2019-11-15 22:32:06,651 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-11-15 22:32:06,651 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 30 transitions. [2019-11-15 22:32:06,651 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-11-15 22:32:06,652 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-11-15 22:32:06,652 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 30 transitions. [2019-11-15 22:32:06,652 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:32:06,652 INFO L688 BuchiCegarLoop]: Abstraction has 26 states and 30 transitions. [2019-11-15 22:32:06,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 30 transitions. [2019-11-15 22:32:06,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2019-11-15 22:32:06,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-15 22:32:06,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2019-11-15 22:32:06,654 INFO L711 BuchiCegarLoop]: Abstraction has 25 states and 29 transitions. [2019-11-15 22:32:06,655 INFO L591 BuchiCegarLoop]: Abstraction has 25 states and 29 transitions. [2019-11-15 22:32:06,655 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-15 22:32:06,655 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 29 transitions. [2019-11-15 22:32:06,655 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-11-15 22:32:06,656 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:32:06,656 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:32:06,656 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2019-11-15 22:32:06,656 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 22:32:06,657 INFO L791 eck$LassoCheckResult]: Stem: 423#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 419#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, 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(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 415#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 416#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 417#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 418#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 420#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 429#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 428#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 427#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 426#L23-3 assume !(main_~i~1 < 5); 414#L23-4 avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 407#L9-3 [2019-11-15 22:32:06,657 INFO L793 eck$LassoCheckResult]: Loop: 407#L9-3 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 408#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 407#L9-3 [2019-11-15 22:32:06,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:32:06,657 INFO L82 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 4 times [2019-11-15 22:32:06,657 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:32:06,657 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316057394] [2019-11-15 22:32:06,658 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:06,658 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:06,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:32:06,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:32:06,718 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-15 22:32:06,718 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316057394] [2019-11-15 22:32:06,719 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1823443025] [2019-11-15 22:32:06,719 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2b88b96-4150-41f8-aef5-2b0b817ff1c8/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:32:06,778 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-15 22:32:06,779 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:32:06,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 22:32:06,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:32:06,790 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-15 22:32:06,793 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:32:06,794 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-11-15 22:32:06,794 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485596250] [2019-11-15 22:32:06,794 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 22:32:06,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:32:06,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 5 times [2019-11-15 22:32:06,795 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:32:06,796 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792542490] [2019-11-15 22:32:06,796 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:06,796 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:06,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:32:06,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:32:06,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:32:06,807 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:32:06,841 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:32:06,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 22:32:06,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:32:06,842 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. cyclomatic complexity: 9 Second operand 8 states. [2019-11-15 22:32:06,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:32:06,894 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2019-11-15 22:32:06,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 22:32:06,896 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 31 transitions. [2019-11-15 22:32:06,897 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-11-15 22:32:06,897 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 31 transitions. [2019-11-15 22:32:06,897 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-11-15 22:32:06,897 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-11-15 22:32:06,897 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 31 transitions. [2019-11-15 22:32:06,898 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:32:06,898 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2019-11-15 22:32:06,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 31 transitions. [2019-11-15 22:32:06,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-11-15 22:32:06,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-15 22:32:06,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2019-11-15 22:32:06,900 INFO L711 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2019-11-15 22:32:06,900 INFO L591 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2019-11-15 22:32:06,900 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-15 22:32:06,900 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 31 transitions. [2019-11-15 22:32:06,901 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-11-15 22:32:06,901 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:32:06,901 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:32:06,902 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1] [2019-11-15 22:32:06,902 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 22:32:06,902 INFO L791 eck$LassoCheckResult]: Stem: 517#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 515#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, 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(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 511#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 512#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 513#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 514#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 516#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 527#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 526#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 525#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 524#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 523#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 522#L23-3 assume !(main_~i~1 < 5); 510#L23-4 avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 503#L9-3 [2019-11-15 22:32:06,902 INFO L793 eck$LassoCheckResult]: Loop: 503#L9-3 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 504#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 503#L9-3 [2019-11-15 22:32:06,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:32:06,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1745699051, now seen corresponding path program 5 times [2019-11-15 22:32:06,903 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:32:06,903 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427549392] [2019-11-15 22:32:06,903 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:06,903 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:06,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:32:06,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:32:06,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:32:06,927 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:32:06,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:32:06,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 6 times [2019-11-15 22:32:06,927 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:32:06,928 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476584843] [2019-11-15 22:32:06,928 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:06,928 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:06,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:32:06,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:32:06,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:32:06,934 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:32:06,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:32:06,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1715425495, now seen corresponding path program 1 times [2019-11-15 22:32:06,935 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:32:06,935 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180565482] [2019-11-15 22:32:06,935 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:06,935 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:06,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:32:06,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:32:06,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:32:06,974 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:32:07,509 WARN L191 SmtUtils]: Spent 494.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 102 [2019-11-15 22:32:07,600 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:32:07,601 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:32:07,601 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:32:07,601 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:32:07,601 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:32:07,601 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:32:07,601 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:32:07,601 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:32:07,601 INFO L131 ssoRankerPreferences]: Filename of dumped script: avg05-1.i_Iteration7_Lasso [2019-11-15 22:32:07,601 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:32:07,601 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:32:07,605 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-15 22:32:07,608 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-15 22:32:07,609 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-15 22:32:07,611 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-15 22:32:07,613 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-15 22:32:07,614 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-15 22:32:07,616 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-15 22:32:07,618 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-15 22:32:07,620 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-15 22:32:07,622 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-15 22:32:07,623 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-15 22:32:07,625 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-15 22:32:07,733 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-15 22:32:07,738 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-15 22:32:07,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:32:07,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:32:07,745 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-15 22:32:07,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:32:07,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:32:07,753 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-15 22:32:07,754 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-15 22:32:07,756 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-15 22:32:08,002 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:32:08,002 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 22:32:08,003 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-15 22:32:08,003 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:32:08,004 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:32:08,004 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:32:08,004 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:32:08,004 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:32:08,004 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:32:08,004 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:32:08,005 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:32:08,005 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-15 22:32:08,006 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:32:08,006 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:32:08,006 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:32:08,006 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:32:08,006 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:32:08,006 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:32:08,007 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:32:08,007 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:32:08,007 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-15 22:32:08,008 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:32:08,008 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:32:08,008 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:32:08,008 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:32:08,009 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:32:08,009 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:32:08,011 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:32:08,012 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-15 22:32:08,012 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:32:08,013 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:32:08,013 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:32:08,013 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:32:08,013 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:32:08,013 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:32:08,014 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:32:08,014 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:32:08,014 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-15 22:32:08,015 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:32:08,015 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:32:08,015 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:32:08,015 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:32:08,015 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:32:08,016 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:32:08,016 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:32:08,016 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:32:08,017 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-15 22:32:08,017 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:32:08,017 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:32:08,017 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:32:08,018 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:32:08,018 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:32:08,018 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:32:08,018 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:32:08,019 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:32:08,019 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-15 22:32:08,020 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:32:08,020 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:32:08,020 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:32:08,020 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:32:08,020 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:32:08,021 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:32:08,021 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:32:08,021 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:32:08,022 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-15 22:32:08,022 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:32:08,022 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:32:08,023 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:32:08,023 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:32:08,023 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:32:08,023 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:32:08,023 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:32:08,024 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:32:08,024 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-15 22:32:08,025 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:32:08,025 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:32:08,025 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:32:08,025 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:32:08,026 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:32:08,026 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:32:08,028 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:32:08,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-15 22:32:08,029 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:32:08,029 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:32:08,029 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:32:08,029 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:32:08,029 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:32:08,030 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:32:08,030 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:32:08,030 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:32:08,030 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-15 22:32:08,031 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:32:08,031 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:32:08,031 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:32:08,031 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:32:08,032 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:32:08,032 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:32:08,032 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:32:08,033 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:32:08,033 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-15 22:32:08,033 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:32:08,034 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-15 22:32:08,034 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:32:08,034 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:32:08,036 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-15 22:32:08,036 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:32:08,043 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:32:08,043 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-15 22:32:08,044 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:32:08,044 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:32:08,044 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:32:08,044 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:32:08,045 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:32:08,046 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:32:08,048 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:32:08,048 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-15 22:32:08,049 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:32:08,049 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:32:08,049 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:32:08,049 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:32:08,051 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:32:08,051 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:32:08,052 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:32:08,053 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-15 22:32:08,053 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:32:08,053 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:32:08,054 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:32:08,054 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:32:08,056 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:32:08,056 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:32:08,071 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 22:32:08,106 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-15 22:32:08,106 INFO L444 ModelExtractionUtils]: 17 out of 22 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-11-15 22:32:08,106 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 22:32:08,107 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 22:32:08,108 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 22:32:08,108 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_avg_~i~0) = -2*ULTIMATE.start_avg_~i~0 + 9 Supporting invariants [] [2019-11-15 22:32:08,123 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-11-15 22:32:08,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:32:08,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:32:08,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:32:08,153 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:32:08,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:32:08,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 22:32:08,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:32:08,169 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-15 22:32:08,170 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-15 22:32:08,170 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 31 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-11-15 22:32:08,187 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 31 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 31 states and 38 transitions. Complement of second has 7 states. [2019-11-15 22:32:08,188 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-15 22:32:08,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 22:32:08,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2019-11-15 22:32:08,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 14 letters. Loop has 2 letters. [2019-11-15 22:32:08,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:32:08,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 16 letters. Loop has 2 letters. [2019-11-15 22:32:08,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:32:08,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 14 letters. Loop has 4 letters. [2019-11-15 22:32:08,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:32:08,190 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 38 transitions. [2019-11-15 22:32:08,191 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-11-15 22:32:08,192 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 28 states and 33 transitions. [2019-11-15 22:32:08,192 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-11-15 22:32:08,192 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-11-15 22:32:08,192 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 33 transitions. [2019-11-15 22:32:08,192 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:32:08,192 INFO L688 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2019-11-15 22:32:08,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 33 transitions. [2019-11-15 22:32:08,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-11-15 22:32:08,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-15 22:32:08,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2019-11-15 22:32:08,195 INFO L711 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2019-11-15 22:32:08,195 INFO L591 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2019-11-15 22:32:08,195 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-15 22:32:08,195 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 33 transitions. [2019-11-15 22:32:08,195 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-11-15 22:32:08,195 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:32:08,195 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:32:08,196 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:32:08,196 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 22:32:08,196 INFO L791 eck$LassoCheckResult]: Stem: 660#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 658#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, 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(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 654#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 655#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 656#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 657#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 659#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 670#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 669#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 668#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 667#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 666#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 665#L23-3 assume !(main_~i~1 < 5); 653#L23-4 avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 645#L9-3 assume !(avg_~i~0 < 5); 643#L9-4 avg_#res := (if (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % 5 then 1 + avg_~ret~0 / 5 else avg_~ret~0 / 5) % 4294967296 <= 2147483647 then (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % 5 then 1 + avg_~ret~0 / 5 else avg_~ret~0 / 5) % 4294967296 else (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % 5 then 1 + avg_~ret~0 / 5 else avg_~ret~0 / 5) % 4294967296 - 4294967296); 644#L12 main_#t~ret4 := avg_#res;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 663#L9-8 [2019-11-15 22:32:08,197 INFO L793 eck$LassoCheckResult]: Loop: 663#L9-8 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 664#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 663#L9-8 [2019-11-15 22:32:08,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:32:08,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1638581027, now seen corresponding path program 1 times [2019-11-15 22:32:08,197 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:32:08,197 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212322598] [2019-11-15 22:32:08,197 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:08,197 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:08,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:32:08,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:32:08,222 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-15 22:32:08,222 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212322598] [2019-11-15 22:32:08,222 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:32:08,223 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:32:08,223 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735096431] [2019-11-15 22:32:08,223 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 22:32:08,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:32:08,223 INFO L82 PathProgramCache]: Analyzing trace with hash 2243, now seen corresponding path program 1 times [2019-11-15 22:32:08,223 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:32:08,224 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316222553] [2019-11-15 22:32:08,224 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:08,224 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:08,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:32:08,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:32:08,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:32:08,229 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:32:08,261 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:32:08,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:32:08,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:32:08,261 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. cyclomatic complexity: 10 Second operand 3 states. [2019-11-15 22:32:08,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:32:08,284 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2019-11-15 22:32:08,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:32:08,285 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 37 transitions. [2019-11-15 22:32:08,285 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-11-15 22:32:08,286 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 37 transitions. [2019-11-15 22:32:08,286 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-11-15 22:32:08,286 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-11-15 22:32:08,286 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 37 transitions. [2019-11-15 22:32:08,287 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:32:08,287 INFO L688 BuchiCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-11-15 22:32:08,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 37 transitions. [2019-11-15 22:32:08,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2019-11-15 22:32:08,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-15 22:32:08,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2019-11-15 22:32:08,289 INFO L711 BuchiCegarLoop]: Abstraction has 29 states and 33 transitions. [2019-11-15 22:32:08,289 INFO L591 BuchiCegarLoop]: Abstraction has 29 states and 33 transitions. [2019-11-15 22:32:08,289 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-15 22:32:08,289 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 33 transitions. [2019-11-15 22:32:08,290 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-11-15 22:32:08,290 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:32:08,290 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:32:08,291 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:32:08,291 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 22:32:08,291 INFO L791 eck$LassoCheckResult]: Stem: 726#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 725#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, 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(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 721#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 722#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 723#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 724#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 738#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 737#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 736#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 735#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 734#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 733#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 732#L23-3 assume !(main_~i~1 < 5); 720#L23-4 avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 712#L9-3 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 713#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 714#L9-3 assume !(avg_~i~0 < 5); 710#L9-4 avg_#res := (if (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % 5 then 1 + avg_~ret~0 / 5 else avg_~ret~0 / 5) % 4294967296 <= 2147483647 then (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % 5 then 1 + avg_~ret~0 / 5 else avg_~ret~0 / 5) % 4294967296 else (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % 5 then 1 + avg_~ret~0 / 5 else avg_~ret~0 / 5) % 4294967296 - 4294967296); 711#L12 main_#t~ret4 := avg_#res;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 729#L9-8 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 730#L9-7 [2019-11-15 22:32:08,291 INFO L793 eck$LassoCheckResult]: Loop: 730#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 731#L9-8 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 730#L9-7 [2019-11-15 22:32:08,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:32:08,291 INFO L82 PathProgramCache]: Analyzing trace with hash -1577614809, now seen corresponding path program 1 times [2019-11-15 22:32:08,292 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:32:08,292 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360745809] [2019-11-15 22:32:08,292 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:08,292 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:08,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:32:08,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:32:08,325 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-15 22:32:08,325 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360745809] [2019-11-15 22:32:08,326 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [89953850] [2019-11-15 22:32:08,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2b88b96-4150-41f8-aef5-2b0b817ff1c8/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:32:08,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:32:08,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 22:32:08,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:32:08,418 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-15 22:32:08,419 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:32:08,419 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-11-15 22:32:08,419 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075022423] [2019-11-15 22:32:08,419 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 22:32:08,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:32:08,420 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 2 times [2019-11-15 22:32:08,420 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:32:08,420 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901028104] [2019-11-15 22:32:08,420 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:08,420 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:08,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:32:08,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:32:08,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:32:08,424 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:32:08,457 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:32:08,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:32:08,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:32:08,457 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. cyclomatic complexity: 9 Second operand 5 states. [2019-11-15 22:32:08,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:32:08,497 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2019-11-15 22:32:08,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:32:08,498 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 43 transitions. [2019-11-15 22:32:08,498 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-11-15 22:32:08,499 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 39 states and 43 transitions. [2019-11-15 22:32:08,499 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2019-11-15 22:32:08,499 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2019-11-15 22:32:08,499 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 43 transitions. [2019-11-15 22:32:08,499 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:32:08,500 INFO L688 BuchiCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-11-15 22:32:08,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 43 transitions. [2019-11-15 22:32:08,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 33. [2019-11-15 22:32:08,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-15 22:32:08,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-11-15 22:32:08,502 INFO L711 BuchiCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-11-15 22:32:08,502 INFO L591 BuchiCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-11-15 22:32:08,502 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-15 22:32:08,502 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 37 transitions. [2019-11-15 22:32:08,503 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-11-15 22:32:08,503 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:32:08,503 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:32:08,503 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:32:08,504 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 22:32:08,504 INFO L791 eck$LassoCheckResult]: Stem: 861#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 860#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, 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(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 856#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 857#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 858#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 859#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 875#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 874#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 873#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 872#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 871#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 870#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 869#L23-3 assume !(main_~i~1 < 5); 855#L23-4 avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 845#L9-3 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 846#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 847#L9-3 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 848#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 852#L9-3 assume !(avg_~i~0 < 5); 843#L9-4 avg_#res := (if (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % 5 then 1 + avg_~ret~0 / 5 else avg_~ret~0 / 5) % 4294967296 <= 2147483647 then (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % 5 then 1 + avg_~ret~0 / 5 else avg_~ret~0 / 5) % 4294967296 else (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % 5 then 1 + avg_~ret~0 / 5 else avg_~ret~0 / 5) % 4294967296 - 4294967296); 844#L12 main_#t~ret4 := avg_#res;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 866#L9-8 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 867#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 864#L9-8 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 865#L9-7 [2019-11-15 22:32:08,504 INFO L793 eck$LassoCheckResult]: Loop: 865#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 868#L9-8 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 865#L9-7 [2019-11-15 22:32:08,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:32:08,504 INFO L82 PathProgramCache]: Analyzing trace with hash -483964569, now seen corresponding path program 1 times [2019-11-15 22:32:08,504 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:32:08,505 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758476640] [2019-11-15 22:32:08,505 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:08,505 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:08,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:32:08,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:32:08,546 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-15 22:32:08,546 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758476640] [2019-11-15 22:32:08,546 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [120249413] [2019-11-15 22:32:08,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2b88b96-4150-41f8-aef5-2b0b817ff1c8/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:32:08,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:32:08,623 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 22:32:08,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:32:08,637 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-15 22:32:08,637 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:32:08,637 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-11-15 22:32:08,637 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722476389] [2019-11-15 22:32:08,638 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 22:32:08,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:32:08,638 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 3 times [2019-11-15 22:32:08,638 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:32:08,638 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871388534] [2019-11-15 22:32:08,638 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:08,638 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:08,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:32:08,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:32:08,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:32:08,648 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:32:08,684 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:32:08,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:32:08,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:32:08,684 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. cyclomatic complexity: 9 Second operand 6 states. [2019-11-15 22:32:08,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:32:08,750 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2019-11-15 22:32:08,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:32:08,751 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 49 transitions. [2019-11-15 22:32:08,752 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-11-15 22:32:08,752 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 45 states and 49 transitions. [2019-11-15 22:32:08,752 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2019-11-15 22:32:08,752 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2019-11-15 22:32:08,752 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 49 transitions. [2019-11-15 22:32:08,753 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:32:08,753 INFO L688 BuchiCegarLoop]: Abstraction has 45 states and 49 transitions. [2019-11-15 22:32:08,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 49 transitions. [2019-11-15 22:32:08,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 37. [2019-11-15 22:32:08,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-11-15 22:32:08,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2019-11-15 22:32:08,755 INFO L711 BuchiCegarLoop]: Abstraction has 37 states and 41 transitions. [2019-11-15 22:32:08,755 INFO L591 BuchiCegarLoop]: Abstraction has 37 states and 41 transitions. [2019-11-15 22:32:08,755 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-15 22:32:08,755 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 41 transitions. [2019-11-15 22:32:08,755 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-11-15 22:32:08,755 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:32:08,756 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:32:08,756 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:32:08,756 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 22:32:08,756 INFO L791 eck$LassoCheckResult]: Stem: 1019#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1016#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, 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(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1012#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1013#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1014#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1015#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1034#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1033#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1031#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1030#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1029#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1028#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1027#L23-3 assume !(main_~i~1 < 5); 1011#L23-4 avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 1001#L9-3 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1002#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 1003#L9-3 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1004#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 1008#L9-3 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1026#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 1025#L9-3 assume !(avg_~i~0 < 5); 999#L9-4 avg_#res := (if (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % 5 then 1 + avg_~ret~0 / 5 else avg_~ret~0 / 5) % 4294967296 <= 2147483647 then (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % 5 then 1 + avg_~ret~0 / 5 else avg_~ret~0 / 5) % 4294967296 else (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % 5 then 1 + avg_~ret~0 / 5 else avg_~ret~0 / 5) % 4294967296 - 4294967296); 1000#L12 main_#t~ret4 := avg_#res;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 1022#L9-8 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1023#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 1024#L9-8 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1035#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 1020#L9-8 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1021#L9-7 [2019-11-15 22:32:08,756 INFO L793 eck$LassoCheckResult]: Loop: 1021#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 1032#L9-8 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1021#L9-7 [2019-11-15 22:32:08,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:32:08,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1757450151, now seen corresponding path program 2 times [2019-11-15 22:32:08,757 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:32:08,757 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040545896] [2019-11-15 22:32:08,757 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:08,757 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:08,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:32:08,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:32:08,809 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-15 22:32:08,810 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040545896] [2019-11-15 22:32:08,810 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1206176677] [2019-11-15 22:32:08,810 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2b88b96-4150-41f8-aef5-2b0b817ff1c8/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:32:08,883 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 22:32:08,883 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:32:08,884 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 22:32:08,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:32:08,895 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-15 22:32:08,895 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:32:08,896 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-11-15 22:32:08,896 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98522907] [2019-11-15 22:32:08,896 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 22:32:08,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:32:08,896 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 4 times [2019-11-15 22:32:08,897 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:32:08,897 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128585126] [2019-11-15 22:32:08,897 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:08,897 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:08,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:32:08,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:32:08,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:32:08,905 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:32:08,942 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:32:08,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 22:32:08,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:32:08,943 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. cyclomatic complexity: 9 Second operand 7 states. [2019-11-15 22:32:09,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:32:09,009 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2019-11-15 22:32:09,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 22:32:09,010 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 55 transitions. [2019-11-15 22:32:09,011 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-11-15 22:32:09,011 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 51 states and 55 transitions. [2019-11-15 22:32:09,011 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2019-11-15 22:32:09,011 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2019-11-15 22:32:09,012 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 55 transitions. [2019-11-15 22:32:09,012 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:32:09,012 INFO L688 BuchiCegarLoop]: Abstraction has 51 states and 55 transitions. [2019-11-15 22:32:09,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 55 transitions. [2019-11-15 22:32:09,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 41. [2019-11-15 22:32:09,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-15 22:32:09,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2019-11-15 22:32:09,015 INFO L711 BuchiCegarLoop]: Abstraction has 41 states and 45 transitions. [2019-11-15 22:32:09,015 INFO L591 BuchiCegarLoop]: Abstraction has 41 states and 45 transitions. [2019-11-15 22:32:09,015 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-11-15 22:32:09,015 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 45 transitions. [2019-11-15 22:32:09,016 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-11-15 22:32:09,016 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:32:09,016 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:32:09,017 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:32:09,017 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 22:32:09,017 INFO L791 eck$LassoCheckResult]: Stem: 1197#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1194#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, 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(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1190#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1191#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1192#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1193#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1211#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1210#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1207#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1206#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1205#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1204#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1203#L23-3 assume !(main_~i~1 < 5); 1189#L23-4 avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 1180#L9-3 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1181#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 1182#L9-3 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1183#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 1214#L9-3 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1213#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 1212#L9-3 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1202#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 1201#L9-3 assume !(avg_~i~0 < 5); 1178#L9-4 avg_#res := (if (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % 5 then 1 + avg_~ret~0 / 5 else avg_~ret~0 / 5) % 4294967296 <= 2147483647 then (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % 5 then 1 + avg_~ret~0 / 5 else avg_~ret~0 / 5) % 4294967296 else (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % 5 then 1 + avg_~ret~0 / 5 else avg_~ret~0 / 5) % 4294967296 - 4294967296); 1179#L12 main_#t~ret4 := avg_#res;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 1198#L9-8 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1199#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 1200#L9-8 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1218#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 1217#L9-8 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1216#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 1215#L9-8 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1209#L9-7 [2019-11-15 22:32:09,017 INFO L793 eck$LassoCheckResult]: Loop: 1209#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 1208#L9-8 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1209#L9-7 [2019-11-15 22:32:09,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:32:09,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1218450663, now seen corresponding path program 3 times [2019-11-15 22:32:09,017 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:32:09,018 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846133721] [2019-11-15 22:32:09,018 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:09,018 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:09,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:32:09,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:32:09,079 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-11-15 22:32:09,079 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846133721] [2019-11-15 22:32:09,079 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [714155903] [2019-11-15 22:32:09,080 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2b88b96-4150-41f8-aef5-2b0b817ff1c8/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:32:09,160 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-11-15 22:32:09,160 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:32:09,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 22:32:09,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:32:09,172 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-11-15 22:32:09,173 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:32:09,173 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-11-15 22:32:09,173 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619023434] [2019-11-15 22:32:09,173 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 22:32:09,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:32:09,174 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 5 times [2019-11-15 22:32:09,174 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:32:09,174 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563848628] [2019-11-15 22:32:09,174 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:09,174 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:09,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:32:09,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:32:09,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:32:09,182 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:32:09,209 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:32:09,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 22:32:09,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:32:09,210 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. cyclomatic complexity: 9 Second operand 8 states. [2019-11-15 22:32:09,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:32:09,281 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2019-11-15 22:32:09,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 22:32:09,282 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 58 transitions. [2019-11-15 22:32:09,283 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-11-15 22:32:09,283 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 54 states and 58 transitions. [2019-11-15 22:32:09,283 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2019-11-15 22:32:09,284 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2019-11-15 22:32:09,284 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 58 transitions. [2019-11-15 22:32:09,284 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:32:09,284 INFO L688 BuchiCegarLoop]: Abstraction has 54 states and 58 transitions. [2019-11-15 22:32:09,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 58 transitions. [2019-11-15 22:32:09,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 45. [2019-11-15 22:32:09,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-15 22:32:09,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2019-11-15 22:32:09,287 INFO L711 BuchiCegarLoop]: Abstraction has 45 states and 49 transitions. [2019-11-15 22:32:09,287 INFO L591 BuchiCegarLoop]: Abstraction has 45 states and 49 transitions. [2019-11-15 22:32:09,287 INFO L424 BuchiCegarLoop]: ======== Iteration 13============ [2019-11-15 22:32:09,287 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 49 transitions. [2019-11-15 22:32:09,288 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-11-15 22:32:09,288 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:32:09,288 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:32:09,293 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:32:09,293 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 22:32:09,293 INFO L791 eck$LassoCheckResult]: Stem: 1395#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1394#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, 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(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1390#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1391#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1392#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1393#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1416#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1414#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1412#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1410#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1408#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1406#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1405#L23-3 assume !(main_~i~1 < 5); 1389#L23-4 avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 1379#L9-3 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1380#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 1381#L9-3 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1382#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 1386#L9-3 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1421#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 1420#L9-3 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1419#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 1418#L9-3 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1402#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 1401#L9-3 assume !(avg_~i~0 < 5); 1377#L9-4 avg_#res := (if (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % 5 then 1 + avg_~ret~0 / 5 else avg_~ret~0 / 5) % 4294967296 <= 2147483647 then (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % 5 then 1 + avg_~ret~0 / 5 else avg_~ret~0 / 5) % 4294967296 else (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % 5 then 1 + avg_~ret~0 / 5 else avg_~ret~0 / 5) % 4294967296 - 4294967296); 1378#L12 main_#t~ret4 := avg_#res;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 1398#L9-8 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1399#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 1400#L9-8 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1417#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 1415#L9-8 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1413#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 1411#L9-8 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1409#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 1407#L9-8 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1404#L9-7 [2019-11-15 22:32:09,293 INFO L793 eck$LassoCheckResult]: Loop: 1404#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 1403#L9-8 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1404#L9-7 [2019-11-15 22:32:09,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:32:09,294 INFO L82 PathProgramCache]: Analyzing trace with hash -2144167641, now seen corresponding path program 4 times [2019-11-15 22:32:09,294 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:32:09,294 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596208317] [2019-11-15 22:32:09,294 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:09,294 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:09,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:32:09,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:32:09,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:32:09,418 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:32:09,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:32:09,419 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 6 times [2019-11-15 22:32:09,419 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:32:09,419 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998567400] [2019-11-15 22:32:09,419 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:09,419 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:09,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:32:09,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:32:09,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:32:09,424 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:32:09,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:32:09,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1039200421, now seen corresponding path program 5 times [2019-11-15 22:32:09,425 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:32:09,426 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050095037] [2019-11-15 22:32:09,426 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:09,426 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:09,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:32:09,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:32:09,558 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-11-15 22:32:09,559 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050095037] [2019-11-15 22:32:09,559 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:32:09,559 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-15 22:32:09,559 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587153822] [2019-11-15 22:32:09,590 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:32:09,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 22:32:09,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-11-15 22:32:09,590 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. cyclomatic complexity: 9 Second operand 10 states. [2019-11-15 22:32:09,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:32:09,768 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2019-11-15 22:32:09,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 22:32:09,768 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 55 transitions. [2019-11-15 22:32:09,769 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 22:32:09,770 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 42 states and 43 transitions. [2019-11-15 22:32:09,770 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2019-11-15 22:32:09,770 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2019-11-15 22:32:09,770 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 43 transitions. [2019-11-15 22:32:09,770 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:32:09,770 INFO L688 BuchiCegarLoop]: Abstraction has 42 states and 43 transitions. [2019-11-15 22:32:09,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 43 transitions. [2019-11-15 22:32:09,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-11-15 22:32:09,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-15 22:32:09,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2019-11-15 22:32:09,773 INFO L711 BuchiCegarLoop]: Abstraction has 42 states and 43 transitions. [2019-11-15 22:32:09,773 INFO L591 BuchiCegarLoop]: Abstraction has 42 states and 43 transitions. [2019-11-15 22:32:09,773 INFO L424 BuchiCegarLoop]: ======== Iteration 14============ [2019-11-15 22:32:09,773 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 43 transitions. [2019-11-15 22:32:09,774 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 22:32:09,774 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:32:09,774 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:32:09,774 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:32:09,775 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 22:32:09,775 INFO L791 eck$LassoCheckResult]: Stem: 1518#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1515#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, 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(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1511#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1512#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1513#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1514#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1536#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1535#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1533#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1531#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1529#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1526#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1525#L23-3 assume !(main_~i~1 < 5); 1510#L23-4 avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 1505#L9-3 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1506#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 1507#L9-3 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1534#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 1532#L9-3 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1530#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 1528#L9-3 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1527#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 1524#L9-3 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1523#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 1522#L9-3 assume !(avg_~i~0 < 5); 1503#L9-4 avg_#res := (if (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % 5 then 1 + avg_~ret~0 / 5 else avg_~ret~0 / 5) % 4294967296 <= 2147483647 then (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % 5 then 1 + avg_~ret~0 / 5 else avg_~ret~0 / 5) % 4294967296 else (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % 5 then 1 + avg_~ret~0 / 5 else avg_~ret~0 / 5) % 4294967296 - 4294967296); 1504#L12 main_#t~ret4 := avg_#res;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 1519#L9-8 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1520#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 1521#L9-8 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1544#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 1543#L9-8 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1542#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 1541#L9-8 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1540#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 1539#L9-8 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1538#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 1537#L9-8 assume !(avg_~i~0 < 5); 1516#L9-9 avg_#res := (if (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % 5 then 1 + avg_~ret~0 / 5 else avg_~ret~0 / 5) % 4294967296 <= 2147483647 then (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % 5 then 1 + avg_~ret~0 / 5 else avg_~ret~0 / 5) % 4294967296 else (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % 5 then 1 + avg_~ret~0 / 5 else avg_~ret~0 / 5) % 4294967296 - 4294967296); 1517#L12-1 main_#t~ret7 := avg_#res;main_~ret2~0 := main_#t~ret7;havoc main_#t~ret7;call main_#t~mem8 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem8;havoc main_#t~mem8;main_~i~2 := 0; 1508#L32-3 [2019-11-15 22:32:09,775 INFO L793 eck$LassoCheckResult]: Loop: 1508#L32-3 assume !!(main_~i~2 < 4);call main_#t~mem10 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~2), 4);call write~int(main_#t~mem10, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~2, 4);havoc main_#t~mem10; 1509#L32-2 main_#t~post9 := main_~i~2;main_~i~2 := 1 + main_#t~post9;havoc main_#t~post9; 1508#L32-3 [2019-11-15 22:32:09,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:32:09,775 INFO L82 PathProgramCache]: Analyzing trace with hash -2055775835, now seen corresponding path program 1 times [2019-11-15 22:32:09,776 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:32:09,776 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434691073] [2019-11-15 22:32:09,776 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:09,776 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:09,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:32:09,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:32:09,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:32:09,927 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:32:09,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:32:09,928 INFO L82 PathProgramCache]: Analyzing trace with hash 2755, now seen corresponding path program 1 times [2019-11-15 22:32:09,928 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:32:09,928 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190072296] [2019-11-15 22:32:09,929 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:09,929 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:09,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:32:09,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:32:09,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:32:09,935 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:32:09,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:32:09,935 INFO L82 PathProgramCache]: Analyzing trace with hash 84380519, now seen corresponding path program 1 times [2019-11-15 22:32:09,935 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:32:09,936 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190189901] [2019-11-15 22:32:09,936 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:09,936 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:09,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:32:09,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:32:10,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:32:10,050 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:32:13,197 WARN L191 SmtUtils]: Spent 3.09 s on a formula simplification. DAG size of input: 367 DAG size of output: 261 [2019-11-15 22:33:38,595 WARN L191 SmtUtils]: Spent 1.41 m on a formula simplification. DAG size of input: 227 DAG size of output: 152 [2019-11-15 22:33:38,598 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:33:38,598 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:33:38,598 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:33:38,598 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:33:38,598 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:33:38,598 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:33:38,599 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:33:38,599 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:33:38,599 INFO L131 ssoRankerPreferences]: Filename of dumped script: avg05-1.i_Iteration14_Lasso [2019-11-15 22:33:38,599 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:33:38,599 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:33:38,601 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-15 22:33:38,741 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-15 22:33:38,743 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-15 22:33:38,749 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-15 22:33:38,753 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-15 22:33:38,756 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-15 22:33:38,758 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-15 22:33:38,760 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-15 22:33:38,767 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-15 22:33:38,769 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-15 22:33:39,294 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 109 [2019-11-15 22:33:43,932 WARN L177 XnfTransformerHelper]: Simplifying disjunction of 5389 conjuctions. This might take some time... [2019-11-15 22:33:44,003 INFO L193 XnfTransformerHelper]: Simplified to disjunction of 10 conjuctions. [2019-11-15 22:33:45,671 WARN L191 SmtUtils]: Spent 1.63 s on a formula simplification. DAG size of input: 146 DAG size of output: 115 [2019-11-15 22:33:45,930 WARN L191 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-11-15 22:33:45,930 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-15 22:33:45,932 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-15 22:33:45,933 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-15 22:33:45,935 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-15 22:33:45,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-15 22:33:45,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-15 22:33:45,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-15 22:33:45,941 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-15 22:33:45,944 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-15 22:33:48,083 WARN L191 SmtUtils]: Spent 1.94 s on a formula simplification. DAG size of input: 239 DAG size of output: 143 [2019-11-15 22:33:48,116 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 13 [2019-11-15 22:33:53,362 WARN L191 SmtUtils]: Spent 4.95 s on a formula simplification. DAG size of input: 307 DAG size of output: 127 [2019-11-15 22:33:53,410 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:33:53,411 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 22:33:53,411 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-15 22:33:53,412 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:33:53,412 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:33:53,412 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:33:53,412 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:33:53,413 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:33:53,413 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:33:53,413 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:33:53,414 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:33:53,414 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-15 22:33:53,414 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:33:53,415 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:33:53,415 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:33:53,415 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:33:53,415 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:33:53,415 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:33:53,416 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:33:53,416 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:33:53,416 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-15 22:33:53,417 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:33:53,417 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:33:53,417 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:33:53,417 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:33:53,417 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:33:53,418 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:33:53,418 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:33:53,418 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:33:53,418 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-15 22:33:53,419 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:33:53,419 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:33:53,419 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:33:53,419 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:33:53,420 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:33:53,420 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:33:53,422 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:33:53,422 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-15 22:33:53,422 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:33:53,423 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:33:53,423 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:33:53,423 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:33:53,423 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:33:53,423 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:33:53,424 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:33:53,424 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:33:53,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-15 22:33:53,425 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:33:53,425 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:33:53,425 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:33:53,425 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:33:53,426 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:33:53,426 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:33:53,426 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:33:53,426 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:33:53,427 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-15 22:33:53,427 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:33:53,427 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:33:53,427 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:33:53,428 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:33:53,428 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:33:53,428 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:33:53,429 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:33:53,430 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-15 22:33:53,430 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:33:53,430 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:33:53,431 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:33:53,431 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:33:53,431 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:33:53,431 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:33:53,431 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:33:53,432 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:33:53,432 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-15 22:33:53,433 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:33:53,433 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:33:53,433 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:33:53,433 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:33:53,434 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:33:53,434 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:33:53,437 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:33:53,437 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-15 22:33:53,438 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:33:53,438 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:33:53,438 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:33:53,438 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:33:53,440 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:33:53,440 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:33:53,457 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 22:33:53,482 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2019-11-15 22:33:53,483 INFO L444 ModelExtractionUtils]: 19 out of 25 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-11-15 22:33:53,483 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 22:33:53,484 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 22:33:53,484 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 22:33:53,484 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~2) = -2*ULTIMATE.start_main_~i~2 + 7 Supporting invariants [] [2019-11-15 22:33:53,642 INFO L297 tatePredicateManager]: 39 out of 39 supporting invariants were superfluous and have been removed [2019-11-15 22:33:53,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:33:53,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:33:53,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:33:53,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:33:53,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:33:53,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 22:33:53,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:33:53,726 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-15 22:33:53,726 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-15 22:33:53,727 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 43 transitions. cyclomatic complexity: 3 Second operand 3 states. [2019-11-15 22:33:53,736 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 43 transitions. cyclomatic complexity: 3. Second operand 3 states. Result 44 states and 46 transitions. Complement of second has 4 states. [2019-11-15 22:33:53,736 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-15 22:33:53,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 22:33:53,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2019-11-15 22:33:53,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 40 letters. Loop has 2 letters. [2019-11-15 22:33:53,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:33:53,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 42 letters. Loop has 2 letters. [2019-11-15 22:33:53,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:33:53,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 40 letters. Loop has 4 letters. [2019-11-15 22:33:53,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:33:53,738 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 46 transitions. [2019-11-15 22:33:53,739 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 22:33:53,739 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 0 states and 0 transitions. [2019-11-15 22:33:53,739 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 22:33:53,739 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 22:33:53,739 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 22:33:53,739 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:33:53,739 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:33:53,739 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:33:53,739 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:33:53,739 INFO L424 BuchiCegarLoop]: ======== Iteration 15============ [2019-11-15 22:33:53,739 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 22:33:53,739 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 22:33:53,740 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 22:33:53,744 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 10:33:53 BoogieIcfgContainer [2019-11-15 22:33:53,744 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 22:33:53,745 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 22:33:53,745 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 22:33:53,745 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 22:33:53,746 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:32:04" (3/4) ... [2019-11-15 22:33:53,749 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 22:33:53,749 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 22:33:53,750 INFO L168 Benchmark]: Toolchain (without parser) took 110037.25 ms. Allocated memory was 1.0 GB in the beginning and 2.2 GB in the end (delta: 1.1 GB). Free memory was 941.0 MB in the beginning and 795.2 MB in the end (delta: 145.8 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2019-11-15 22:33:53,750 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 963.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:33:53,751 INFO L168 Benchmark]: CACSL2BoogieTranslator took 362.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 941.0 MB in the beginning and 1.1 GB in the end (delta: -194.2 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. [2019-11-15 22:33:53,751 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.93 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-15 22:33:53,752 INFO L168 Benchmark]: Boogie Preprocessor took 27.68 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 22:33:53,752 INFO L168 Benchmark]: RCFGBuilder took 351.53 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: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. [2019-11-15 22:33:53,753 INFO L168 Benchmark]: BuchiAutomizer took 109245.23 ms. Allocated memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: 999.3 MB). Free memory was 1.1 GB in the beginning and 795.2 MB in the end (delta: 310.9 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2019-11-15 22:33:53,753 INFO L168 Benchmark]: Witness Printer took 4.08 ms. Allocated memory is still 2.2 GB. Free memory is still 795.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:33:53,756 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.26 ms. Allocated memory is still 1.0 GB. Free memory is still 963.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 362.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 941.0 MB in the beginning and 1.1 GB in the end (delta: -194.2 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 41.93 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 27.68 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 351.53 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: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 109245.23 ms. Allocated memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: 999.3 MB). Free memory was 1.1 GB in the beginning and 795.2 MB in the end (delta: 310.9 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. * Witness Printer took 4.08 ms. Allocated memory is still 2.2 GB. Free memory is still 795.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 14 terminating modules (11 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -8 * i + 9 * unknown-#length-unknown[x] and consists of 5 locations. One deterministic module has affine ranking function -2 * i + 9 and consists of 4 locations. One deterministic module has affine ranking function -2 * i + 7 and consists of 3 locations. 11 modules have a trivial ranking function, the largest among these consists of 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 109.1s and 15 iterations. TraceHistogramMax:5. Analysis of lassos took 107.9s. Construction of modules took 0.4s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 14. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 41 StatesRemovedByMinimization, 9 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 45 states and ocurred in iteration 12. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 227 SDtfs, 195 SDslu, 446 SDs, 0 SdLazy, 314 SolverSat, 92 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU10 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital2198 mio100 ax100 hnf99 lsp445 ukn40 mio100 lsp213 div80 bol100 ite100 ukn100 eq166 hnf91 smp72 dnf2541 smp67 tf100 neg99 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 13ms VariablesStem: 2 VariablesLoop: 0 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...