./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-15/count_up_and_down_alloca.i --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/working_dir_eb3b7ef8-a699-47d5-8bce-2282450ed7b9/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_eb3b7ef8-a699-47d5-8bce-2282450ed7b9/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_eb3b7ef8-a699-47d5-8bce-2282450ed7b9/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_eb3b7ef8-a699-47d5-8bce-2282450ed7b9/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/count_up_and_down_alloca.i -s /tmp/vcloud-vcloud-master/worker/working_dir_eb3b7ef8-a699-47d5-8bce-2282450ed7b9/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_eb3b7ef8-a699-47d5-8bce-2282450ed7b9/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 94f95b6ef0a3c8650bd30cb1958ada590298bd1c ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 08:56:11,574 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:56:11,575 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:56:11,585 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:56:11,585 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:56:11,586 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:56:11,587 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:56:11,588 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:56:11,590 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:56:11,591 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:56:11,591 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:56:11,592 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:56:11,593 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:56:11,593 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:56:11,594 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:56:11,595 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:56:11,596 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:56:11,597 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:56:11,600 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:56:11,607 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:56:11,609 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:56:11,609 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:56:11,613 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:56:11,614 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:56:11,617 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:56:11,618 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:56:11,618 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:56:11,619 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:56:11,619 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:56:11,620 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:56:11,620 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:56:11,620 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:56:11,621 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:56:11,622 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:56:11,623 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:56:11,623 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:56:11,623 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:56:11,624 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:56:11,624 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:56:11,624 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:56:11,625 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:56:11,625 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_eb3b7ef8-a699-47d5-8bce-2282450ed7b9/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-10-22 08:56:11,643 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:56:11,643 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:56:11,644 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:56:11,644 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:56:11,644 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:56:11,645 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 08:56:11,645 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 08:56:11,645 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 08:56:11,645 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 08:56:11,645 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 08:56:11,645 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 08:56:11,645 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:56:11,645 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 08:56:11,646 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:56:11,646 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:56:11,646 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 08:56:11,646 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 08:56:11,648 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 08:56:11,648 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:56:11,648 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 08:56:11,648 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:56:11,648 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 08:56:11,648 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:56:11,649 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:56:11,649 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 08:56:11,649 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:56:11,649 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:56:11,649 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 08:56:11,650 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 08:56:11,650 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/working_dir_eb3b7ef8-a699-47d5-8bce-2282450ed7b9/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 -> 94f95b6ef0a3c8650bd30cb1958ada590298bd1c [2019-10-22 08:56:11,683 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:56:11,695 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:56:11,698 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:56:11,700 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:56:11,700 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:56:11,701 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_eb3b7ef8-a699-47d5-8bce-2282450ed7b9/bin/uautomizer/../../sv-benchmarks/c/termination-15/count_up_and_down_alloca.i [2019-10-22 08:56:11,748 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_eb3b7ef8-a699-47d5-8bce-2282450ed7b9/bin/uautomizer/data/c9ea07dbf/346c1ab72e1142c99351ad08728fe5c0/FLAG02fe93f4b [2019-10-22 08:56:12,182 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:56:12,182 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_eb3b7ef8-a699-47d5-8bce-2282450ed7b9/sv-benchmarks/c/termination-15/count_up_and_down_alloca.i [2019-10-22 08:56:12,191 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_eb3b7ef8-a699-47d5-8bce-2282450ed7b9/bin/uautomizer/data/c9ea07dbf/346c1ab72e1142c99351ad08728fe5c0/FLAG02fe93f4b [2019-10-22 08:56:12,535 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_eb3b7ef8-a699-47d5-8bce-2282450ed7b9/bin/uautomizer/data/c9ea07dbf/346c1ab72e1142c99351ad08728fe5c0 [2019-10-22 08:56:12,538 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:56:12,539 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:56:12,542 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:56:12,542 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:56:12,545 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:56:12,546 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:56:12" (1/1) ... [2019-10-22 08:56:12,549 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3df6e0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:12, skipping insertion in model container [2019-10-22 08:56:12,549 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:56:12" (1/1) ... [2019-10-22 08:56:12,556 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:56:12,586 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:56:12,928 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:56:12,940 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:56:12,979 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:56:13,023 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:56:13,024 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:13 WrapperNode [2019-10-22 08:56:13,024 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:56:13,025 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:56:13,025 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:56:13,025 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:56:13,033 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:13" (1/1) ... [2019-10-22 08:56:13,051 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:13" (1/1) ... [2019-10-22 08:56:13,072 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:56:13,074 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:56:13,074 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:56:13,074 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:56:13,082 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:13" (1/1) ... [2019-10-22 08:56:13,082 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:13" (1/1) ... [2019-10-22 08:56:13,084 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:13" (1/1) ... [2019-10-22 08:56:13,084 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:13" (1/1) ... [2019-10-22 08:56:13,089 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:13" (1/1) ... [2019-10-22 08:56:13,093 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:13" (1/1) ... [2019-10-22 08:56:13,094 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:13" (1/1) ... [2019-10-22 08:56:13,096 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:56:13,096 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:56:13,097 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:56:13,097 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:56:13,097 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:13" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eb3b7ef8-a699-47d5-8bce-2282450ed7b9/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-10-22 08:56:13,158 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 08:56:13,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 08:56:13,159 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 08:56:13,159 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 08:56:13,159 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:56:13,159 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:56:13,464 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:56:13,464 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-10-22 08:56:13,465 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:56:13 BoogieIcfgContainer [2019-10-22 08:56:13,465 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:56:13,465 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 08:56:13,465 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 08:56:13,469 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 08:56:13,470 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:56:13,470 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 08:56:12" (1/3) ... [2019-10-22 08:56:13,471 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@98c1261 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:56:13, skipping insertion in model container [2019-10-22 08:56:13,471 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:56:13,472 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:13" (2/3) ... [2019-10-22 08:56:13,472 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@98c1261 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:56:13, skipping insertion in model container [2019-10-22 08:56:13,472 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:56:13,472 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:56:13" (3/3) ... [2019-10-22 08:56:13,474 INFO L371 chiAutomizerObserver]: Analyzing ICFG count_up_and_down_alloca.i [2019-10-22 08:56:13,519 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 08:56:13,519 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 08:56:13,520 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 08:56:13,520 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:56:13,520 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:56:13,520 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 08:56:13,520 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:56:13,520 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 08:56:13,535 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2019-10-22 08:56:13,563 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-10-22 08:56:13,563 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:13,563 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:13,570 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 08:56:13,570 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:56:13,570 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 08:56:13,570 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2019-10-22 08:56:13,571 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-10-22 08:56:13,571 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:13,572 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:13,573 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 08:56:13,573 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:56:13,580 INFO L791 eck$LassoCheckResult]: Stem: 8#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 5#L-1true havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~mem208, main_#t~post207, main_#t~mem211, main_#t~post212, main_#t~mem210, main_#t~post209, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 17#L367true assume !(main_~length~0 < 1); 3#L367-2true call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 12#L369true assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);call write~int(0, main_~arr~0.base, main_~arr~0.offset, 4);main_~i~0 := 1; 15#L371-3true [2019-10-22 08:56:13,580 INFO L793 eck$LassoCheckResult]: Loop: 15#L371-3true assume !!(main_~i~0 < main_~length~0);call main_#t~mem208 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * (main_~i~0 - 1), 4);call write~int(1 + main_#t~mem208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~mem208; 13#L371-2true main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 15#L371-3true [2019-10-22 08:56:13,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:13,586 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2019-10-22 08:56:13,594 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:13,594 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007296047] [2019-10-22 08:56:13,594 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:13,595 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:13,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:13,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:13,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:13,719 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:13,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:13,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1667, now seen corresponding path program 1 times [2019-10-22 08:56:13,720 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:13,721 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852692262] [2019-10-22 08:56:13,721 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:13,721 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:13,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:13,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:13,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:13,743 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:13,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:13,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815563, now seen corresponding path program 1 times [2019-10-22 08:56:13,747 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:13,747 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920514507] [2019-10-22 08:56:13,747 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:13,747 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:13,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:13,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:13,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:13,800 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:14,047 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:56:14,048 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:56:14,049 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:56:14,049 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:56:14,049 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:56:14,050 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:56:14,050 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:56:14,050 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:56:14,050 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_up_and_down_alloca.i_Iteration1_Lasso [2019-10-22 08:56:14,050 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:56:14,050 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:56:14,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:14,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:14,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:14,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:14,099 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:14,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:14,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:14,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:14,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:14,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:14,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:14,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:14,547 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:56:14,555 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:56:14,557 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-10-22 08:56:14,558 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:14,559 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:14,559 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:14,559 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:14,560 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:14,561 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:14,561 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:14,563 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:14,564 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-10-22 08:56:14,564 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:14,564 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:14,565 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:14,565 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:14,565 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:14,565 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:14,565 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:14,568 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:14,568 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-10-22 08:56:14,569 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:14,569 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:14,569 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:14,570 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:14,570 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:14,570 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:14,570 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:14,571 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:14,571 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-10-22 08:56:14,572 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:14,572 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:14,572 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:14,572 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:14,572 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:14,573 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:14,573 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:14,574 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:14,574 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-10-22 08:56:14,576 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:14,576 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:14,576 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:14,577 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:14,577 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:14,577 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:14,577 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:14,578 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:14,579 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-10-22 08:56:14,579 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:14,579 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:14,579 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:14,580 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:14,583 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:14,584 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:14,619 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:14,620 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-10-22 08:56:14,620 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:14,621 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-10-22 08:56:14,621 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:14,621 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:14,624 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 08:56:14,624 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:14,637 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:14,637 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-10-22 08:56:14,638 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:14,638 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:14,638 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:14,638 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:14,642 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:14,643 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:14,698 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:56:14,759 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-10-22 08:56:14,759 INFO L444 ModelExtractionUtils]: 16 out of 22 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-10-22 08:56:14,762 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:56:14,764 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:56:14,764 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:56:14,765 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~length~0) = -1*ULTIMATE.start_main_~i~0 + 1*ULTIMATE.start_main_~length~0 Supporting invariants [] [2019-10-22 08:56:14,785 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-10-22 08:56:14,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:14,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:14,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:56:14,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:14,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:14,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:56:14,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:14,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:14,881 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-10-22 08:56:14,882 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states. Second operand 3 states. [2019-10-22 08:56:14,948 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states.. Second operand 3 states. Result 39 states and 54 transitions. Complement of second has 7 states. [2019-10-22 08:56:14,950 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-10-22 08:56:14,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:56:14,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2019-10-22 08:56:14,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 5 letters. Loop has 2 letters. [2019-10-22 08:56:14,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:14,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 7 letters. Loop has 2 letters. [2019-10-22 08:56:14,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:14,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 5 letters. Loop has 4 letters. [2019-10-22 08:56:14,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:14,958 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 54 transitions. [2019-10-22 08:56:14,961 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 08:56:14,967 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 13 states and 17 transitions. [2019-10-22 08:56:14,969 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-10-22 08:56:14,969 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-10-22 08:56:14,970 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2019-10-22 08:56:14,971 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:56:14,971 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-10-22 08:56:14,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2019-10-22 08:56:14,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-10-22 08:56:14,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-10-22 08:56:14,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2019-10-22 08:56:14,998 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-10-22 08:56:14,999 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-10-22 08:56:14,999 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 08:56:15,000 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2019-10-22 08:56:15,000 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 08:56:15,000 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:15,000 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:15,001 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:15,001 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 08:56:15,001 INFO L791 eck$LassoCheckResult]: Stem: 125#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 119#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~mem208, main_#t~post207, main_#t~mem211, main_#t~post212, main_#t~mem210, main_#t~post209, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 120#L367 assume !(main_~length~0 < 1); 126#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 127#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);call write~int(0, main_~arr~0.base, main_~arr~0.offset, 4);main_~i~0 := 1; 128#L371-3 assume !(main_~i~0 < main_~length~0); 131#L371-4 main_~j~0 := 0; 124#L374-3 [2019-10-22 08:56:15,001 INFO L793 eck$LassoCheckResult]: Loop: 124#L374-3 assume !!(main_~j~0 < main_~length~0); 121#L375-3 call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 122#L375-1 assume !(main_#t~mem210 > 0);havoc main_#t~mem210; 123#L374-2 main_#t~post209 := main_~j~0;main_~j~0 := 1 + main_#t~post209;havoc main_#t~post209; 124#L374-3 [2019-10-22 08:56:15,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:15,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815505, now seen corresponding path program 1 times [2019-10-22 08:56:15,002 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:15,003 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282584135] [2019-10-22 08:56:15,004 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:15,004 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:15,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:15,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:15,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:15,031 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:15,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:15,032 INFO L82 PathProgramCache]: Analyzing trace with hash 2036812, now seen corresponding path program 1 times [2019-10-22 08:56:15,032 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:15,032 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299957708] [2019-10-22 08:56:15,033 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:15,033 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:15,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:15,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:15,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:15,050 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:15,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:15,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1386095268, now seen corresponding path program 1 times [2019-10-22 08:56:15,051 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:15,051 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766449029] [2019-10-22 08:56:15,052 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:15,052 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:15,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:15,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:15,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:15,083 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:15,256 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:56:15,257 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:56:15,257 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:56:15,257 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:56:15,257 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:56:15,257 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:56:15,258 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:56:15,258 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:56:15,258 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_up_and_down_alloca.i_Iteration2_Lasso [2019-10-22 08:56:15,258 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:56:15,258 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:56:15,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:15,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-10-22 08:56:15,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-10-22 08:56:15,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-10-22 08:56:15,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:15,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:15,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:15,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:15,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:15,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:15,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:15,668 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:56:15,668 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:56:15,669 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-10-22 08:56:15,669 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:15,670 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:15,670 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:15,670 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:15,670 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:15,670 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:15,670 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:15,671 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:15,671 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-10-22 08:56:15,672 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:15,672 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:15,672 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:15,672 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:15,672 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:15,673 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:15,673 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:15,673 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:15,674 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-10-22 08:56:15,675 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:15,675 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:15,675 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:15,675 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:15,676 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:15,676 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:15,676 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:15,677 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:15,677 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-10-22 08:56:15,678 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:15,678 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:15,678 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:15,678 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:15,679 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:15,679 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:15,681 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:15,682 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-10-22 08:56:15,683 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:15,683 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:15,683 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:15,683 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:15,686 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:15,686 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:15,714 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:56:15,746 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-10-22 08:56:15,746 INFO L444 ModelExtractionUtils]: 14 out of 25 variables were initially zero. Simplification set additionally 8 variables to zero. [2019-10-22 08:56:15,747 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:56:15,748 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:56:15,748 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:56:15,748 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~length~0) = -1*ULTIMATE.start_main_~j~0 + 1*ULTIMATE.start_main_~length~0 Supporting invariants [] [2019-10-22 08:56:15,754 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-10-22 08:56:15,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:15,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:15,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:56:15,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:15,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:15,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:56:15,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:15,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:15,789 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-10-22 08:56:15,789 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-10-22 08:56:15,801 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 18 states and 24 transitions. Complement of second has 4 states. [2019-10-22 08:56:15,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-10-22 08:56:15,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:56:15,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2019-10-22 08:56:15,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 7 letters. Loop has 4 letters. [2019-10-22 08:56:15,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:15,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 11 letters. Loop has 4 letters. [2019-10-22 08:56:15,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:15,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 7 letters. Loop has 8 letters. [2019-10-22 08:56:15,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:15,804 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 24 transitions. [2019-10-22 08:56:15,805 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 08:56:15,805 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 17 states and 23 transitions. [2019-10-22 08:56:15,805 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-10-22 08:56:15,805 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-10-22 08:56:15,805 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 23 transitions. [2019-10-22 08:56:15,806 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:56:15,806 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2019-10-22 08:56:15,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 23 transitions. [2019-10-22 08:56:15,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-10-22 08:56:15,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-10-22 08:56:15,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2019-10-22 08:56:15,808 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-10-22 08:56:15,808 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-10-22 08:56:15,808 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 08:56:15,808 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 22 transitions. [2019-10-22 08:56:15,808 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 08:56:15,808 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:15,809 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:15,809 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:15,809 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:56:15,809 INFO L791 eck$LassoCheckResult]: Stem: 224#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 221#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~mem208, main_#t~post207, main_#t~mem211, main_#t~post212, main_#t~mem210, main_#t~post209, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 222#L367 assume !(main_~length~0 < 1); 225#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 226#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);call write~int(0, main_~arr~0.base, main_~arr~0.offset, 4);main_~i~0 := 1; 227#L371-3 assume !(main_~i~0 < main_~length~0); 230#L371-4 main_~j~0 := 0; 223#L374-3 assume !!(main_~j~0 < main_~length~0); 215#L375-3 [2019-10-22 08:56:15,809 INFO L793 eck$LassoCheckResult]: Loop: 215#L375-3 call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 216#L375-1 assume !!(main_#t~mem210 > 0);havoc main_#t~mem210;call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_#t~post212 := main_#t~mem211;call write~int(main_#t~post212 - 1, main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);havoc main_#t~post212;havoc main_#t~mem211; 215#L375-3 [2019-10-22 08:56:15,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:15,810 INFO L82 PathProgramCache]: Analyzing trace with hash 176705843, now seen corresponding path program 1 times [2019-10-22 08:56:15,810 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:15,810 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543458236] [2019-10-22 08:56:15,810 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:15,810 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:15,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:15,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:15,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:15,823 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:15,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:15,824 INFO L82 PathProgramCache]: Analyzing trace with hash 2278, now seen corresponding path program 1 times [2019-10-22 08:56:15,824 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:15,824 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087989555] [2019-10-22 08:56:15,824 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:15,824 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:15,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:15,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:15,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:15,831 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:15,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:15,832 INFO L82 PathProgramCache]: Analyzing trace with hash -1984375400, now seen corresponding path program 1 times [2019-10-22 08:56:15,832 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:15,832 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158571365] [2019-10-22 08:56:15,832 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:15,832 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:15,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:15,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:15,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:15,916 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158571365] [2019-10-22 08:56:15,917 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:15,917 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:56:15,917 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382564538] [2019-10-22 08:56:15,942 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:15,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 08:56:15,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:56:15,946 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. cyclomatic complexity: 9 Second operand 6 states. [2019-10-22 08:56:15,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:15,999 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2019-10-22 08:56:15,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 08:56:15,999 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 34 transitions. [2019-10-22 08:56:16,000 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 08:56:16,001 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 25 states and 32 transitions. [2019-10-22 08:56:16,001 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-10-22 08:56:16,001 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-10-22 08:56:16,001 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 32 transitions. [2019-10-22 08:56:16,001 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:56:16,001 INFO L688 BuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2019-10-22 08:56:16,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 32 transitions. [2019-10-22 08:56:16,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 18. [2019-10-22 08:56:16,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-10-22 08:56:16,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2019-10-22 08:56:16,003 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2019-10-22 08:56:16,003 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2019-10-22 08:56:16,004 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 08:56:16,004 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 23 transitions. [2019-10-22 08:56:16,004 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 08:56:16,004 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:16,004 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:16,005 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:16,005 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:56:16,005 INFO L791 eck$LassoCheckResult]: Stem: 281#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 277#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~mem208, main_#t~post207, main_#t~mem211, main_#t~post212, main_#t~mem210, main_#t~post209, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 278#L367 assume !(main_~length~0 < 1); 282#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 283#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);call write~int(0, main_~arr~0.base, main_~arr~0.offset, 4);main_~i~0 := 1; 284#L371-3 assume !(main_~i~0 < main_~length~0); 287#L371-4 main_~j~0 := 0; 279#L374-3 assume !!(main_~j~0 < main_~length~0); 275#L375-3 call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 276#L375-1 assume !(main_#t~mem210 > 0);havoc main_#t~mem210; 271#L374-2 main_#t~post209 := main_~j~0;main_~j~0 := 1 + main_#t~post209;havoc main_#t~post209; 272#L374-3 assume !!(main_~j~0 < main_~length~0); 273#L375-3 [2019-10-22 08:56:16,005 INFO L793 eck$LassoCheckResult]: Loop: 273#L375-3 call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 274#L375-1 assume !!(main_#t~mem210 > 0);havoc main_#t~mem210;call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_#t~post212 := main_#t~mem211;call write~int(main_#t~post212 - 1, main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);havoc main_#t~post212;havoc main_#t~mem211; 273#L375-3 [2019-10-22 08:56:16,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:16,005 INFO L82 PathProgramCache]: Analyzing trace with hash -19280312, now seen corresponding path program 2 times [2019-10-22 08:56:16,006 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:16,006 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861816557] [2019-10-22 08:56:16,006 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:16,006 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:16,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:16,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:16,046 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:16,046 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861816557] [2019-10-22 08:56:16,046 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [757475524] [2019-10-22 08:56:16,046 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eb3b7ef8-a699-47d5-8bce-2282450ed7b9/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-10-22 08:56:16,091 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-22 08:56:16,092 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 08:56:16,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 08:56:16,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:16,148 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:16,149 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-22 08:56:16,149 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2019-10-22 08:56:16,149 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821020339] [2019-10-22 08:56:16,149 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:56:16,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:16,150 INFO L82 PathProgramCache]: Analyzing trace with hash 2278, now seen corresponding path program 2 times [2019-10-22 08:56:16,150 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:16,150 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114061533] [2019-10-22 08:56:16,150 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:16,150 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:16,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:16,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:16,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:16,158 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:16,185 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:16,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 08:56:16,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-10-22 08:56:16,186 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. cyclomatic complexity: 8 Second operand 6 states. [2019-10-22 08:56:16,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:16,266 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2019-10-22 08:56:16,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 08:56:16,268 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 41 transitions. [2019-10-22 08:56:16,269 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 08:56:16,270 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 19 states and 22 transitions. [2019-10-22 08:56:16,270 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-10-22 08:56:16,270 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-10-22 08:56:16,270 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 22 transitions. [2019-10-22 08:56:16,270 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:56:16,270 INFO L688 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2019-10-22 08:56:16,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 22 transitions. [2019-10-22 08:56:16,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2019-10-22 08:56:16,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-10-22 08:56:16,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2019-10-22 08:56:16,272 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2019-10-22 08:56:16,272 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2019-10-22 08:56:16,272 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-10-22 08:56:16,272 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 21 transitions. [2019-10-22 08:56:16,273 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 08:56:16,273 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:16,273 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:16,274 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:16,274 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:56:16,274 INFO L791 eck$LassoCheckResult]: Stem: 388#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 382#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~mem208, main_#t~post207, main_#t~mem211, main_#t~post212, main_#t~mem210, main_#t~post209, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 383#L367 assume !(main_~length~0 < 1); 389#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 390#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);call write~int(0, main_~arr~0.base, main_~arr~0.offset, 4);main_~i~0 := 1; 393#L371-3 assume !!(main_~i~0 < main_~length~0);call main_#t~mem208 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * (main_~i~0 - 1), 4);call write~int(1 + main_#t~mem208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~mem208; 391#L371-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 392#L371-3 assume !(main_~i~0 < main_~length~0); 395#L371-4 main_~j~0 := 0; 386#L374-3 assume !!(main_~j~0 < main_~length~0); 387#L375-3 call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 394#L375-1 assume !(main_#t~mem210 > 0);havoc main_#t~mem210; 384#L374-2 main_#t~post209 := main_~j~0;main_~j~0 := 1 + main_#t~post209;havoc main_#t~post209; 385#L374-3 assume !!(main_~j~0 < main_~length~0); 378#L375-3 [2019-10-22 08:56:16,274 INFO L793 eck$LassoCheckResult]: Loop: 378#L375-3 call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 379#L375-1 assume !!(main_#t~mem210 > 0);havoc main_#t~mem210;call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_#t~post212 := main_#t~mem211;call write~int(main_#t~post212 - 1, main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);havoc main_#t~post212;havoc main_#t~mem211; 378#L375-3 [2019-10-22 08:56:16,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:16,278 INFO L82 PathProgramCache]: Analyzing trace with hash -744742010, now seen corresponding path program 1 times [2019-10-22 08:56:16,278 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:16,279 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897010750] [2019-10-22 08:56:16,279 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:16,279 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:16,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:16,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:16,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:16,309 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:16,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:16,313 INFO L82 PathProgramCache]: Analyzing trace with hash 2278, now seen corresponding path program 3 times [2019-10-22 08:56:16,313 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:16,313 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032931661] [2019-10-22 08:56:16,313 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:16,313 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:16,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:16,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:16,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:16,323 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:16,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:16,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1562468139, now seen corresponding path program 1 times [2019-10-22 08:56:16,327 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:16,327 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907726711] [2019-10-22 08:56:16,327 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:16,327 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:16,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:16,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:16,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:16,349 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:16,577 WARN L191 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 82 [2019-10-22 08:56:16,641 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:56:16,641 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:56:16,641 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:56:16,642 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:56:16,642 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:56:16,642 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:56:16,642 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:56:16,642 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:56:16,642 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_up_and_down_alloca.i_Iteration5_Lasso [2019-10-22 08:56:16,642 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:56:16,642 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:56:16,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:16,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:16,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:16,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:16,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:16,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:16,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:16,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:16,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:16,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:16,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:16,994 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:56:16,994 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:56:16,995 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-10-22 08:56:16,995 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:16,995 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:16,996 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:16,996 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:16,996 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:16,996 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:16,996 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:16,997 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:16,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-10-22 08:56:17,009 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:17,009 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:17,009 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:17,009 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:17,009 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:17,010 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:17,010 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:17,010 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:17,010 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-10-22 08:56:17,011 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:17,011 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:17,011 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:17,011 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:17,012 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:17,012 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:17,013 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:17,013 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-10-22 08:56:17,014 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:17,014 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:17,014 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:17,014 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:17,019 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:17,020 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:17,020 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:17,020 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:17,021 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-10-22 08:56:17,022 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:17,022 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:17,022 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:17,023 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:17,023 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:17,023 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:17,023 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:17,024 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:17,025 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-10-22 08:56:17,025 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:17,025 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:17,026 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:17,026 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:17,026 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:17,026 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:17,026 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:17,027 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:17,027 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-10-22 08:56:17,028 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:17,028 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:17,028 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:17,029 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:17,029 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:17,030 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:17,032 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:17,039 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-10-22 08:56:17,039 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:17,040 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-10-22 08:56:17,040 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:17,040 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:17,041 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 08:56:17,041 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:17,046 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:17,048 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:17,050 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:17,051 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:17,051 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:17,051 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:17,051 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:17,052 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:17,052 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:17,053 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:56:17,054 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 08:56:17,055 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 08:56:17,056 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:56:17,056 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 08:56:17,056 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:56:17,056 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) (+ (* ULTIMATE.start_main_~j~0 4) ULTIMATE.start_main_~arr~0.offset))_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) (+ (* ULTIMATE.start_main_~j~0 4) ULTIMATE.start_main_~arr~0.offset))_2 Supporting invariants [] [2019-10-22 08:56:17,065 INFO L297 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2019-10-22 08:56:17,067 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 08:56:17,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:17,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:17,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:56:17,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:17,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:17,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 08:56:17,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:17,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:17,111 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-10-22 08:56:17,111 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-10-22 08:56:17,127 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 21 states and 24 transitions. Complement of second has 7 states. [2019-10-22 08:56:17,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-10-22 08:56:17,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:56:17,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2019-10-22 08:56:17,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 14 letters. Loop has 2 letters. [2019-10-22 08:56:17,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:17,129 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:56:17,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:17,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:17,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:56:17,153 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:17,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:17,160 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 08:56:17,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:17,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:17,174 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2019-10-22 08:56:17,174 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-10-22 08:56:17,186 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 21 states and 24 transitions. Complement of second has 7 states. [2019-10-22 08:56:17,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-10-22 08:56:17,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:56:17,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2019-10-22 08:56:17,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 14 letters. Loop has 2 letters. [2019-10-22 08:56:17,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:17,188 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:56:17,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:17,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:17,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:56:17,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:17,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:17,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 08:56:17,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:17,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:17,245 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-10-22 08:56:17,245 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-10-22 08:56:17,260 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 23 states and 28 transitions. Complement of second has 6 states. [2019-10-22 08:56:17,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-10-22 08:56:17,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:56:17,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2019-10-22 08:56:17,261 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 14 letters. Loop has 2 letters. [2019-10-22 08:56:17,261 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:17,261 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 16 letters. Loop has 2 letters. [2019-10-22 08:56:17,262 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:17,262 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 14 letters. Loop has 4 letters. [2019-10-22 08:56:17,262 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:17,262 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 28 transitions. [2019-10-22 08:56:17,263 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:56:17,263 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 0 states and 0 transitions. [2019-10-22 08:56:17,263 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 08:56:17,263 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 08:56:17,263 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 08:56:17,263 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:56:17,263 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:56:17,263 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:56:17,263 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:56:17,263 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-10-22 08:56:17,263 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 08:56:17,264 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:56:17,264 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 08:56:17,275 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 08:56:17 BoogieIcfgContainer [2019-10-22 08:56:17,275 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 08:56:17,275 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:56:17,275 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:56:17,275 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:56:17,276 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:56:13" (3/4) ... [2019-10-22 08:56:17,278 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 08:56:17,278 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:56:17,280 INFO L168 Benchmark]: Toolchain (without parser) took 4740.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 186.6 MB). Free memory was 939.2 MB in the beginning and 1.1 GB in the end (delta: -203.9 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:56:17,280 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:56:17,281 INFO L168 Benchmark]: CACSL2BoogieTranslator took 482.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 939.2 MB in the beginning and 1.1 GB in the end (delta: -172.4 MB). Peak memory consumption was 17.6 MB. Max. memory is 11.5 GB. [2019-10-22 08:56:17,281 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.09 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:56:17,281 INFO L168 Benchmark]: Boogie Preprocessor took 22.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-10-22 08:56:17,282 INFO L168 Benchmark]: RCFGBuilder took 368.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2019-10-22 08:56:17,282 INFO L168 Benchmark]: BuchiAutomizer took 3809.71 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 52.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -54.0 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:56:17,282 INFO L168 Benchmark]: Witness Printer took 3.10 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:56:17,286 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 482.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 939.2 MB in the beginning and 1.1 GB in the end (delta: -172.4 MB). Peak memory consumption was 17.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 49.09 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 368.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3809.71 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 52.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -54.0 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 3.10 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - 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 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * i + length and consists of 5 locations. One deterministic module has affine ranking function -1 * j + length and consists of 3 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[arr][j * 4 + arr] and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.7s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 3.0s. Construction of modules took 0.1s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 9 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 18 states and ocurred in iteration 3. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 78 SDtfs, 108 SDslu, 51 SDs, 0 SdLazy, 108 SolverSat, 23 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital144 mio100 ax100 hnf99 lsp95 ukn78 mio100 lsp60 div100 bol100 ite100 ukn100 eq157 hnf87 smp93 dnf100 smp100 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 17ms VariablesStem: 3 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...