./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/java_BubbleSort-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_8fd1b635-d28e-4649-a370-ca6bef1577c3/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_8fd1b635-d28e-4649-a370-ca6bef1577c3/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_8fd1b635-d28e-4649-a370-ca6bef1577c3/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_8fd1b635-d28e-4649-a370-ca6bef1577c3/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/java_BubbleSort-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_8fd1b635-d28e-4649-a370-ca6bef1577c3/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_8fd1b635-d28e-4649-a370-ca6bef1577c3/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash af6d3df1a288680024c52d2d61adb02fdd276fce ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 12:17:59,436 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 12:17:59,438 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 12:17:59,446 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 12:17:59,447 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 12:17:59,447 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 12:17:59,448 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 12:17:59,450 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 12:17:59,451 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 12:17:59,452 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 12:17:59,452 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 12:17:59,453 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 12:17:59,453 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 12:17:59,454 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 12:17:59,455 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 12:17:59,455 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 12:17:59,456 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 12:17:59,457 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 12:17:59,459 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 12:17:59,460 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 12:17:59,461 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 12:17:59,462 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 12:17:59,463 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 12:17:59,464 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 12:17:59,464 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 12:17:59,464 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 12:17:59,465 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 12:17:59,466 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 12:17:59,466 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 12:17:59,467 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 12:17:59,467 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 12:17:59,468 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 12:17:59,468 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 12:17:59,468 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 12:17:59,469 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 12:17:59,469 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 12:17:59,470 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_8fd1b635-d28e-4649-a370-ca6bef1577c3/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-18 12:17:59,481 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 12:17:59,481 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 12:17:59,482 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 12:17:59,482 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 12:17:59,482 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 12:17:59,482 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 12:17:59,483 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 12:17:59,483 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 12:17:59,483 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 12:17:59,483 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 12:17:59,483 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 12:17:59,483 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 12:17:59,483 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 12:17:59,484 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 12:17:59,484 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 12:17:59,484 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 12:17:59,484 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 12:17:59,484 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 12:17:59,484 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 12:17:59,484 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 12:17:59,485 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 12:17:59,485 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 12:17:59,485 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 12:17:59,485 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 12:17:59,485 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 12:17:59,485 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 12:17:59,485 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 12:17:59,486 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 12:17:59,486 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 12:17:59,487 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_8fd1b635-d28e-4649-a370-ca6bef1577c3/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> af6d3df1a288680024c52d2d61adb02fdd276fce [2018-11-18 12:17:59,511 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 12:17:59,521 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 12:17:59,524 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 12:17:59,525 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 12:17:59,525 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 12:17:59,526 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_8fd1b635-d28e-4649-a370-ca6bef1577c3/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/java_BubbleSort-alloca_true-termination.c.i [2018-11-18 12:17:59,573 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8fd1b635-d28e-4649-a370-ca6bef1577c3/bin-2019/uautomizer/data/8f512bf7b/65fc480d20ec4e78b378b8df5698ab91/FLAG924d9547f [2018-11-18 12:17:59,905 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 12:17:59,906 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_8fd1b635-d28e-4649-a370-ca6bef1577c3/sv-benchmarks/c/termination-memory-alloca/java_BubbleSort-alloca_true-termination.c.i [2018-11-18 12:17:59,914 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8fd1b635-d28e-4649-a370-ca6bef1577c3/bin-2019/uautomizer/data/8f512bf7b/65fc480d20ec4e78b378b8df5698ab91/FLAG924d9547f [2018-11-18 12:17:59,922 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_8fd1b635-d28e-4649-a370-ca6bef1577c3/bin-2019/uautomizer/data/8f512bf7b/65fc480d20ec4e78b378b8df5698ab91 [2018-11-18 12:17:59,924 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 12:17:59,925 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 12:17:59,926 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 12:17:59,926 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 12:17:59,928 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 12:17:59,929 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 12:17:59" (1/1) ... [2018-11-18 12:17:59,931 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7be20a0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:17:59, skipping insertion in model container [2018-11-18 12:17:59,931 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 12:17:59" (1/1) ... [2018-11-18 12:17:59,937 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 12:17:59,963 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 12:18:00,154 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 12:18:00,160 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 12:18:00,186 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 12:18:00,263 INFO L195 MainTranslator]: Completed translation [2018-11-18 12:18:00,263 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:18:00 WrapperNode [2018-11-18 12:18:00,263 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 12:18:00,264 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 12:18:00,264 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 12:18:00,264 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 12:18:00,270 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:18:00" (1/1) ... [2018-11-18 12:18:00,278 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:18:00" (1/1) ... [2018-11-18 12:18:00,292 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 12:18:00,292 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 12:18:00,292 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 12:18:00,292 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 12:18:00,298 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:18:00" (1/1) ... [2018-11-18 12:18:00,298 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:18:00" (1/1) ... [2018-11-18 12:18:00,300 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:18:00" (1/1) ... [2018-11-18 12:18:00,300 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:18:00" (1/1) ... [2018-11-18 12:18:00,304 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:18:00" (1/1) ... [2018-11-18 12:18:00,308 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:18:00" (1/1) ... [2018-11-18 12:18:00,309 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:18:00" (1/1) ... [2018-11-18 12:18:00,311 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 12:18:00,311 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 12:18:00,311 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 12:18:00,311 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 12:18:00,312 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:18:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8fd1b635-d28e-4649-a370-ca6bef1577c3/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:18:00,353 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 12:18:00,353 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 12:18:00,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 12:18:00,354 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 12:18:00,354 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 12:18:00,354 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 12:18:00,511 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 12:18:00,511 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:18:00 BoogieIcfgContainer [2018-11-18 12:18:00,511 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 12:18:00,512 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 12:18:00,512 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 12:18:00,515 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 12:18:00,516 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 12:18:00,516 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 12:17:59" (1/3) ... [2018-11-18 12:18:00,517 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2a4e4cc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 12:18:00, skipping insertion in model container [2018-11-18 12:18:00,517 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 12:18:00,517 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:18:00" (2/3) ... [2018-11-18 12:18:00,517 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2a4e4cc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 12:18:00, skipping insertion in model container [2018-11-18 12:18:00,517 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 12:18:00,518 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:18:00" (3/3) ... [2018-11-18 12:18:00,519 INFO L375 chiAutomizerObserver]: Analyzing ICFG java_BubbleSort-alloca_true-termination.c.i [2018-11-18 12:18:00,562 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 12:18:00,562 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 12:18:00,562 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 12:18:00,563 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 12:18:00,563 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 12:18:00,563 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 12:18:00,563 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 12:18:00,563 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 12:18:00,563 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 12:18:00,572 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2018-11-18 12:18:00,590 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-18 12:18:00,590 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:18:00,591 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:18:00,596 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-18 12:18:00,596 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 12:18:00,597 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 12:18:00,597 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2018-11-18 12:18:00,598 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-18 12:18:00,598 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:18:00,598 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:18:00,598 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-18 12:18:00,598 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 12:18:00,605 INFO L794 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 4#L558true assume !(main_~array_size~0 < 1); 9#L558-2true call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;assume { :begin_inline_sort } true;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; 8#L550-4true [2018-11-18 12:18:00,605 INFO L796 eck$LassoCheckResult]: Loop: 8#L550-4true assume true; 17#L550-1true assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 6#L551-4true assume !true; 7#L550-3true sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 8#L550-4true [2018-11-18 12:18:00,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:18:00,610 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2018-11-18 12:18:00,612 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:18:00,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:18:00,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:18:00,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:18:00,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:18:00,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:18:00,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:18:00,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:18:00,696 INFO L82 PathProgramCache]: Analyzing trace with hash 1329256, now seen corresponding path program 1 times [2018-11-18 12:18:00,696 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:18:00,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:18:00,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:18:00,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:18:00,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:18:00,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:18:00,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:18:00,715 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:18:00,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 12:18:00,717 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 12:18:00,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 12:18:00,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 12:18:00,727 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 2 states. [2018-11-18 12:18:00,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:18:00,731 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2018-11-18 12:18:00,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 12:18:00,733 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 18 transitions. [2018-11-18 12:18:00,734 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-18 12:18:00,736 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 11 states and 14 transitions. [2018-11-18 12:18:00,737 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-18 12:18:00,737 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-18 12:18:00,737 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2018-11-18 12:18:00,738 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 12:18:00,738 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-11-18 12:18:00,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2018-11-18 12:18:00,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-11-18 12:18:00,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-18 12:18:00,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2018-11-18 12:18:00,755 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-11-18 12:18:00,755 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-11-18 12:18:00,755 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 12:18:00,755 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2018-11-18 12:18:00,756 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-18 12:18:00,756 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:18:00,756 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:18:00,756 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-18 12:18:00,756 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 12:18:00,757 INFO L794 eck$LassoCheckResult]: Stem: 45#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 40#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 41#L558 assume !(main_~array_size~0 < 1); 42#L558-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;assume { :begin_inline_sort } true;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; 44#L550-4 [2018-11-18 12:18:00,757 INFO L796 eck$LassoCheckResult]: Loop: 44#L550-4 assume true; 48#L550-1 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 39#L551-4 assume true; 46#L551-1 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 43#L550-3 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 44#L550-4 [2018-11-18 12:18:00,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:18:00,757 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2018-11-18 12:18:00,757 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:18:00,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:18:00,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:18:00,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:18:00,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:18:00,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:18:00,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:18:00,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:18:00,772 INFO L82 PathProgramCache]: Analyzing trace with hash 41193117, now seen corresponding path program 1 times [2018-11-18 12:18:00,772 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:18:00,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:18:00,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:18:00,773 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:18:00,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:18:00,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:18:00,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:18:00,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:18:00,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 12:18:00,796 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 12:18:00,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 12:18:00,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:18:00,796 INFO L87 Difference]: Start difference. First operand 11 states and 14 transitions. cyclomatic complexity: 4 Second operand 3 states. [2018-11-18 12:18:00,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:18:00,817 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2018-11-18 12:18:00,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 12:18:00,818 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 16 transitions. [2018-11-18 12:18:00,818 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-18 12:18:00,818 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 16 transitions. [2018-11-18 12:18:00,819 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-18 12:18:00,819 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-18 12:18:00,819 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 16 transitions. [2018-11-18 12:18:00,819 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 12:18:00,819 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2018-11-18 12:18:00,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 16 transitions. [2018-11-18 12:18:00,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-18 12:18:00,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-18 12:18:00,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2018-11-18 12:18:00,820 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2018-11-18 12:18:00,820 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2018-11-18 12:18:00,820 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 12:18:00,821 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 16 transitions. [2018-11-18 12:18:00,821 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-18 12:18:00,821 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:18:00,821 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:18:00,821 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-18 12:18:00,821 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:18:00,822 INFO L794 eck$LassoCheckResult]: Stem: 77#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 70#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 71#L558 assume !(main_~array_size~0 < 1); 72#L558-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;assume { :begin_inline_sort } true;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; 76#L550-4 [2018-11-18 12:18:00,822 INFO L796 eck$LassoCheckResult]: Loop: 76#L550-4 assume true; 79#L550-1 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 73#L551-4 assume true; 74#L551-1 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); 78#L552 assume !(sort_#t~mem4 > sort_#t~mem5);havoc sort_#t~mem4;havoc sort_#t~mem5; 68#L551-3 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 69#L551-4 assume true; 80#L551-1 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 75#L550-3 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 76#L550-4 [2018-11-18 12:18:00,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:18:00,822 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 3 times [2018-11-18 12:18:00,822 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:18:00,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:18:00,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:18:00,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:18:00,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:18:00,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:18:00,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:18:00,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:18:00,832 INFO L82 PathProgramCache]: Analyzing trace with hash -2058950986, now seen corresponding path program 1 times [2018-11-18 12:18:00,832 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:18:00,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:18:00,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:18:00,833 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:18:00,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:18:00,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:18:00,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:18:00,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:18:00,846 INFO L82 PathProgramCache]: Analyzing trace with hash 722757458, now seen corresponding path program 1 times [2018-11-18 12:18:00,846 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:18:00,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:18:00,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:18:00,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:18:00,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:18:00,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:18:00,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:18:00,994 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2018-11-18 12:18:01,105 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 12:18:01,106 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 12:18:01,106 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 12:18:01,106 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 12:18:01,106 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 12:18:01,106 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:18:01,106 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 12:18:01,106 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 12:18:01,107 INFO L131 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca_true-termination.c.i_Iteration3_Lasso [2018-11-18 12:18:01,107 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 12:18:01,107 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 12:18:01,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:18:01,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:18:01,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:18:01,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:18:01,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:18:01,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:18:01,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:18:01,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:18:01,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:18:01,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:18:01,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:18:01,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:18:01,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:18:01,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:18:01,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:18:01,532 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 12:18:01,535 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 12:18:01,537 INFO L122 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 [2018-11-18 12:18:01,538 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:18:01,538 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:18:01,538 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:18:01,539 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:18:01,539 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:18:01,540 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:18:01,541 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:18:01,542 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:18:01,543 INFO L122 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 [2018-11-18 12:18:01,543 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:18:01,543 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:18:01,543 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:18:01,543 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:18:01,543 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:18:01,544 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:18:01,544 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:18:01,544 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:18:01,544 INFO L122 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 [2018-11-18 12:18:01,545 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:18:01,545 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:18:01,545 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:18:01,545 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:18:01,546 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:18:01,547 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:18:01,549 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:18:01,549 INFO L122 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 [2018-11-18 12:18:01,549 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:18:01,550 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:18:01,550 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:18:01,550 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:18:01,551 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:18:01,551 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:18:01,555 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:18:01,556 INFO L122 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 [2018-11-18 12:18:01,556 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:18:01,556 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:18:01,557 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:18:01,557 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:18:01,558 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:18:01,558 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:18:01,561 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:18:01,561 INFO L122 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 [2018-11-18 12:18:01,562 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:18:01,562 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:18:01,562 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:18:01,562 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:18:01,562 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:18:01,563 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:18:01,563 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:18:01,563 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:18:01,564 INFO L122 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 [2018-11-18 12:18:01,564 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:18:01,564 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:18:01,565 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:18:01,565 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:18:01,565 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:18:01,565 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:18:01,565 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:18:01,566 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:18:01,566 INFO L122 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 [2018-11-18 12:18:01,567 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:18:01,567 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:18:01,567 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:18:01,567 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:18:01,567 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:18:01,568 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:18:01,568 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:18:01,569 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:18:01,569 INFO L122 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 [2018-11-18 12:18:01,570 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:18:01,570 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:18:01,570 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:18:01,570 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:18:01,570 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:18:01,570 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:18:01,571 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:18:01,571 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:18:01,572 INFO L122 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 [2018-11-18 12:18:01,572 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:18:01,572 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:18:01,573 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:18:01,573 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:18:01,573 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:18:01,573 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:18:01,573 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:18:01,574 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:18:01,575 INFO L122 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 [2018-11-18 12:18:01,575 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:18:01,575 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:18:01,575 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:18:01,575 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:18:01,577 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:18:01,577 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:18:01,579 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:18:01,580 INFO L122 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 [2018-11-18 12:18:01,585 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:18:01,585 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:18:01,585 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:18:01,586 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:18:01,586 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:18:01,586 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:18:01,586 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:18:01,587 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:18:01,587 INFO L122 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 [2018-11-18 12:18:01,587 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:18:01,588 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:18:01,588 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:18:01,588 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:18:01,592 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:18:01,592 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:18:01,634 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 12:18:01,657 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 12:18:01,657 INFO L444 ModelExtractionUtils]: 33 out of 37 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 12:18:01,660 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 12:18:01,661 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 12:18:01,661 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 12:18:01,662 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sort_~pass~0, ULTIMATE.start_sort_~n) = -1*ULTIMATE.start_sort_~pass~0 + 1*ULTIMATE.start_sort_~n Supporting invariants [] [2018-11-18 12:18:01,686 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-11-18 12:18:01,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:18:01,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:18:01,708 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:18:01,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:18:01,719 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:18:01,731 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 12:18:01,733 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 [2018-11-18 12:18:01,734 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 16 transitions. cyclomatic complexity: 4 Second operand 4 states. [2018-11-18 12:18:01,758 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 16 transitions. cyclomatic complexity: 4. Second operand 4 states. Result 22 states and 28 transitions. Complement of second has 6 states. [2018-11-18 12:18:01,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 12:18:01,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 12:18:01,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2018-11-18 12:18:01,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 4 letters. Loop has 9 letters. [2018-11-18 12:18:01,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:18:01,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 13 letters. Loop has 9 letters. [2018-11-18 12:18:01,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:18:01,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 4 letters. Loop has 18 letters. [2018-11-18 12:18:01,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:18:01,762 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 28 transitions. [2018-11-18 12:18:01,763 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 12:18:01,763 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 21 states and 27 transitions. [2018-11-18 12:18:01,763 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-18 12:18:01,764 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-11-18 12:18:01,764 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 27 transitions. [2018-11-18 12:18:01,764 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:18:01,764 INFO L705 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2018-11-18 12:18:01,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 27 transitions. [2018-11-18 12:18:01,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2018-11-18 12:18:01,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-18 12:18:01,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2018-11-18 12:18:01,766 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2018-11-18 12:18:01,766 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2018-11-18 12:18:01,766 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 12:18:01,766 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 25 transitions. [2018-11-18 12:18:01,766 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 12:18:01,767 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:18:01,767 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:18:01,767 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-18 12:18:01,767 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 12:18:01,767 INFO L794 eck$LassoCheckResult]: Stem: 193#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 185#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 186#L558 assume !(main_~array_size~0 < 1); 187#L558-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;assume { :begin_inline_sort } true;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; 196#L550-4 assume true; 197#L550-1 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 182#L551-4 [2018-11-18 12:18:01,767 INFO L796 eck$LassoCheckResult]: Loop: 182#L551-4 assume true; 188#L551-1 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); 194#L552 assume !(sort_#t~mem4 > sort_#t~mem5);havoc sort_#t~mem4;havoc sort_#t~mem5; 181#L551-3 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 182#L551-4 [2018-11-18 12:18:01,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:18:01,768 INFO L82 PathProgramCache]: Analyzing trace with hash 889568330, now seen corresponding path program 1 times [2018-11-18 12:18:01,768 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:18:01,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:18:01,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:18:01,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:18:01,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:18:01,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:18:01,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:18:01,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:18:01,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1605896, now seen corresponding path program 1 times [2018-11-18 12:18:01,779 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:18:01,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:18:01,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:18:01,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:18:01,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:18:01,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:18:01,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:18:01,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:18:01,788 INFO L82 PathProgramCache]: Analyzing trace with hash -2015039279, now seen corresponding path program 1 times [2018-11-18 12:18:01,788 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:18:01,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:18:01,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:18:01,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:18:01,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:18:01,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:18:01,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:18:01,978 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 12:18:01,978 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 12:18:01,978 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 12:18:01,979 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 12:18:01,979 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 12:18:01,979 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:18:01,979 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 12:18:01,979 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 12:18:01,979 INFO L131 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca_true-termination.c.i_Iteration4_Lasso [2018-11-18 12:18:01,979 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 12:18:01,979 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 12:18:01,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:18:01,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:18:01,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:18:01,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:18:01,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:18:02,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:18:02,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:18:02,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:18:02,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:18:02,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:18:02,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:18:02,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:18:02,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:18:02,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:18:02,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:18:02,298 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 12:18:02,298 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 12:18:02,298 INFO L122 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 [2018-11-18 12:18:02,299 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:18:02,299 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:18:02,299 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:18:02,300 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:18:02,300 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:18:02,300 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:18:02,301 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:18:02,301 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:18:02,301 INFO L122 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 [2018-11-18 12:18:02,303 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:18:02,303 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:18:02,303 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:18:02,303 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:18:02,303 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:18:02,304 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:18:02,304 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:18:02,304 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:18:02,305 INFO L122 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 [2018-11-18 12:18:02,305 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:18:02,305 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:18:02,306 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:18:02,306 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:18:02,306 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:18:02,306 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:18:02,306 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:18:02,307 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:18:02,307 INFO L122 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 [2018-11-18 12:18:02,307 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:18:02,307 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:18:02,308 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:18:02,308 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:18:02,308 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:18:02,308 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:18:02,309 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:18:02,309 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:18:02,310 INFO L122 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 [2018-11-18 12:18:02,310 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:18:02,310 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:18:02,310 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:18:02,310 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:18:02,311 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:18:02,311 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:18:02,311 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:18:02,312 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:18:02,312 INFO L122 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 [2018-11-18 12:18:02,312 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:18:02,313 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:18:02,313 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:18:02,313 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:18:02,314 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:18:02,314 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:18:02,316 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:18:02,316 INFO L122 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 [2018-11-18 12:18:02,316 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:18:02,316 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:18:02,316 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:18:02,317 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:18:02,318 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:18:02,318 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:18:02,323 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:18:02,323 INFO L122 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 [2018-11-18 12:18:02,324 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:18:02,324 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 12:18:02,324 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:18:02,324 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:18:02,326 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 12:18:02,326 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:18:02,333 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:18:02,333 INFO L122 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 [2018-11-18 12:18:02,333 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:18:02,334 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:18:02,334 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:18:02,334 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:18:02,336 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:18:02,337 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:18:02,355 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 12:18:02,373 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-18 12:18:02,373 INFO L444 ModelExtractionUtils]: 29 out of 37 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-18 12:18:02,374 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 12:18:02,374 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 12:18:02,375 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 12:18:02,375 INFO L520 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 [] [2018-11-18 12:18:02,396 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-11-18 12:18:02,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:18:02,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:18:02,417 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:18:02,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:18:02,423 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:18:02,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:18:02,438 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 [2018-11-18 12:18:02,438 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 25 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-11-18 12:18:02,460 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 25 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 47 states and 61 transitions. Complement of second has 7 states. [2018-11-18 12:18:02,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 12:18:02,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 12:18:02,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2018-11-18 12:18:02,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 6 letters. Loop has 4 letters. [2018-11-18 12:18:02,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:18:02,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 10 letters. Loop has 4 letters. [2018-11-18 12:18:02,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:18:02,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 6 letters. Loop has 8 letters. [2018-11-18 12:18:02,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:18:02,463 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 61 transitions. [2018-11-18 12:18:02,464 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 12:18:02,465 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 31 states and 39 transitions. [2018-11-18 12:18:02,465 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-18 12:18:02,465 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-18 12:18:02,465 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 39 transitions. [2018-11-18 12:18:02,466 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:18:02,466 INFO L705 BuchiCegarLoop]: Abstraction has 31 states and 39 transitions. [2018-11-18 12:18:02,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 39 transitions. [2018-11-18 12:18:02,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 26. [2018-11-18 12:18:02,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-18 12:18:02,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2018-11-18 12:18:02,468 INFO L728 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2018-11-18 12:18:02,468 INFO L608 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2018-11-18 12:18:02,468 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 12:18:02,468 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 33 transitions. [2018-11-18 12:18:02,469 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 12:18:02,470 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:18:02,470 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:18:02,470 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:18:02,470 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 12:18:02,470 INFO L794 eck$LassoCheckResult]: Stem: 324#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 317#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 318#L558 assume !(main_~array_size~0 < 1); 323#L558-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;assume { :begin_inline_sort } true;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; 332#L550-4 assume true; 333#L550-1 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 342#L551-4 assume true; 339#L551-1 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); 341#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); 340#L551-3 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 338#L551-4 assume true; 336#L551-1 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 328#L550-3 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 329#L550-4 assume true; 334#L550-1 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 320#L551-4 [2018-11-18 12:18:02,471 INFO L796 eck$LassoCheckResult]: Loop: 320#L551-4 assume true; 325#L551-1 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); 330#L552 assume !(sort_#t~mem4 > sort_#t~mem5);havoc sort_#t~mem4;havoc sort_#t~mem5; 319#L551-3 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 320#L551-4 [2018-11-18 12:18:02,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:18:02,471 INFO L82 PathProgramCache]: Analyzing trace with hash 1305175541, now seen corresponding path program 1 times [2018-11-18 12:18:02,471 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:18:02,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:18:02,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:18:02,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:18:02,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:18:02,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:18:02,528 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:18:02,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:18:02,529 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8fd1b635-d28e-4649-a370-ca6bef1577c3/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 12:18:02,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:18:02,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:18:02,558 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:18:02,578 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:18:02,604 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 12:18:02,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-18 12:18:02,604 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 12:18:02,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:18:02,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1605896, now seen corresponding path program 2 times [2018-11-18 12:18:02,605 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:18:02,605 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:18:02,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:18:02,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:18:02,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:18:02,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:18:02,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:18:02,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 12:18:02,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-18 12:18:02,651 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. cyclomatic complexity: 10 Second operand 7 states. [2018-11-18 12:18:02,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:18:02,685 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2018-11-18 12:18:02,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 12:18:02,686 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 66 transitions. [2018-11-18 12:18:02,687 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 12:18:02,687 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 47 states and 60 transitions. [2018-11-18 12:18:02,688 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2018-11-18 12:18:02,688 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2018-11-18 12:18:02,688 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 60 transitions. [2018-11-18 12:18:02,688 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:18:02,688 INFO L705 BuchiCegarLoop]: Abstraction has 47 states and 60 transitions. [2018-11-18 12:18:02,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 60 transitions. [2018-11-18 12:18:02,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 34. [2018-11-18 12:18:02,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-18 12:18:02,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2018-11-18 12:18:02,691 INFO L728 BuchiCegarLoop]: Abstraction has 34 states and 43 transitions. [2018-11-18 12:18:02,691 INFO L608 BuchiCegarLoop]: Abstraction has 34 states and 43 transitions. [2018-11-18 12:18:02,692 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-18 12:18:02,692 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 43 transitions. [2018-11-18 12:18:02,692 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 12:18:02,692 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:18:02,692 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:18:02,693 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-11-18 12:18:02,693 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 12:18:02,693 INFO L794 eck$LassoCheckResult]: Stem: 459#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 456#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 457#L558 assume !(main_~array_size~0 < 1); 458#L558-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;assume { :begin_inline_sort } true;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; 468#L550-4 assume true; 469#L550-1 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 461#L551-4 assume true; 462#L551-1 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); 466#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); 467#L551-3 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 482#L551-4 assume true; 479#L551-1 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); 480#L551-3 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 478#L551-4 assume true; 472#L551-1 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 463#L550-3 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 464#L550-4 assume true; 470#L550-1 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 453#L551-4 [2018-11-18 12:18:02,693 INFO L796 eck$LassoCheckResult]: Loop: 453#L551-4 assume true; 460#L551-1 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); 465#L552 assume !(sort_#t~mem4 > sort_#t~mem5);havoc sort_#t~mem4;havoc sort_#t~mem5; 452#L551-3 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 453#L551-4 [2018-11-18 12:18:02,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:18:02,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1505227724, now seen corresponding path program 2 times [2018-11-18 12:18:02,693 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:18:02,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:18:02,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:18:02,694 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:18:02,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:18:02,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:18:02,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:18:02,711 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:18:02,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1605896, now seen corresponding path program 3 times [2018-11-18 12:18:02,712 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:18:02,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:18:02,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:18:02,713 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:18:02,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:18:02,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:18:02,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:18:02,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:18:02,720 INFO L82 PathProgramCache]: Analyzing trace with hash 298555219, now seen corresponding path program 1 times [2018-11-18 12:18:02,720 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:18:02,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:18:02,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:18:02,721 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:18:02,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:18:02,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:18:02,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:18:03,031 WARN L180 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 100 [2018-11-18 12:18:03,072 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 12:18:03,072 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 12:18:03,072 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 12:18:03,072 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 12:18:03,073 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 12:18:03,073 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:18:03,073 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 12:18:03,073 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 12:18:03,073 INFO L131 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca_true-termination.c.i_Iteration6_Lasso [2018-11-18 12:18:03,073 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 12:18:03,073 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 12:18:03,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:18:03,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:18:03,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:18:03,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:18:03,081 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:18:03,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:18:03,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:18:03,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:18:03,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:18:03,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:18:03,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:18:03,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:18:03,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:18:03,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:18:03,381 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 12:18:03,381 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 12:18:03,381 INFO L122 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 [2018-11-18 12:18:03,382 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:18:03,382 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:18:03,382 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:18:03,382 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:18:03,382 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:18:03,382 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:18:03,383 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:18:03,383 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:18:03,383 INFO L122 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 [2018-11-18 12:18:03,383 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:18:03,384 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:18:03,384 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:18:03,384 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:18:03,384 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:18:03,384 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:18:03,384 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:18:03,384 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:18:03,384 INFO L122 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 [2018-11-18 12:18:03,385 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:18:03,385 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:18:03,385 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:18:03,385 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:18:03,385 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:18:03,385 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:18:03,386 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:18:03,386 INFO L122 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 [2018-11-18 12:18:03,387 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:18:03,387 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:18:03,387 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:18:03,387 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:18:03,387 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:18:03,387 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:18:03,387 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:18:03,388 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:18:03,388 INFO L122 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 [2018-11-18 12:18:03,388 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:18:03,388 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:18:03,389 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:18:03,389 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:18:03,389 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:18:03,389 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:18:03,389 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:18:03,389 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:18:03,390 INFO L122 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 [2018-11-18 12:18:03,390 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:18:03,390 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:18:03,390 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:18:03,390 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:18:03,392 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:18:03,392 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:18:03,402 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 12:18:03,416 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-18 12:18:03,416 INFO L444 ModelExtractionUtils]: 30 out of 37 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-18 12:18:03,416 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 12:18:03,417 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 12:18:03,417 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 12:18:03,417 INFO L520 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 [] [2018-11-18 12:18:03,444 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2018-11-18 12:18:03,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:18:03,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:18:03,480 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:18:03,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:18:03,495 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:18:03,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:18:03,510 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 [2018-11-18 12:18:03,510 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 43 transitions. cyclomatic complexity: 12 Second operand 4 states. [2018-11-18 12:18:03,530 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 43 transitions. cyclomatic complexity: 12. Second operand 4 states. Result 49 states and 62 transitions. Complement of second has 7 states. [2018-11-18 12:18:03,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 12:18:03,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 12:18:03,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2018-11-18 12:18:03,531 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 19 letters. Loop has 4 letters. [2018-11-18 12:18:03,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:18:03,532 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 12:18:03,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:18:03,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:18:03,548 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:18:03,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:18:03,551 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:18:03,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:18:03,557 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-18 12:18:03,557 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 43 transitions. cyclomatic complexity: 12 Second operand 4 states. [2018-11-18 12:18:03,571 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 43 transitions. cyclomatic complexity: 12. Second operand 4 states. Result 49 states and 62 transitions. Complement of second has 7 states. [2018-11-18 12:18:03,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 12:18:03,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 12:18:03,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2018-11-18 12:18:03,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 19 letters. Loop has 4 letters. [2018-11-18 12:18:03,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:18:03,572 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 12:18:03,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:18:03,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:18:03,590 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:18:03,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:18:03,594 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:18:03,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:18:03,600 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-18 12:18:03,600 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 43 transitions. cyclomatic complexity: 12 Second operand 4 states. [2018-11-18 12:18:03,611 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 43 transitions. cyclomatic complexity: 12. Second operand 4 states. Result 56 states and 74 transitions. Complement of second has 6 states. [2018-11-18 12:18:03,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 12:18:03,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 12:18:03,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2018-11-18 12:18:03,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 19 letters. Loop has 4 letters. [2018-11-18 12:18:03,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:18:03,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 23 letters. Loop has 4 letters. [2018-11-18 12:18:03,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:18:03,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 19 letters. Loop has 8 letters. [2018-11-18 12:18:03,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:18:03,613 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 74 transitions. [2018-11-18 12:18:03,614 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 12:18:03,614 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 0 states and 0 transitions. [2018-11-18 12:18:03,614 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 12:18:03,615 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 12:18:03,615 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 12:18:03,615 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 12:18:03,615 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 12:18:03,615 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 12:18:03,615 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 12:18:03,615 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-18 12:18:03,615 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-18 12:18:03,615 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 12:18:03,615 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-18 12:18:03,619 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 12:18:03 BoogieIcfgContainer [2018-11-18 12:18:03,619 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 12:18:03,619 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 12:18:03,619 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 12:18:03,619 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 12:18:03,619 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:18:00" (3/4) ... [2018-11-18 12:18:03,621 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 12:18:03,621 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 12:18:03,622 INFO L168 Benchmark]: Toolchain (without parser) took 3697.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 213.9 MB). Free memory was 951.0 MB in the beginning and 884.9 MB in the end (delta: 66.1 MB). Peak memory consumption was 280.1 MB. Max. memory is 11.5 GB. [2018-11-18 12:18:03,623 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 12:18:03,623 INFO L168 Benchmark]: CACSL2BoogieTranslator took 337.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -174.5 MB). Peak memory consumption was 31.3 MB. Max. memory is 11.5 GB. [2018-11-18 12:18:03,623 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.06 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. [2018-11-18 12:18:03,624 INFO L168 Benchmark]: Boogie Preprocessor took 18.74 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-18 12:18:03,624 INFO L168 Benchmark]: RCFGBuilder took 200.09 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.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2018-11-18 12:18:03,625 INFO L168 Benchmark]: BuchiAutomizer took 3107.03 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 75.0 MB). Free memory was 1.1 GB in the beginning and 884.9 MB in the end (delta: 219.2 MB). Peak memory consumption was 294.2 MB. Max. memory is 11.5 GB. [2018-11-18 12:18:03,625 INFO L168 Benchmark]: Witness Printer took 2.67 ms. Allocated memory is still 1.2 GB. Free memory is still 884.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 12:18:03,628 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 337.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -174.5 MB). Peak memory consumption was 31.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 28.06 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 18.74 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 200.09 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.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3107.03 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 75.0 MB). Free memory was 1.1 GB in the beginning and 884.9 MB in the end (delta: 219.2 MB). Peak memory consumption was 294.2 MB. Max. memory is 11.5 GB. * Witness Printer took 2.67 ms. Allocated memory is still 1.2 GB. Free memory is still 884.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (3 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * pass + n 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 -1 * i + -1 * pass + n and consists of 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.0s and 7 iterations. TraceHistogramMax:3. Analysis of lassos took 2.5s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 20 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 34 states and ocurred in iteration 5. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 2/2 HoareTripleCheckerStatistics: 96 SDtfs, 88 SDslu, 52 SDs, 0 SdLazy, 89 SolverSat, 18 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital157 mio100 ax112 hnf99 lsp85 ukn76 mio100 lsp64 div100 bol100 ite100 ukn100 eq181 hnf88 smp98 dnf100 smp100 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 9ms VariablesStem: 4 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...