./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-15/count_up_alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 9a8b2e8d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -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-15/count_up_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 09e9c2546f4b38561ae63bf5b67ae3d7f5a4eb9b ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-9a8b2e8 [2020-10-20 06:42:37,704 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 06:42:37,707 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 06:42:37,733 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 06:42:37,734 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 06:42:37,744 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 06:42:37,745 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 06:42:37,748 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 06:42:37,752 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 06:42:37,754 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 06:42:37,755 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 06:42:37,757 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 06:42:37,759 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 06:42:37,764 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 06:42:37,766 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 06:42:37,767 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 06:42:37,770 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 06:42:37,771 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 06:42:37,773 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 06:42:37,776 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 06:42:37,780 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 06:42:37,790 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 06:42:37,791 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 06:42:37,792 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 06:42:37,794 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 06:42:37,795 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 06:42:37,795 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 06:42:37,796 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 06:42:37,796 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 06:42:37,797 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 06:42:37,797 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 06:42:37,798 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 06:42:37,798 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 06:42:37,799 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 06:42:37,800 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 06:42:37,800 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 06:42:37,801 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 06:42:37,801 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 06:42:37,801 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 06:42:37,802 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 06:42:37,803 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 06:42:37,803 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2020-10-20 06:42:37,830 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 06:42:37,830 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 06:42:37,831 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 06:42:37,831 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 06:42:37,832 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 06:42:37,832 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-20 06:42:37,832 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-20 06:42:37,832 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-20 06:42:37,832 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-20 06:42:37,833 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-20 06:42:37,833 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-20 06:42:37,833 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 06:42:37,833 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-20 06:42:37,833 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 06:42:37,833 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 06:42:37,834 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-20 06:42:37,834 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-20 06:42:37,834 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-20 06:42:37,834 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 06:42:37,834 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-20 06:42:37,834 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 06:42:37,835 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-20 06:42:37,835 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 06:42:37,835 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 06:42:37,835 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-20 06:42:37,835 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 06:42:37,836 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 06:42:37,836 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 06:42:37,836 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-20 06:42:37,837 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-20 06:42:37,837 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 -> 09e9c2546f4b38561ae63bf5b67ae3d7f5a4eb9b [2020-10-20 06:42:38,056 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 06:42:38,069 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 06:42:38,073 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 06:42:38,074 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 06:42:38,075 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 06:42:38,076 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-15/count_up_alloca.i [2020-10-20 06:42:38,170 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a421b535c/68311e8739bd4e5f969920b32a146412/FLAGc405b62ac [2020-10-20 06:42:38,747 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 06:42:38,749 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/count_up_alloca.i [2020-10-20 06:42:38,764 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a421b535c/68311e8739bd4e5f969920b32a146412/FLAGc405b62ac [2020-10-20 06:42:39,063 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a421b535c/68311e8739bd4e5f969920b32a146412 [2020-10-20 06:42:39,067 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 06:42:39,074 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 06:42:39,076 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 06:42:39,076 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 06:42:39,079 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 06:42:39,081 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 06:42:39" (1/1) ... [2020-10-20 06:42:39,084 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f77b7f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:42:39, skipping insertion in model container [2020-10-20 06:42:39,084 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 06:42:39" (1/1) ... [2020-10-20 06:42:39,092 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 06:42:39,130 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 06:42:39,486 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 06:42:39,502 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 06:42:39,587 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 06:42:39,671 INFO L208 MainTranslator]: Completed translation [2020-10-20 06:42:39,672 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:42:39 WrapperNode [2020-10-20 06:42:39,672 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 06:42:39,674 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 06:42:39,674 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 06:42:39,675 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 06:42:39,683 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:42:39" (1/1) ... [2020-10-20 06:42:39,697 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:42:39" (1/1) ... [2020-10-20 06:42:39,720 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 06:42:39,721 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 06:42:39,721 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 06:42:39,721 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 06:42:39,731 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:42:39" (1/1) ... [2020-10-20 06:42:39,731 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:42:39" (1/1) ... [2020-10-20 06:42:39,733 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:42:39" (1/1) ... [2020-10-20 06:42:39,734 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:42:39" (1/1) ... [2020-10-20 06:42:39,739 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:42:39" (1/1) ... [2020-10-20 06:42:39,744 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:42:39" (1/1) ... [2020-10-20 06:42:39,746 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:42:39" (1/1) ... [2020-10-20 06:42:39,749 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 06:42:39,749 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 06:42:39,750 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 06:42:39,750 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 06:42:39,751 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:42:39" (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-10-20 06:42:39,821 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-20 06:42:39,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-20 06:42:39,822 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 06:42:39,822 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-20 06:42:39,822 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 06:42:39,822 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 06:42:40,070 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 06:42:40,071 INFO L298 CfgBuilder]: Removed 7 assume(true) statements. [2020-10-20 06:42:40,073 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 06:42:40 BoogieIcfgContainer [2020-10-20 06:42:40,073 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 06:42:40,074 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-20 06:42:40,074 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-20 06:42:40,078 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-20 06:42:40,079 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 06:42:40,079 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.10 06:42:39" (1/3) ... [2020-10-20 06:42:40,080 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@176873de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 06:42:40, skipping insertion in model container [2020-10-20 06:42:40,080 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 06:42:40,080 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:42:39" (2/3) ... [2020-10-20 06:42:40,081 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@176873de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 06:42:40, skipping insertion in model container [2020-10-20 06:42:40,081 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 06:42:40,081 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 06:42:40" (3/3) ... [2020-10-20 06:42:40,083 INFO L373 chiAutomizerObserver]: Analyzing ICFG count_up_alloca.i [2020-10-20 06:42:40,161 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-20 06:42:40,162 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-20 06:42:40,162 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-20 06:42:40,163 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 06:42:40,163 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 06:42:40,163 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-20 06:42:40,164 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 06:42:40,164 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-20 06:42:40,209 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2020-10-20 06:42:40,238 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-10-20 06:42:40,239 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:42:40,239 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:42:40,247 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-10-20 06:42:40,247 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-20 06:42:40,248 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-20 06:42:40,248 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2020-10-20 06:42:40,250 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-10-20 06:42:40,250 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:42:40,250 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:42:40,250 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-10-20 06:42:40,251 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-20 06:42:40,257 INFO L794 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 9#L-1true havoc main_#res;havoc main_#t~nondet205, main_#t~nondet206, main_#t~malloc207.base, main_#t~malloc207.offset, main_#t~nondet209, main_#t~post208, main_#t~mem212, main_#t~post213, main_#t~mem211, main_#t~post210, main_~i~0, main_~j~0, main_~val~0, main_~limit~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~limit~0 := main_#t~nondet205;havoc main_#t~nondet205;main_~length~0 := main_#t~nondet206;havoc main_#t~nondet206; 15#L369true assume !(main_~length~0 < 1); 20#L369-2true call main_#t~malloc207.base, main_#t~malloc207.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc207.base, main_#t~malloc207.offset; 12#L371true assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 16#L372-3true [2020-10-20 06:42:40,258 INFO L796 eck$LassoCheckResult]: Loop: 16#L372-3true assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet209;havoc main_#t~nondet209; 7#L374true assume main_~val~0 > main_~limit~0;main_~val~0 := main_~limit~0; 10#L374-2true call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 13#L372-2true main_#t~post208 := main_~i~0;main_~i~0 := 1 + main_#t~post208;havoc main_#t~post208; 16#L372-3true [2020-10-20 06:42:40,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:42:40,264 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2020-10-20 06:42:40,272 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:42:40,272 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773121044] [2020-10-20 06:42:40,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:42:40,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:42:40,369 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:42:40,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:42:40,383 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:42:40,407 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:42:40,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:42:40,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1603878, now seen corresponding path program 1 times [2020-10-20 06:42:40,409 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:42:40,409 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591004743] [2020-10-20 06:42:40,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:42:40,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:42:40,423 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:42:40,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:42:40,432 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:42:40,436 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:42:40,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:42:40,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1182970350, now seen corresponding path program 1 times [2020-10-20 06:42:40,438 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:42:40,438 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483535209] [2020-10-20 06:42:40,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:42:40,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:42:40,460 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:42:40,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:42:40,482 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:42:40,490 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:42:40,800 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:42:40,801 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:42:40,801 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:42:40,802 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:42:40,802 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 06:42:40,802 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:42:40,802 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:42:40,802 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:42:40,803 INFO L133 ssoRankerPreferences]: Filename of dumped script: count_up_alloca.i_Iteration1_Lasso [2020-10-20 06:42:40,803 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:42:40,803 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:42:40,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:40,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:40,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:40,849 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:40,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:40,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:40,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:40,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:41,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:41,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:41,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:41,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:41,277 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:42:41,283 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) [2020-10-20 06:42:41,291 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-10-20 06:42:41,294 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:42:41,295 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:42:41,296 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:42:41,296 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:42:41,297 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:42:41,300 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:42:41,300 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:42:41,304 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-10-20 06:42:41,333 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-10-20 06:42:41,335 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:42:41,335 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:42:41,335 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:42:41,336 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:42:41,336 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:42:41,336 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:42:41,337 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:42:41,338 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) [2020-10-20 06:42:41,378 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:42:41,380 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:42:41,380 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:42:41,380 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:42:41,380 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:42:41,380 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:42:41,381 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:42:41,381 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:42:41,383 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-10-20 06:42:41,423 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-10-20 06:42:41,424 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:42:41,425 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:42:41,425 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:42:41,425 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:42:41,425 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:42:41,426 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:42:41,426 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:42:41,428 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-10-20 06:42:41,473 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-10-20 06:42:41,475 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:42:41,475 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:42:41,475 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:42:41,475 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:42:41,481 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:42:41,481 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:42:41,494 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-10-20 06:42:41,526 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-10-20 06:42:41,529 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:42:41,529 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:42:41,530 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:42:41,530 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:42:41,530 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:42:41,531 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:42:41,531 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:42:41,533 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-10-20 06:42:41,575 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-10-20 06:42:41,577 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:42:41,577 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:42:41,578 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:42:41,578 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:42:41,578 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:42:41,579 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:42:41,579 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:42:41,581 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-10-20 06:42:41,610 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-10-20 06:42:41,613 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:42:41,613 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:42:41,613 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:42:41,613 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:42:41,622 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:42:41,623 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:42:41,637 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 06:42:41,674 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2020-10-20 06:42:41,675 INFO L444 ModelExtractionUtils]: 5 out of 22 variables were initially zero. Simplification set additionally 14 variables to zero. 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-10-20 06:42:41,687 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 06:42:41,690 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-20 06:42:41,691 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 06:42:41,692 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~length~0) = -1*ULTIMATE.start_main_~i~0 + 1*ULTIMATE.start_main_~length~0 Supporting invariants [] [2020-10-20 06:42:41,739 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2020-10-20 06:42:41,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:42:41,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:42:41,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 06:42:41,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:42:41,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:42:41,860 INFO L263 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 06:42:41,861 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:42:41,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:42:41,901 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-10-20 06:42:41,903 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states. Second operand 3 states. [2020-10-20 06:42:41,984 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states.. Second operand 3 states. Result 43 states and 60 transitions. Complement of second has 7 states. [2020-10-20 06:42:41,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-20 06:42:41,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-20 06:42:41,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2020-10-20 06:42:41,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 5 letters. Loop has 4 letters. [2020-10-20 06:42:41,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:42:41,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 9 letters. Loop has 4 letters. [2020-10-20 06:42:41,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:42:41,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 5 letters. Loop has 8 letters. [2020-10-20 06:42:41,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:42:41,998 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 60 transitions. [2020-10-20 06:42:42,008 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-10-20 06:42:42,015 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 15 states and 20 transitions. [2020-10-20 06:42:42,017 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-10-20 06:42:42,018 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-10-20 06:42:42,019 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 20 transitions. [2020-10-20 06:42:42,019 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:42:42,020 INFO L691 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2020-10-20 06:42:42,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 20 transitions. [2020-10-20 06:42:42,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2020-10-20 06:42:42,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-10-20 06:42:42,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2020-10-20 06:42:42,060 INFO L714 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2020-10-20 06:42:42,060 INFO L594 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2020-10-20 06:42:42,060 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-20 06:42:42,061 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2020-10-20 06:42:42,064 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-10-20 06:42:42,064 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:42:42,064 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:42:42,065 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:42:42,065 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-20 06:42:42,066 INFO L794 eck$LassoCheckResult]: Stem: 136#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 134#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~nondet206, main_#t~malloc207.base, main_#t~malloc207.offset, main_#t~nondet209, main_#t~post208, main_#t~mem212, main_#t~post213, main_#t~mem211, main_#t~post210, main_~i~0, main_~j~0, main_~val~0, main_~limit~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~limit~0 := main_#t~nondet205;havoc main_#t~nondet205;main_~length~0 := main_#t~nondet206;havoc main_#t~nondet206; 135#L369 assume !(main_~length~0 < 1); 140#L369-2 call main_#t~malloc207.base, main_#t~malloc207.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc207.base, main_#t~malloc207.offset; 137#L371 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 138#L372-3 assume !(main_~i~0 < main_~length~0); 141#L372-4 main_~j~0 := 0; 130#L379-3 [2020-10-20 06:42:42,066 INFO L796 eck$LassoCheckResult]: Loop: 130#L379-3 assume !!(main_~j~0 < main_~length~0); 127#L380-3 call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 128#L380-1 assume !(main_#t~mem211 < main_~limit~0);havoc main_#t~mem211; 129#L379-2 main_#t~post210 := main_~j~0;main_~j~0 := 1 + main_#t~post210;havoc main_#t~post210; 130#L379-3 [2020-10-20 06:42:42,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:42:42,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815512, now seen corresponding path program 1 times [2020-10-20 06:42:42,067 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:42:42,068 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979664441] [2020-10-20 06:42:42,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:42:42,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:42:42,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:42:42,180 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979664441] [2020-10-20 06:42:42,181 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:42:42,181 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 06:42:42,182 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398082400] [2020-10-20 06:42:42,187 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 06:42:42,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:42:42,188 INFO L82 PathProgramCache]: Analyzing trace with hash 2252300, now seen corresponding path program 1 times [2020-10-20 06:42:42,188 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:42:42,190 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400032292] [2020-10-20 06:42:42,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:42:42,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:42:42,210 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:42:42,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:42:42,218 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:42:42,220 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:42:42,271 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:42:42,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 06:42:42,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-20 06:42:42,276 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. cyclomatic complexity: 7 Second operand 4 states. [2020-10-20 06:42:42,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:42:42,316 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2020-10-20 06:42:42,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 06:42:42,318 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2020-10-20 06:42:42,319 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-10-20 06:42:42,320 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 23 transitions. [2020-10-20 06:42:42,322 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-10-20 06:42:42,322 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-10-20 06:42:42,322 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 23 transitions. [2020-10-20 06:42:42,323 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:42:42,323 INFO L691 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2020-10-20 06:42:42,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 23 transitions. [2020-10-20 06:42:42,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 15. [2020-10-20 06:42:42,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-10-20 06:42:42,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2020-10-20 06:42:42,329 INFO L714 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2020-10-20 06:42:42,329 INFO L594 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2020-10-20 06:42:42,329 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-20 06:42:42,335 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2020-10-20 06:42:42,336 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-10-20 06:42:42,336 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:42:42,337 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:42:42,339 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:42:42,339 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-20 06:42:42,341 INFO L794 eck$LassoCheckResult]: Stem: 176#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 174#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~nondet206, main_#t~malloc207.base, main_#t~malloc207.offset, main_#t~nondet209, main_#t~post208, main_#t~mem212, main_#t~post213, main_#t~mem211, main_#t~post210, main_~i~0, main_~j~0, main_~val~0, main_~limit~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~limit~0 := main_#t~nondet205;havoc main_#t~nondet205;main_~length~0 := main_#t~nondet206;havoc main_#t~nondet206; 175#L369 assume !(main_~length~0 < 1); 180#L369-2 call main_#t~malloc207.base, main_#t~malloc207.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc207.base, main_#t~malloc207.offset; 177#L371 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 178#L372-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet209;havoc main_#t~nondet209; 171#L374 assume !(main_~val~0 > main_~limit~0); 172#L374-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 173#L372-2 main_#t~post208 := main_~i~0;main_~i~0 := 1 + main_#t~post208;havoc main_#t~post208; 179#L372-3 assume !(main_~i~0 < main_~length~0); 181#L372-4 main_~j~0 := 0; 170#L379-3 [2020-10-20 06:42:42,341 INFO L796 eck$LassoCheckResult]: Loop: 170#L379-3 assume !!(main_~j~0 < main_~length~0); 167#L380-3 call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 168#L380-1 assume !(main_#t~mem211 < main_~limit~0);havoc main_#t~mem211; 169#L379-2 main_#t~post210 := main_~j~0;main_~j~0 := 1 + main_#t~post210;havoc main_#t~post210; 170#L379-3 [2020-10-20 06:42:42,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:42:42,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1329979393, now seen corresponding path program 1 times [2020-10-20 06:42:42,342 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:42:42,343 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930265808] [2020-10-20 06:42:42,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:42:42,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:42:42,364 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:42:42,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:42:42,393 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:42:42,401 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:42:42,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:42:42,402 INFO L82 PathProgramCache]: Analyzing trace with hash 2252300, now seen corresponding path program 2 times [2020-10-20 06:42:42,403 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:42:42,403 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246860085] [2020-10-20 06:42:42,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:42:42,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:42:42,421 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:42:42,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:42:42,431 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:42:42,433 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:42:42,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:42:42,434 INFO L82 PathProgramCache]: Analyzing trace with hash -2035265782, now seen corresponding path program 1 times [2020-10-20 06:42:42,434 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:42:42,434 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229977750] [2020-10-20 06:42:42,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:42:42,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:42:42,465 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:42:42,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:42:42,487 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:42:42,497 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:42:42,705 WARN L193 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 65 [2020-10-20 06:42:42,758 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:42:42,758 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:42:42,758 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:42:42,758 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:42:42,759 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 06:42:42,759 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:42:42,759 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:42:42,759 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:42:42,759 INFO L133 ssoRankerPreferences]: Filename of dumped script: count_up_alloca.i_Iteration3_Lasso [2020-10-20 06:42:42,759 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:42:42,759 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:42:42,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:42,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:42,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:42,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:42,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:42,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:42,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:42,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:42,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:42,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-10-20 06:42:42,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:42,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:43,186 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:42:43,187 INFO L489 LassoAnalysis]: Using template 'affine'. 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) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:42:43,194 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-10-20 06:42:43,195 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:42:43,196 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:42:43,196 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:42:43,196 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:42:43,196 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:42:43,197 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:42:43,197 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:42:43,199 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 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-10-20 06:42:43,240 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-10-20 06:42:43,241 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:42:43,242 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:42:43,242 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:42:43,242 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:42:43,242 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:42:43,243 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:42:43,243 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:42:43,244 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-10-20 06:42:43,282 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-10-20 06:42:43,283 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:42:43,283 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:42:43,284 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:42:43,284 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:42:43,284 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:42:43,284 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:42:43,285 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:42:43,286 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) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:42:43,322 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:42:43,323 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:42:43,324 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:42:43,324 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:42:43,324 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:42:43,324 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:42:43,325 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:42:43,325 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:42:43,326 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-10-20 06:42:43,351 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-10-20 06:42:43,352 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:42:43,352 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:42:43,353 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:42:43,353 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:42:43,353 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:42:43,353 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:42:43,353 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:42:43,355 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 16 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:42:43,384 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-10-20 06:42:43,386 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:42:43,386 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:42:43,386 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:42:43,386 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:42:43,388 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:42:43,389 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:42:43,393 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 17 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 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:42:43,422 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:42:43,423 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:42:43,423 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:42:43,424 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:42:43,424 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:42:43,424 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:42:43,425 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:42:43,425 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:42:43,427 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 18 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:42:43,450 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-10-20 06:42:43,452 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:42:43,455 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:42:43,456 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:42:43,456 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:42:43,463 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:42:43,463 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:42:43,477 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 06:42:43,504 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2020-10-20 06:42:43,504 INFO L444 ModelExtractionUtils]: 14 out of 25 variables were initially zero. Simplification set additionally 7 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:42:43,512 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:42:43,515 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-20 06:42:43,515 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 06:42:43,516 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_~j~0, v_rep(select #length ULTIMATE.start_main_~arr~0.base)_2) = -1*ULTIMATE.start_main_~arr~0.offset - 4*ULTIMATE.start_main_~j~0 + 1*v_rep(select #length ULTIMATE.start_main_~arr~0.base)_2 Supporting invariants [] [2020-10-20 06:42:43,554 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2020-10-20 06:42:43,556 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-20 06:42:43,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:42:43,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:42:43,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 06:42:43,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:42:43,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:42:43,611 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 06:42:43,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:42:43,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:42:43,624 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-10-20 06:42:43,624 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 6 Second operand 4 states. [2020-10-20 06:42:43,646 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 6. Second operand 4 states. Result 21 states and 27 transitions. Complement of second has 6 states. [2020-10-20 06:42:43,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-20 06:42:43,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-20 06:42:43,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2020-10-20 06:42:43,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 11 letters. Loop has 4 letters. [2020-10-20 06:42:43,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:42:43,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 15 letters. Loop has 4 letters. [2020-10-20 06:42:43,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:42:43,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 11 letters. Loop has 8 letters. [2020-10-20 06:42:43,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:42:43,649 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 27 transitions. [2020-10-20 06:42:43,649 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-20 06:42:43,650 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 20 states and 26 transitions. [2020-10-20 06:42:43,650 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-10-20 06:42:43,651 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-10-20 06:42:43,651 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 26 transitions. [2020-10-20 06:42:43,651 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:42:43,651 INFO L691 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2020-10-20 06:42:43,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 26 transitions. [2020-10-20 06:42:43,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2020-10-20 06:42:43,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-10-20 06:42:43,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2020-10-20 06:42:43,654 INFO L714 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2020-10-20 06:42:43,654 INFO L594 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2020-10-20 06:42:43,654 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-20 06:42:43,654 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 24 transitions. [2020-10-20 06:42:43,655 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-20 06:42:43,655 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:42:43,655 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:42:43,656 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:42:43,656 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-20 06:42:43,656 INFO L794 eck$LassoCheckResult]: Stem: 297#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 293#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~nondet206, main_#t~malloc207.base, main_#t~malloc207.offset, main_#t~nondet209, main_#t~post208, main_#t~mem212, main_#t~post213, main_#t~mem211, main_#t~post210, main_~i~0, main_~j~0, main_~val~0, main_~limit~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~limit~0 := main_#t~nondet205;havoc main_#t~nondet205;main_~length~0 := main_#t~nondet206;havoc main_#t~nondet206; 294#L369 assume !(main_~length~0 < 1); 300#L369-2 call main_#t~malloc207.base, main_#t~malloc207.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc207.base, main_#t~malloc207.offset; 295#L371 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 296#L372-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet209;havoc main_#t~nondet209; 290#L374 assume !(main_~val~0 > main_~limit~0); 291#L374-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 292#L372-2 main_#t~post208 := main_~i~0;main_~i~0 := 1 + main_#t~post208;havoc main_#t~post208; 298#L372-3 assume !(main_~i~0 < main_~length~0); 299#L372-4 main_~j~0 := 0; 289#L379-3 assume !!(main_~j~0 < main_~length~0); 283#L380-3 [2020-10-20 06:42:43,656 INFO L796 eck$LassoCheckResult]: Loop: 283#L380-3 call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 284#L380-1 assume !!(main_#t~mem211 < main_~limit~0);havoc main_#t~mem211;call main_#t~mem212 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_#t~post213 := main_#t~mem212;call write~int(1 + main_#t~post213, main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);havoc main_#t~post213;havoc main_#t~mem212; 283#L380-3 [2020-10-20 06:42:43,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:42:43,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1720311820, now seen corresponding path program 1 times [2020-10-20 06:42:43,657 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:42:43,658 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829920538] [2020-10-20 06:42:43,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:42:43,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:42:43,668 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:42:43,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:42:43,676 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:42:43,680 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:42:43,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:42:43,681 INFO L82 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 1 times [2020-10-20 06:42:43,681 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:42:43,682 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137311701] [2020-10-20 06:42:43,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:42:43,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:42:43,687 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:42:43,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:42:43,690 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:42:43,692 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:42:43,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:42:43,693 INFO L82 PathProgramCache]: Analyzing trace with hash -342748399, now seen corresponding path program 1 times [2020-10-20 06:42:43,693 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:42:43,693 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386511304] [2020-10-20 06:42:43,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:42:43,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:42:43,705 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:42:43,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:42:43,715 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:42:43,719 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:42:43,895 WARN L193 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 65 [2020-10-20 06:42:43,944 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:42:43,944 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:42:43,944 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:42:43,945 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:42:43,945 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 06:42:43,945 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:42:43,945 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:42:43,945 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:42:43,945 INFO L133 ssoRankerPreferences]: Filename of dumped script: count_up_alloca.i_Iteration4_Lasso [2020-10-20 06:42:43,946 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:42:43,946 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:42:43,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:43,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-10-20 06:42:43,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:44,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:44,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:44,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:44,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:44,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:44,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:44,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:44,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:44,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:44,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:44,420 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:42:44,420 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:42:44,440 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:42:44,441 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:42:44,442 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:42:44,442 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:42:44,442 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:42:44,442 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:42:44,443 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:42:44,443 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:42:44,448 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 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:42:44,480 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:42:44,483 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:42:44,483 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:42:44,483 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:42:44,483 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:42:44,485 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:42:44,486 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:42:44,489 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:42:44,526 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-10-20 06:42:44,528 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:42:44,528 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:42:44,528 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:42:44,528 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:42:44,533 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:42:44,534 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:42:44,544 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 06:42:44,571 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2020-10-20 06:42:44,572 INFO L444 ModelExtractionUtils]: 3 out of 16 variables were initially zero. Simplification set additionally 10 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:42:44,575 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:42:44,578 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-20 06:42:44,578 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 06:42:44,578 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~limit~0, v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) (+ ULTIMATE.start_main_~arr~0.offset (* ULTIMATE.start_main_~i~0 4) (- 4)))_1) = 1*ULTIMATE.start_main_~limit~0 - 1*v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) (+ ULTIMATE.start_main_~arr~0.offset (* ULTIMATE.start_main_~i~0 4) (- 4)))_1 Supporting invariants [] [2020-10-20 06:42:44,624 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2020-10-20 06:42:44,627 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-20 06:42:44,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:42:44,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:42:44,666 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-20 06:42:44,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:42:44,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:42:44,727 INFO L263 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-20 06:42:44,727 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:42:44,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:42:44,772 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2020-10-20 06:42:44,772 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 9 Second operand 6 states. [2020-10-20 06:42:44,877 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 9. Second operand 6 states. Result 39 states and 51 transitions. Complement of second has 11 states. [2020-10-20 06:42:44,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 4 stem states 2 non-accepting loop states 2 accepting loop states [2020-10-20 06:42:44,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-20 06:42:44,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 30 transitions. [2020-10-20 06:42:44,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 30 transitions. Stem has 12 letters. Loop has 2 letters. [2020-10-20 06:42:44,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:42:44,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 30 transitions. Stem has 14 letters. Loop has 2 letters. [2020-10-20 06:42:44,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:42:44,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 30 transitions. Stem has 12 letters. Loop has 4 letters. [2020-10-20 06:42:44,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:42:44,881 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 51 transitions. [2020-10-20 06:42:44,882 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-20 06:42:44,883 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 34 states and 44 transitions. [2020-10-20 06:42:44,883 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-10-20 06:42:44,883 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2020-10-20 06:42:44,883 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 44 transitions. [2020-10-20 06:42:44,884 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:42:44,884 INFO L691 BuchiCegarLoop]: Abstraction has 34 states and 44 transitions. [2020-10-20 06:42:44,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 44 transitions. [2020-10-20 06:42:44,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 27. [2020-10-20 06:42:44,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-10-20 06:42:44,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2020-10-20 06:42:44,887 INFO L714 BuchiCegarLoop]: Abstraction has 27 states and 36 transitions. [2020-10-20 06:42:44,887 INFO L594 BuchiCegarLoop]: Abstraction has 27 states and 36 transitions. [2020-10-20 06:42:44,887 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-20 06:42:44,887 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 36 transitions. [2020-10-20 06:42:44,888 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-20 06:42:44,888 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:42:44,888 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:42:44,889 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:42:44,889 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-20 06:42:44,889 INFO L794 eck$LassoCheckResult]: Stem: 454#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 452#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~nondet206, main_#t~malloc207.base, main_#t~malloc207.offset, main_#t~nondet209, main_#t~post208, main_#t~mem212, main_#t~post213, main_#t~mem211, main_#t~post210, main_~i~0, main_~j~0, main_~val~0, main_~limit~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~limit~0 := main_#t~nondet205;havoc main_#t~nondet205;main_~length~0 := main_#t~nondet206;havoc main_#t~nondet206; 453#L369 assume !(main_~length~0 < 1); 461#L369-2 call main_#t~malloc207.base, main_#t~malloc207.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc207.base, main_#t~malloc207.offset; 455#L371 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 456#L372-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet209;havoc main_#t~nondet209; 459#L374 assume !(main_~val~0 > main_~limit~0); 466#L374-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 457#L372-2 main_#t~post208 := main_~i~0;main_~i~0 := 1 + main_#t~post208;havoc main_#t~post208; 458#L372-3 assume !(main_~i~0 < main_~length~0); 460#L372-4 main_~j~0 := 0; 447#L379-3 assume !!(main_~j~0 < main_~length~0); 448#L380-3 call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 467#L380-1 assume !(main_#t~mem211 < main_~limit~0);havoc main_#t~mem211; 445#L379-2 main_#t~post210 := main_~j~0;main_~j~0 := 1 + main_#t~post210;havoc main_#t~post210; 446#L379-3 assume !!(main_~j~0 < main_~length~0); 441#L380-3 [2020-10-20 06:42:44,889 INFO L796 eck$LassoCheckResult]: Loop: 441#L380-3 call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 442#L380-1 assume !!(main_#t~mem211 < main_~limit~0);havoc main_#t~mem211;call main_#t~mem212 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_#t~post213 := main_#t~mem212;call write~int(1 + main_#t~post213, main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);havoc main_#t~post213;havoc main_#t~mem212; 441#L380-3 [2020-10-20 06:42:44,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:42:44,890 INFO L82 PathProgramCache]: Analyzing trace with hash 1331270241, now seen corresponding path program 2 times [2020-10-20 06:42:44,890 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:42:44,890 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513717684] [2020-10-20 06:42:44,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:42:44,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:42:44,937 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:42:44,937 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513717684] [2020-10-20 06:42:44,937 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1607964289] [2020-10-20 06:42:44,938 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:42:44,991 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-20 06:42:44,991 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 06:42:44,992 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-20 06:42:44,993 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:42:45,043 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:42:45,043 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:42:45,044 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2020-10-20 06:42:45,044 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763119086] [2020-10-20 06:42:45,044 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 06:42:45,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:42:45,045 INFO L82 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 2 times [2020-10-20 06:42:45,045 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:42:45,045 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152773504] [2020-10-20 06:42:45,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:42:45,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:42:45,050 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:42:45,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:42:45,054 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:42:45,055 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:42:45,080 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:42:45,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-20 06:42:45,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-10-20 06:42:45,081 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. cyclomatic complexity: 13 Second operand 10 states. [2020-10-20 06:42:45,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:42:45,224 INFO L93 Difference]: Finished difference Result 49 states and 64 transitions. [2020-10-20 06:42:45,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-20 06:42:45,225 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 64 transitions. [2020-10-20 06:42:45,228 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-10-20 06:42:45,228 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 40 states and 51 transitions. [2020-10-20 06:42:45,229 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-10-20 06:42:45,229 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-10-20 06:42:45,229 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 51 transitions. [2020-10-20 06:42:45,229 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:42:45,229 INFO L691 BuchiCegarLoop]: Abstraction has 40 states and 51 transitions. [2020-10-20 06:42:45,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 51 transitions. [2020-10-20 06:42:45,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 35. [2020-10-20 06:42:45,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-10-20 06:42:45,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions. [2020-10-20 06:42:45,232 INFO L714 BuchiCegarLoop]: Abstraction has 35 states and 45 transitions. [2020-10-20 06:42:45,233 INFO L594 BuchiCegarLoop]: Abstraction has 35 states and 45 transitions. [2020-10-20 06:42:45,233 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-20 06:42:45,233 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 45 transitions. [2020-10-20 06:42:45,234 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-20 06:42:45,234 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:42:45,234 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:42:45,236 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:42:45,236 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-20 06:42:45,237 INFO L794 eck$LassoCheckResult]: Stem: 597#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 594#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~nondet206, main_#t~malloc207.base, main_#t~malloc207.offset, main_#t~nondet209, main_#t~post208, main_#t~mem212, main_#t~post213, main_#t~mem211, main_#t~post210, main_~i~0, main_~j~0, main_~val~0, main_~limit~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~limit~0 := main_#t~nondet205;havoc main_#t~nondet205;main_~length~0 := main_#t~nondet206;havoc main_#t~nondet206; 595#L369 assume main_~length~0 < 1;main_~length~0 := 1; 602#L369-2 call main_#t~malloc207.base, main_#t~malloc207.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc207.base, main_#t~malloc207.offset; 598#L371 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 599#L372-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet209;havoc main_#t~nondet209; 617#L374 assume !(main_~val~0 > main_~limit~0); 616#L374-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 615#L372-2 main_#t~post208 := main_~i~0;main_~i~0 := 1 + main_#t~post208;havoc main_#t~post208; 614#L372-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet209;havoc main_#t~nondet209; 611#L374 assume !(main_~val~0 > main_~limit~0); 613#L374-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 612#L372-2 main_#t~post208 := main_~i~0;main_~i~0 := 1 + main_#t~post208;havoc main_#t~post208; 610#L372-3 assume !(main_~i~0 < main_~length~0); 606#L372-4 main_~j~0 := 0; 591#L379-3 assume !!(main_~j~0 < main_~length~0); 585#L380-3 [2020-10-20 06:42:45,237 INFO L796 eck$LassoCheckResult]: Loop: 585#L380-3 call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 586#L380-1 assume !!(main_#t~mem211 < main_~limit~0);havoc main_#t~mem211;call main_#t~mem212 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_#t~post213 := main_#t~mem212;call write~int(1 + main_#t~post213, main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);havoc main_#t~post213;havoc main_#t~mem212; 585#L380-3 [2020-10-20 06:42:45,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:42:45,237 INFO L82 PathProgramCache]: Analyzing trace with hash -420071865, now seen corresponding path program 1 times [2020-10-20 06:42:45,237 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:42:45,238 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425557380] [2020-10-20 06:42:45,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:42:45,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:42:45,267 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:42:45,268 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425557380] [2020-10-20 06:42:45,268 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [492588141] [2020-10-20 06:42:45,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:42:45,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:42:45,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 06:42:45,301 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:42:45,340 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:42:45,341 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-10-20 06:42:45,341 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2020-10-20 06:42:45,341 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764813488] [2020-10-20 06:42:45,342 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 06:42:45,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:42:45,342 INFO L82 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 3 times [2020-10-20 06:42:45,342 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:42:45,343 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575315900] [2020-10-20 06:42:45,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:42:45,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:42:45,348 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:42:45,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:42:45,352 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:42:45,353 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:42:45,377 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:42:45,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 06:42:45,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-20 06:42:45,378 INFO L87 Difference]: Start difference. First operand 35 states and 45 transitions. cyclomatic complexity: 14 Second operand 5 states. [2020-10-20 06:42:45,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:42:45,405 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2020-10-20 06:42:45,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 06:42:45,406 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 36 transitions. [2020-10-20 06:42:45,408 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-20 06:42:45,409 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 22 states and 28 transitions. [2020-10-20 06:42:45,409 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-10-20 06:42:45,410 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-10-20 06:42:45,410 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 28 transitions. [2020-10-20 06:42:45,410 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:42:45,410 INFO L691 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2020-10-20 06:42:45,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 28 transitions. [2020-10-20 06:42:45,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2020-10-20 06:42:45,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-10-20 06:42:45,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2020-10-20 06:42:45,413 INFO L714 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2020-10-20 06:42:45,413 INFO L594 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2020-10-20 06:42:45,413 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-10-20 06:42:45,413 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 28 transitions. [2020-10-20 06:42:45,414 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-20 06:42:45,414 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:42:45,414 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:42:45,415 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:42:45,415 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-20 06:42:45,415 INFO L794 eck$LassoCheckResult]: Stem: 716#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 713#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~nondet206, main_#t~malloc207.base, main_#t~malloc207.offset, main_#t~nondet209, main_#t~post208, main_#t~mem212, main_#t~post213, main_#t~mem211, main_#t~post210, main_~i~0, main_~j~0, main_~val~0, main_~limit~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~limit~0 := main_#t~nondet205;havoc main_#t~nondet205;main_~length~0 := main_#t~nondet206;havoc main_#t~nondet206; 714#L369 assume !(main_~length~0 < 1); 720#L369-2 call main_#t~malloc207.base, main_#t~malloc207.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc207.base, main_#t~malloc207.offset; 717#L371 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 718#L372-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet209;havoc main_#t~nondet209; 721#L374 assume !(main_~val~0 > main_~limit~0); 725#L374-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 724#L372-2 main_#t~post208 := main_~i~0;main_~i~0 := 1 + main_#t~post208;havoc main_#t~post208; 722#L372-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet209;havoc main_#t~nondet209; 711#L374 assume !(main_~val~0 > main_~limit~0); 712#L374-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 715#L372-2 main_#t~post208 := main_~i~0;main_~i~0 := 1 + main_#t~post208;havoc main_#t~post208; 719#L372-3 assume !(main_~i~0 < main_~length~0); 723#L372-4 main_~j~0 := 0; 710#L379-3 assume !!(main_~j~0 < main_~length~0); 704#L380-3 [2020-10-20 06:42:45,415 INFO L796 eck$LassoCheckResult]: Loop: 704#L380-3 call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 705#L380-1 assume !!(main_#t~mem211 < main_~limit~0);havoc main_#t~mem211;call main_#t~mem212 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_#t~post213 := main_#t~mem212;call write~int(1 + main_#t~post213, main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);havoc main_#t~post213;havoc main_#t~mem212; 704#L380-3 [2020-10-20 06:42:45,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:42:45,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1431189115, now seen corresponding path program 2 times [2020-10-20 06:42:45,416 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:42:45,416 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846920360] [2020-10-20 06:42:45,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:42:45,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:42:45,432 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:42:45,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:42:45,441 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:42:45,445 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:42:45,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:42:45,446 INFO L82 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 4 times [2020-10-20 06:42:45,446 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:42:45,446 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420817821] [2020-10-20 06:42:45,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:42:45,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:42:45,456 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:42:45,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:42:45,462 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:42:45,464 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:42:45,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:42:45,465 INFO L82 PathProgramCache]: Analyzing trace with hash -983203254, now seen corresponding path program 2 times [2020-10-20 06:42:45,465 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:42:45,466 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790997985] [2020-10-20 06:42:45,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:42:45,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:42:45,498 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:42:45,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:42:45,522 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:42:45,531 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:42:45,761 WARN L193 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 79 [2020-10-20 06:42:45,847 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:42:45,848 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:42:45,848 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:42:45,848 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:42:45,848 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 06:42:45,848 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:42:45,848 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:42:45,848 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:42:45,849 INFO L133 ssoRankerPreferences]: Filename of dumped script: count_up_alloca.i_Iteration7_Lasso [2020-10-20 06:42:45,849 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:42:45,849 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:42:45,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:45,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:45,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:45,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:45,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:45,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:45,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:45,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:45,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:45,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:46,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:46,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:46,231 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:42:46,231 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:42:46,236 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:42:46,238 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:42:46,238 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:42:46,238 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:42:46,238 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:42:46,244 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:42:46,244 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:42:46,252 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 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:42:46,274 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-10-20 06:42:46,276 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:42:46,276 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:42:46,276 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:42:46,277 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:42:46,280 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:42:46,280 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:42:46,286 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 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:42:46,316 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-10-20 06:42:46,317 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:42:46,318 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:42:46,318 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:42:46,318 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:42:46,321 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:42:46,321 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:42:46,329 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 06:42:46,335 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-10-20 06:42:46,335 INFO L444 ModelExtractionUtils]: 7 out of 13 variables were initially zero. Simplification set additionally 3 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:42:46,339 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:42:46,342 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-20 06:42:46,342 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 06:42:46,342 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~limit~0, v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) (+ (* ULTIMATE.start_main_~j~0 4) ULTIMATE.start_main_~arr~0.offset))_3) = 1*ULTIMATE.start_main_~limit~0 - 1*v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) (+ (* ULTIMATE.start_main_~j~0 4) ULTIMATE.start_main_~arr~0.offset))_3 Supporting invariants [] [2020-10-20 06:42:46,367 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2020-10-20 06:42:46,368 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-20 06:42:46,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:42:46,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:42:46,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 06:42:46,396 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:42:46,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:42:46,407 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-20 06:42:46,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:42:46,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:42:46,420 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-10-20 06:42:46,420 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 28 transitions. cyclomatic complexity: 9 Second operand 3 states. [2020-10-20 06:42:46,438 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 28 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 31 states and 39 transitions. Complement of second has 7 states. [2020-10-20 06:42:46,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-20 06:42:46,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-20 06:42:46,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2020-10-20 06:42:46,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 16 letters. Loop has 2 letters. [2020-10-20 06:42:46,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:42:46,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 18 letters. Loop has 2 letters. [2020-10-20 06:42:46,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:42:46,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 16 letters. Loop has 4 letters. [2020-10-20 06:42:46,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:42:46,442 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 39 transitions. [2020-10-20 06:42:46,443 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-20 06:42:46,443 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 26 states and 32 transitions. [2020-10-20 06:42:46,443 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-10-20 06:42:46,444 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-10-20 06:42:46,444 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 32 transitions. [2020-10-20 06:42:46,444 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:42:46,444 INFO L691 BuchiCegarLoop]: Abstraction has 26 states and 32 transitions. [2020-10-20 06:42:46,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 32 transitions. [2020-10-20 06:42:46,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2020-10-20 06:42:46,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-10-20 06:42:46,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2020-10-20 06:42:46,447 INFO L714 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2020-10-20 06:42:46,447 INFO L594 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2020-10-20 06:42:46,447 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-10-20 06:42:46,448 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 31 transitions. [2020-10-20 06:42:46,448 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-20 06:42:46,448 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:42:46,448 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:42:46,449 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:42:46,449 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-20 06:42:46,449 INFO L794 eck$LassoCheckResult]: Stem: 860#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 857#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~nondet206, main_#t~malloc207.base, main_#t~malloc207.offset, main_#t~nondet209, main_#t~post208, main_#t~mem212, main_#t~post213, main_#t~mem211, main_#t~post210, main_~i~0, main_~j~0, main_~val~0, main_~limit~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~limit~0 := main_#t~nondet205;havoc main_#t~nondet205;main_~length~0 := main_#t~nondet206;havoc main_#t~nondet206; 858#L369 assume !(main_~length~0 < 1); 864#L369-2 call main_#t~malloc207.base, main_#t~malloc207.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc207.base, main_#t~malloc207.offset; 861#L371 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 862#L372-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet209;havoc main_#t~nondet209; 855#L374 assume !(main_~val~0 > main_~limit~0); 856#L374-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 859#L372-2 main_#t~post208 := main_~i~0;main_~i~0 := 1 + main_#t~post208;havoc main_#t~post208; 863#L372-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet209;havoc main_#t~nondet209; 865#L374 assume !(main_~val~0 > main_~limit~0); 870#L374-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 869#L372-2 main_#t~post208 := main_~i~0;main_~i~0 := 1 + main_#t~post208;havoc main_#t~post208; 868#L372-3 assume !(main_~i~0 < main_~length~0); 867#L372-4 main_~j~0 := 0; 853#L379-3 assume !!(main_~j~0 < main_~length~0); 854#L380-3 call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 871#L380-1 assume !(main_#t~mem211 < main_~limit~0);havoc main_#t~mem211; 847#L379-2 main_#t~post210 := main_~j~0;main_~j~0 := 1 + main_#t~post210;havoc main_#t~post210; 848#L379-3 assume !!(main_~j~0 < main_~length~0); 849#L380-3 [2020-10-20 06:42:46,450 INFO L796 eck$LassoCheckResult]: Loop: 849#L380-3 call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 850#L380-1 assume !!(main_#t~mem211 < main_~limit~0);havoc main_#t~mem211;call main_#t~mem212 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_#t~post213 := main_#t~mem212;call write~int(1 + main_#t~post213, main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);havoc main_#t~post213;havoc main_#t~mem212; 849#L380-3 [2020-10-20 06:42:46,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:42:46,450 INFO L82 PathProgramCache]: Analyzing trace with hash 34477914, now seen corresponding path program 3 times [2020-10-20 06:42:46,450 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:42:46,451 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716039016] [2020-10-20 06:42:46,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:42:46,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:42:46,462 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:42:46,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:42:46,480 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:42:46,490 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:42:46,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:42:46,490 INFO L82 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 5 times [2020-10-20 06:42:46,490 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:42:46,491 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021971756] [2020-10-20 06:42:46,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:42:46,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:42:46,496 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:42:46,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:42:46,503 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:42:46,505 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:42:46,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:42:46,506 INFO L82 PathProgramCache]: Analyzing trace with hash -1226461473, now seen corresponding path program 1 times [2020-10-20 06:42:46,506 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:42:46,507 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358241775] [2020-10-20 06:42:46,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:42:46,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:42:46,539 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:42:46,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:42:46,561 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:42:46,572 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:42:46,892 WARN L193 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 92 [2020-10-20 06:42:46,985 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:42:46,986 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:42:46,986 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:42:46,986 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:42:46,986 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 06:42:46,986 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:42:46,987 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:42:46,987 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:42:46,987 INFO L133 ssoRankerPreferences]: Filename of dumped script: count_up_alloca.i_Iteration8_Lasso [2020-10-20 06:42:46,987 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:42:46,987 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:42:46,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:46,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:46,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:46,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:47,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:47,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:47,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:47,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:47,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:47,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:47,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:47,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:47,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:47,368 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:42:47,368 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 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 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:42:47,372 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-10-20 06:42:47,373 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:42:47,373 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:42:47,374 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:42:47,374 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:42:47,374 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:42:47,374 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:42:47,374 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:42:47,375 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 31 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 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:42:47,399 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-10-20 06:42:47,400 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:42:47,400 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:42:47,400 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:42:47,400 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:42:47,401 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:42:47,401 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:42:47,401 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:42:47,402 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 32 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 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:42:47,427 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:42:47,428 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:42:47,429 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:42:47,429 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:42:47,429 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:42:47,429 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:42:47,429 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:42:47,429 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:42:47,431 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 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:42:47,454 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:42:47,455 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:42:47,456 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:42:47,456 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:42:47,456 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:42:47,457 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:42:47,457 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:42:47,461 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 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:42:47,485 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-10-20 06:42:47,487 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:42:47,487 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:42:47,487 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:42:47,488 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:42:47,489 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:42:47,489 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:42:47,492 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 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:42:47,523 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-10-20 06:42:47,526 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:42:47,526 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:42:47,526 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:42:47,526 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:42:47,531 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:42:47,531 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:42:47,550 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. Waiting until toolchain timeout for monitored process 35 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 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:42:47,584 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-10-20 06:42:47,586 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:42:47,586 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:42:47,586 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:42:47,587 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:42:47,591 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:42:47,592 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:42:47,600 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 06:42:47,618 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2020-10-20 06:42:47,618 INFO L444 ModelExtractionUtils]: 10 out of 16 variables were initially zero. Simplification set additionally 3 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:42:47,621 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:42:47,624 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-20 06:42:47,624 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 06:42:47,624 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~limit~0, v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) (+ (* ULTIMATE.start_main_~j~0 4) ULTIMATE.start_main_~arr~0.offset))_4) = 1*ULTIMATE.start_main_~limit~0 - 1*v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) (+ (* ULTIMATE.start_main_~j~0 4) ULTIMATE.start_main_~arr~0.offset))_4 Supporting invariants [] [2020-10-20 06:42:47,655 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2020-10-20 06:42:47,657 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-20 06:42:47,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:42:47,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:42:47,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 06:42:47,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:42:47,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:42:47,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-20 06:42:47,697 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:42:47,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:42:47,713 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-10-20 06:42:47,713 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10 Second operand 3 states. [2020-10-20 06:42:47,736 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 29 states and 35 transitions. Complement of second has 7 states. [2020-10-20 06:42:47,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-20 06:42:47,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-20 06:42:47,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2020-10-20 06:42:47,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 20 letters. Loop has 2 letters. [2020-10-20 06:42:47,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:42:47,738 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-10-20 06:42:47,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:42:47,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:42:47,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 06:42:47,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:42:47,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:42:47,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-20 06:42:47,778 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:42:47,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:42:47,790 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2020-10-20 06:42:47,790 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10 Second operand 3 states. [2020-10-20 06:42:47,810 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 29 states and 35 transitions. Complement of second has 7 states. [2020-10-20 06:42:47,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-20 06:42:47,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-20 06:42:47,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2020-10-20 06:42:47,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 20 letters. Loop has 2 letters. [2020-10-20 06:42:47,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:42:47,812 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-10-20 06:42:47,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:42:47,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:42:47,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 06:42:47,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:42:47,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:42:47,880 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-20 06:42:47,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:42:47,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:42:47,893 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-10-20 06:42:47,893 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10 Second operand 3 states. [2020-10-20 06:42:47,913 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 31 states and 39 transitions. Complement of second has 6 states. [2020-10-20 06:42:47,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-20 06:42:47,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-20 06:42:47,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2020-10-20 06:42:47,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 20 letters. Loop has 2 letters. [2020-10-20 06:42:47,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:42:47,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 22 letters. Loop has 2 letters. [2020-10-20 06:42:47,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:42:47,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 20 letters. Loop has 4 letters. [2020-10-20 06:42:47,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:42:47,920 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 39 transitions. [2020-10-20 06:42:47,921 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-20 06:42:47,921 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 0 states and 0 transitions. [2020-10-20 06:42:47,921 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-10-20 06:42:47,921 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-10-20 06:42:47,922 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-10-20 06:42:47,922 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:42:47,922 INFO L691 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 06:42:47,922 INFO L714 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 06:42:47,922 INFO L594 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 06:42:47,922 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-10-20 06:42:47,922 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-10-20 06:42:47,922 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-20 06:42:47,922 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-10-20 06:42:47,928 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 20.10 06:42:47 BoogieIcfgContainer [2020-10-20 06:42:47,928 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-20 06:42:47,929 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 06:42:47,929 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 06:42:47,929 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 06:42:47,929 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 06:42:40" (3/4) ... [2020-10-20 06:42:47,932 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-20 06:42:47,932 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 06:42:47,933 INFO L168 Benchmark]: Toolchain (without parser) took 8865.34 ms. Allocated memory was 39.3 MB in the beginning and 85.5 MB in the end (delta: 46.1 MB). Free memory was 16.5 MB in the beginning and 50.3 MB in the end (delta: -33.8 MB). Peak memory consumption was 12.3 MB. Max. memory is 14.3 GB. [2020-10-20 06:42:47,934 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 30.9 MB. Free memory was 7.2 MB in the beginning and 7.1 MB in the end (delta: 43.7 kB). Peak memory consumption was 43.7 kB. Max. memory is 14.3 GB. [2020-10-20 06:42:47,935 INFO L168 Benchmark]: CACSL2BoogieTranslator took 597.34 ms. Allocated memory was 39.3 MB in the beginning and 41.4 MB in the end (delta: 2.1 MB). Free memory was 15.7 MB in the beginning and 15.9 MB in the end (delta: -226.9 kB). Peak memory consumption was 7.6 MB. Max. memory is 14.3 GB. [2020-10-20 06:42:47,936 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.46 ms. Allocated memory is still 41.4 MB. Free memory was 15.9 MB in the beginning and 13.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 14.3 GB. [2020-10-20 06:42:47,936 INFO L168 Benchmark]: Boogie Preprocessor took 28.28 ms. Allocated memory is still 41.4 MB. Free memory was 13.9 MB in the beginning and 12.5 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 14.3 GB. [2020-10-20 06:42:47,937 INFO L168 Benchmark]: RCFGBuilder took 323.84 ms. Allocated memory was 41.4 MB in the beginning and 41.9 MB in the end (delta: 524.3 kB). Free memory was 12.5 MB in the beginning and 14.2 MB in the end (delta: -1.7 MB). Peak memory consumption was 3.4 MB. Max. memory is 14.3 GB. [2020-10-20 06:42:47,938 INFO L168 Benchmark]: BuchiAutomizer took 7854.49 ms. Allocated memory was 41.9 MB in the beginning and 85.5 MB in the end (delta: 43.5 MB). Free memory was 13.9 MB in the beginning and 50.3 MB in the end (delta: -36.4 MB). Peak memory consumption was 7.1 MB. Max. memory is 14.3 GB. [2020-10-20 06:42:47,938 INFO L168 Benchmark]: Witness Printer took 3.58 ms. Allocated memory is still 85.5 MB. Free memory is still 50.3 MB. There was no memory consumed. Max. memory is 14.3 GB. [2020-10-20 06:42:47,942 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31 ms. Allocated memory is still 30.9 MB. Free memory was 7.2 MB in the beginning and 7.1 MB in the end (delta: 43.7 kB). Peak memory consumption was 43.7 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 597.34 ms. Allocated memory was 39.3 MB in the beginning and 41.4 MB in the end (delta: 2.1 MB). Free memory was 15.7 MB in the beginning and 15.9 MB in the end (delta: -226.9 kB). Peak memory consumption was 7.6 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 46.46 ms. Allocated memory is still 41.4 MB. Free memory was 15.9 MB in the beginning and 13.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 28.28 ms. Allocated memory is still 41.4 MB. Free memory was 13.9 MB in the beginning and 12.5 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 14.3 GB. * RCFGBuilder took 323.84 ms. Allocated memory was 41.4 MB in the beginning and 41.9 MB in the end (delta: 524.3 kB). Free memory was 12.5 MB in the beginning and 14.2 MB in the end (delta: -1.7 MB). Peak memory consumption was 3.4 MB. Max. memory is 14.3 GB. * BuchiAutomizer took 7854.49 ms. Allocated memory was 41.9 MB in the beginning and 85.5 MB in the end (delta: 43.5 MB). Free memory was 13.9 MB in the beginning and 50.3 MB in the end (delta: -36.4 MB). Peak memory consumption was 7.1 MB. Max. memory is 14.3 GB. * Witness Printer took 3.58 ms. Allocated memory is still 85.5 MB. Free memory is still 50.3 MB. There was no memory consumed. Max. memory is 14.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 8 terminating modules (3 trivial, 4 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * i + length and consists of 5 locations. One deterministic module has affine ranking function -1 * arr + -4 * j + unknown-#length-unknown[arr] and consists of 4 locations. One deterministic module has affine ranking function limit + -1 * unknown-#memory_int-unknown[arr][arr + i * 4 + -4] and consists of 8 locations. One deterministic module has affine ranking function limit + -1 * unknown-#memory_int-unknown[arr][j * 4 + arr] and consists of 4 locations. One nondeterministic module has affine ranking function limit + -1 * unknown-#memory_int-unknown[arr][j * 4 + arr] and consists of 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.7s and 9 iterations. TraceHistogramMax:2. Analysis of lassos took 6.3s. Construction of modules took 0.2s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 18 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 35 states and ocurred in iteration 5. Nontrivial modules had stage [4, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 135 SDtfs, 191 SDslu, 112 SDs, 0 SdLazy, 205 SolverSat, 37 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU3 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital140 mio100 ax100 hnf97 lsp94 ukn77 mio100 lsp57 div100 bol100 ite100 ukn100 eq157 hnf89 smp84 dnf100 smp100 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 33ms 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...