./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/b.07-alloca.i --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-memory-alloca/b.07-alloca.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 d098d694ac70f506ee7e05c2de50965e1598d96f ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 01:34:33,651 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:34:33,654 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:34:33,666 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:34:33,667 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:34:33,668 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:34:33,670 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:34:33,674 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:34:33,677 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:34:33,678 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:34:33,679 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:34:33,681 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:34:33,681 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:34:33,682 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:34:33,684 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:34:33,685 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:34:33,686 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:34:33,687 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:34:33,689 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:34:33,692 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:34:33,693 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:34:33,695 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:34:33,696 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:34:33,697 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:34:33,700 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:34:33,701 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:34:33,701 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:34:33,702 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:34:33,703 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:34:33,704 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:34:33,704 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:34:33,705 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:34:33,706 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:34:33,707 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:34:33,709 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:34:33,709 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:34:33,710 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:34:33,710 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:34:33,710 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:34:33,712 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:34:33,713 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:34:33,714 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2020-07-29 01:34:33,734 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:34:33,734 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:34:33,736 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:34:33,737 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:34:33,737 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:34:33,737 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 01:34:33,737 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 01:34:33,738 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 01:34:33,738 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 01:34:33,738 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 01:34:33,739 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 01:34:33,740 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:34:33,740 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:34:33,741 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:34:33,741 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:34:33,742 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 01:34:33,742 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 01:34:33,742 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 01:34:33,742 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 01:34:33,743 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 01:34:33,743 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:34:33,743 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 01:34:33,744 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:34:33,744 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:34:33,744 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 01:34:33,745 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:34:33,745 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:34:33,745 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:34:33,745 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 01:34:33,747 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 01:34:33,748 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> d098d694ac70f506ee7e05c2de50965e1598d96f [2020-07-29 01:34:34,071 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:34:34,086 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:34:34,091 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:34:34,093 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:34:34,095 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:34:34,097 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/b.07-alloca.i [2020-07-29 01:34:34,177 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5058f5b81/058ec51c769a4c5f8d390f6b90f2dac4/FLAG52d1665d7 [2020-07-29 01:34:34,744 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:34:34,745 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/b.07-alloca.i [2020-07-29 01:34:34,760 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5058f5b81/058ec51c769a4c5f8d390f6b90f2dac4/FLAG52d1665d7 [2020-07-29 01:34:35,056 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5058f5b81/058ec51c769a4c5f8d390f6b90f2dac4 [2020-07-29 01:34:35,060 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:34:35,064 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 01:34:35,069 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:34:35,069 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:34:35,073 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:34:35,077 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:34:35" (1/1) ... [2020-07-29 01:34:35,080 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7effe43e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:35, skipping insertion in model container [2020-07-29 01:34:35,080 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:34:35" (1/1) ... [2020-07-29 01:34:35,088 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:34:35,127 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:34:35,519 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:34:35,537 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:34:35,615 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:34:35,669 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:34:35,670 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:35 WrapperNode [2020-07-29 01:34:35,670 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:34:35,671 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 01:34:35,671 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 01:34:35,671 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 01:34:35,680 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:35" (1/1) ... [2020-07-29 01:34:35,697 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:35" (1/1) ... [2020-07-29 01:34:35,726 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 01:34:35,727 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:34:35,727 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:34:35,727 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:34:35,737 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:35" (1/1) ... [2020-07-29 01:34:35,738 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:35" (1/1) ... [2020-07-29 01:34:35,742 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:35" (1/1) ... [2020-07-29 01:34:35,743 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:35" (1/1) ... [2020-07-29 01:34:35,752 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:35" (1/1) ... [2020-07-29 01:34:35,757 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:35" (1/1) ... [2020-07-29 01:34:35,759 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:35" (1/1) ... [2020-07-29 01:34:35,766 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:34:35,768 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:34:35,769 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:34:35,769 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:34:35,770 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:35" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-07-29 01:34:35,848 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 01:34:35,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 01:34:35,848 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-29 01:34:35,849 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 01:34:35,849 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:34:35,849 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:34:36,273 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:34:36,273 INFO L295 CfgBuilder]: Removed 7 assume(true) statements. [2020-07-29 01:34:36,277 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:34:36 BoogieIcfgContainer [2020-07-29 01:34:36,278 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:34:36,279 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 01:34:36,279 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 01:34:36,283 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 01:34:36,284 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:34:36,285 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 01:34:35" (1/3) ... [2020-07-29 01:34:36,286 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2e8850a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:34:36, skipping insertion in model container [2020-07-29 01:34:36,286 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:34:36,287 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:35" (2/3) ... [2020-07-29 01:34:36,287 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2e8850a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:34:36, skipping insertion in model container [2020-07-29 01:34:36,287 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:34:36,287 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:34:36" (3/3) ... [2020-07-29 01:34:36,289 INFO L371 chiAutomizerObserver]: Analyzing ICFG b.07-alloca.i [2020-07-29 01:34:36,344 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 01:34:36,345 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 01:34:36,345 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 01:34:36,345 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:34:36,345 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:34:36,346 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 01:34:36,346 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:34:36,346 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 01:34:36,360 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states. [2020-07-29 01:34:36,388 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:34:36,389 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:36,389 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:36,394 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 01:34:36,395 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:34:36,395 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 01:34:36,395 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states. [2020-07-29 01:34:36,398 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:34:36,398 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:36,398 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:36,399 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 01:34:36,399 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:34:36,406 INFO L794 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 3#L-1true havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~ret17;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet14, main_#t~nondet15, main_#t~nondet16;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~short10, test_fun_#t~mem13, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 6#L557-5true [2020-07-29 01:34:36,407 INFO L796 eck$LassoCheckResult]: Loop: 6#L557-5true call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 8#L557-1true assume test_fun_#t~short10;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem8 > test_fun_#t~mem9; 12#L557-3true assume !!test_fun_#t~short10;havoc test_fun_#t~mem9;havoc test_fun_#t~mem7;havoc test_fun_#t~mem8;havoc test_fun_#t~short10;havoc test_fun_#t~mem6;call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem11 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem11;call test_fun_#t~mem12 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem12; 6#L557-5true [2020-07-29 01:34:36,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:36,414 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2020-07-29 01:34:36,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:36,425 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925408294] [2020-07-29 01:34:36,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:36,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:36,592 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:36,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:36,688 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:36,717 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:34:36,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:36,720 INFO L82 PathProgramCache]: Analyzing trace with hash 36846, now seen corresponding path program 1 times [2020-07-29 01:34:36,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:36,721 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019792601] [2020-07-29 01:34:36,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:36,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:36,739 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:36,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:36,753 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:36,757 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:34:36,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:36,760 INFO L82 PathProgramCache]: Analyzing trace with hash 28695788, now seen corresponding path program 1 times [2020-07-29 01:34:36,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:36,761 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257455797] [2020-07-29 01:34:36,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:36,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:36,835 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:36,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:36,940 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:36,948 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:34:37,185 WARN L193 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2020-07-29 01:34:38,349 WARN L193 SmtUtils]: Spent 952.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 106 [2020-07-29 01:34:38,793 WARN L193 SmtUtils]: Spent 393.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2020-07-29 01:34:38,818 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:34:38,819 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:34:38,820 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:34:38,820 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:34:38,821 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:34:38,821 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:38,821 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:34:38,821 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:34:38,821 INFO L133 ssoRankerPreferences]: Filename of dumped script: b.07-alloca.i_Iteration1_Lasso [2020-07-29 01:34:38,822 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:34:38,822 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:34:38,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:38,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:38,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:38,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:38,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:38,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:38,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:38,957 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:38,962 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:38,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:38,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:38,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:39,814 WARN L193 SmtUtils]: Spent 460.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 91 [2020-07-29 01:34:40,034 WARN L193 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 71 [2020-07-29 01:34:40,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:40,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:40,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:40,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:40,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:40,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:41,321 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:34:41,327 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 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 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:41,334 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 [2020-07-29 01:34:41,336 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:41,336 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:41,337 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:41,337 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:41,337 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:41,339 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:41,339 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:41,345 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 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 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:41,381 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 [2020-07-29 01:34:41,383 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:41,384 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:41,384 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:41,384 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:41,384 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:41,385 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:41,386 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:41,388 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:41,413 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:34:41,415 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:41,415 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:41,415 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:41,415 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:41,415 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:41,416 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:41,416 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:41,419 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 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 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:41,446 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:34:41,447 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:41,447 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:41,448 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:41,448 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:41,448 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:41,448 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:41,448 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:41,450 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:41,476 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 [2020-07-29 01:34:41,477 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:41,477 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:41,477 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:41,478 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:41,478 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:41,480 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:41,481 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:41,483 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 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 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:41,507 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 [2020-07-29 01:34:41,509 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:41,509 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:41,509 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:41,510 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:41,510 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:41,510 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:41,511 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:41,515 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:41,549 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 [2020-07-29 01:34:41,551 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:41,551 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:41,551 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:41,551 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:41,555 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:41,555 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:41,559 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 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 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:41,596 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 [2020-07-29 01:34:41,598 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:41,598 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:41,598 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:41,598 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:41,598 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:41,599 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:41,599 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:41,601 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 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 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:41,631 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 [2020-07-29 01:34:41,635 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:41,635 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:41,635 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:41,636 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:41,639 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:41,639 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:41,652 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:34:41,702 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 [2020-07-29 01:34:41,704 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:41,705 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:41,705 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:41,705 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:41,711 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:41,714 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:41,724 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 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 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:41,754 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 [2020-07-29 01:34:41,755 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:41,756 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:41,756 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:41,756 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:41,760 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:41,760 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:41,765 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:41,791 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 [2020-07-29 01:34:41,792 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:41,793 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:41,793 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:41,793 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:41,796 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:41,797 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:41,801 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:34:41,832 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 [2020-07-29 01:34:41,834 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:41,834 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:41,834 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:41,835 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:41,838 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:41,838 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:41,844 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 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 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:41,868 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 [2020-07-29 01:34:41,870 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:41,871 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:41,871 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:41,871 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:41,882 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:41,882 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:41,902 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:34:42,096 INFO L443 ModelExtractionUtils]: Simplification made 15 calls to the SMT solver. [2020-07-29 01:34:42,096 INFO L444 ModelExtractionUtils]: 13 out of 40 variables were initially zero. Simplification set additionally 22 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:34:42,136 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:42,146 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-07-29 01:34:42,147 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:34:42,147 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_1, ULTIMATE.start_test_fun_~z) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_1 - 1*ULTIMATE.start_test_fun_~z Supporting invariants [1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_1 - 1*ULTIMATE.start_test_fun_~z >= 0] [2020-07-29 01:34:42,500 INFO L297 tatePredicateManager]: 41 out of 42 supporting invariants were superfluous and have been removed [2020-07-29 01:34:42,512 INFO L393 LassoCheck]: Loop: "call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7;" "assume test_fun_#t~short10;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem8 > test_fun_#t~mem9;" "assume !!test_fun_#t~short10;havoc test_fun_#t~mem9;havoc test_fun_#t~mem7;havoc test_fun_#t~mem8;havoc test_fun_#t~short10;havoc test_fun_#t~mem6;call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem11 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem11;call test_fun_#t~mem12 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem12;" [2020-07-29 01:34:42,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:42,541 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-29 01:34:42,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:42,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:42,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-29 01:34:42,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:42,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:34:42,641 INFO L280 TraceCheckUtils]: 0: Hoare triple {20#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {20#unseeded} is VALID [2020-07-29 01:34:42,645 INFO L280 TraceCheckUtils]: 1: Hoare triple {20#unseeded} havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~ret17;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet14, main_#t~nondet15, main_#t~nondet16;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~short10, test_fun_#t~mem13, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); {244#(and (>= (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset) (* (- 1) ULTIMATE.start_test_fun_~z)) 0) unseeded)} is VALID [2020-07-29 01:34:42,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:42,667 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-29 01:34:42,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:42,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:34:42,746 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:34:42,793 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:34:42,922 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:34:42,950 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:34:43,032 INFO L280 TraceCheckUtils]: 0: Hoare triple {245#(and (>= (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset) (* (- 1) ULTIMATE.start_test_fun_~z)) 0) (>= oldRank0 (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) (* (- 1) ULTIMATE.start_test_fun_~z))))} call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; {256#(and (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) (+ ULTIMATE.start_test_fun_~z oldRank0)) (<= ULTIMATE.start_test_fun_~z (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)) (or (not |ULTIMATE.start_test_fun_#t~short10|) (<= (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset) 1) (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset))))} is VALID [2020-07-29 01:34:43,035 INFO L280 TraceCheckUtils]: 1: Hoare triple {256#(and (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) (+ ULTIMATE.start_test_fun_~z oldRank0)) (<= ULTIMATE.start_test_fun_~z (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)) (or (not |ULTIMATE.start_test_fun_#t~short10|) (<= (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset) 1) (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset))))} assume test_fun_#t~short10;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem8 > test_fun_#t~mem9; {260#(and (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) (+ ULTIMATE.start_test_fun_~z oldRank0)) (or (not |ULTIMATE.start_test_fun_#t~short10|) (<= (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset) 1) (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset))) (<= ULTIMATE.start_test_fun_~z (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)) (<= (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset) 1) (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)))} is VALID [2020-07-29 01:34:43,040 INFO L280 TraceCheckUtils]: 2: Hoare triple {260#(and (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) (+ ULTIMATE.start_test_fun_~z oldRank0)) (or (not |ULTIMATE.start_test_fun_#t~short10|) (<= (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset) 1) (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset))) (<= ULTIMATE.start_test_fun_~z (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)) (<= (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset) 1) (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)))} assume !!test_fun_#t~short10;havoc test_fun_#t~mem9;havoc test_fun_#t~mem7;havoc test_fun_#t~mem8;havoc test_fun_#t~short10;havoc test_fun_#t~mem6;call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem11 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem11;call test_fun_#t~mem12 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem12; {247#(and (or (and (> oldRank0 (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) (* (- 1) ULTIMATE.start_test_fun_~z))) (>= oldRank0 0)) unseeded) (>= (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset) (* (- 1) ULTIMATE.start_test_fun_~z)) 0))} is VALID [2020-07-29 01:34:43,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:34:43,054 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:34:43,093 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:34:43,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:34:43,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:43,106 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-07-29 01:34:43,115 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states. Second operand 4 states. [2020-07-29 01:34:43,391 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states.. Second operand 4 states. Result 43 states and 48 transitions. Complement of second has 10 states. [2020-07-29 01:34:43,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2020-07-29 01:34:43,391 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:34:43,391 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states. [2020-07-29 01:34:43,393 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:34:43,393 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:43,395 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:43,395 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:34:43,406 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-07-29 01:34:43,406 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:43,406 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:43,407 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 48 transitions. [2020-07-29 01:34:43,410 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:34:43,411 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:43,411 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:43,416 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 10 states. [2020-07-29 01:34:43,419 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:34:43,421 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:34:43,421 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:34:43,428 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-07-29 01:34:43,429 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:34:43,429 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 43 states and 48 transitions. cyclomatic complexity: 7 [2020-07-29 01:34:43,436 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:34:43,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:34:43,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:43,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:34:43,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:43,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 48 transitions. cyclomatic complexity: 7 Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:34:43,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:43,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:34:43,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:43,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:34:43,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:43,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 48 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:34:43,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:43,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:34:43,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:43,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:34:43,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:43,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 48 transitions. cyclomatic complexity: 7 Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:34:43,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:43,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 43 letters. Loop has 43 letters. [2020-07-29 01:34:43,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:43,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 43 letters. Loop has 43 letters. [2020-07-29 01:34:43,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:43,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 48 transitions. cyclomatic complexity: 7 Stem has 43 letters. Loop has 43 letters. [2020-07-29 01:34:43,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:43,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 10 letters. Loop has 10 letters. [2020-07-29 01:34:43,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:43,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 10 letters. Loop has 10 letters. [2020-07-29 01:34:43,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:43,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 48 transitions. cyclomatic complexity: 7 Stem has 10 letters. Loop has 10 letters. [2020-07-29 01:34:43,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:43,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:34:43,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:43,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:34:43,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:43,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 48 transitions. cyclomatic complexity: 7 Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:34:43,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:43,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:34:43,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:43,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:34:43,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:43,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 48 transitions. cyclomatic complexity: 7 Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:34:43,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:43,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:34:43,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:43,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:34:43,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:43,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 48 transitions. cyclomatic complexity: 7 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:34:43,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:43,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:34:43,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:43,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:34:43,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:43,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 48 transitions. cyclomatic complexity: 7 Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:34:43,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:43,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:34:43,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:43,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:34:43,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:43,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 48 transitions. cyclomatic complexity: 7 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:34:43,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:43,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:34:43,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:43,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:34:43,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:43,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 48 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:34:43,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:43,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:34:43,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:43,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:34:43,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:43,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 48 transitions. cyclomatic complexity: 7 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:34:43,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:43,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:34:43,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:43,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:34:43,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:43,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 48 transitions. cyclomatic complexity: 7 Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:34:43,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:43,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:34:43,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:43,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:34:43,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:43,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 48 transitions. cyclomatic complexity: 7 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:34:43,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:43,461 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:34:43,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:34:43,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2020-07-29 01:34:43,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:34:43,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:43,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:34:43,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:43,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 2 letters. Loop has 6 letters. [2020-07-29 01:34:43,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:43,470 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 48 transitions. cyclomatic complexity: 7 [2020-07-29 01:34:43,482 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:34:43,488 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 11 states and 14 transitions. [2020-07-29 01:34:43,489 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2020-07-29 01:34:43,490 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2020-07-29 01:34:43,490 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2020-07-29 01:34:43,491 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:34:43,491 INFO L688 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2020-07-29 01:34:43,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2020-07-29 01:34:43,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2020-07-29 01:34:43,522 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:34:43,525 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states and 14 transitions. Second operand 10 states. [2020-07-29 01:34:43,526 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states and 14 transitions. Second operand 10 states. [2020-07-29 01:34:43,530 INFO L87 Difference]: Start difference. First operand 11 states and 14 transitions. Second operand 10 states. [2020-07-29 01:34:43,534 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:34:43,540 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2020-07-29 01:34:43,540 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 14 transitions. [2020-07-29 01:34:43,541 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:34:43,541 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:34:43,542 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states. Second operand 11 states and 14 transitions. [2020-07-29 01:34:43,542 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 11 states and 14 transitions. [2020-07-29 01:34:43,542 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:34:43,545 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2020-07-29 01:34:43,545 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 14 transitions. [2020-07-29 01:34:43,545 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:34:43,545 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:34:43,545 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:34:43,545 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:34:43,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-29 01:34:43,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2020-07-29 01:34:43,552 INFO L711 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2020-07-29 01:34:43,552 INFO L591 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2020-07-29 01:34:43,552 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 01:34:43,552 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2020-07-29 01:34:43,556 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:34:43,557 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:43,557 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:43,557 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-29 01:34:43,557 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:34:43,557 INFO L794 eck$LassoCheckResult]: Stem: 324#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 322#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~ret17;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet14, main_#t~nondet15, main_#t~nondet16;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~short10, test_fun_#t~mem13, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 323#L557-5 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 329#L557-1 assume !test_fun_#t~short10; 330#L557-3 [2020-07-29 01:34:43,558 INFO L796 eck$LassoCheckResult]: Loop: 330#L557-3 assume !!test_fun_#t~short10;havoc test_fun_#t~mem9;havoc test_fun_#t~mem7;havoc test_fun_#t~mem8;havoc test_fun_#t~short10;havoc test_fun_#t~mem6;call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem11 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem11;call test_fun_#t~mem12 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem12; 325#L557-5 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 326#L557-1 assume test_fun_#t~short10;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem8 > test_fun_#t~mem9; 330#L557-3 [2020-07-29 01:34:43,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:43,560 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 1 times [2020-07-29 01:34:43,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:43,561 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426010659] [2020-07-29 01:34:43,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:43,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:43,607 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:43,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:43,632 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:43,637 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:34:43,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:43,638 INFO L82 PathProgramCache]: Analyzing trace with hash 47316, now seen corresponding path program 2 times [2020-07-29 01:34:43,639 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:43,639 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217970230] [2020-07-29 01:34:43,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:43,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:43,650 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:43,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:43,659 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:43,662 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:34:43,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:43,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1806908301, now seen corresponding path program 1 times [2020-07-29 01:34:43,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:43,664 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954071674] [2020-07-29 01:34:43,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:43,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:43,729 INFO L280 TraceCheckUtils]: 0: Hoare triple {390#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {390#true} is VALID [2020-07-29 01:34:43,729 INFO L280 TraceCheckUtils]: 1: Hoare triple {390#true} havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~ret17;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet14, main_#t~nondet15, main_#t~nondet16;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~short10, test_fun_#t~mem13, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); {390#true} is VALID [2020-07-29 01:34:43,729 INFO L280 TraceCheckUtils]: 2: Hoare triple {390#true} call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; {390#true} is VALID [2020-07-29 01:34:43,730 INFO L280 TraceCheckUtils]: 3: Hoare triple {390#true} assume !test_fun_#t~short10; {392#(not |ULTIMATE.start_test_fun_#t~short10|)} is VALID [2020-07-29 01:34:43,731 INFO L280 TraceCheckUtils]: 4: Hoare triple {392#(not |ULTIMATE.start_test_fun_#t~short10|)} assume !!test_fun_#t~short10;havoc test_fun_#t~mem9;havoc test_fun_#t~mem7;havoc test_fun_#t~mem8;havoc test_fun_#t~short10;havoc test_fun_#t~mem6;call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem11 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem11;call test_fun_#t~mem12 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem12; {391#false} is VALID [2020-07-29 01:34:43,732 INFO L280 TraceCheckUtils]: 5: Hoare triple {391#false} call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; {391#false} is VALID [2020-07-29 01:34:43,732 INFO L280 TraceCheckUtils]: 6: Hoare triple {391#false} assume test_fun_#t~short10;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem8 > test_fun_#t~mem9; {391#false} is VALID [2020-07-29 01:34:43,733 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:34:43,733 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954071674] [2020-07-29 01:34:43,734 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:34:43,734 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 01:34:43,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549056181] [2020-07-29 01:34:43,955 WARN L193 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 68 [2020-07-29 01:34:44,088 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2020-07-29 01:34:44,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:34:44,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 01:34:44,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 01:34:44,093 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. cyclomatic complexity: 5 Second operand 3 states. [2020-07-29 01:34:44,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:34:44,131 INFO L93 Difference]: Finished difference Result 8 states and 9 transitions. [2020-07-29 01:34:44,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 01:34:44,131 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:34:44,147 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:34:44,148 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8 states and 9 transitions. [2020-07-29 01:34:44,148 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:34:44,148 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8 states to 0 states and 0 transitions. [2020-07-29 01:34:44,149 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 01:34:44,149 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 01:34:44,149 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 01:34:44,149 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:34:44,149 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:34:44,150 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:34:44,150 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:34:44,150 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 01:34:44,150 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 01:34:44,151 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:34:44,151 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:34:44,161 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 01:34:44 BoogieIcfgContainer [2020-07-29 01:34:44,161 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 01:34:44,162 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:34:44,162 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:34:44,162 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:34:44,163 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:34:36" (3/4) ... [2020-07-29 01:34:44,167 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 01:34:44,167 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:34:44,170 INFO L168 Benchmark]: Toolchain (without parser) took 9107.42 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 332.4 MB). Free memory was 960.2 MB in the beginning and 1.1 GB in the end (delta: -149.6 MB). Peak memory consumption was 182.8 MB. Max. memory is 11.5 GB. [2020-07-29 01:34:44,172 INFO L168 Benchmark]: CDTParser took 1.29 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:34:44,178 INFO L168 Benchmark]: CACSL2BoogieTranslator took 601.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 960.2 MB in the beginning and 1.1 GB in the end (delta: -162.7 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. [2020-07-29 01:34:44,180 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.52 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:34:44,181 INFO L168 Benchmark]: Boogie Preprocessor took 41.56 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:34:44,181 INFO L168 Benchmark]: RCFGBuilder took 509.46 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: 25.5 MB). Peak memory consumption was 25.5 MB. Max. memory is 11.5 GB. [2020-07-29 01:34:44,183 INFO L168 Benchmark]: BuchiAutomizer took 7882.96 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 191.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -25.8 MB). Peak memory consumption was 166.1 MB. Max. memory is 11.5 GB. [2020-07-29 01:34:44,184 INFO L168 Benchmark]: Witness Printer took 5.38 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:34:44,198 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.29 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 601.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 960.2 MB in the beginning and 1.1 GB in the end (delta: -162.7 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 55.52 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 41.56 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 509.46 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: 25.5 MB). Peak memory consumption was 25.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7882.96 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 191.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -25.8 MB). Peak memory consumption was 166.1 MB. Max. memory is 11.5 GB. * Witness Printer took 5.38 ms. Allocated memory is still 1.4 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 2 terminating modules (1 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[y_ref][y_ref] + -1 * z and consists of 6 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.8s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 6.6s. Construction of modules took 0.0s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 10 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 11 SDtfs, 10 SDslu, 10 SDs, 0 SdLazy, 24 SolverSat, 7 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital430 mio100 ax104 hnf100 lsp93 ukn52 mio100 lsp35 div100 bol100 ite100 ukn100 eq198 hnf87 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 13ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...