./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/java_BubbleSort-alloca-2.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-memory-alloca/java_BubbleSort-alloca-2.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 af6d3df1a288680024c52d2d61adb02fdd276fce ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:40:07,204 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 06:40:07,207 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 06:40:07,230 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 06:40:07,230 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 06:40:07,231 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 06:40:07,233 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 06:40:07,234 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 06:40:07,236 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 06:40:07,237 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 06:40:07,238 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 06:40:07,239 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 06:40:07,239 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 06:40:07,242 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 06:40:07,243 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 06:40:07,244 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 06:40:07,245 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 06:40:07,246 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 06:40:07,247 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 06:40:07,249 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 06:40:07,250 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 06:40:07,258 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 06:40:07,260 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 06:40:07,261 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 06:40:07,263 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 06:40:07,263 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 06:40:07,264 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 06:40:07,265 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 06:40:07,265 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 06:40:07,266 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 06:40:07,266 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 06:40:07,267 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 06:40:07,268 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 06:40:07,268 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 06:40:07,269 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 06:40:07,270 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 06:40:07,270 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 06:40:07,270 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 06:40:07,271 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 06:40:07,272 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 06:40:07,272 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 06:40:07,273 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:40:07,298 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 06:40:07,298 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 06:40:07,300 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 06:40:07,300 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 06:40:07,300 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 06:40:07,300 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-20 06:40:07,301 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-20 06:40:07,301 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-20 06:40:07,301 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-20 06:40:07,301 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-20 06:40:07,301 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-20 06:40:07,302 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 06:40:07,302 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-20 06:40:07,302 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 06:40:07,302 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 06:40:07,303 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-20 06:40:07,303 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-20 06:40:07,303 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-20 06:40:07,303 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 06:40:07,304 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-20 06:40:07,304 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 06:40:07,304 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-20 06:40:07,304 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 06:40:07,305 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 06:40:07,305 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-20 06:40:07,305 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 06:40:07,305 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 06:40:07,306 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 06:40:07,306 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-20 06:40:07,307 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-20 06:40:07,307 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 -> af6d3df1a288680024c52d2d61adb02fdd276fce [2020-10-20 06:40:07,491 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 06:40:07,502 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 06:40:07,505 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 06:40:07,507 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 06:40:07,507 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 06:40:07,508 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/java_BubbleSort-alloca-2.i [2020-10-20 06:40:07,581 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/821502250/595bf5f140b146d0bfac0181fb3fa9c6/FLAGd8f17fcbb [2020-10-20 06:40:08,163 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 06:40:08,164 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/java_BubbleSort-alloca-2.i [2020-10-20 06:40:08,175 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/821502250/595bf5f140b146d0bfac0181fb3fa9c6/FLAGd8f17fcbb [2020-10-20 06:40:08,533 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/821502250/595bf5f140b146d0bfac0181fb3fa9c6 [2020-10-20 06:40:08,537 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 06:40:08,543 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 06:40:08,544 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 06:40:08,544 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 06:40:08,547 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 06:40:08,548 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 06:40:08" (1/1) ... [2020-10-20 06:40:08,551 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a46f932 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:40:08, skipping insertion in model container [2020-10-20 06:40:08,552 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 06:40:08" (1/1) ... [2020-10-20 06:40:08,559 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 06:40:08,615 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 06:40:08,883 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 06:40:08,893 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 06:40:08,937 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 06:40:08,999 INFO L208 MainTranslator]: Completed translation [2020-10-20 06:40:09,000 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:40:08 WrapperNode [2020-10-20 06:40:09,000 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 06:40:09,001 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 06:40:09,001 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 06:40:09,001 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 06:40:09,010 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:40:08" (1/1) ... [2020-10-20 06:40:09,025 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:40:08" (1/1) ... [2020-10-20 06:40:09,048 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 06:40:09,048 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 06:40:09,048 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 06:40:09,049 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 06:40:09,058 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:40:08" (1/1) ... [2020-10-20 06:40:09,058 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:40:08" (1/1) ... [2020-10-20 06:40:09,061 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:40:08" (1/1) ... [2020-10-20 06:40:09,062 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:40:08" (1/1) ... [2020-10-20 06:40:09,067 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:40:08" (1/1) ... [2020-10-20 06:40:09,072 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:40:08" (1/1) ... [2020-10-20 06:40:09,074 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:40:08" (1/1) ... [2020-10-20 06:40:09,076 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 06:40:09,077 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 06:40:09,077 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 06:40:09,077 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 06:40:09,078 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:40:08" (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:40:09,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-20 06:40:09,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-20 06:40:09,152 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 06:40:09,153 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-20 06:40:09,153 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 06:40:09,153 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 06:40:09,437 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 06:40:09,438 INFO L298 CfgBuilder]: Removed 8 assume(true) statements. [2020-10-20 06:40:09,439 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 06:40:09 BoogieIcfgContainer [2020-10-20 06:40:09,440 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 06:40:09,440 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-20 06:40:09,440 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-20 06:40:09,455 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-20 06:40:09,456 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 06:40:09,456 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.10 06:40:08" (1/3) ... [2020-10-20 06:40:09,457 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6d75e8b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 06:40:09, skipping insertion in model container [2020-10-20 06:40:09,457 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 06:40:09,458 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:40:08" (2/3) ... [2020-10-20 06:40:09,458 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6d75e8b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 06:40:09, skipping insertion in model container [2020-10-20 06:40:09,458 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 06:40:09,459 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 06:40:09" (3/3) ... [2020-10-20 06:40:09,460 INFO L373 chiAutomizerObserver]: Analyzing ICFG java_BubbleSort-alloca-2.i [2020-10-20 06:40:09,514 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-20 06:40:09,514 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-20 06:40:09,514 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-20 06:40:09,515 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 06:40:09,515 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 06:40:09,515 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-20 06:40:09,515 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 06:40:09,515 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-20 06:40:09,531 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2020-10-20 06:40:09,554 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-10-20 06:40:09,554 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:40:09,555 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:40:09,562 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-10-20 06:40:09,562 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-20 06:40:09,562 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-20 06:40:09,563 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2020-10-20 06:40:09,564 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-10-20 06:40:09,564 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:40:09,564 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:40:09,565 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-10-20 06:40:09,565 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-20 06:40:09,573 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 9#L-1true havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 5#L558true assume !(main_~array_size~0 < 1); 8#L558-2true call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;sort_#in~x.base, sort_#in~x.offset, sort_#in~n := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sort_#t~mem4, sort_#t~mem5, sort_#t~mem6, sort_#t~mem7, sort_~temp~0, sort_#t~post3, sort_#t~post2, sort_~x.base, sort_~x.offset, sort_~n, sort_~pass~0, sort_~i~0;sort_~x.base, sort_~x.offset := sort_#in~x.base, sort_#in~x.offset;sort_~n := sort_#in~n;havoc sort_~pass~0;havoc sort_~i~0;sort_~pass~0 := 1; 6#L550-3true [2020-10-20 06:40:09,574 INFO L796 eck$LassoCheckResult]: Loop: 6#L550-3true assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 3#L551-3true assume !true; 4#L550-2true sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 6#L550-3true [2020-10-20 06:40:09,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:40:09,580 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2020-10-20 06:40:09,587 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:40:09,587 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460181366] [2020-10-20 06:40:09,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:40:09,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:40:09,680 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:40:09,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:40:09,693 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:40:09,715 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:40:09,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:40:09,717 INFO L82 PathProgramCache]: Analyzing trace with hash 47218, now seen corresponding path program 1 times [2020-10-20 06:40:09,717 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:40:09,717 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230846943] [2020-10-20 06:40:09,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:40:09,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:40:09,749 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:40:09,750 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230846943] [2020-10-20 06:40:09,751 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:40:09,751 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 06:40:09,751 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478281360] [2020-10-20 06:40:09,757 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:40:09,758 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:40:09,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-20 06:40:09,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-20 06:40:09,776 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 2 states. [2020-10-20 06:40:09,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:40:09,781 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2020-10-20 06:40:09,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-20 06:40:09,783 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 16 transitions. [2020-10-20 06:40:09,784 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-10-20 06:40:09,788 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 9 states and 12 transitions. [2020-10-20 06:40:09,790 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2020-10-20 06:40:09,791 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2020-10-20 06:40:09,791 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 12 transitions. [2020-10-20 06:40:09,803 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:40:09,803 INFO L691 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2020-10-20 06:40:09,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 12 transitions. [2020-10-20 06:40:09,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2020-10-20 06:40:09,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-20 06:40:09,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 12 transitions. [2020-10-20 06:40:09,830 INFO L714 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2020-10-20 06:40:09,830 INFO L594 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2020-10-20 06:40:09,830 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-20 06:40:09,830 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 12 transitions. [2020-10-20 06:40:09,831 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-10-20 06:40:09,831 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:40:09,831 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:40:09,831 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-10-20 06:40:09,831 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-20 06:40:09,832 INFO L794 eck$LassoCheckResult]: Stem: 41#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 34#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 35#L558 assume !(main_~array_size~0 < 1); 40#L558-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;sort_#in~x.base, sort_#in~x.offset, sort_#in~n := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sort_#t~mem4, sort_#t~mem5, sort_#t~mem6, sort_#t~mem7, sort_~temp~0, sort_#t~post3, sort_#t~post2, sort_~x.base, sort_~x.offset, sort_~n, sort_~pass~0, sort_~i~0;sort_~x.base, sort_~x.offset := sort_#in~x.base, sort_#in~x.offset;sort_~n := sort_#in~n;havoc sort_~pass~0;havoc sort_~i~0;sort_~pass~0 := 1; 39#L550-3 [2020-10-20 06:40:09,832 INFO L796 eck$LassoCheckResult]: Loop: 39#L550-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 36#L551-3 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 37#L550-2 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 39#L550-3 [2020-10-20 06:40:09,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:40:09,832 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2020-10-20 06:40:09,833 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:40:09,833 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403137988] [2020-10-20 06:40:09,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:40:09,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:40:09,844 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:40:09,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:40:09,854 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:40:09,858 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:40:09,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:40:09,859 INFO L82 PathProgramCache]: Analyzing trace with hash 46877, now seen corresponding path program 1 times [2020-10-20 06:40:09,859 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:40:09,859 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537750376] [2020-10-20 06:40:09,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:40:09,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:40:09,902 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:40:09,902 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537750376] [2020-10-20 06:40:09,902 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:40:09,902 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 06:40:09,903 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148578807] [2020-10-20 06:40:09,903 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:40:09,904 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:40:09,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 06:40:09,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:40:09,904 INFO L87 Difference]: Start difference. First operand 9 states and 12 transitions. cyclomatic complexity: 4 Second operand 3 states. [2020-10-20 06:40:09,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:40:09,929 INFO L93 Difference]: Finished difference Result 10 states and 13 transitions. [2020-10-20 06:40:09,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 06:40:09,931 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 13 transitions. [2020-10-20 06:40:09,932 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-10-20 06:40:09,932 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 13 transitions. [2020-10-20 06:40:09,932 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-10-20 06:40:09,933 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-10-20 06:40:09,933 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2020-10-20 06:40:09,933 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:40:09,933 INFO L691 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2020-10-20 06:40:09,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2020-10-20 06:40:09,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2020-10-20 06:40:09,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-10-20 06:40:09,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2020-10-20 06:40:09,936 INFO L714 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2020-10-20 06:40:09,936 INFO L594 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2020-10-20 06:40:09,936 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-20 06:40:09,936 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2020-10-20 06:40:09,937 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-10-20 06:40:09,937 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:40:09,937 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:40:09,938 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-10-20 06:40:09,938 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-10-20 06:40:09,938 INFO L794 eck$LassoCheckResult]: Stem: 66#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 59#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 60#L558 assume !(main_~array_size~0 < 1); 65#L558-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;sort_#in~x.base, sort_#in~x.offset, sort_#in~n := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sort_#t~mem4, sort_#t~mem5, sort_#t~mem6, sort_#t~mem7, sort_~temp~0, sort_#t~post3, sort_#t~post2, sort_~x.base, sort_~x.offset, sort_~n, sort_~pass~0, sort_~i~0;sort_~x.base, sort_~x.offset := sort_#in~x.base, sort_#in~x.offset;sort_~n := sort_#in~n;havoc sort_~pass~0;havoc sort_~i~0;sort_~pass~0 := 1; 64#L550-3 [2020-10-20 06:40:09,939 INFO L796 eck$LassoCheckResult]: Loop: 64#L550-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 61#L551-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 62#L552 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem4;havoc sort_#t~mem5;call sort_#t~mem6 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);sort_~temp~0 := sort_#t~mem6;havoc sort_#t~mem6;call sort_#t~mem7 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4);call write~int(sort_#t~mem7, sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);havoc sort_#t~mem7;call write~int(sort_~temp~0, sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 67#L551-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 68#L551-3 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 63#L550-2 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 64#L550-3 [2020-10-20 06:40:09,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:40:09,939 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 3 times [2020-10-20 06:40:09,939 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:40:09,940 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378191758] [2020-10-20 06:40:09,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:40:09,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:40:09,950 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:40:09,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:40:09,958 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:40:09,961 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:40:09,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:40:09,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1398152922, now seen corresponding path program 1 times [2020-10-20 06:40:09,962 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:40:09,963 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126147432] [2020-10-20 06:40:09,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:40:09,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:40:09,991 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:40:10,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:40:10,007 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:40:10,011 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:40:10,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:40:10,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1893874754, now seen corresponding path program 1 times [2020-10-20 06:40:10,012 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:40:10,012 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481441367] [2020-10-20 06:40:10,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:40:10,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:40:10,044 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:40:10,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:40:10,079 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:40:10,091 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:40:10,217 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2020-10-20 06:40:10,417 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2020-10-20 06:40:10,487 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:40:10,488 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:40:10,488 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:40:10,488 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:40:10,488 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 06:40:10,489 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:40:10,489 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:40:10,489 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:40:10,489 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-2.i_Iteration3_Lasso [2020-10-20 06:40:10,490 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:40:10,490 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:40:10,515 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:40:10,522 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:40:10,525 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:40:10,528 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:40:10,533 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:40:10,537 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:40:10,541 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:40:10,724 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:40:10,728 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:40:10,732 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:40:10,735 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:40:10,738 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:40:10,741 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:40:10,744 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:40:11,091 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:40:11,097 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:40:11,103 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:40:11,106 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:40:11,106 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:40:11,107 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:40:11,107 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:40:11,107 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:40:11,110 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:40:11,110 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:40:11,119 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) [2020-10-20 06:40:11,168 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:40:11,170 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:40:11,170 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:40:11,170 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:40:11,170 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:40:11,171 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:40:11,174 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:40:11,175 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:40:11,182 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. Waiting until toolchain timeout for monitored process 3 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 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:40:11,217 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:40:11,219 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:40:11,219 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:40:11,219 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:40:11,219 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:40:11,219 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:40:11,220 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:40:11,220 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:40:11,231 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) [2020-10-20 06:40:11,272 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:40:11,273 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:40:11,274 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:40:11,274 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:40:11,274 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:40:11,277 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:40:11,278 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:40:11,282 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) [2020-10-20 06:40:11,326 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:40:11,328 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:40:11,328 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:40:11,328 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:40:11,328 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:40:11,328 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:40:11,329 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:40:11,329 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:40:11,332 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) [2020-10-20 06:40:11,377 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:40:11,379 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:40:11,380 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:40:11,380 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:40:11,380 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:40:11,380 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:40:11,381 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:40:11,381 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:40:11,384 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:40:11,424 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:40:11,426 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:40:11,427 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:40:11,427 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:40:11,427 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:40:11,427 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:40:11,428 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:40:11,428 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:40:11,430 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:40:11,468 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:40:11,470 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:40:11,470 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:40:11,470 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:40:11,470 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:40:11,476 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:40:11,477 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:40:11,485 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:40:11,515 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:40:11,517 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:40:11,517 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:40:11,517 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:40:11,517 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:40:11,524 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:40:11,524 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:40:11,537 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:40:11,578 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:40:11,580 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:40:11,580 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:40:11,580 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:40:11,580 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:40:11,580 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:40:11,581 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:40:11,581 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:40:11,583 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:40:11,619 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:40:11,622 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:40:11,622 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:40:11,622 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:40:11,622 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:40:11,638 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:40:11,639 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:40:11,658 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 06:40:11,848 INFO L443 ModelExtractionUtils]: Simplification made 21 calls to the SMT solver. [2020-10-20 06:40:11,848 INFO L444 ModelExtractionUtils]: 14 out of 37 variables were initially zero. Simplification set additionally 18 variables to zero. 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:40:11,856 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 06:40:11,860 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-10-20 06:40:11,861 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 06:40:11,861 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_sort_~x.base)_1, ULTIMATE.start_sort_~pass~0) = 1*v_rep(select #length ULTIMATE.start_sort_~x.base)_1 - 2*ULTIMATE.start_sort_~pass~0 Supporting invariants [-2*ULTIMATE.start_sort_~n + 1*v_rep(select #length ULTIMATE.start_sort_~x.base)_1 >= 0] [2020-10-20 06:40:11,912 INFO L297 tatePredicateManager]: 4 out of 5 supporting invariants were superfluous and have been removed [2020-10-20 06:40:11,924 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-20 06:40:11,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:40:11,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:40:11,976 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 12 conjunts are in the unsatisfiable core [2020-10-20 06:40:11,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:40:12,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:40:12,016 INFO L263 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-20 06:40:12,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:40:12,038 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-20 06:40:12,042 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2020-10-20 06:40:12,043 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 4 Second operand 4 states. [2020-10-20 06:40:12,115 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 4. Second operand 4 states. Result 16 states and 22 transitions. Complement of second has 5 states. [2020-10-20 06:40:12,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2020-10-20 06:40:12,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-20 06:40:12,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2020-10-20 06:40:12,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 4 letters. Loop has 6 letters. [2020-10-20 06:40:12,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:40:12,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 10 letters. Loop has 6 letters. [2020-10-20 06:40:12,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:40:12,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 4 letters. Loop has 12 letters. [2020-10-20 06:40:12,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:40:12,150 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 22 transitions. [2020-10-20 06:40:12,151 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 06:40:12,152 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 15 states and 21 transitions. [2020-10-20 06:40:12,152 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2020-10-20 06:40:12,152 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2020-10-20 06:40:12,153 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 21 transitions. [2020-10-20 06:40:12,153 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:40:12,153 INFO L691 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2020-10-20 06:40:12,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 21 transitions. [2020-10-20 06:40:12,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2020-10-20 06:40:12,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-10-20 06:40:12,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 20 transitions. [2020-10-20 06:40:12,160 INFO L714 BuchiCegarLoop]: Abstraction has 14 states and 20 transitions. [2020-10-20 06:40:12,161 INFO L594 BuchiCegarLoop]: Abstraction has 14 states and 20 transitions. [2020-10-20 06:40:12,161 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-20 06:40:12,161 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 20 transitions. [2020-10-20 06:40:12,161 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 06:40:12,162 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:40:12,162 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:40:12,164 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-10-20 06:40:12,164 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-20 06:40:12,165 INFO L794 eck$LassoCheckResult]: Stem: 173#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 165#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 166#L558 assume !(main_~array_size~0 < 1); 171#L558-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;sort_#in~x.base, sort_#in~x.offset, sort_#in~n := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sort_#t~mem4, sort_#t~mem5, sort_#t~mem6, sort_#t~mem7, sort_~temp~0, sort_#t~post3, sort_#t~post2, sort_~x.base, sort_~x.offset, sort_~n, sort_~pass~0, sort_~i~0;sort_~x.base, sort_~x.offset := sort_#in~x.base, sort_#in~x.offset;sort_~n := sort_#in~n;havoc sort_~pass~0;havoc sort_~i~0;sort_~pass~0 := 1; 172#L550-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 167#L551-3 [2020-10-20 06:40:12,165 INFO L796 eck$LassoCheckResult]: Loop: 167#L551-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 168#L552 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem4;havoc sort_#t~mem5;call sort_#t~mem6 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);sort_~temp~0 := sort_#t~mem6;havoc sort_#t~mem6;call sort_#t~mem7 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4);call write~int(sort_#t~mem7, sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);havoc sort_#t~mem7;call write~int(sort_~temp~0, sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 174#L551-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 167#L551-3 [2020-10-20 06:40:12,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:40:12,165 INFO L82 PathProgramCache]: Analyzing trace with hash 28695756, now seen corresponding path program 1 times [2020-10-20 06:40:12,165 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:40:12,166 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238280555] [2020-10-20 06:40:12,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:40:12,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:40:12,183 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:40:12,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:40:12,207 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:40:12,213 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:40:12,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:40:12,214 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 1 times [2020-10-20 06:40:12,214 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:40:12,215 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254803423] [2020-10-20 06:40:12,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:40:12,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:40:12,222 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:40:12,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:40:12,227 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:40:12,230 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:40:12,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:40:12,230 INFO L82 PathProgramCache]: Analyzing trace with hash 176800017, now seen corresponding path program 1 times [2020-10-20 06:40:12,230 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:40:12,231 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467107829] [2020-10-20 06:40:12,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:40:12,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:40:12,250 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:40:12,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:40:12,277 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:40:12,283 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:40:12,501 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2020-10-20 06:40:12,548 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:40:12,548 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:40:12,548 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:40:12,549 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:40:12,549 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 06:40:12,549 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:40:12,549 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:40:12,549 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:40:12,549 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-2.i_Iteration4_Lasso [2020-10-20 06:40:12,549 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:40:12,550 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:40:12,557 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:40:12,561 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:40:12,563 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:40:12,575 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:40:12,578 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:40:12,580 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:40:12,582 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:40:12,584 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:40:12,587 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:40:12,590 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:40:12,592 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:40:12,716 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2020-10-20 06:40:12,791 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:40:12,795 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:40:12,798 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:40:13,173 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:40:13,173 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:40:13,187 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:40:13,189 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:40:13,189 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:40:13,189 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:40:13,190 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:40:13,190 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:40:13,191 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:40:13,191 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:40:13,193 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) [2020-10-20 06:40:13,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 Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:40:13,275 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:40:13,275 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:40:13,275 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:40:13,276 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:40:13,276 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:40:13,276 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:40:13,276 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:40:13,278 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) [2020-10-20 06:40:13,320 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:40:13,321 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:40:13,322 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:40:13,322 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:40:13,322 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:40:13,324 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:40:13,324 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:40:13,328 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:40:13,362 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:40:13,363 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:40:13,364 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:40:13,364 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:40:13,364 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:40:13,366 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:40:13,366 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:40:13,369 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) [2020-10-20 06:40:13,400 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:40:13,402 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:40:13,402 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:40:13,402 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:40:13,402 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:40:13,402 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:40:13,403 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:40:13,403 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:40:13,405 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. Waiting until toolchain timeout for monitored process 18 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 19 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:40:13,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:40:13,442 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:40:13,442 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:40:13,442 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:40:13,443 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:40:13,443 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:40:13,443 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:40:13,443 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:40:13,445 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 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:40:13,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:40:13,474 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:40:13,474 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:40:13,474 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:40:13,474 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:40:13,481 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:40:13,481 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:40:13,484 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) [2020-10-20 06:40:13,520 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:40:13,522 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:40:13,522 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:40:13,522 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:40:13,522 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:40:13,522 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:40:13,523 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:40:13,523 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:40:13,530 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:40:13,558 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:40:13,560 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:40:13,560 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:40:13,560 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:40:13,560 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:40:13,560 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:40:13,563 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:40:13,563 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:40:13,565 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 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:40:13,603 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:40:13,604 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:40:13,605 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:40:13,605 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:40:13,605 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:40:13,607 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:40:13,607 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:40:13,613 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:40:13,660 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:40:13,661 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:40:13,661 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:40:13,662 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:40:13,662 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:40:13,668 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:40:13,668 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:40:13,681 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 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:40:13,716 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:40:13,718 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:40:13,718 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:40:13,718 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:40:13,718 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:40:13,721 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:40:13,722 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:40:13,729 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 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:40:13,758 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:40:13,759 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:40:13,760 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:40:13,760 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:40:13,760 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:40:13,770 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:40:13,770 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:40:13,788 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 06:40:13,834 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2020-10-20 06:40:13,834 INFO L444 ModelExtractionUtils]: 9 out of 37 variables were initially zero. Simplification set additionally 24 variables to zero. 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) [2020-10-20 06:40:13,837 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:40:13,840 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-20 06:40:13,840 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 06:40:13,840 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sort_~i~0, ULTIMATE.start_sort_~pass~0, ULTIMATE.start_sort_~n) = -1*ULTIMATE.start_sort_~i~0 - 1*ULTIMATE.start_sort_~pass~0 + 1*ULTIMATE.start_sort_~n Supporting invariants [] [2020-10-20 06:40:13,883 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2020-10-20 06:40:13,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:40:13,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:40:13,908 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 06:40:13,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:40:13,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:40:13,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 06:40:13,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:40:13,929 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:40:13,930 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:40:13,930 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 20 transitions. cyclomatic complexity: 8 Second operand 3 states. [2020-10-20 06:40:13,954 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 20 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 30 states and 44 transitions. Complement of second has 7 states. [2020-10-20 06:40:13,954 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:40:13,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-20 06:40:13,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2020-10-20 06:40:13,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 5 letters. Loop has 3 letters. [2020-10-20 06:40:13,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:40:13,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 8 letters. Loop has 3 letters. [2020-10-20 06:40:13,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:40:13,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 5 letters. Loop has 6 letters. [2020-10-20 06:40:13,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:40:13,956 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 44 transitions. [2020-10-20 06:40:13,959 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 06:40:13,960 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 20 states and 28 transitions. [2020-10-20 06:40:13,960 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2020-10-20 06:40:13,960 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2020-10-20 06:40:13,960 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 28 transitions. [2020-10-20 06:40:13,960 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:40:13,960 INFO L691 BuchiCegarLoop]: Abstraction has 20 states and 28 transitions. [2020-10-20 06:40:13,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 28 transitions. [2020-10-20 06:40:13,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 14. [2020-10-20 06:40:13,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-10-20 06:40:13,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2020-10-20 06:40:13,962 INFO L714 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2020-10-20 06:40:13,962 INFO L594 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2020-10-20 06:40:13,963 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-20 06:40:13,963 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2020-10-20 06:40:13,963 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 06:40:13,963 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:40:13,963 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:40:13,964 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:40:13,964 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-20 06:40:13,964 INFO L794 eck$LassoCheckResult]: Stem: 281#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 277#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 278#L558 assume !(main_~array_size~0 < 1); 279#L558-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;sort_#in~x.base, sort_#in~x.offset, sort_#in~n := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sort_#t~mem4, sort_#t~mem5, sort_#t~mem6, sort_#t~mem7, sort_~temp~0, sort_#t~post3, sort_#t~post2, sort_~x.base, sort_~x.offset, sort_~n, sort_~pass~0, sort_~i~0;sort_~x.base, sort_~x.offset := sort_#in~x.base, sort_#in~x.offset;sort_~n := sort_#in~n;havoc sort_~pass~0;havoc sort_~i~0;sort_~pass~0 := 1; 280#L550-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 275#L551-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 276#L552 assume !(sort_#t~mem4 > sort_#t~mem5);havoc sort_#t~mem4;havoc sort_#t~mem5; 283#L551-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 284#L551-3 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 271#L550-2 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 272#L550-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 273#L551-3 [2020-10-20 06:40:13,964 INFO L796 eck$LassoCheckResult]: Loop: 273#L551-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 274#L552 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem4;havoc sort_#t~mem5;call sort_#t~mem6 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);sort_~temp~0 := sort_#t~mem6;havoc sort_#t~mem6;call sort_#t~mem7 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4);call write~int(sort_#t~mem7, sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);havoc sort_#t~mem7;call write~int(sort_~temp~0, sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 282#L551-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 273#L551-3 [2020-10-20 06:40:13,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:40:13,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1421271829, now seen corresponding path program 1 times [2020-10-20 06:40:13,965 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:40:13,965 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285415746] [2020-10-20 06:40:13,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:40:13,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:40:14,016 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:40:14,017 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285415746] [2020-10-20 06:40:14,017 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1949057812] [2020-10-20 06:40:14,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:40:14,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:40:14,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-20 06:40:14,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:40:14,114 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:40:14,114 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:40:14,115 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2020-10-20 06:40:14,115 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283058973] [2020-10-20 06:40:14,123 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 06:40:14,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:40:14,124 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 2 times [2020-10-20 06:40:14,124 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:40:14,124 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697935950] [2020-10-20 06:40:14,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:40:14,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:40:14,129 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:40:14,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:40:14,140 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:40:14,142 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:40:14,225 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:40:14,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-20 06:40:14,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-20 06:40:14,226 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. cyclomatic complexity: 7 Second operand 7 states. [2020-10-20 06:40:14,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:40:14,283 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2020-10-20 06:40:14,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 06:40:14,283 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 36 transitions. [2020-10-20 06:40:14,285 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 06:40:14,285 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 25 states and 34 transitions. [2020-10-20 06:40:14,285 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2020-10-20 06:40:14,286 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2020-10-20 06:40:14,286 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 34 transitions. [2020-10-20 06:40:14,286 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:40:14,286 INFO L691 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2020-10-20 06:40:14,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 34 transitions. [2020-10-20 06:40:14,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 17. [2020-10-20 06:40:14,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-10-20 06:40:14,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2020-10-20 06:40:14,288 INFO L714 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2020-10-20 06:40:14,289 INFO L594 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2020-10-20 06:40:14,289 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-20 06:40:14,289 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 23 transitions. [2020-10-20 06:40:14,289 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 06:40:14,289 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:40:14,290 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:40:14,290 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2020-10-20 06:40:14,290 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-20 06:40:14,290 INFO L794 eck$LassoCheckResult]: Stem: 365#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 356#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 357#L558 assume !(main_~array_size~0 < 1); 364#L558-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;sort_#in~x.base, sort_#in~x.offset, sort_#in~n := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sort_#t~mem4, sort_#t~mem5, sort_#t~mem6, sort_#t~mem7, sort_~temp~0, sort_#t~post3, sort_#t~post2, sort_~x.base, sort_~x.offset, sort_~n, sort_~pass~0, sort_~i~0;sort_~x.base, sort_~x.offset := sort_#in~x.base, sort_#in~x.offset;sort_~n := sort_#in~n;havoc sort_~pass~0;havoc sort_~i~0;sort_~pass~0 := 1; 366#L550-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 367#L551-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 369#L552 assume !(sort_#t~mem4 > sort_#t~mem5);havoc sort_#t~mem4;havoc sort_#t~mem5; 370#L551-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 360#L551-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 361#L552 assume !(sort_#t~mem4 > sort_#t~mem5);havoc sort_#t~mem4;havoc sort_#t~mem5; 372#L551-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 371#L551-3 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 362#L550-2 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 363#L550-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 358#L551-3 [2020-10-20 06:40:14,290 INFO L796 eck$LassoCheckResult]: Loop: 358#L551-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 359#L552 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem4;havoc sort_#t~mem5;call sort_#t~mem6 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);sort_~temp~0 := sort_#t~mem6;havoc sort_#t~mem6;call sort_#t~mem7 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4);call write~int(sort_#t~mem7, sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);havoc sort_#t~mem7;call write~int(sort_~temp~0, sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 368#L551-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 358#L551-3 [2020-10-20 06:40:14,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:40:14,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1373641048, now seen corresponding path program 2 times [2020-10-20 06:40:14,291 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:40:14,291 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442093291] [2020-10-20 06:40:14,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:40:14,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:40:14,304 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:40:14,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:40:14,317 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:40:14,321 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:40:14,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:40:14,322 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 3 times [2020-10-20 06:40:14,322 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:40:14,322 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903988257] [2020-10-20 06:40:14,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:40:14,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:40:14,327 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:40:14,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:40:14,331 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:40:14,333 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:40:14,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:40:14,333 INFO L82 PathProgramCache]: Analyzing trace with hash -307910395, now seen corresponding path program 1 times [2020-10-20 06:40:14,334 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:40:14,334 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670035072] [2020-10-20 06:40:14,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:40:14,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:40:14,551 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:40:14,551 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670035072] [2020-10-20 06:40:14,551 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1824823070] [2020-10-20 06:40:14,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:40:14,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:40:14,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-20 06:40:14,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:40:14,691 INFO L350 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2020-10-20 06:40:14,691 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 10 [2020-10-20 06:40:14,693 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:14,695 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:14,696 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 06:40:14,696 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:3 [2020-10-20 06:40:14,702 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-20 06:40:14,703 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:40:14,703 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 13 [2020-10-20 06:40:14,703 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277900068] [2020-10-20 06:40:14,776 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:40:14,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-20 06:40:14,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2020-10-20 06:40:14,777 INFO L87 Difference]: Start difference. First operand 17 states and 23 transitions. cyclomatic complexity: 8 Second operand 13 states. [2020-10-20 06:40:14,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:40:14,876 INFO L93 Difference]: Finished difference Result 37 states and 50 transitions. [2020-10-20 06:40:14,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-20 06:40:14,877 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 50 transitions. [2020-10-20 06:40:14,878 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-10-20 06:40:14,880 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 37 states and 50 transitions. [2020-10-20 06:40:14,880 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2020-10-20 06:40:14,881 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2020-10-20 06:40:14,881 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 50 transitions. [2020-10-20 06:40:14,881 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:40:14,881 INFO L691 BuchiCegarLoop]: Abstraction has 37 states and 50 transitions. [2020-10-20 06:40:14,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 50 transitions. [2020-10-20 06:40:14,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 26. [2020-10-20 06:40:14,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-10-20 06:40:14,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2020-10-20 06:40:14,885 INFO L714 BuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2020-10-20 06:40:14,885 INFO L594 BuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2020-10-20 06:40:14,885 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-10-20 06:40:14,885 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 35 transitions. [2020-10-20 06:40:14,886 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 06:40:14,886 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:40:14,886 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:40:14,886 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:40:14,886 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-20 06:40:14,887 INFO L794 eck$LassoCheckResult]: Stem: 492#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 484#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 485#L558 assume !(main_~array_size~0 < 1); 486#L558-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;sort_#in~x.base, sort_#in~x.offset, sort_#in~n := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sort_#t~mem4, sort_#t~mem5, sort_#t~mem6, sort_#t~mem7, sort_~temp~0, sort_#t~post3, sort_#t~post2, sort_~x.base, sort_~x.offset, sort_~n, sort_~pass~0, sort_~i~0;sort_~x.base, sort_~x.offset := sort_#in~x.base, sort_#in~x.offset;sort_~n := sort_#in~n;havoc sort_~pass~0;havoc sort_~i~0;sort_~pass~0 := 1; 487#L550-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 488#L551-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 501#L552 assume !(sort_#t~mem4 > sort_#t~mem5);havoc sort_#t~mem4;havoc sort_#t~mem5; 497#L551-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 480#L551-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 481#L552 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem4;havoc sort_#t~mem5;call sort_#t~mem6 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);sort_~temp~0 := sort_#t~mem6;havoc sort_#t~mem6;call sort_#t~mem7 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4);call write~int(sort_#t~mem7, sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);havoc sort_#t~mem7;call write~int(sort_~temp~0, sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 495#L551-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 500#L551-3 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 482#L550-2 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 483#L550-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 478#L551-3 [2020-10-20 06:40:14,887 INFO L796 eck$LassoCheckResult]: Loop: 478#L551-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 479#L552 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem4;havoc sort_#t~mem5;call sort_#t~mem6 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);sort_~temp~0 := sort_#t~mem6;havoc sort_#t~mem6;call sort_#t~mem7 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4);call write~int(sort_#t~mem7, sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);havoc sort_#t~mem7;call write~int(sort_~temp~0, sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 494#L551-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 478#L551-3 [2020-10-20 06:40:14,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:40:14,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1371794006, now seen corresponding path program 2 times [2020-10-20 06:40:14,887 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:40:14,887 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526657928] [2020-10-20 06:40:14,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:40:14,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:40:14,900 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:40:14,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:40:14,913 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:40:14,917 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:40:14,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:40:14,918 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 4 times [2020-10-20 06:40:14,918 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:40:14,918 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838151564] [2020-10-20 06:40:14,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:40:14,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:40:14,931 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:40:14,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:40:14,937 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:40:14,940 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:40:14,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:40:14,941 INFO L82 PathProgramCache]: Analyzing trace with hash 501436231, now seen corresponding path program 3 times [2020-10-20 06:40:14,942 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:40:14,942 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113755890] [2020-10-20 06:40:14,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:40:14,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:40:14,979 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:40:15,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:40:15,003 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:40:15,007 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:40:15,506 WARN L193 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 97 [2020-10-20 06:40:15,608 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:40:15,608 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:40:15,608 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:40:15,608 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:40:15,608 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 06:40:15,608 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:40:15,609 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:40:15,609 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:40:15,609 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-2.i_Iteration7_Lasso [2020-10-20 06:40:15,609 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:40:15,609 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:40:15,613 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:40:15,623 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:40:15,631 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:40:15,635 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:40:15,809 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2020-10-20 06:40:15,893 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:40:15,896 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:40:15,899 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:40:15,903 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:40:15,906 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:40:15,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:40:15,910 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:40:15,912 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:40:15,914 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:40:15,917 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:40:16,259 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:40:16,259 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:40:16,263 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:40:16,264 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:40:16,264 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:40:16,265 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:40:16,265 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:40:16,265 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:40:16,265 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:40:16,265 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:40:16,266 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) [2020-10-20 06:40:16,288 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 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:40:16,290 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:40:16,290 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:40:16,290 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:40:16,290 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:40:16,291 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:40:16,291 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:40:16,294 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:40:16,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:40:16,317 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:40:16,318 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:40:16,318 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:40:16,318 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:40:16,323 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:40:16,323 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:40:16,328 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) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:40:16,349 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:40:16,350 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:40:16,350 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:40:16,351 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:40:16,351 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:40:16,355 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:40:16,355 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:40:16,361 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:40:16,382 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:40:16,383 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:40:16,383 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:40:16,384 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:40:16,384 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:40:16,394 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:40:16,394 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:40:16,409 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 06:40:16,452 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2020-10-20 06:40:16,452 INFO L444 ModelExtractionUtils]: 9 out of 37 variables were initially zero. Simplification set additionally 24 variables to zero. 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:40:16,455 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:40:16,458 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-10-20 06:40:16,458 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 06:40:16,458 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc9.base)_3, ULTIMATE.start_sort_~i~0) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc9.base)_3 - 4*ULTIMATE.start_sort_~i~0 Supporting invariants [1*ULTIMATE.start_sort_~x.offset >= 0] [2020-10-20 06:40:16,508 INFO L297 tatePredicateManager]: 6 out of 8 supporting invariants were superfluous and have been removed [2020-10-20 06:40:16,512 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-20 06:40:16,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:40:16,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:40:16,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-20 06:40:16,558 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:40:16,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:40:16,606 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-20 06:40:16,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:40:16,634 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:40:16,635 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:40:16,635 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 11 Second operand 6 states. [2020-10-20 06:40:16,673 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 11. Second operand 6 states. Result 50 states and 70 transitions. Complement of second has 8 states. [2020-10-20 06:40:16,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-20 06:40:16,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-20 06:40:16,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2020-10-20 06:40:16,674 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 14 letters. Loop has 3 letters. [2020-10-20 06:40:16,674 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:40:16,674 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-10-20 06:40:16,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:40:16,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:40:16,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-20 06:40:16,721 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:40:16,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:40:16,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-20 06:40:16,765 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:40:16,787 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:40:16,787 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.4 stem predicates 2 loop predicates [2020-10-20 06:40:16,787 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 11 Second operand 6 states. [2020-10-20 06:40:16,831 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 11. Second operand 6 states. Result 50 states and 70 transitions. Complement of second has 8 states. [2020-10-20 06:40:16,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-20 06:40:16,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-20 06:40:16,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2020-10-20 06:40:16,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 14 letters. Loop has 3 letters. [2020-10-20 06:40:16,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:40:16,835 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-10-20 06:40:16,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:40:16,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:40:16,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-20 06:40:16,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:40:16,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:40:16,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-20 06:40:16,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:40:16,960 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:40:16,961 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2020-10-20 06:40:16,961 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 11 Second operand 6 states. [2020-10-20 06:40:17,043 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 11. Second operand 6 states. Result 45 states and 63 transitions. Complement of second has 10 states. [2020-10-20 06:40:17,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-20 06:40:17,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-20 06:40:17,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 23 transitions. [2020-10-20 06:40:17,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 23 transitions. Stem has 14 letters. Loop has 3 letters. [2020-10-20 06:40:17,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:40:17,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 23 transitions. Stem has 17 letters. Loop has 3 letters. [2020-10-20 06:40:17,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:40:17,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 23 transitions. Stem has 14 letters. Loop has 6 letters. [2020-10-20 06:40:17,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:40:17,048 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 63 transitions. [2020-10-20 06:40:17,049 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-20 06:40:17,049 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 0 states and 0 transitions. [2020-10-20 06:40:17,050 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-10-20 06:40:17,050 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-10-20 06:40:17,050 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-10-20 06:40:17,050 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:40:17,050 INFO L691 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 06:40:17,050 INFO L714 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 06:40:17,050 INFO L594 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 06:40:17,050 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-10-20 06:40:17,050 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-10-20 06:40:17,050 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-20 06:40:17,050 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-10-20 06:40:17,057 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 20.10 06:40:17 BoogieIcfgContainer [2020-10-20 06:40:17,057 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-20 06:40:17,058 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 06:40:17,058 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 06:40:17,058 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 06:40:17,058 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 06:40:09" (3/4) ... [2020-10-20 06:40:17,062 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-20 06:40:17,062 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 06:40:17,063 INFO L168 Benchmark]: Toolchain (without parser) took 8524.93 ms. Allocated memory was 39.8 MB in the beginning and 73.4 MB in the end (delta: 33.6 MB). Free memory was 16.4 MB in the beginning and 32.8 MB in the end (delta: -16.3 MB). Peak memory consumption was 17.2 MB. Max. memory is 14.3 GB. [2020-10-20 06:40:17,064 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 30.9 MB. Free memory was 7.0 MB in the beginning and 6.9 MB in the end (delta: 42.0 kB). Peak memory consumption was 42.0 kB. Max. memory is 14.3 GB. [2020-10-20 06:40:17,065 INFO L168 Benchmark]: CACSL2BoogieTranslator took 456.60 ms. Allocated memory was 39.8 MB in the beginning and 41.9 MB in the end (delta: 2.1 MB). Free memory was 15.5 MB in the beginning and 17.5 MB in the end (delta: -1.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 14.3 GB. [2020-10-20 06:40:17,065 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.33 ms. Allocated memory is still 41.9 MB. Free memory was 17.5 MB in the beginning and 15.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 14.3 GB. [2020-10-20 06:40:17,066 INFO L168 Benchmark]: Boogie Preprocessor took 27.95 ms. Allocated memory is still 41.9 MB. Free memory was 15.4 MB in the beginning and 14.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 14.3 GB. [2020-10-20 06:40:17,067 INFO L168 Benchmark]: RCFGBuilder took 363.23 ms. Allocated memory was 41.9 MB in the beginning and 42.5 MB in the end (delta: 524.3 kB). Free memory was 13.9 MB in the beginning and 14.3 MB in the end (delta: -464.7 kB). Peak memory consumption was 4.2 MB. Max. memory is 14.3 GB. [2020-10-20 06:40:17,067 INFO L168 Benchmark]: BuchiAutomizer took 7616.91 ms. Allocated memory was 42.5 MB in the beginning and 73.4 MB in the end (delta: 30.9 MB). Free memory was 14.3 MB in the beginning and 32.8 MB in the end (delta: -18.4 MB). Peak memory consumption was 12.5 MB. Max. memory is 14.3 GB. [2020-10-20 06:40:17,068 INFO L168 Benchmark]: Witness Printer took 4.39 ms. Allocated memory is still 73.4 MB. Free memory is still 32.8 MB. There was no memory consumed. Max. memory is 14.3 GB. [2020-10-20 06:40:17,072 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.27 ms. Allocated memory is still 30.9 MB. Free memory was 7.0 MB in the beginning and 6.9 MB in the end (delta: 42.0 kB). Peak memory consumption was 42.0 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 456.60 ms. Allocated memory was 39.8 MB in the beginning and 41.9 MB in the end (delta: 2.1 MB). Free memory was 15.5 MB in the beginning and 17.5 MB in the end (delta: -1.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 47.33 ms. Allocated memory is still 41.9 MB. Free memory was 17.5 MB in the beginning and 15.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 27.95 ms. Allocated memory is still 41.9 MB. Free memory was 15.4 MB in the beginning and 14.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 14.3 GB. * RCFGBuilder took 363.23 ms. Allocated memory was 41.9 MB in the beginning and 42.5 MB in the end (delta: 524.3 kB). Free memory was 13.9 MB in the beginning and 14.3 MB in the end (delta: -464.7 kB). Peak memory consumption was 4.2 MB. Max. memory is 14.3 GB. * BuchiAutomizer took 7616.91 ms. Allocated memory was 42.5 MB in the beginning and 73.4 MB in the end (delta: 30.9 MB). Free memory was 14.3 MB in the beginning and 32.8 MB in the end (delta: -18.4 MB). Peak memory consumption was 12.5 MB. Max. memory is 14.3 GB. * Witness Printer took 4.39 ms. Allocated memory is still 73.4 MB. Free memory is still 32.8 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 #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (4 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[x] + -2 * pass and consists of 4 locations. One deterministic module has affine ranking function -1 * i + -1 * pass + n and consists of 4 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (array_size * sizeof(int))] + -4 * i and consists of 6 locations. 4 modules have a trivial ranking function, the largest among these consists of 13 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.5s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 6.3s. Construction of modules took 0.1s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 26 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 26 states and ocurred in iteration 6. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1/1 HoareTripleCheckerStatistics: 87 SDtfs, 103 SDslu, 115 SDs, 0 SdLazy, 169 SolverSat, 38 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital197 mio100 ax109 hnf98 lsp88 ukn62 mio100 lsp64 div100 bol100 ite100 ukn100 eq177 hnf87 smp100 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 13ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...