./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-crafted/4BitCounterPointer.c --full-output --architecture 64bit -------------------------------------------------------------------------------- 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_82c2d14a-f5db-44aa-af8f-169e9d0f11e3/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_82c2d14a-f5db-44aa-af8f-169e9d0f11e3/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_82c2d14a-f5db-44aa-af8f-169e9d0f11e3/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_82c2d14a-f5db-44aa-af8f-169e9d0f11e3/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-crafted/4BitCounterPointer.c -s /tmp/vcloud-vcloud-master/worker/run_dir_82c2d14a-f5db-44aa-af8f-169e9d0f11e3/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_82c2d14a-f5db-44aa-af8f-169e9d0f11e3/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 64bit --witnessprinter.graph.data.programhash 0233d496bfaf5cb1311bfa260a57f41458184795 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:00:01,593 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:00:01,594 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:00:01,608 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:00:01,608 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:00:01,609 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:00:01,611 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:00:01,620 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:00:01,624 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:00:01,626 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:00:01,627 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:00:01,629 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:00:01,629 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:00:01,631 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:00:01,631 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:00:01,632 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:00:01,633 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:00:01,633 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:00:01,636 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:00:01,639 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:00:01,642 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:00:01,644 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:00:01,647 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:00:01,648 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:00:01,652 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:00:01,652 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:00:01,653 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:00:01,655 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:00:01,655 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:00:01,656 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:00:01,656 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:00:01,657 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:00:01,657 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:00:01,658 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:00:01,659 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:00:01,659 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:00:01,660 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:00:01,660 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:00:01,660 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:00:01,661 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:00:01,661 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:00:01,662 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_82c2d14a-f5db-44aa-af8f-169e9d0f11e3/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-15 22:00:01,677 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:00:01,677 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:00:01,679 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:00:01,679 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:00:01,679 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:00:01,679 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 22:00:01,679 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 22:00:01,680 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 22:00:01,680 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 22:00:01,680 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 22:00:01,680 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 22:00:01,681 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:00:01,681 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 22:00:01,681 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 22:00:01,681 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:00:01,681 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 22:00:01,682 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 22:00:01,682 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 22:00:01,682 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 22:00:01,682 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 22:00:01,682 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:00:01,683 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 22:00:01,683 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:00:01,683 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:00:01,683 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 22:00:01,684 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:00:01,684 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 22:00:01,684 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 22:00:01,685 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 22:00:01,685 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_82c2d14a-f5db-44aa-af8f-169e9d0f11e3/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0233d496bfaf5cb1311bfa260a57f41458184795 [2019-11-15 22:00:01,713 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:00:01,723 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:00:01,729 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:00:01,731 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:00:01,733 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:00:01,734 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_82c2d14a-f5db-44aa-af8f-169e9d0f11e3/bin/uautomizer/../../sv-benchmarks/c/termination-crafted/4BitCounterPointer.c [2019-11-15 22:00:01,791 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_82c2d14a-f5db-44aa-af8f-169e9d0f11e3/bin/uautomizer/data/8b809234e/6f4d3617ce764a5481ff269c1f070aa0/FLAGd10cf16d0 [2019-11-15 22:00:02,180 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:00:02,181 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_82c2d14a-f5db-44aa-af8f-169e9d0f11e3/sv-benchmarks/c/termination-crafted/4BitCounterPointer.c [2019-11-15 22:00:02,187 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_82c2d14a-f5db-44aa-af8f-169e9d0f11e3/bin/uautomizer/data/8b809234e/6f4d3617ce764a5481ff269c1f070aa0/FLAGd10cf16d0 [2019-11-15 22:00:02,204 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_82c2d14a-f5db-44aa-af8f-169e9d0f11e3/bin/uautomizer/data/8b809234e/6f4d3617ce764a5481ff269c1f070aa0 [2019-11-15 22:00:02,206 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:00:02,207 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 22:00:02,210 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:00:02,210 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:00:02,214 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:00:02,214 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:00:02" (1/1) ... [2019-11-15 22:00:02,217 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ff8676e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:00:02, skipping insertion in model container [2019-11-15 22:00:02,217 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:00:02" (1/1) ... [2019-11-15 22:00:02,223 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:00:02,242 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:00:02,494 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:00:02,510 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:00:02,529 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:00:02,544 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:00:02,545 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:00:02 WrapperNode [2019-11-15 22:00:02,545 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:00:02,546 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 22:00:02,546 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 22:00:02,546 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 22:00:02,554 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:00:02" (1/1) ... [2019-11-15 22:00:02,568 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:00:02" (1/1) ... [2019-11-15 22:00:02,591 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 22:00:02,592 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:00:02,592 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:00:02,592 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:00:02,600 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:00:02" (1/1) ... [2019-11-15 22:00:02,601 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:00:02" (1/1) ... [2019-11-15 22:00:02,613 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:00:02" (1/1) ... [2019-11-15 22:00:02,614 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:00:02" (1/1) ... [2019-11-15 22:00:02,619 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:00:02" (1/1) ... [2019-11-15 22:00:02,625 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:00:02" (1/1) ... [2019-11-15 22:00:02,631 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:00:02" (1/1) ... [2019-11-15 22:00:02,639 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:00:02,639 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:00:02,640 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:00:02,640 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:00:02,641 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:00:02" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_82c2d14a-f5db-44aa-af8f-169e9d0f11e3/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:00:02,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 22:00:02,706 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:00:02,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:00:02,707 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 22:00:02,707 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 22:00:02,707 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 22:00:02,923 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:00:02,923 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-15 22:00:02,924 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:00:02 BoogieIcfgContainer [2019-11-15 22:00:02,924 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:00:02,925 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 22:00:02,925 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 22:00:02,928 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 22:00:02,929 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 22:00:02,929 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 10:00:02" (1/3) ... [2019-11-15 22:00:02,930 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2acd6687 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 10:00:02, skipping insertion in model container [2019-11-15 22:00:02,930 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 22:00:02,930 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:00:02" (2/3) ... [2019-11-15 22:00:02,930 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2acd6687 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 10:00:02, skipping insertion in model container [2019-11-15 22:00:02,930 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 22:00:02,931 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:00:02" (3/3) ... [2019-11-15 22:00:02,932 INFO L371 chiAutomizerObserver]: Analyzing ICFG 4BitCounterPointer.c [2019-11-15 22:00:02,994 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 22:00:02,994 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 22:00:02,994 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 22:00:02,994 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:00:02,994 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:00:02,994 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 22:00:02,995 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:00:02,995 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 22:00:03,023 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2019-11-15 22:00:03,041 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 22:00:03,042 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:00:03,042 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:00:03,049 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 22:00:03,049 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 22:00:03,049 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 22:00:03,050 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2019-11-15 22:00:03,051 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 22:00:03,051 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:00:03,051 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:00:03,051 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 22:00:03,067 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 22:00:03,074 INFO L791 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#L-1true havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnStack(4);main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); 6#L24-2true [2019-11-15 22:00:03,074 INFO L793 eck$LassoCheckResult]: Loop: 6#L24-2true call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 12#L15-1true assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 5#L16true assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 6#L24-2true [2019-11-15 22:00:03,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:00:03,080 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-11-15 22:00:03,102 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:00:03,102 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59720601] [2019-11-15 22:00:03,103 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:00:03,103 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:00:03,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:00:03,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:00:03,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:00:03,278 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:00:03,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:00:03,279 INFO L82 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 1 times [2019-11-15 22:00:03,279 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:00:03,280 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486788197] [2019-11-15 22:00:03,280 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:00:03,280 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:00:03,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:00:03,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:00:03,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:00:03,295 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:00:03,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:00:03,297 INFO L82 PathProgramCache]: Analyzing trace with hash 28695847, now seen corresponding path program 1 times [2019-11-15 22:00:03,297 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:00:03,297 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024147639] [2019-11-15 22:00:03,298 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:00:03,298 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:00:03,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:00:03,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:00:03,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:00:03,370 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:00:03,481 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-11-15 22:00:04,216 WARN L191 SmtUtils]: Spent 697.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 98 [2019-11-15 22:00:04,507 WARN L191 SmtUtils]: Spent 288.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2019-11-15 22:00:04,520 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:00:04,521 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:00:04,521 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:00:04,521 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:00:04,521 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:00:04,522 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:00:04,522 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:00:04,522 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:00:04,522 INFO L131 ssoRankerPreferences]: Filename of dumped script: 4BitCounterPointer.c_Iteration1_Lasso [2019-11-15 22:00:04,522 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:00:04,523 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:00:04,564 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:00:04,570 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:00:04,576 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:00:04,578 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:00:04,582 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:00:05,206 WARN L191 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 83 [2019-11-15 22:00:05,385 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-11-15 22:00:05,385 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:00:05,388 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:00:05,390 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:00:05,394 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:00:05,536 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 34 [2019-11-15 22:00:06,766 WARN L191 SmtUtils]: Spent 882.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2019-11-15 22:00:06,881 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:00:06,886 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 22:00:06,888 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:00:06,889 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:00:06,890 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:00:06,890 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:00:06,891 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:00:06,891 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:00:06,893 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:00:06,893 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:00:06,895 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:00:06,896 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:00:06,897 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:00:06,897 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:00:06,897 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:00:06,897 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:00:06,900 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:00:06,900 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:00:06,913 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:00:06,914 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:00:06,915 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:00:06,915 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:00:06,915 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:00:06,915 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:00:06,915 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:00:06,916 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:00:06,916 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:00:06,917 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:00:06,917 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:00:06,918 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:00:06,918 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:00:06,918 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:00:06,918 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:00:06,920 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:00:06,920 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:00:06,923 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:00:06,923 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:00:06,924 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:00:06,924 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:00:06,924 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:00:06,925 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:00:06,937 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:00:06,937 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:00:07,009 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:00:07,009 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:00:07,010 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:00:07,010 INFO L202 nArgumentSynthesizer]: 16 stem disjuncts [2019-11-15 22:00:07,011 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:00:07,011 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:00:07,030 INFO L400 nArgumentSynthesizer]: We have 36 Motzkin's Theorem applications. [2019-11-15 22:00:07,030 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:00:07,173 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:00:07,174 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:00:07,174 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:00:07,175 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:00:07,175 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:00:07,175 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:00:07,177 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:00:07,177 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:00:07,183 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:00:07,184 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:00:07,185 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:00:07,186 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:00:07,186 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:00:07,186 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:00:07,187 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:00:07,187 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:00:07,191 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:00:07,192 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:00:07,192 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:00:07,193 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:00:07,193 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:00:07,193 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:00:07,198 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:00:07,198 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:00:07,200 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:00:07,201 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:00:07,202 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:00:07,202 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:00:07,203 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:00:07,203 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:00:07,204 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:00:07,204 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:00:07,207 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:00:07,208 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:00:07,208 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:00:07,209 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:00:07,209 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:00:07,209 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:00:07,210 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:00:07,210 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:00:07,213 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:00:07,214 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:00:07,215 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:00:07,215 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:00:07,215 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:00:07,216 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:00:07,217 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:00:07,218 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:00:07,220 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:00:07,221 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:00:07,222 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:00:07,222 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:00:07,222 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:00:07,222 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:00:07,223 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:00:07,223 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:00:07,230 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:00:07,231 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:00:07,231 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:00:07,231 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:00:07,231 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:00:07,232 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:00:07,232 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:00:07,232 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:00:07,235 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:00:07,236 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:00:07,236 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:00:07,236 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:00:07,237 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:00:07,237 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:00:07,238 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:00:07,238 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:00:07,242 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:00:07,243 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:00:07,244 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:00:07,244 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:00:07,244 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:00:07,244 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:00:07,246 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:00:07,246 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:00:07,248 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:00:07,251 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:00:07,251 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:00:07,252 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:00:07,252 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:00:07,252 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:00:07,253 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:00:07,254 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:00:07,265 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 22:00:07,277 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-15 22:00:07,278 INFO L444 ModelExtractionUtils]: 3 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 22:00:07,280 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 22:00:07,281 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 22:00:07,282 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 22:00:07,282 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset)_1) = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset)_1 + 1 Supporting invariants [] [2019-11-15 22:00:07,438 INFO L297 tatePredicateManager]: 40 out of 40 supporting invariants were superfluous and have been removed [2019-11-15 22:00:07,447 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 22:00:07,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:00:07,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:00:07,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:00:07,504 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:00:07,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:00:07,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 22:00:07,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:00:07,528 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:00:07,542 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:00:07,544 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states. Second operand 4 states. [2019-11-15 22:00:07,590 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states.. Second operand 4 states. Result 29 states and 36 transitions. Complement of second has 8 states. [2019-11-15 22:00:07,592 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:00:07,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-15 22:00:07,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2019-11-15 22:00:07,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 2 letters. Loop has 3 letters. [2019-11-15 22:00:07,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:00:07,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 5 letters. Loop has 3 letters. [2019-11-15 22:00:07,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:00:07,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 2 letters. Loop has 6 letters. [2019-11-15 22:00:07,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:00:07,598 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 36 transitions. [2019-11-15 22:00:07,600 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 22:00:07,604 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 13 states and 18 transitions. [2019-11-15 22:00:07,605 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-11-15 22:00:07,605 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-15 22:00:07,606 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 18 transitions. [2019-11-15 22:00:07,606 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:00:07,606 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2019-11-15 22:00:07,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 18 transitions. [2019-11-15 22:00:07,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-11-15 22:00:07,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-15 22:00:07,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2019-11-15 22:00:07,627 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2019-11-15 22:00:07,627 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2019-11-15 22:00:07,627 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 22:00:07,628 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2019-11-15 22:00:07,628 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 22:00:07,629 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:00:07,629 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:00:07,629 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 22:00:07,629 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 22:00:07,630 INFO L791 eck$LassoCheckResult]: Stem: 245#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 243#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnStack(4);main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); 244#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 253#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 246#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 247#L20 [2019-11-15 22:00:07,630 INFO L793 eck$LassoCheckResult]: Loop: 247#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 250#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 251#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 255#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 247#L20 [2019-11-15 22:00:07,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:00:07,630 INFO L82 PathProgramCache]: Analyzing trace with hash 28695849, now seen corresponding path program 1 times [2019-11-15 22:00:07,631 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:00:07,631 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666862637] [2019-11-15 22:00:07,631 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:00:07,631 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:00:07,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:00:07,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:00:07,749 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:00:07,749 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666862637] [2019-11-15 22:00:07,750 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:00:07,750 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:00:07,750 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564935483] [2019-11-15 22:00:07,752 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 22:00:07,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:00:07,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1526457, now seen corresponding path program 1 times [2019-11-15 22:00:07,753 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:00:07,753 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176732189] [2019-11-15 22:00:07,753 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:00:07,753 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:00:07,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:00:07,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:00:07,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:00:07,773 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:00:07,880 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:00:07,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:00:07,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:00:07,883 INFO L87 Difference]: Start difference. First operand 13 states and 18 transitions. cyclomatic complexity: 7 Second operand 5 states. [2019-11-15 22:00:07,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:00:07,990 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2019-11-15 22:00:07,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:00:07,991 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 21 transitions. [2019-11-15 22:00:07,992 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 22:00:07,993 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 15 states and 19 transitions. [2019-11-15 22:00:07,993 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-15 22:00:07,993 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-15 22:00:07,993 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2019-11-15 22:00:07,994 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:00:07,994 INFO L688 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-11-15 22:00:07,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2019-11-15 22:00:07,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 13. [2019-11-15 22:00:07,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-15 22:00:07,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2019-11-15 22:00:07,996 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-11-15 22:00:07,996 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-11-15 22:00:07,996 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 22:00:07,996 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2019-11-15 22:00:07,996 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 22:00:07,997 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:00:07,997 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:00:07,997 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2019-11-15 22:00:07,997 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 22:00:07,997 INFO L791 eck$LassoCheckResult]: Stem: 287#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 285#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnStack(4);main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); 286#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 292#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 290#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 291#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 293#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 288#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 289#L20 [2019-11-15 22:00:07,998 INFO L793 eck$LassoCheckResult]: Loop: 289#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 295#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 296#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 297#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 289#L20 [2019-11-15 22:00:07,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:00:07,998 INFO L82 PathProgramCache]: Analyzing trace with hash 179493189, now seen corresponding path program 1 times [2019-11-15 22:00:07,998 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:00:07,998 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690716556] [2019-11-15 22:00:07,998 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:00:07,998 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:00:07,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:00:08,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:00:08,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:00:08,059 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:00:08,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:00:08,060 INFO L82 PathProgramCache]: Analyzing trace with hash 1526457, now seen corresponding path program 2 times [2019-11-15 22:00:08,060 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:00:08,060 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100999156] [2019-11-15 22:00:08,061 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:00:08,061 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:00:08,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:00:08,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:00:08,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:00:08,069 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:00:08,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:00:08,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1467212285, now seen corresponding path program 1 times [2019-11-15 22:00:08,070 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:00:08,070 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329364622] [2019-11-15 22:00:08,070 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:00:08,071 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:00:08,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:00:08,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:00:08,135 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:00:08,135 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329364622] [2019-11-15 22:00:08,135 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [756037918] [2019-11-15 22:00:08,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_82c2d14a-f5db-44aa-af8f-169e9d0f11e3/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:00:08,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:00:08,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-15 22:00:08,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:00:08,254 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:00:08,255 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2019-11-15 22:00:08,256 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:00:08,264 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:00:08,267 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:00:08,267 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:4 [2019-11-15 22:00:08,277 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 22:00:08,277 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:00:08,283 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:00:08,283 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:00:08,283 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2019-11-15 22:00:08,319 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-15 22:00:08,319 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:00:08,324 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:00:08,324 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:00:08,324 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:12 [2019-11-15 22:00:08,333 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:00:08,336 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-15 22:00:08,337 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:00:08,344 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:00:08,345 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 22:00:08,345 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:19 [2019-11-15 22:00:08,376 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-15 22:00:08,376 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:00:08,382 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:00:08,383 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:00:08,383 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2019-11-15 22:00:08,393 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:00:08,394 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:00:08,394 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 10 [2019-11-15 22:00:08,394 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890145026] [2019-11-15 22:00:08,507 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:00:08,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-15 22:00:08,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-11-15 22:00:08,508 INFO L87 Difference]: Start difference. First operand 13 states and 17 transitions. cyclomatic complexity: 6 Second operand 11 states. [2019-11-15 22:00:08,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:00:08,690 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2019-11-15 22:00:08,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 22:00:08,691 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 24 transitions. [2019-11-15 22:00:08,692 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2019-11-15 22:00:08,693 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 19 states and 22 transitions. [2019-11-15 22:00:08,693 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-11-15 22:00:08,693 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2019-11-15 22:00:08,694 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 22 transitions. [2019-11-15 22:00:08,694 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:00:08,694 INFO L688 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2019-11-15 22:00:08,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 22 transitions. [2019-11-15 22:00:08,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 13. [2019-11-15 22:00:08,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-15 22:00:08,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2019-11-15 22:00:08,696 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2019-11-15 22:00:08,696 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2019-11-15 22:00:08,696 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 22:00:08,696 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 16 transitions. [2019-11-15 22:00:08,697 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2019-11-15 22:00:08,697 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:00:08,697 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:00:08,697 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 22:00:08,698 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1] [2019-11-15 22:00:08,698 INFO L791 eck$LassoCheckResult]: Stem: 378#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 374#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnStack(4);main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); 375#L24-2 [2019-11-15 22:00:08,698 INFO L793 eck$LassoCheckResult]: Loop: 375#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 384#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 376#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 377#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 379#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 382#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 383#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 375#L24-2 [2019-11-15 22:00:08,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:00:08,698 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2019-11-15 22:00:08,698 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:00:08,699 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170339536] [2019-11-15 22:00:08,699 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:00:08,700 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:00:08,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:00:08,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:00:08,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:00:08,720 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:00:08,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:00:08,721 INFO L82 PathProgramCache]: Analyzing trace with hash -276975247, now seen corresponding path program 1 times [2019-11-15 22:00:08,721 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:00:08,721 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547402030] [2019-11-15 22:00:08,721 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:00:08,722 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:00:08,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:00:08,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:00:08,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:00:08,733 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:00:08,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:00:08,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1269321583, now seen corresponding path program 2 times [2019-11-15 22:00:08,734 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:00:08,734 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917127388] [2019-11-15 22:00:08,734 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:00:08,734 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:00:08,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:00:08,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:00:08,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:00:08,810 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:00:08,983 WARN L191 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 66 [2019-11-15 22:00:09,621 WARN L191 SmtUtils]: Spent 567.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 98 [2019-11-15 22:00:09,883 WARN L191 SmtUtils]: Spent 260.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2019-11-15 22:00:09,885 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:00:09,885 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:00:09,886 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:00:09,886 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:00:09,886 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:00:09,886 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:00:09,886 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:00:09,886 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:00:09,886 INFO L131 ssoRankerPreferences]: Filename of dumped script: 4BitCounterPointer.c_Iteration4_Lasso [2019-11-15 22:00:09,886 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:00:09,886 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:00:09,889 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:00:09,892 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:00:09,894 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:00:09,899 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:00:10,414 WARN L191 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 83 [2019-11-15 22:00:10,544 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 69 [2019-11-15 22:00:10,544 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:00:10,547 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:00:10,549 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:00:10,550 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:00:10,552 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:00:10,554 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:00:11,816 WARN L191 SmtUtils]: Spent 867.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2019-11-15 22:00:11,871 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:00:11,871 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 22:00:11,871 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:00:11,872 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:00:11,872 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:00:11,872 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:00:11,872 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:00:11,873 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:00:11,873 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:00:11,875 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:00:11,875 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:00:11,875 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:00:11,876 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:00:11,876 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:00:11,876 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:00:11,876 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:00:11,876 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:00:11,876 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:00:11,877 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:00:11,877 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:00:11,878 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:00:11,878 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:00:11,878 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:00:11,878 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:00:11,879 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:00:11,879 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:00:11,880 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:00:11,880 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:00:11,881 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:00:11,881 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:00:11,881 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:00:11,881 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:00:11,882 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:00:11,882 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:00:11,885 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:00:11,886 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:00:11,886 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:00:11,887 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:00:11,887 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:00:11,887 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:00:11,888 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:00:11,888 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:00:11,891 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:00:11,892 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:00:11,892 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:00:11,892 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:00:11,892 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:00:11,893 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:00:11,893 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:00:11,893 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:00:11,895 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:00:11,895 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:00:11,896 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:00:11,896 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:00:11,896 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:00:11,896 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:00:11,897 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:00:11,897 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:00:11,901 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 22:00:11,905 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-15 22:00:11,906 INFO L444 ModelExtractionUtils]: 3 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 22:00:11,906 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 22:00:11,907 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 22:00:11,907 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 22:00:11,907 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)_2) = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)_2 + 1 Supporting invariants [] [2019-11-15 22:00:12,044 INFO L297 tatePredicateManager]: 41 out of 41 supporting invariants were superfluous and have been removed [2019-11-15 22:00:12,045 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 22:00:12,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:00:12,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:00:12,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:00:12,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:00:12,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:00:12,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-15 22:00:12,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:00:12,124 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:00:12,125 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 61 [2019-11-15 22:00:12,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:00:12,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:00:12,129 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:00:12,187 INFO L567 ElimStorePlain]: treesize reduction 33, result has 54.2 percent of original size [2019-11-15 22:00:12,187 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:00:12,188 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:39 [2019-11-15 22:00:12,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:00:12,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:00:12,255 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2019-11-15 22:00:12,256 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:00:12,266 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:00:12,267 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 36 [2019-11-15 22:00:12,267 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:00:12,280 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-11-15 22:00:12,281 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 22:00:12,310 INFO L567 ElimStorePlain]: treesize reduction 34, result has 57.0 percent of original size [2019-11-15 22:00:12,311 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-11-15 22:00:12,311 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:112, output treesize:45 [2019-11-15 22:00:12,338 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:00:12,339 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2019-11-15 22:00:12,339 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 16 transitions. cyclomatic complexity: 4 Second operand 6 states. [2019-11-15 22:00:12,442 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 16 transitions. cyclomatic complexity: 4. Second operand 6 states. Result 27 states and 32 transitions. Complement of second has 13 states. [2019-11-15 22:00:12,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2019-11-15 22:00:12,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-15 22:00:12,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2019-11-15 22:00:12,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. Stem has 2 letters. Loop has 7 letters. [2019-11-15 22:00:12,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:00:12,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. Stem has 9 letters. Loop has 7 letters. [2019-11-15 22:00:12,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:00:12,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. Stem has 2 letters. Loop has 14 letters. [2019-11-15 22:00:12,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:00:12,445 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 32 transitions. [2019-11-15 22:00:12,447 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2019-11-15 22:00:12,448 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 32 transitions. [2019-11-15 22:00:12,448 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2019-11-15 22:00:12,448 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-11-15 22:00:12,448 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 32 transitions. [2019-11-15 22:00:12,448 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:00:12,448 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2019-11-15 22:00:12,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 32 transitions. [2019-11-15 22:00:12,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-11-15 22:00:12,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-15 22:00:12,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2019-11-15 22:00:12,451 INFO L711 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2019-11-15 22:00:12,451 INFO L591 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2019-11-15 22:00:12,452 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-15 22:00:12,452 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 32 transitions. [2019-11-15 22:00:12,452 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2019-11-15 22:00:12,453 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:00:12,453 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:00:12,453 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2019-11-15 22:00:12,453 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-15 22:00:12,454 INFO L791 eck$LassoCheckResult]: Stem: 647#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 641#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnStack(4);main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); 642#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 652#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 653#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 666#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 665#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 664#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 655#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 651#L24 [2019-11-15 22:00:12,454 INFO L793 eck$LassoCheckResult]: Loop: 651#L24 assume 0 == main_#t~mem7;havoc main_#t~mem7;call write~int(1, main_~x2~0.base, main_~x2~0.offset, 4); 648#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 649#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 661#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 660#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 651#L24 [2019-11-15 22:00:12,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:00:12,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1269321585, now seen corresponding path program 1 times [2019-11-15 22:00:12,454 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:00:12,455 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458094275] [2019-11-15 22:00:12,455 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:00:12,455 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:00:12,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:00:12,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:00:12,640 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:00:12,640 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458094275] [2019-11-15 22:00:12,641 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [563182742] [2019-11-15 22:00:12,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_82c2d14a-f5db-44aa-af8f-169e9d0f11e3/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:00:12,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:00:12,705 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-15 22:00:12,706 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:00:12,785 INFO L341 Elim1Store]: treesize reduction 105, result has 17.3 percent of original size [2019-11-15 22:00:12,785 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 123 treesize of output 29 [2019-11-15 22:00:12,786 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:00:12,805 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:00:12,805 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:00:12,806 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:133, output treesize:38 [2019-11-15 22:00:12,897 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:00:12,898 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 87 [2019-11-15 22:00:12,899 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:00:12,946 INFO L567 ElimStorePlain]: treesize reduction 24, result has 61.9 percent of original size [2019-11-15 22:00:12,946 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:00:12,946 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:42, output treesize:39 [2019-11-15 22:00:12,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:00:13,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:00:13,153 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:00:13,153 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 31 [2019-11-15 22:00:13,154 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:00:13,160 INFO L567 ElimStorePlain]: treesize reduction 22, result has 12.0 percent of original size [2019-11-15 22:00:13,160 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:00:13,160 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:3 [2019-11-15 22:00:13,161 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:00:13,161 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:00:13,161 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-11-15 22:00:13,161 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30089312] [2019-11-15 22:00:13,162 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 22:00:13,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:00:13,162 INFO L82 PathProgramCache]: Analyzing trace with hash 51937794, now seen corresponding path program 1 times [2019-11-15 22:00:13,162 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:00:13,162 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859611496] [2019-11-15 22:00:13,162 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:00:13,162 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:00:13,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:00:13,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:00:13,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:00:13,179 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:00:13,326 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:00:13,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-15 22:00:13,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-11-15 22:00:13,327 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. cyclomatic complexity: 7 Second operand 11 states. [2019-11-15 22:00:13,550 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 40 [2019-11-15 22:00:13,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:00:13,673 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2019-11-15 22:00:13,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 22:00:13,674 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 49 transitions. [2019-11-15 22:00:13,675 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2019-11-15 22:00:13,676 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 38 states and 43 transitions. [2019-11-15 22:00:13,676 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2019-11-15 22:00:13,676 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2019-11-15 22:00:13,676 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 43 transitions. [2019-11-15 22:00:13,677 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:00:13,677 INFO L688 BuchiCegarLoop]: Abstraction has 38 states and 43 transitions. [2019-11-15 22:00:13,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 43 transitions. [2019-11-15 22:00:13,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 27. [2019-11-15 22:00:13,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-15 22:00:13,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2019-11-15 22:00:13,679 INFO L711 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2019-11-15 22:00:13,680 INFO L591 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2019-11-15 22:00:13,680 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-15 22:00:13,680 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 31 transitions. [2019-11-15 22:00:13,680 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2019-11-15 22:00:13,680 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:00:13,680 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:00:13,681 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 1, 1, 1, 1] [2019-11-15 22:00:13,681 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-15 22:00:13,681 INFO L791 eck$LassoCheckResult]: Stem: 762#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 760#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnStack(4);main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); 761#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 771#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 765#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 766#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 779#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 776#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 775#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 769#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 770#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 773#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 785#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 784#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 783#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 774#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 772#L24 [2019-11-15 22:00:13,681 INFO L793 eck$LassoCheckResult]: Loop: 772#L24 assume 0 == main_#t~mem7;havoc main_#t~mem7;call write~int(1, main_~x2~0.base, main_~x2~0.offset, 4); 767#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 768#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 780#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 778#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 772#L24 [2019-11-15 22:00:13,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:00:13,682 INFO L82 PathProgramCache]: Analyzing trace with hash -697316795, now seen corresponding path program 1 times [2019-11-15 22:00:13,682 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:00:13,682 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216167680] [2019-11-15 22:00:13,682 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:00:13,682 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:00:13,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:00:13,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:00:13,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:00:13,740 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:00:13,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:00:13,741 INFO L82 PathProgramCache]: Analyzing trace with hash 51937794, now seen corresponding path program 2 times [2019-11-15 22:00:13,741 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:00:13,741 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148346356] [2019-11-15 22:00:13,741 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:00:13,741 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:00:13,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:00:13,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:00:13,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:00:13,754 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:00:13,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:00:13,756 INFO L82 PathProgramCache]: Analyzing trace with hash 16810558, now seen corresponding path program 1 times [2019-11-15 22:00:13,756 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:00:13,757 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731158972] [2019-11-15 22:00:13,757 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:00:13,757 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:00:13,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:00:13,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:00:13,912 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-15 22:00:13,913 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731158972] [2019-11-15 22:00:13,913 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1095136448] [2019-11-15 22:00:13,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_82c2d14a-f5db-44aa-af8f-169e9d0f11e3/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:00:13,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:00:13,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-15 22:00:13,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:00:13,987 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:00:13,987 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2019-11-15 22:00:13,988 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:00:14,003 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:00:14,004 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:00:14,004 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:4 [2019-11-15 22:00:14,013 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 22:00:14,014 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:00:14,022 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:00:14,022 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:00:14,023 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2019-11-15 22:00:14,037 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-15 22:00:14,037 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:00:14,040 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:00:14,040 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:00:14,040 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:8 [2019-11-15 22:00:14,053 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 22:00:14,053 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:00:14,057 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:00:14,057 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:00:14,057 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2019-11-15 22:00:14,073 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-15 22:00:14,073 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:00:14,078 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:00:14,079 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:00:14,079 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-11-15 22:00:14,118 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:00:14,118 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 76 [2019-11-15 22:00:14,119 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:00:14,151 INFO L567 ElimStorePlain]: treesize reduction 32, result has 56.8 percent of original size [2019-11-15 22:00:14,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:00:14,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:00:14,153 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 22:00:14,153 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:42 [2019-11-15 22:00:14,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:00:14,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:00:14,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:00:14,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:00:14,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:00:14,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:00:14,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:00:14,249 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:00:14,251 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-11-15 22:00:14,251 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:00:14,255 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:00:14,256 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:00:14,256 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:42, output treesize:3 [2019-11-15 22:00:14,269 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 13 proven. 11 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-15 22:00:14,269 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:00:14,269 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 15 [2019-11-15 22:00:14,269 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058806247] [2019-11-15 22:00:14,449 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:00:14,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-15 22:00:14,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2019-11-15 22:00:14,450 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. cyclomatic complexity: 6 Second operand 15 states. [2019-11-15 22:00:14,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:00:14,861 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2019-11-15 22:00:14,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 22:00:14,861 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 41 transitions. [2019-11-15 22:00:14,862 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2019-11-15 22:00:14,863 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 37 states and 41 transitions. [2019-11-15 22:00:14,863 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2019-11-15 22:00:14,863 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2019-11-15 22:00:14,863 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 41 transitions. [2019-11-15 22:00:14,863 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:00:14,863 INFO L688 BuchiCegarLoop]: Abstraction has 37 states and 41 transitions. [2019-11-15 22:00:14,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 41 transitions. [2019-11-15 22:00:14,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 28. [2019-11-15 22:00:14,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-15 22:00:14,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2019-11-15 22:00:14,866 INFO L711 BuchiCegarLoop]: Abstraction has 28 states and 32 transitions. [2019-11-15 22:00:14,866 INFO L591 BuchiCegarLoop]: Abstraction has 28 states and 32 transitions. [2019-11-15 22:00:14,866 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-15 22:00:14,866 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 32 transitions. [2019-11-15 22:00:14,867 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2019-11-15 22:00:14,867 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:00:14,867 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:00:14,867 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 1, 1, 1, 1] [2019-11-15 22:00:14,867 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1] [2019-11-15 22:00:14,868 INFO L791 eck$LassoCheckResult]: Stem: 932#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 926#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnStack(4);main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); 927#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 933#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 930#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 931#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 948#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 943#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 941#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 934#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 935#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 953#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 952#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 951#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 950#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 942#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 936#L24 [2019-11-15 22:00:14,868 INFO L793 eck$LassoCheckResult]: Loop: 936#L24 assume 0 == main_#t~mem7;havoc main_#t~mem7;call write~int(1, main_~x2~0.base, main_~x2~0.offset, 4); 937#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 939#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 928#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 929#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 949#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 946#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 947#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 936#L24 [2019-11-15 22:00:14,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:00:14,868 INFO L82 PathProgramCache]: Analyzing trace with hash -697316795, now seen corresponding path program 2 times [2019-11-15 22:00:14,868 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:00:14,868 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015159651] [2019-11-15 22:00:14,868 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:00:14,869 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:00:14,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:00:14,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:00:14,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:00:14,903 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:00:14,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:00:14,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1088312668, now seen corresponding path program 1 times [2019-11-15 22:00:14,903 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:00:14,904 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339708857] [2019-11-15 22:00:14,904 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:00:14,904 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:00:14,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:00:14,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:00:14,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:00:14,916 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:00:14,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:00:14,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1710122080, now seen corresponding path program 2 times [2019-11-15 22:00:14,917 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:00:14,917 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417514350] [2019-11-15 22:00:14,917 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:00:14,917 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:00:14,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:00:14,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:00:15,048 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 30 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-15 22:00:15,048 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417514350] [2019-11-15 22:00:15,048 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1945565469] [2019-11-15 22:00:15,049 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_82c2d14a-f5db-44aa-af8f-169e9d0f11e3/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:00:15,138 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 22:00:15,138 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:00:15,140 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-15 22:00:15,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:00:15,150 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:00:15,151 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2019-11-15 22:00:15,151 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:00:15,164 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:00:15,165 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:00:15,165 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:11 [2019-11-15 22:00:15,181 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 22:00:15,182 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:00:15,189 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:00:15,189 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:00:15,189 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2019-11-15 22:00:15,210 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-15 22:00:15,211 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:00:15,223 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:00:15,224 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 22:00:15,224 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:25 [2019-11-15 22:00:15,282 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:00:15,283 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 68 [2019-11-15 22:00:15,284 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:00:15,328 INFO L567 ElimStorePlain]: treesize reduction 36, result has 50.0 percent of original size [2019-11-15 22:00:15,328 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 22:00:15,328 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:36 [2019-11-15 22:00:15,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:00:15,419 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:00:15,420 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 50 [2019-11-15 22:00:15,420 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:00:15,428 INFO L567 ElimStorePlain]: treesize reduction 26, result has 10.3 percent of original size [2019-11-15 22:00:15,428 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:00:15,428 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:3 [2019-11-15 22:00:15,443 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-11-15 22:00:15,443 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:00:15,443 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2019-11-15 22:00:15,443 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928484111] [2019-11-15 22:00:15,765 WARN L191 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 86 [2019-11-15 22:00:15,830 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:00:15,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-15 22:00:15,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-11-15 22:00:15,831 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. cyclomatic complexity: 6 Second operand 12 states. [2019-11-15 22:00:16,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:00:16,046 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2019-11-15 22:00:16,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 22:00:16,047 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 45 transitions. [2019-11-15 22:00:16,048 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2019-11-15 22:00:16,048 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 41 states and 45 transitions. [2019-11-15 22:00:16,048 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2019-11-15 22:00:16,048 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2019-11-15 22:00:16,049 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 45 transitions. [2019-11-15 22:00:16,049 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:00:16,049 INFO L688 BuchiCegarLoop]: Abstraction has 41 states and 45 transitions. [2019-11-15 22:00:16,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 45 transitions. [2019-11-15 22:00:16,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 34. [2019-11-15 22:00:16,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-15 22:00:16,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2019-11-15 22:00:16,052 INFO L711 BuchiCegarLoop]: Abstraction has 34 states and 38 transitions. [2019-11-15 22:00:16,052 INFO L591 BuchiCegarLoop]: Abstraction has 34 states and 38 transitions. [2019-11-15 22:00:16,052 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-15 22:00:16,052 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 38 transitions. [2019-11-15 22:00:16,052 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2019-11-15 22:00:16,052 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:00:16,053 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:00:16,053 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 1, 1, 1, 1] [2019-11-15 22:00:16,053 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1] [2019-11-15 22:00:16,053 INFO L791 eck$LassoCheckResult]: Stem: 1097#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1091#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnStack(4);main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); 1092#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1098#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1095#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1096#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1114#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1110#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1108#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 1099#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1100#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1124#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1123#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1122#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1121#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1109#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1101#L24 [2019-11-15 22:00:16,053 INFO L793 eck$LassoCheckResult]: Loop: 1101#L24 assume !(0 == main_#t~mem7);havoc main_#t~mem7;call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(1, main_~x3~0.base, main_~x3~0.offset, 4); 1103#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1119#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1117#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1116#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1115#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1111#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1112#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1101#L24 [2019-11-15 22:00:16,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:00:16,054 INFO L82 PathProgramCache]: Analyzing trace with hash -697316795, now seen corresponding path program 3 times [2019-11-15 22:00:16,054 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:00:16,054 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084219833] [2019-11-15 22:00:16,054 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:00:16,054 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:00:16,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:00:16,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:00:16,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:00:16,099 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:00:16,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:00:16,099 INFO L82 PathProgramCache]: Analyzing trace with hash 278966042, now seen corresponding path program 1 times [2019-11-15 22:00:16,099 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:00:16,100 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981108988] [2019-11-15 22:00:16,100 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:00:16,100 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:00:16,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:00:16,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:00:16,125 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 22:00:16,125 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981108988] [2019-11-15 22:00:16,126 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:00:16,126 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:00:16,126 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101706059] [2019-11-15 22:00:16,126 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 22:00:16,126 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:00:16,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:00:16,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:00:16,127 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. cyclomatic complexity: 6 Second operand 4 states. [2019-11-15 22:00:16,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:00:16,161 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2019-11-15 22:00:16,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:00:16,162 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 35 transitions. [2019-11-15 22:00:16,162 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2019-11-15 22:00:16,163 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 31 states and 33 transitions. [2019-11-15 22:00:16,163 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2019-11-15 22:00:16,163 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2019-11-15 22:00:16,163 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 33 transitions. [2019-11-15 22:00:16,163 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:00:16,163 INFO L688 BuchiCegarLoop]: Abstraction has 31 states and 33 transitions. [2019-11-15 22:00:16,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 33 transitions. [2019-11-15 22:00:16,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-11-15 22:00:16,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-15 22:00:16,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2019-11-15 22:00:16,166 INFO L711 BuchiCegarLoop]: Abstraction has 31 states and 33 transitions. [2019-11-15 22:00:16,166 INFO L591 BuchiCegarLoop]: Abstraction has 31 states and 33 transitions. [2019-11-15 22:00:16,166 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-15 22:00:16,166 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 33 transitions. [2019-11-15 22:00:16,166 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2019-11-15 22:00:16,166 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:00:16,166 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:00:16,169 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 1, 1, 1, 1] [2019-11-15 22:00:16,169 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 2, 2, 1, 1, 1] [2019-11-15 22:00:16,170 INFO L791 eck$LassoCheckResult]: Stem: 1173#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1167#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnStack(4);main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); 1168#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1179#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1171#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1172#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1176#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1183#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1181#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 1182#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1185#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1197#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1196#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1195#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1194#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1184#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1177#L24 [2019-11-15 22:00:16,170 INFO L793 eck$LassoCheckResult]: Loop: 1177#L24 assume 0 == main_#t~mem7;havoc main_#t~mem7;call write~int(1, main_~x2~0.base, main_~x2~0.offset, 4); 1178#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1190#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1189#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1188#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1187#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1186#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1180#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 1174#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1175#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1169#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1170#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1193#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1191#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1192#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1177#L24 [2019-11-15 22:00:16,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:00:16,170 INFO L82 PathProgramCache]: Analyzing trace with hash -697316795, now seen corresponding path program 4 times [2019-11-15 22:00:16,170 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:00:16,171 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340151059] [2019-11-15 22:00:16,171 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:00:16,171 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:00:16,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:00:16,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:00:16,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:00:16,223 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:00:16,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:00:16,224 INFO L82 PathProgramCache]: Analyzing trace with hash 2047759866, now seen corresponding path program 1 times [2019-11-15 22:00:16,224 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:00:16,225 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720089645] [2019-11-15 22:00:16,225 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:00:16,225 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:00:16,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:00:16,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:00:16,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:00:16,246 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:00:16,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:00:16,247 INFO L82 PathProgramCache]: Analyzing trace with hash 462437174, now seen corresponding path program 3 times [2019-11-15 22:00:16,247 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:00:16,247 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105915514] [2019-11-15 22:00:16,247 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:00:16,247 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:00:16,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:00:16,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:00:16,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:00:16,304 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:00:16,844 WARN L191 SmtUtils]: Spent 538.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 115 [2019-11-15 22:00:17,005 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2019-11-15 22:00:19,618 WARN L191 SmtUtils]: Spent 2.61 s on a formula simplification. DAG size of input: 194 DAG size of output: 158 [2019-11-15 22:00:20,247 WARN L191 SmtUtils]: Spent 626.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2019-11-15 22:00:20,253 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:00:20,253 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:00:20,253 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:00:20,253 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:00:20,253 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:00:20,253 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:00:20,253 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:00:20,253 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:00:20,254 INFO L131 ssoRankerPreferences]: Filename of dumped script: 4BitCounterPointer.c_Iteration9_Lasso [2019-11-15 22:00:20,254 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:00:20,254 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:00:20,257 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:00:20,263 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:00:20,265 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:00:20,268 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:00:20,271 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:00:20,935 WARN L191 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 87 [2019-11-15 22:00:21,115 WARN L191 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 78 [2019-11-15 22:00:21,115 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:00:21,117 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:00:21,118 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:00:21,121 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:00:22,310 WARN L191 SmtUtils]: Spent 818.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2019-11-15 22:00:22,440 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:00:22,440 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 22:00:22,440 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:00:22,441 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:00:22,441 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:00:22,441 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:00:22,441 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:00:22,441 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:00:22,442 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:00:22,442 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:00:22,442 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:00:22,442 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:00:22,443 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:00:22,443 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:00:22,443 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:00:22,443 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:00:22,443 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:00:22,443 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:00:22,443 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:00:22,444 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:00:22,444 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:00:22,444 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:00:22,444 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:00:22,444 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:00:22,444 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:00:22,445 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:00:22,445 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:00:22,446 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:00:22,446 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:00:22,446 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:00:22,447 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:00:22,447 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:00:22,447 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:00:22,447 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:00:22,447 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:00:22,448 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:00:22,448 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:00:22,449 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:00:22,449 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:00:22,449 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:00:22,449 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:00:22,450 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:00:22,450 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:00:22,452 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:00:22,452 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:00:22,453 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:00:22,453 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:00:22,453 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:00:22,453 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:00:22,454 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:00:22,454 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:00:22,456 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:00:22,456 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:00:22,456 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:00:22,457 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:00:22,457 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:00:22,457 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:00:22,458 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:00:22,458 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:00:22,462 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 22:00:22,466 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-15 22:00:22,467 INFO L444 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-11-15 22:00:22,467 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 22:00:22,468 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 22:00:22,468 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 22:00:22,468 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_#t~mem7) = -2*ULTIMATE.start_main_#t~mem7 + 1 Supporting invariants [] [2019-11-15 22:00:22,658 INFO L297 tatePredicateManager]: 42 out of 42 supporting invariants were superfluous and have been removed [2019-11-15 22:00:22,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:00:22,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:00:22,704 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:00:22,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:00:22,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:00:22,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-15 22:00:22,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:00:22,733 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 22:00:22,733 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:00:22,737 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:00:22,737 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:00:22,737 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2019-11-15 22:00:22,861 INFO L341 Elim1Store]: treesize reduction 12, result has 87.9 percent of original size [2019-11-15 22:00:22,861 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 103 [2019-11-15 22:00:22,862 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:00:22,898 INFO L567 ElimStorePlain]: treesize reduction 40, result has 52.9 percent of original size [2019-11-15 22:00:22,899 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:00:22,899 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-11-15 22:00:22,951 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 39 [2019-11-15 22:00:22,952 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:00:22,960 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:00:22,960 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 39 [2019-11-15 22:00:22,961 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:00:22,980 INFO L567 ElimStorePlain]: treesize reduction 38, result has 43.3 percent of original size [2019-11-15 22:00:22,981 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:00:22,981 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:89, output treesize:29 [2019-11-15 22:00:23,073 INFO L341 Elim1Store]: treesize reduction 12, result has 87.9 percent of original size [2019-11-15 22:00:23,073 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 103 [2019-11-15 22:00:23,074 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:00:23,115 INFO L567 ElimStorePlain]: treesize reduction 40, result has 52.9 percent of original size [2019-11-15 22:00:23,115 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:00:23,115 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:45 [2019-11-15 22:00:23,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:00:23,185 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 38 [2019-11-15 22:00:23,186 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:00:23,236 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:00:23,236 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 44 treesize of output 114 [2019-11-15 22:00:23,237 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:00:23,262 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:00:23,262 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 38 [2019-11-15 22:00:23,263 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 22:00:23,320 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:00:23,320 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 44 treesize of output 114 [2019-11-15 22:00:23,321 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 22:00:23,451 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 35 [2019-11-15 22:00:23,451 INFO L567 ElimStorePlain]: treesize reduction 176, result has 32.0 percent of original size [2019-11-15 22:00:23,451 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-15 22:00:23,451 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:175, output treesize:83 [2019-11-15 22:00:23,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:00:23,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:00:23,604 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:00:23,605 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 48 treesize of output 82 [2019-11-15 22:00:23,605 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:00:23,638 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:00:23,638 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 82 [2019-11-15 22:00:23,639 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:00:23,688 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:00:23,688 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 82 [2019-11-15 22:00:23,689 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 22:00:23,716 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:00:23,716 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 82 [2019-11-15 22:00:23,717 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 22:00:23,785 INFO L567 ElimStorePlain]: treesize reduction 162, result has 33.9 percent of original size [2019-11-15 22:00:23,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:00:23,786 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2019-11-15 22:00:23,786 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:193, output treesize:83 [2019-11-15 22:00:23,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:00:23,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:00:23,835 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:00:23,835 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 9 loop predicates [2019-11-15 22:00:23,835 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 33 transitions. cyclomatic complexity: 4 Second operand 10 states. [2019-11-15 22:00:24,286 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-11-15 22:00:24,502 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 33 transitions. cyclomatic complexity: 4. Second operand 10 states. Result 46 states and 50 transitions. Complement of second has 30 states. [2019-11-15 22:00:24,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 16 states 1 stem states 14 non-accepting loop states 1 accepting loop states [2019-11-15 22:00:24,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-11-15 22:00:24,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 24 transitions. [2019-11-15 22:00:24,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 24 transitions. Stem has 16 letters. Loop has 15 letters. [2019-11-15 22:00:24,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:00:24,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 24 transitions. Stem has 31 letters. Loop has 15 letters. [2019-11-15 22:00:24,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:00:24,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 24 transitions. Stem has 16 letters. Loop has 30 letters. [2019-11-15 22:00:24,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:00:24,506 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 50 transitions. [2019-11-15 22:00:24,507 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-15 22:00:24,507 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 50 transitions. [2019-11-15 22:00:24,508 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2019-11-15 22:00:24,508 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2019-11-15 22:00:24,508 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 50 transitions. [2019-11-15 22:00:24,508 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:00:24,508 INFO L688 BuchiCegarLoop]: Abstraction has 46 states and 50 transitions. [2019-11-15 22:00:24,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 50 transitions. [2019-11-15 22:00:24,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 39. [2019-11-15 22:00:24,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-15 22:00:24,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-11-15 22:00:24,511 INFO L711 BuchiCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-11-15 22:00:24,511 INFO L591 BuchiCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-11-15 22:00:24,511 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-15 22:00:24,511 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 43 transitions. [2019-11-15 22:00:24,512 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-15 22:00:24,512 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:00:24,512 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:00:24,512 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 1, 1, 1, 1, 1] [2019-11-15 22:00:24,512 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1] [2019-11-15 22:00:24,513 INFO L791 eck$LassoCheckResult]: Stem: 1580#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1578#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnStack(4);main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); 1579#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1592#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1583#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1584#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1613#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1611#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1594#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 1595#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1608#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1606#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1604#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1602#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1600#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1598#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1588#L24 assume 0 == main_#t~mem7;havoc main_#t~mem7;call write~int(1, main_~x2~0.base, main_~x2~0.offset, 4); 1589#L24-2 [2019-11-15 22:00:24,513 INFO L793 eck$LassoCheckResult]: Loop: 1589#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1616#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1581#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1582#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1585#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1591#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1593#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 1589#L24-2 [2019-11-15 22:00:24,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:00:24,513 INFO L82 PathProgramCache]: Analyzing trace with hash -141984140, now seen corresponding path program 4 times [2019-11-15 22:00:24,513 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:00:24,513 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711680589] [2019-11-15 22:00:24,513 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:00:24,513 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:00:24,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:00:24,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:00:24,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:00:24,541 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:00:24,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:00:24,541 INFO L82 PathProgramCache]: Analyzing trace with hash -276975247, now seen corresponding path program 2 times [2019-11-15 22:00:24,542 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:00:24,542 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888004728] [2019-11-15 22:00:24,542 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:00:24,542 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:00:24,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:00:24,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:00:24,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:00:24,548 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:00:24,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:00:24,549 INFO L82 PathProgramCache]: Analyzing trace with hash -1710122082, now seen corresponding path program 5 times [2019-11-15 22:00:24,549 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:00:24,549 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916771688] [2019-11-15 22:00:24,549 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:00:24,550 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:00:24,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:00:24,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:00:24,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:00:24,579 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:00:24,732 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 66 [2019-11-15 22:00:27,387 WARN L191 SmtUtils]: Spent 2.61 s on a formula simplification. DAG size of input: 199 DAG size of output: 167 [2019-11-15 22:00:27,953 WARN L191 SmtUtils]: Spent 562.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2019-11-15 22:00:27,956 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:00:27,956 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:00:27,956 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:00:27,956 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:00:27,956 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:00:27,957 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:00:27,957 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:00:27,957 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:00:27,957 INFO L131 ssoRankerPreferences]: Filename of dumped script: 4BitCounterPointer.c_Iteration10_Lasso [2019-11-15 22:00:27,957 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:00:27,957 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:00:27,958 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:00:27,962 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:00:27,963 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:00:27,965 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:00:28,496 WARN L191 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 83 [2019-11-15 22:00:28,606 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 63 [2019-11-15 22:00:28,606 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:00:28,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:00:28,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:00:28,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:00:28,612 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:00:29,968 WARN L191 SmtUtils]: Spent 949.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2019-11-15 22:00:29,993 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:00:29,993 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 22:00:29,993 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:00:29,994 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:00:29,994 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:00:29,994 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:00:29,994 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:00:29,995 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:00:29,995 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:00:29,996 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:00:29,996 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:00:29,996 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:00:29,996 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:00:29,996 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:00:29,996 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:00:29,996 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:00:29,997 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:00:29,997 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:00:29,997 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:00:29,997 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:00:29,997 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:00:29,998 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:00:29,998 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:00:29,998 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:00:29,998 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:00:29,998 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:00:29,998 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:00:29,998 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:00:29,999 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:00:29,999 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:00:29,999 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:00:29,999 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:00:29,999 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:00:30,001 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:00:30,001 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:00:30,004 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 22:00:30,005 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 22:00:30,006 INFO L444 ModelExtractionUtils]: 3 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 22:00:30,006 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 22:00:30,007 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 22:00:30,007 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 22:00:30,007 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)_4) = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)_4 + 1 Supporting invariants [] [2019-11-15 22:00:30,151 INFO L297 tatePredicateManager]: 37 out of 37 supporting invariants were superfluous and have been removed [2019-11-15 22:00:30,152 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 22:00:30,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:00:30,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:00:30,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:00:30,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:00:30,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:00:30,193 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-15 22:00:30,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:00:30,224 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:00:30,225 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 61 [2019-11-15 22:00:30,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:00:30,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:00:30,226 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:00:30,270 INFO L567 ElimStorePlain]: treesize reduction 32, result has 55.6 percent of original size [2019-11-15 22:00:30,270 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:00:30,270 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:39 [2019-11-15 22:00:30,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:00:30,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:00:30,318 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-11-15 22:00:30,319 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:00:30,324 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2019-11-15 22:00:30,324 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:00:30,331 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:00:30,331 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 36 [2019-11-15 22:00:30,331 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 22:00:30,357 INFO L567 ElimStorePlain]: treesize reduction 34, result has 57.0 percent of original size [2019-11-15 22:00:30,358 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-11-15 22:00:30,358 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:112, output treesize:45 [2019-11-15 22:00:30,379 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:00:30,379 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2019-11-15 22:00:30,379 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 43 transitions. cyclomatic complexity: 7 Second operand 6 states. [2019-11-15 22:00:30,463 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 43 transitions. cyclomatic complexity: 7. Second operand 6 states. Result 79 states and 85 transitions. Complement of second has 13 states. [2019-11-15 22:00:30,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2019-11-15 22:00:30,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-15 22:00:30,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 16 transitions. [2019-11-15 22:00:30,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 17 letters. Loop has 7 letters. [2019-11-15 22:00:30,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:00:30,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 24 letters. Loop has 7 letters. [2019-11-15 22:00:30,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:00:30,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 17 letters. Loop has 14 letters. [2019-11-15 22:00:30,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:00:30,465 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 79 states and 85 transitions. [2019-11-15 22:00:30,466 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-15 22:00:30,466 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 79 states to 59 states and 63 transitions. [2019-11-15 22:00:30,466 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-11-15 22:00:30,467 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-11-15 22:00:30,467 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 63 transitions. [2019-11-15 22:00:30,467 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:00:30,467 INFO L688 BuchiCegarLoop]: Abstraction has 59 states and 63 transitions. [2019-11-15 22:00:30,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 63 transitions. [2019-11-15 22:00:30,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 53. [2019-11-15 22:00:30,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-15 22:00:30,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2019-11-15 22:00:30,470 INFO L711 BuchiCegarLoop]: Abstraction has 53 states and 57 transitions. [2019-11-15 22:00:30,470 INFO L591 BuchiCegarLoop]: Abstraction has 53 states and 57 transitions. [2019-11-15 22:00:30,470 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-15 22:00:30,471 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 57 transitions. [2019-11-15 22:00:30,471 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-15 22:00:30,471 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:00:30,471 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:00:30,472 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 4, 4, 2, 2, 2, 1, 1] [2019-11-15 22:00:30,472 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1] [2019-11-15 22:00:30,473 INFO L791 eck$LassoCheckResult]: Stem: 1958#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1952#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnStack(4);main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); 1953#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1959#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1984#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1983#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1982#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1981#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1980#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 1979#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1978#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1954#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1955#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1976#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1974#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1972#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1962#L24 assume 0 == main_#t~mem7;havoc main_#t~mem7;call write~int(1, main_~x2~0.base, main_~x2~0.offset, 4); 1960#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1961#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1956#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1957#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 2004#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 2003#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1997#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 1996#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1995#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1994#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1993#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1992#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1991#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1971#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1963#L24 assume 0 == main_#t~mem7;havoc main_#t~mem7;call write~int(1, main_~x2~0.base, main_~x2~0.offset, 4); 1965#L24-2 [2019-11-15 22:00:30,473 INFO L793 eck$LassoCheckResult]: Loop: 1965#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1966#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1967#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1977#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1975#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1973#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1968#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 1965#L24-2 [2019-11-15 22:00:30,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:00:30,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1450650531, now seen corresponding path program 6 times [2019-11-15 22:00:30,473 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:00:30,473 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730379593] [2019-11-15 22:00:30,473 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:00:30,473 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:00:30,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:00:30,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:00:30,692 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 50 proven. 22 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-11-15 22:00:30,692 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730379593] [2019-11-15 22:00:30,692 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1398988039] [2019-11-15 22:00:30,692 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_82c2d14a-f5db-44aa-af8f-169e9d0f11e3/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:00:30,828 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2019-11-15 22:00:30,829 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:00:30,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-15 22:00:30,831 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:00:30,842 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:00:30,842 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2019-11-15 22:00:30,842 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:00:30,847 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:00:30,847 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:00:30,848 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:13 [2019-11-15 22:00:30,869 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 22:00:30,869 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:00:30,876 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:00:30,877 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:00:30,877 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2019-11-15 22:00:30,896 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-15 22:00:30,897 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:00:30,906 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:00:30,906 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:00:30,906 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2019-11-15 22:00:30,928 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-11-15 22:00:30,928 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:00:30,935 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:00:30,935 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:00:30,936 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:27 [2019-11-15 22:00:30,958 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-11-15 22:00:30,958 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:00:30,967 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:00:30,967 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:00:30,967 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:34 [2019-11-15 22:00:30,997 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2019-11-15 22:00:30,998 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:00:31,006 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:00:31,007 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:00:31,007 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:34 [2019-11-15 22:00:31,036 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2019-11-15 22:00:31,036 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:00:31,052 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:00:31,053 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 22:00:31,053 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:34 [2019-11-15 22:00:31,086 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:00:31,087 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-15 22:00:31,087 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:00:31,094 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:00:31,094 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:00:31,095 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:49, output treesize:3 [2019-11-15 22:00:31,109 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 62 proven. 10 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-11-15 22:00:31,109 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:00:31,109 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2019-11-15 22:00:31,110 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713362821] [2019-11-15 22:00:31,110 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 22:00:31,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:00:31,110 INFO L82 PathProgramCache]: Analyzing trace with hash -276975247, now seen corresponding path program 3 times [2019-11-15 22:00:31,110 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:00:31,111 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381619773] [2019-11-15 22:00:31,111 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:00:31,111 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:00:31,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:00:31,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:00:31,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:00:31,118 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:00:31,246 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 66 [2019-11-15 22:00:31,279 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:00:31,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-15 22:00:31,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2019-11-15 22:00:31,280 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. cyclomatic complexity: 8 Second operand 18 states. [2019-11-15 22:00:31,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:00:31,634 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2019-11-15 22:00:31,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-15 22:00:31,634 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 39 transitions. [2019-11-15 22:00:31,635 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 22:00:31,635 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 0 states and 0 transitions. [2019-11-15 22:00:31,635 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 22:00:31,635 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 22:00:31,635 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 22:00:31,635 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:00:31,635 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:00:31,635 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:00:31,636 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:00:31,636 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-11-15 22:00:31,636 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 22:00:31,636 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 22:00:31,636 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 22:00:31,641 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 10:00:31 BoogieIcfgContainer [2019-11-15 22:00:31,641 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 22:00:31,641 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 22:00:31,641 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 22:00:31,641 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 22:00:31,642 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:00:02" (3/4) ... [2019-11-15 22:00:31,645 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 22:00:31,645 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 22:00:31,646 INFO L168 Benchmark]: Toolchain (without parser) took 29439.38 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 467.7 MB). Free memory was 943.4 MB in the beginning and 1.0 GB in the end (delta: -106.5 MB). Peak memory consumption was 361.2 MB. Max. memory is 11.5 GB. [2019-11-15 22:00:31,647 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:00:31,647 INFO L168 Benchmark]: CACSL2BoogieTranslator took 335.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 164.1 MB). Free memory was 943.4 MB in the beginning and 1.2 GB in the end (delta: -211.4 MB). Peak memory consumption was 22.7 MB. Max. memory is 11.5 GB. [2019-11-15 22:00:31,647 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.75 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:00:31,648 INFO L168 Benchmark]: Boogie Preprocessor took 47.43 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:00:31,648 INFO L168 Benchmark]: RCFGBuilder took 285.12 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. [2019-11-15 22:00:31,649 INFO L168 Benchmark]: BuchiAutomizer took 28715.98 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 303.6 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 80.7 MB). Peak memory consumption was 384.3 MB. Max. memory is 11.5 GB. [2019-11-15 22:00:31,649 INFO L168 Benchmark]: Witness Printer took 4.30 ms. Allocated memory is still 1.5 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:00:31,650 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.28 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 335.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 164.1 MB). Free memory was 943.4 MB in the beginning and 1.2 GB in the end (delta: -211.4 MB). Peak memory consumption was 22.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 45.75 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 47.43 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 285.12 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 28715.98 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 303.6 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 80.7 MB). Peak memory consumption was 384.3 MB. Max. memory is 11.5 GB. * Witness Printer took 4.30 ms. Allocated memory is still 1.5 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 11 terminating modules (7 trivial, 4 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[x0][x0] + 1 and consists of 5 locations. One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[x1][x1] + 1 and consists of 7 locations. One deterministic module has affine ranking function -2 * aux-x2-aux + 1 and consists of 16 locations. One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[x1][x1] + 1 and consists of 7 locations. 7 modules have a trivial ranking function, the largest among these consists of 18 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 28.6s and 12 iterations. TraceHistogramMax:8. Analysis of lassos took 24.0s. Construction of modules took 0.7s. Büchi inclusion checks took 3.6s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 9. Automata minimization 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 48 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 53 states and ocurred in iteration 10. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 10/25 HoareTripleCheckerStatistics: 49 SDtfs, 98 SDslu, 50 SDs, 0 SdLazy, 715 SolverSat, 119 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc3 concLT0 SILN0 SILU3 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital1994 mio100 ax100 hnf100 lsp98 ukn31 mio100 lsp36 div100 bol100 ite100 ukn100 eq186 hnf88 smp94 dnf710 smp90 tf100 neg91 sie127 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 163ms VariablesStem: 9 VariablesLoop: 8 DisjunctsStem: 16 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 36 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...