./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 906a4fb5 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -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-906a4fb [2020-10-19 18:47:06,477 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-19 18:47:06,479 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-19 18:47:06,503 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-19 18:47:06,504 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-19 18:47:06,505 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-19 18:47:06,506 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-19 18:47:06,508 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-19 18:47:06,510 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-19 18:47:06,511 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-19 18:47:06,512 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-19 18:47:06,513 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-19 18:47:06,514 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-19 18:47:06,515 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-19 18:47:06,516 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-19 18:47:06,518 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-19 18:47:06,518 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-19 18:47:06,519 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-19 18:47:06,522 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-19 18:47:06,523 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-19 18:47:06,525 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-19 18:47:06,526 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-19 18:47:06,527 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-19 18:47:06,528 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-19 18:47:06,531 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-19 18:47:06,531 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-19 18:47:06,532 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-19 18:47:06,533 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-19 18:47:06,533 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-19 18:47:06,534 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-19 18:47:06,534 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-19 18:47:06,535 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-19 18:47:06,536 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-19 18:47:06,537 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-19 18:47:06,538 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-19 18:47:06,538 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-19 18:47:06,539 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-19 18:47:06,539 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-19 18:47:06,540 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-19 18:47:06,541 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-19 18:47:06,541 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-19 18:47:06,542 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2020-10-19 18:47:06,584 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-19 18:47:06,585 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-19 18:47:06,589 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-19 18:47:06,589 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-19 18:47:06,589 INFO L138 SettingsManager]: * Use SBE=true [2020-10-19 18:47:06,589 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-19 18:47:06,589 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-19 18:47:06,590 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-19 18:47:06,590 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-19 18:47:06,590 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-19 18:47:06,590 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-19 18:47:06,590 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-19 18:47:06,591 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-19 18:47:06,591 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-19 18:47:06,592 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-19 18:47:06,593 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-19 18:47:06,594 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-19 18:47:06,594 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-19 18:47:06,594 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-19 18:47:06,595 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-19 18:47:06,595 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-19 18:47:06,595 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-19 18:47:06,596 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-19 18:47:06,596 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-19 18:47:06,596 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-19 18:47:06,596 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-19 18:47:06,597 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-19 18:47:06,597 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-19 18:47:06,597 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-19 18:47:06,599 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-19 18:47:06,599 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-19 18:47:06,928 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-19 18:47:06,942 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-19 18:47:06,948 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-19 18:47:06,950 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-19 18:47:06,951 INFO L275 PluginConnector]: CDTParser initialized [2020-10-19 18:47:06,953 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-19 18:47:07,014 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/978fd05c0/3ae400d98d2040f5b2d44d9c5e4e9ed9/FLAG8dc78ae32 [2020-10-19 18:47:07,550 INFO L306 CDTParser]: Found 1 translation units. [2020-10-19 18:47:07,550 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/java_BubbleSort-alloca-2.i [2020-10-19 18:47:07,570 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/978fd05c0/3ae400d98d2040f5b2d44d9c5e4e9ed9/FLAG8dc78ae32 [2020-10-19 18:47:07,833 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/978fd05c0/3ae400d98d2040f5b2d44d9c5e4e9ed9 [2020-10-19 18:47:07,836 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-19 18:47:07,843 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-19 18:47:07,844 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-19 18:47:07,844 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-19 18:47:07,847 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-19 18:47:07,848 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 06:47:07" (1/1) ... [2020-10-19 18:47:07,851 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32a659b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:47:07, skipping insertion in model container [2020-10-19 18:47:07,851 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 06:47:07" (1/1) ... [2020-10-19 18:47:07,859 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-19 18:47:07,901 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-19 18:47:08,299 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-19 18:47:08,309 INFO L203 MainTranslator]: Completed pre-run [2020-10-19 18:47:08,380 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-19 18:47:08,425 INFO L208 MainTranslator]: Completed translation [2020-10-19 18:47:08,426 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:47:08 WrapperNode [2020-10-19 18:47:08,426 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-19 18:47:08,427 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-19 18:47:08,427 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-19 18:47:08,427 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-19 18:47:08,436 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:47:08" (1/1) ... [2020-10-19 18:47:08,450 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:47:08" (1/1) ... [2020-10-19 18:47:08,471 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-19 18:47:08,471 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-19 18:47:08,472 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-19 18:47:08,472 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-19 18:47:08,479 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:47:08" (1/1) ... [2020-10-19 18:47:08,479 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:47:08" (1/1) ... [2020-10-19 18:47:08,483 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:47:08" (1/1) ... [2020-10-19 18:47:08,483 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:47:08" (1/1) ... [2020-10-19 18:47:08,489 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:47:08" (1/1) ... [2020-10-19 18:47:08,494 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:47:08" (1/1) ... [2020-10-19 18:47:08,495 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:47:08" (1/1) ... [2020-10-19 18:47:08,497 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-19 18:47:08,498 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-19 18:47:08,498 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-19 18:47:08,498 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-19 18:47:08,499 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:47: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-19 18:47:08,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-19 18:47:08,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-19 18:47:08,567 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-19 18:47:08,567 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-19 18:47:08,567 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-19 18:47:08,567 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-19 18:47:08,832 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-19 18:47:08,832 INFO L298 CfgBuilder]: Removed 8 assume(true) statements. [2020-10-19 18:47:08,833 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 06:47:08 BoogieIcfgContainer [2020-10-19 18:47:08,834 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-19 18:47:08,834 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-19 18:47:08,834 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-19 18:47:08,838 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-19 18:47:08,839 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 18:47:08,839 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.10 06:47:07" (1/3) ... [2020-10-19 18:47:08,840 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@59c3d953 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.10 06:47:08, skipping insertion in model container [2020-10-19 18:47:08,840 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 18:47:08,840 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:47:08" (2/3) ... [2020-10-19 18:47:08,841 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@59c3d953 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.10 06:47:08, skipping insertion in model container [2020-10-19 18:47:08,841 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 18:47:08,841 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 06:47:08" (3/3) ... [2020-10-19 18:47:08,843 INFO L373 chiAutomizerObserver]: Analyzing ICFG java_BubbleSort-alloca-2.i [2020-10-19 18:47:08,892 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-19 18:47:08,892 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-19 18:47:08,893 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-19 18:47:08,893 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-19 18:47:08,893 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-19 18:47:08,893 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-19 18:47:08,893 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-19 18:47:08,893 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-19 18:47:08,908 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2020-10-19 18:47:08,936 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-10-19 18:47:08,937 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:47:08,937 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:47:08,942 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-10-19 18:47:08,943 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-19 18:47:08,943 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-19 18:47:08,943 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2020-10-19 18:47:08,945 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-10-19 18:47:08,945 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:47:08,945 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:47:08,945 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-10-19 18:47:08,945 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-19 18:47:08,952 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-19 18:47:08,952 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-19 18:47:08,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:47:08,957 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2020-10-19 18:47:08,966 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:47:08,967 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289845446] [2020-10-19 18:47:08,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:47:09,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:47:09,069 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:47:09,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:47:09,083 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:47:09,105 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:47:09,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:47:09,107 INFO L82 PathProgramCache]: Analyzing trace with hash 47218, now seen corresponding path program 1 times [2020-10-19 18:47:09,107 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:47:09,107 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059137673] [2020-10-19 18:47:09,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:47:09,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:47:09,140 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-19 18:47:09,141 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059137673] [2020-10-19 18:47:09,141 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 18:47:09,142 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-19 18:47:09,142 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700991965] [2020-10-19 18:47:09,147 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-19 18:47:09,148 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 18:47:09,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-19 18:47:09,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-19 18:47:09,162 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 2 states. [2020-10-19 18:47:09,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 18:47:09,168 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2020-10-19 18:47:09,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-19 18:47:09,170 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 16 transitions. [2020-10-19 18:47:09,171 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-10-19 18:47:09,176 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 9 states and 12 transitions. [2020-10-19 18:47:09,177 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2020-10-19 18:47:09,177 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2020-10-19 18:47:09,178 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 12 transitions. [2020-10-19 18:47:09,178 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 18:47:09,178 INFO L691 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2020-10-19 18:47:09,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 12 transitions. [2020-10-19 18:47:09,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2020-10-19 18:47:09,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-19 18:47:09,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 12 transitions. [2020-10-19 18:47:09,201 INFO L714 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2020-10-19 18:47:09,201 INFO L594 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2020-10-19 18:47:09,201 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-19 18:47:09,202 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 12 transitions. [2020-10-19 18:47:09,202 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-10-19 18:47:09,202 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:47:09,203 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:47:09,203 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-10-19 18:47:09,203 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-19 18:47:09,203 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-19 18:47:09,204 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-19 18:47:09,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:47:09,204 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2020-10-19 18:47:09,204 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:47:09,205 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727126474] [2020-10-19 18:47:09,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:47:09,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:47:09,216 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:47:09,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:47:09,226 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:47:09,231 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:47:09,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:47:09,231 INFO L82 PathProgramCache]: Analyzing trace with hash 46877, now seen corresponding path program 1 times [2020-10-19 18:47:09,232 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:47:09,232 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363720372] [2020-10-19 18:47:09,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:47:09,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:47:09,284 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-19 18:47:09,284 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363720372] [2020-10-19 18:47:09,284 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 18:47:09,285 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-19 18:47:09,285 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121283120] [2020-10-19 18:47:09,285 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-19 18:47:09,285 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 18:47:09,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-19 18:47:09,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-19 18:47:09,288 INFO L87 Difference]: Start difference. First operand 9 states and 12 transitions. cyclomatic complexity: 4 Second operand 3 states. [2020-10-19 18:47:09,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 18:47:09,335 INFO L93 Difference]: Finished difference Result 10 states and 13 transitions. [2020-10-19 18:47:09,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-19 18:47:09,337 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 13 transitions. [2020-10-19 18:47:09,338 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-10-19 18:47:09,339 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 13 transitions. [2020-10-19 18:47:09,340 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-10-19 18:47:09,340 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-10-19 18:47:09,340 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2020-10-19 18:47:09,341 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 18:47:09,341 INFO L691 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2020-10-19 18:47:09,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2020-10-19 18:47:09,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2020-10-19 18:47:09,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-10-19 18:47:09,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2020-10-19 18:47:09,343 INFO L714 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2020-10-19 18:47:09,344 INFO L594 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2020-10-19 18:47:09,344 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-19 18:47:09,344 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2020-10-19 18:47:09,345 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-10-19 18:47:09,345 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:47:09,345 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:47:09,346 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-10-19 18:47:09,346 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-10-19 18:47:09,346 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-19 18:47:09,346 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-19 18:47:09,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:47:09,347 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 3 times [2020-10-19 18:47:09,347 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:47:09,348 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148468801] [2020-10-19 18:47:09,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:47:09,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:47:09,361 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:47:09,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:47:09,369 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:47:09,373 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:47:09,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:47:09,373 INFO L82 PathProgramCache]: Analyzing trace with hash 1398152922, now seen corresponding path program 1 times [2020-10-19 18:47:09,374 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:47:09,376 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541073676] [2020-10-19 18:47:09,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:47:09,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:47:09,390 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:47:09,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:47:09,401 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:47:09,405 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:47:09,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:47:09,406 INFO L82 PathProgramCache]: Analyzing trace with hash -1893874754, now seen corresponding path program 1 times [2020-10-19 18:47:09,406 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:47:09,406 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548625066] [2020-10-19 18:47:09,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:47:09,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:47:09,431 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:47:09,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:47:09,467 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:47:09,478 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:47:09,621 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2020-10-19 18:47:09,828 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2020-10-19 18:47:09,918 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 18:47:09,919 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 18:47:09,919 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 18:47:09,919 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 18:47:09,920 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 18:47:09,920 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:47:09,920 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 18:47:09,921 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 18:47:09,921 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-2.i_Iteration3_Lasso [2020-10-19 18:47:09,921 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 18:47:09,921 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 18:47:09,954 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-19 18:47:09,962 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:47:09,968 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-19 18:47:09,971 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-19 18:47:09,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:47:09,981 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-19 18:47:09,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:47:10,144 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2020-10-19 18:47:10,187 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-19 18:47:10,192 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-19 18:47:10,197 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-19 18:47:10,201 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-19 18:47:10,204 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-19 18:47:10,209 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-19 18:47:10,212 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-19 18:47:10,585 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 18:47:10,592 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-19 18:47:10,598 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-19 18:47:10,601 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:47:10,601 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:47:10,602 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:47:10,603 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:47:10,603 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:47:10,605 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:47:10,606 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-19 18:47:10,610 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-19 18:47:10,652 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-19 18:47:10,654 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:47:10,654 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:47:10,655 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:47:10,655 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:47:10,655 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:47:10,659 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:47:10,660 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:47:10,670 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-19 18:47:10,715 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-19 18:47:10,717 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:47:10,718 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:47:10,718 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:47:10,718 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:47:10,718 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:47:10,719 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:47:10,720 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-19 18:47:10,726 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-19 18:47:10,770 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-19 18:47:10,772 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:47:10,773 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:47:10,773 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:47:10,773 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:47:10,777 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:47:10,777 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-19 18:47:10,782 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-19 18:47:10,817 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-19 18:47:10,819 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:47:10,819 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:47:10,819 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:47:10,820 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:47:10,820 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:47:10,821 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:47:10,821 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-19 18:47:10,823 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-19 18:47:10,861 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-19 18:47:10,863 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:47:10,863 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:47:10,863 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:47:10,864 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:47:10,864 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:47:10,865 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:47:10,865 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-19 18:47:10,867 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) [2020-10-19 18:47:10,896 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:47:10,897 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:47:10,898 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:47:10,898 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:47:10,898 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:47:10,898 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:47:10,902 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:47:10,902 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:47:10,909 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) [2020-10-19 18:47:10,957 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-19 18:47:10,959 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:47:10,959 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:47:10,959 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:47:10,959 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:47:10,966 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:47:10,966 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:47:10,975 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-19 18:47:11,016 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-19 18:47:11,018 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:47:11,018 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:47:11,018 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:47:11,018 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:47:11,021 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:47:11,021 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:47:11,025 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-19 18:47:11,055 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-19 18:47:11,056 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:47:11,057 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:47:11,057 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:47:11,057 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:47:11,057 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:47:11,058 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:47:11,058 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:47:11,060 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-19 18:47:11,085 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-19 18:47:11,087 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:47:11,088 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:47:11,088 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:47:11,088 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:47:11,099 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:47:11,099 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:47:11,118 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-19 18:47:11,305 INFO L443 ModelExtractionUtils]: Simplification made 21 calls to the SMT solver. [2020-10-19 18:47:11,305 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-19 18:47:11,311 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-19 18:47:11,322 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-10-19 18:47:11,322 INFO L510 LassoAnalysis]: Proved termination. [2020-10-19 18:47:11,323 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sort_~pass~0, v_rep(select #length ULTIMATE.start_sort_~x.base)_1) = -2*ULTIMATE.start_sort_~pass~0 + 1*v_rep(select #length ULTIMATE.start_sort_~x.base)_1 Supporting invariants [-2*ULTIMATE.start_sort_~n + 1*v_rep(select #length ULTIMATE.start_sort_~x.base)_1 >= 0] [2020-10-19 18:47:11,387 INFO L297 tatePredicateManager]: 4 out of 5 supporting invariants were superfluous and have been removed [2020-10-19 18:47:11,398 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-19 18:47:11,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:47:11,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:47:11,453 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 12 conjunts are in the unsatisfiable core [2020-10-19 18:47:11,455 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:47:11,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:47:11,493 INFO L263 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-19 18:47:11,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:47:11,518 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-19 18:47:11,522 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-19 18:47:11,523 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 4 Second operand 4 states. [2020-10-19 18:47:11,597 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-19 18:47:11,598 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-19 18:47:11,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-19 18:47:11,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2020-10-19 18:47:11,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 4 letters. Loop has 6 letters. [2020-10-19 18:47:11,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:47:11,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 10 letters. Loop has 6 letters. [2020-10-19 18:47:11,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:47:11,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 4 letters. Loop has 12 letters. [2020-10-19 18:47:11,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:47:11,604 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 22 transitions. [2020-10-19 18:47:11,605 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-19 18:47:11,606 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 15 states and 21 transitions. [2020-10-19 18:47:11,606 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2020-10-19 18:47:11,606 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2020-10-19 18:47:11,606 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 21 transitions. [2020-10-19 18:47:11,606 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 18:47:11,607 INFO L691 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2020-10-19 18:47:11,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 21 transitions. [2020-10-19 18:47:11,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2020-10-19 18:47:11,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-10-19 18:47:11,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 20 transitions. [2020-10-19 18:47:11,609 INFO L714 BuchiCegarLoop]: Abstraction has 14 states and 20 transitions. [2020-10-19 18:47:11,609 INFO L594 BuchiCegarLoop]: Abstraction has 14 states and 20 transitions. [2020-10-19 18:47:11,609 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-19 18:47:11,610 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 20 transitions. [2020-10-19 18:47:11,610 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-19 18:47:11,610 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:47:11,611 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:47:11,611 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-10-19 18:47:11,611 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-19 18:47:11,611 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-19 18:47:11,612 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-19 18:47:11,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:47:11,612 INFO L82 PathProgramCache]: Analyzing trace with hash 28695756, now seen corresponding path program 1 times [2020-10-19 18:47:11,612 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:47:11,612 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122578803] [2020-10-19 18:47:11,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:47:11,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:47:11,625 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:47:11,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:47:11,642 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:47:11,673 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:47:11,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:47:11,679 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 1 times [2020-10-19 18:47:11,679 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:47:11,687 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27120373] [2020-10-19 18:47:11,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:47:11,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:47:11,721 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:47:11,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:47:11,742 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:47:11,749 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:47:11,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:47:11,752 INFO L82 PathProgramCache]: Analyzing trace with hash 176800017, now seen corresponding path program 1 times [2020-10-19 18:47:11,753 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:47:11,753 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131096679] [2020-10-19 18:47:11,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:47:11,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:47:11,784 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:47:11,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:47:11,809 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:47:11,818 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:47:12,016 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2020-10-19 18:47:12,068 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 18:47:12,068 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 18:47:12,068 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 18:47:12,068 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 18:47:12,068 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 18:47:12,068 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:47:12,068 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 18:47:12,069 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 18:47:12,069 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-2.i_Iteration4_Lasso [2020-10-19 18:47:12,069 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 18:47:12,069 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 18:47:12,079 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-19 18:47:12,083 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-19 18:47:12,085 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-19 18:47:12,088 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-19 18:47:12,091 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-19 18:47:12,093 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-19 18:47:12,096 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-19 18:47:12,098 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-19 18:47:12,101 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-19 18:47:12,103 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-19 18:47:12,106 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-19 18:47:12,277 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-19 18:47:12,284 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-19 18:47:12,287 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-19 18:47:12,586 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 18:47:12,586 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) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:47:12,592 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-19 18:47:12,593 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:47:12,593 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:47:12,593 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:47:12,593 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:47:12,593 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:47:12,594 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:47:12,594 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:47:12,595 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:47:12,631 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:47:12,633 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:47:12,633 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:47:12,634 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:47:12,634 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:47:12,634 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:47:12,635 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:47:12,635 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:47:12,636 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:47:12,669 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:47:12,671 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:47:12,671 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:47:12,671 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:47:12,671 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:47:12,675 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:47:12,675 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:47:12,679 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) [2020-10-19 18:47:12,722 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-19 18:47:12,724 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:47:12,724 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:47:12,724 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:47:12,724 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:47:12,729 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:47:12,729 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:47:12,737 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:47:12,772 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-19 18:47:12,774 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:47:12,774 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:47:12,774 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:47:12,774 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:47:12,774 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:47:12,775 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:47:12,775 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:47:12,777 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 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-19 18:47:12,803 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-19 18:47:12,804 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:47:12,804 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:47:12,804 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:47:12,804 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:47:12,804 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:47:12,806 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:47:12,806 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:47:12,807 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-19 18:47:12,829 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-19 18:47:12,830 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:47:12,830 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:47:12,830 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:47:12,831 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:47:12,837 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:47:12,837 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:47:12,841 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:47:12,884 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-19 18:47:12,891 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:47:12,891 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:47:12,891 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:47:12,891 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:47:12,892 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:47:12,892 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:47:12,892 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:47:12,897 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-19 18:47:12,966 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-19 18:47:12,971 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:47:12,971 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:47:12,971 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:47:12,971 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:47:12,972 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:47:12,973 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:47:12,973 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:47:12,982 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-19 18:47:13,051 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-19 18:47:13,054 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:47:13,054 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:47:13,054 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:47:13,055 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:47:13,057 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:47:13,058 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-19 18:47:13,063 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-19 18:47:13,127 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-19 18:47:13,129 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:47:13,129 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:47:13,129 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:47:13,129 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:47:13,133 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:47:13,134 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:47:13,142 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-19 18:47:13,205 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-19 18:47:13,207 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:47:13,207 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:47:13,207 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:47:13,208 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:47:13,215 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:47:13,215 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-19 18:47:13,224 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) [2020-10-19 18:47:13,289 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-19 18:47:13,292 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:47:13,292 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:47:13,292 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:47:13,292 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:47:13,305 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:47:13,305 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:47:13,336 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-19 18:47:13,396 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2020-10-19 18:47:13,396 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) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:47:13,403 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-19 18:47:13,410 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-19 18:47:13,410 INFO L510 LassoAnalysis]: Proved termination. [2020-10-19 18:47:13,411 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-19 18:47:13,485 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2020-10-19 18:47:13,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:47:13,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:47:13,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-19 18:47:13,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:47:13,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:47:13,546 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-19 18:47:13,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:47:13,562 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-19 18:47:13,562 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-19 18:47:13,562 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 20 transitions. cyclomatic complexity: 8 Second operand 3 states. [2020-10-19 18:47:13,591 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-19 18:47:13,592 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-19 18:47:13,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-19 18:47:13,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2020-10-19 18:47:13,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 5 letters. Loop has 3 letters. [2020-10-19 18:47:13,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:47:13,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 8 letters. Loop has 3 letters. [2020-10-19 18:47:13,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:47:13,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 5 letters. Loop has 6 letters. [2020-10-19 18:47:13,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:47:13,595 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 44 transitions. [2020-10-19 18:47:13,598 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-19 18:47:13,599 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 20 states and 28 transitions. [2020-10-19 18:47:13,599 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2020-10-19 18:47:13,599 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2020-10-19 18:47:13,599 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 28 transitions. [2020-10-19 18:47:13,600 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 18:47:13,600 INFO L691 BuchiCegarLoop]: Abstraction has 20 states and 28 transitions. [2020-10-19 18:47:13,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 28 transitions. [2020-10-19 18:47:13,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 14. [2020-10-19 18:47:13,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-10-19 18:47:13,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2020-10-19 18:47:13,603 INFO L714 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2020-10-19 18:47:13,603 INFO L594 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2020-10-19 18:47:13,603 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-19 18:47:13,603 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2020-10-19 18:47:13,604 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-19 18:47:13,604 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:47:13,605 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:47:13,605 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 18:47:13,605 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-19 18:47:13,606 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-19 18:47:13,606 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-19 18:47:13,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:47:13,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1421271829, now seen corresponding path program 1 times [2020-10-19 18:47:13,607 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:47:13,608 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067284009] [2020-10-19 18:47:13,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:47:13,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:47:13,650 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-19 18:47:13,651 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067284009] [2020-10-19 18:47:13,651 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1540742543] [2020-10-19 18:47:13,651 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-19 18:47:13,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:47:13,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-19 18:47:13,693 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:47:13,723 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-19 18:47:13,724 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 18:47:13,724 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2020-10-19 18:47:13,724 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577411323] [2020-10-19 18:47:13,725 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 18:47:13,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:47:13,725 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 2 times [2020-10-19 18:47:13,726 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:47:13,726 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521938484] [2020-10-19 18:47:13,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:47:13,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:47:13,732 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:47:13,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:47:13,737 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:47:13,740 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:47:13,816 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 18:47:13,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-19 18:47:13,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-19 18:47:13,817 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. cyclomatic complexity: 7 Second operand 7 states. [2020-10-19 18:47:13,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 18:47:13,891 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2020-10-19 18:47:13,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-19 18:47:13,892 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 36 transitions. [2020-10-19 18:47:13,894 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-19 18:47:13,894 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 25 states and 34 transitions. [2020-10-19 18:47:13,895 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2020-10-19 18:47:13,895 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2020-10-19 18:47:13,895 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 34 transitions. [2020-10-19 18:47:13,895 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 18:47:13,895 INFO L691 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2020-10-19 18:47:13,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 34 transitions. [2020-10-19 18:47:13,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 17. [2020-10-19 18:47:13,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-10-19 18:47:13,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2020-10-19 18:47:13,898 INFO L714 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2020-10-19 18:47:13,898 INFO L594 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2020-10-19 18:47:13,898 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-19 18:47:13,898 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 23 transitions. [2020-10-19 18:47:13,899 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-19 18:47:13,899 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:47:13,899 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:47:13,899 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2020-10-19 18:47:13,899 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-19 18:47:13,900 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-19 18:47:13,900 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-19 18:47:13,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:47:13,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1373641048, now seen corresponding path program 2 times [2020-10-19 18:47:13,900 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:47:13,901 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981895442] [2020-10-19 18:47:13,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:47:13,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:47:13,914 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:47:13,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:47:13,926 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:47:13,930 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:47:13,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:47:13,931 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 3 times [2020-10-19 18:47:13,931 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:47:13,931 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960387441] [2020-10-19 18:47:13,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:47:13,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:47:13,937 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:47:13,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:47:13,940 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:47:13,942 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:47:13,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:47:13,943 INFO L82 PathProgramCache]: Analyzing trace with hash -307910395, now seen corresponding path program 1 times [2020-10-19 18:47:13,943 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:47:13,943 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021545565] [2020-10-19 18:47:13,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:47:13,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:47:14,185 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-19 18:47:14,188 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021545565] [2020-10-19 18:47:14,188 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [909692155] [2020-10-19 18:47:14,188 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-19 18:47:14,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:47:14,238 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-19 18:47:14,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:47:14,351 INFO L350 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2020-10-19 18:47:14,352 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-19 18:47:14,354 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-19 18:47:14,358 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 18:47:14,358 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-19 18:47:14,359 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:3 [2020-10-19 18:47:14,369 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-19 18:47:14,370 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 18:47:14,370 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 13 [2020-10-19 18:47:14,370 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214663784] [2020-10-19 18:47:14,453 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 18:47:14,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-19 18:47:14,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2020-10-19 18:47:14,454 INFO L87 Difference]: Start difference. First operand 17 states and 23 transitions. cyclomatic complexity: 8 Second operand 13 states. [2020-10-19 18:47:14,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 18:47:14,559 INFO L93 Difference]: Finished difference Result 37 states and 50 transitions. [2020-10-19 18:47:14,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-19 18:47:14,560 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 50 transitions. [2020-10-19 18:47:14,561 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-10-19 18:47:14,564 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 37 states and 50 transitions. [2020-10-19 18:47:14,564 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2020-10-19 18:47:14,564 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2020-10-19 18:47:14,564 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 50 transitions. [2020-10-19 18:47:14,564 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 18:47:14,565 INFO L691 BuchiCegarLoop]: Abstraction has 37 states and 50 transitions. [2020-10-19 18:47:14,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 50 transitions. [2020-10-19 18:47:14,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 26. [2020-10-19 18:47:14,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-10-19 18:47:14,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2020-10-19 18:47:14,568 INFO L714 BuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2020-10-19 18:47:14,568 INFO L594 BuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2020-10-19 18:47:14,569 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-10-19 18:47:14,569 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 35 transitions. [2020-10-19 18:47:14,569 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-19 18:47:14,570 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:47:14,570 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:47:14,570 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 18:47:14,570 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-19 18:47:14,571 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-19 18:47:14,571 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-19 18:47:14,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:47:14,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1371794006, now seen corresponding path program 2 times [2020-10-19 18:47:14,571 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:47:14,572 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563982425] [2020-10-19 18:47:14,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:47:14,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:47:14,584 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:47:14,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:47:14,593 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:47:14,597 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:47:14,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:47:14,598 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 4 times [2020-10-19 18:47:14,598 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:47:14,598 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751570997] [2020-10-19 18:47:14,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:47:14,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:47:14,603 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:47:14,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:47:14,606 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:47:14,608 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:47:14,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:47:14,609 INFO L82 PathProgramCache]: Analyzing trace with hash 501436231, now seen corresponding path program 3 times [2020-10-19 18:47:14,609 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:47:14,609 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739685978] [2020-10-19 18:47:14,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:47:14,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:47:14,635 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:47:14,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:47:14,662 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:47:14,672 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:47:15,206 WARN L193 SmtUtils]: Spent 437.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 97 [2020-10-19 18:47:15,296 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 18:47:15,296 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 18:47:15,296 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 18:47:15,297 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 18:47:15,297 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 18:47:15,297 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:47:15,297 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 18:47:15,297 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 18:47:15,297 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-2.i_Iteration7_Lasso [2020-10-19 18:47:15,297 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 18:47:15,297 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 18:47:15,301 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-19 18:47:15,308 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-19 18:47:15,320 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-19 18:47:15,324 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-19 18:47:15,497 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2020-10-19 18:47:15,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-19 18:47:15,581 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-19 18:47:15,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-19 18:47:15,586 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-19 18:47:15,589 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-19 18:47:15,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-19 18:47:15,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-19 18:47:15,594 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-19 18:47:15,596 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-19 18:47:15,598 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-19 18:47:15,925 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 18:47:15,925 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-19 18:47:15,928 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-19 18:47:15,929 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:47:15,929 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:47:15,929 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:47:15,929 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:47:15,929 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:47:15,930 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:47:15,930 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:47:15,931 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:47:15,953 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-19 18:47:15,954 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:47:15,954 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:47:15,955 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:47:15,955 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:47:15,956 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:47:15,956 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:47:15,959 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-19 18:47:15,981 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-19 18:47:15,983 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:47:15,983 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:47:15,983 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:47:15,983 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:47:15,985 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:47:15,985 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:47:15,993 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-19 18:47:16,014 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-19 18:47:16,015 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:47:16,015 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:47:16,015 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:47:16,015 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:47:16,019 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:47:16,019 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:47:16,027 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) [2020-10-19 18:47:16,069 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-19 18:47:16,071 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:47:16,072 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:47:16,072 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:47:16,072 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:47:16,079 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:47:16,079 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:47:16,098 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-19 18:47:16,138 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2020-10-19 18:47:16,138 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-19 18:47:16,146 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-19 18:47:16,151 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-10-19 18:47:16,152 INFO L510 LassoAnalysis]: Proved termination. [2020-10-19 18:47:16,152 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sort_~i~0, v_rep(select #length ULTIMATE.start_main_#t~malloc9.base)_3) = -4*ULTIMATE.start_sort_~i~0 + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc9.base)_3 Supporting invariants [1*ULTIMATE.start_sort_~x.offset >= 0] [2020-10-19 18:47:16,202 INFO L297 tatePredicateManager]: 6 out of 8 supporting invariants were superfluous and have been removed [2020-10-19 18:47:16,206 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-19 18:47:16,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:47:16,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:47:16,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-19 18:47:16,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:47:16,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:47:16,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-19 18:47:16,306 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:47:16,323 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-19 18:47:16,324 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-19 18:47:16,324 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 11 Second operand 6 states. [2020-10-19 18:47:16,383 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-19 18:47:16,383 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-19 18:47:16,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-19 18:47:16,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2020-10-19 18:47:16,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 14 letters. Loop has 3 letters. [2020-10-19 18:47:16,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:47:16,384 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-10-19 18:47:16,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:47:16,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:47:16,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-19 18:47:16,427 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:47:16,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:47:16,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-19 18:47:16,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:47:16,496 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-19 18:47:16,496 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-19 18:47:16,496 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 11 Second operand 6 states. [2020-10-19 18:47:16,541 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-19 18:47:16,544 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-19 18:47:16,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-19 18:47:16,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2020-10-19 18:47:16,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 14 letters. Loop has 3 letters. [2020-10-19 18:47:16,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:47:16,545 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-10-19 18:47:16,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:47:16,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:47:16,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-19 18:47:16,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:47:16,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:47:16,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-19 18:47:16,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:47:16,658 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-19 18:47:16,659 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-19 18:47:16,659 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 11 Second operand 6 states. [2020-10-19 18:47:16,738 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-19 18:47:16,741 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-19 18:47:16,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-19 18:47:16,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 23 transitions. [2020-10-19 18:47:16,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 23 transitions. Stem has 14 letters. Loop has 3 letters. [2020-10-19 18:47:16,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:47:16,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 23 transitions. Stem has 17 letters. Loop has 3 letters. [2020-10-19 18:47:16,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:47:16,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 23 transitions. Stem has 14 letters. Loop has 6 letters. [2020-10-19 18:47:16,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:47:16,744 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 63 transitions. [2020-10-19 18:47:16,745 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-19 18:47:16,745 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 0 states and 0 transitions. [2020-10-19 18:47:16,745 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-10-19 18:47:16,746 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-10-19 18:47:16,746 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-10-19 18:47:16,746 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 18:47:16,746 INFO L691 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-19 18:47:16,746 INFO L714 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-19 18:47:16,746 INFO L594 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-19 18:47:16,746 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-10-19 18:47:16,746 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-10-19 18:47:16,746 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-19 18:47:16,746 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-10-19 18:47:16,753 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 19.10 06:47:16 BoogieIcfgContainer [2020-10-19 18:47:16,753 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-19 18:47:16,753 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-19 18:47:16,753 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-19 18:47:16,754 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-19 18:47:16,754 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 06:47:08" (3/4) ... [2020-10-19 18:47:16,757 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-19 18:47:16,757 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-19 18:47:16,759 INFO L168 Benchmark]: Toolchain (without parser) took 8921.65 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 316.7 MB). Free memory was 960.0 MB in the beginning and 1.0 GB in the end (delta: -62.3 MB). Peak memory consumption was 254.4 MB. Max. memory is 11.5 GB. [2020-10-19 18:47:16,759 INFO L168 Benchmark]: CDTParser took 1.03 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-10-19 18:47:16,760 INFO L168 Benchmark]: CACSL2BoogieTranslator took 582.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.3 MB). Free memory was 954.6 MB in the beginning and 1.1 GB in the end (delta: -151.3 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. [2020-10-19 18:47:16,760 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.43 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-10-19 18:47:16,761 INFO L168 Benchmark]: Boogie Preprocessor took 25.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2020-10-19 18:47:16,762 INFO L168 Benchmark]: RCFGBuilder took 335.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. [2020-10-19 18:47:16,762 INFO L168 Benchmark]: BuchiAutomizer took 7918.74 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 191.4 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 58.1 MB). Peak memory consumption was 249.5 MB. Max. memory is 11.5 GB. [2020-10-19 18:47:16,763 INFO L168 Benchmark]: Witness Printer took 4.24 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-10-19 18:47:16,766 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.03 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 582.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.3 MB). Free memory was 954.6 MB in the beginning and 1.1 GB in the end (delta: -151.3 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 44.43 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 335.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7918.74 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 191.4 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 58.1 MB). Peak memory consumption was 249.5 MB. Max. memory is 11.5 GB. * Witness Printer took 4.24 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #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 -2 * pass + unknown-#length-unknown[x] 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 -4 * i + unknown-#length-unknown[__builtin_alloca (array_size * sizeof(int))] 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.8s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 6.6s. Construction of modules took 0.2s. 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.2s 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: 23ms 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...