./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/java_BubbleSort-alloca-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_c2dee3fd-2af3-470d-8053-060721f65c40/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_c2dee3fd-2af3-470d-8053-060721f65c40/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_c2dee3fd-2af3-470d-8053-060721f65c40/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_c2dee3fd-2af3-470d-8053-060721f65c40/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/java_BubbleSort-alloca-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_c2dee3fd-2af3-470d-8053-060721f65c40/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_c2dee3fd-2af3-470d-8053-060721f65c40/bin/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.24-678e011 [2019-11-20 10:03:55,298 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 10:03:55,300 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 10:03:55,318 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 10:03:55,319 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 10:03:55,320 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 10:03:55,322 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 10:03:55,332 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 10:03:55,337 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 10:03:55,342 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 10:03:55,344 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 10:03:55,346 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 10:03:55,346 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 10:03:55,348 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 10:03:55,350 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 10:03:55,351 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 10:03:55,352 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 10:03:55,353 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 10:03:55,356 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 10:03:55,360 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 10:03:55,364 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 10:03:55,366 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 10:03:55,369 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 10:03:55,370 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 10:03:55,373 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 10:03:55,373 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 10:03:55,374 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 10:03:55,375 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 10:03:55,376 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 10:03:55,377 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 10:03:55,377 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 10:03:55,378 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 10:03:55,379 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 10:03:55,380 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 10:03:55,381 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 10:03:55,381 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 10:03:55,382 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 10:03:55,382 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 10:03:55,382 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 10:03:55,383 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 10:03:55,385 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 10:03:55,385 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_c2dee3fd-2af3-470d-8053-060721f65c40/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-20 10:03:55,415 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 10:03:55,427 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 10:03:55,428 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 10:03:55,428 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 10:03:55,428 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 10:03:55,429 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-20 10:03:55,429 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-20 10:03:55,429 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-20 10:03:55,429 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-20 10:03:55,430 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-20 10:03:55,430 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-20 10:03:55,430 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 10:03:55,430 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-20 10:03:55,431 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 10:03:55,431 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 10:03:55,431 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-20 10:03:55,431 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-20 10:03:55,432 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-20 10:03:55,432 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 10:03:55,432 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-20 10:03:55,432 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 10:03:55,433 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-20 10:03:55,433 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 10:03:55,433 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 10:03:55,434 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-20 10:03:55,435 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 10:03:55,435 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 10:03:55,435 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-20 10:03:55,436 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-20 10:03:55,437 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_c2dee3fd-2af3-470d-8053-060721f65c40/bin/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 [2019-11-20 10:03:55,623 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 10:03:55,635 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 10:03:55,638 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 10:03:55,640 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 10:03:55,640 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 10:03:55,641 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_c2dee3fd-2af3-470d-8053-060721f65c40/bin/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/java_BubbleSort-alloca-2.i [2019-11-20 10:03:55,695 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c2dee3fd-2af3-470d-8053-060721f65c40/bin/uautomizer/data/d49e8d223/80f97535cf344870ba4756035ded6720/FLAGd18a98c28 [2019-11-20 10:03:56,156 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 10:03:56,157 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_c2dee3fd-2af3-470d-8053-060721f65c40/sv-benchmarks/c/termination-memory-alloca/java_BubbleSort-alloca-2.i [2019-11-20 10:03:56,171 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c2dee3fd-2af3-470d-8053-060721f65c40/bin/uautomizer/data/d49e8d223/80f97535cf344870ba4756035ded6720/FLAGd18a98c28 [2019-11-20 10:03:56,184 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_c2dee3fd-2af3-470d-8053-060721f65c40/bin/uautomizer/data/d49e8d223/80f97535cf344870ba4756035ded6720 [2019-11-20 10:03:56,187 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 10:03:56,188 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 10:03:56,189 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 10:03:56,189 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 10:03:56,193 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 10:03:56,194 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:03:56" (1/1) ... [2019-11-20 10:03:56,197 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a81b648 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:03:56, skipping insertion in model container [2019-11-20 10:03:56,197 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:03:56" (1/1) ... [2019-11-20 10:03:56,205 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 10:03:56,272 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 10:03:56,659 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 10:03:56,669 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 10:03:56,709 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 10:03:56,757 INFO L192 MainTranslator]: Completed translation [2019-11-20 10:03:56,758 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:03:56 WrapperNode [2019-11-20 10:03:56,758 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 10:03:56,759 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 10:03:56,760 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 10:03:56,760 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 10:03:56,768 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:03:56" (1/1) ... [2019-11-20 10:03:56,783 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:03:56" (1/1) ... [2019-11-20 10:03:56,807 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 10:03:56,807 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 10:03:56,807 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 10:03:56,808 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 10:03:56,817 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:03:56" (1/1) ... [2019-11-20 10:03:56,818 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:03:56" (1/1) ... [2019-11-20 10:03:56,821 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:03:56" (1/1) ... [2019-11-20 10:03:56,821 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:03:56" (1/1) ... [2019-11-20 10:03:56,827 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:03:56" (1/1) ... [2019-11-20 10:03:56,832 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:03:56" (1/1) ... [2019-11-20 10:03:56,833 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:03:56" (1/1) ... [2019-11-20 10:03:56,836 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 10:03:56,836 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 10:03:56,836 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 10:03:56,837 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 10:03:56,838 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:03:56" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c2dee3fd-2af3-470d-8053-060721f65c40/bin/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 [2019-11-20 10:03:56,925 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-20 10:03:56,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-20 10:03:56,925 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 10:03:56,926 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-20 10:03:56,927 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 10:03:56,927 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 10:03:57,199 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 10:03:57,199 INFO L285 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-20 10:03:57,200 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:03:57 BoogieIcfgContainer [2019-11-20 10:03:57,200 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 10:03:57,201 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-20 10:03:57,201 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-20 10:03:57,204 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-20 10:03:57,217 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-20 10:03:57,218 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.11 10:03:56" (1/3) ... [2019-11-20 10:03:57,219 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@254242b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 10:03:57, skipping insertion in model container [2019-11-20 10:03:57,219 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-20 10:03:57,219 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:03:56" (2/3) ... [2019-11-20 10:03:57,219 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@254242b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 10:03:57, skipping insertion in model container [2019-11-20 10:03:57,220 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-20 10:03:57,220 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:03:57" (3/3) ... [2019-11-20 10:03:57,221 INFO L371 chiAutomizerObserver]: Analyzing ICFG java_BubbleSort-alloca-2.i [2019-11-20 10:03:57,267 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-20 10:03:57,267 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-20 10:03:57,267 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-20 10:03:57,267 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 10:03:57,268 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 10:03:57,268 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-20 10:03:57,268 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 10:03:57,268 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-20 10:03:57,283 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2019-11-20 10:03:57,307 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-20 10:03:57,307 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 10:03:57,307 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 10:03:57,314 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-20 10:03:57,314 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-20 10:03:57,315 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-20 10:03:57,315 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2019-11-20 10:03:57,316 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-20 10:03:57,317 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 10:03:57,317 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 10:03:57,317 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-20 10:03:57,317 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-20 10:03:57,326 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 9#L-1true havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 5#L558true assume !(main_~array_size~0 < 1); 8#L558-2true call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;sort_#in~x.base, sort_#in~x.offset, sort_#in~n := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sort_#t~mem4, sort_#t~mem5, sort_#t~mem6, sort_#t~mem7, sort_~temp~0, sort_#t~post3, sort_#t~post2, sort_~x.base, sort_~x.offset, sort_~n, sort_~pass~0, sort_~i~0;sort_~x.base, sort_~x.offset := sort_#in~x.base, sort_#in~x.offset;sort_~n := sort_#in~n;havoc sort_~pass~0;havoc sort_~i~0;sort_~pass~0 := 1; 6#L550-3true [2019-11-20 10:03:57,326 INFO L796 eck$LassoCheckResult]: Loop: 6#L550-3true assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 3#L551-3true assume !true; 4#L550-2true sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 6#L550-3true [2019-11-20 10:03:57,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:03:57,333 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2019-11-20 10:03:57,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:03:57,341 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200647469] [2019-11-20 10:03:57,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:03:57,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:03:57,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:03:57,470 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 10:03:57,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:03:57,471 INFO L82 PathProgramCache]: Analyzing trace with hash 47218, now seen corresponding path program 1 times [2019-11-20 10:03:57,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:03:57,471 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789681853] [2019-11-20 10:03:57,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:03:57,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:03:57,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:03:57,504 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789681853] [2019-11-20 10:03:57,505 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:03:57,505 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 10:03:57,506 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375221294] [2019-11-20 10:03:57,511 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-20 10:03:57,512 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:03:57,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-20 10:03:57,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-20 10:03:57,528 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 2 states. [2019-11-20 10:03:57,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:03:57,535 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2019-11-20 10:03:57,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-20 10:03:57,537 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 16 transitions. [2019-11-20 10:03:57,538 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-20 10:03:57,543 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 9 states and 12 transitions. [2019-11-20 10:03:57,544 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-11-20 10:03:57,544 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-11-20 10:03:57,545 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 12 transitions. [2019-11-20 10:03:57,545 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 10:03:57,545 INFO L688 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2019-11-20 10:03:57,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 12 transitions. [2019-11-20 10:03:57,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-11-20 10:03:57,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-11-20 10:03:57,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 12 transitions. [2019-11-20 10:03:57,576 INFO L711 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2019-11-20 10:03:57,576 INFO L591 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2019-11-20 10:03:57,576 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-20 10:03:57,576 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 12 transitions. [2019-11-20 10:03:57,577 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-20 10:03:57,577 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 10:03:57,577 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 10:03:57,577 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-20 10:03:57,578 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-20 10:03:57,578 INFO L794 eck$LassoCheckResult]: Stem: 41#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 34#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 35#L558 assume !(main_~array_size~0 < 1); 40#L558-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;sort_#in~x.base, sort_#in~x.offset, sort_#in~n := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sort_#t~mem4, sort_#t~mem5, sort_#t~mem6, sort_#t~mem7, sort_~temp~0, sort_#t~post3, sort_#t~post2, sort_~x.base, sort_~x.offset, sort_~n, sort_~pass~0, sort_~i~0;sort_~x.base, sort_~x.offset := sort_#in~x.base, sort_#in~x.offset;sort_~n := sort_#in~n;havoc sort_~pass~0;havoc sort_~i~0;sort_~pass~0 := 1; 39#L550-3 [2019-11-20 10:03:57,578 INFO L796 eck$LassoCheckResult]: Loop: 39#L550-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 36#L551-3 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 37#L550-2 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 39#L550-3 [2019-11-20 10:03:57,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:03:57,579 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2019-11-20 10:03:57,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:03:57,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271682832] [2019-11-20 10:03:57,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:03:57,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:03:57,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:03:57,605 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 10:03:57,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:03:57,606 INFO L82 PathProgramCache]: Analyzing trace with hash 46877, now seen corresponding path program 1 times [2019-11-20 10:03:57,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:03:57,606 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086266102] [2019-11-20 10:03:57,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:03:57,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:03:57,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:03:57,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086266102] [2019-11-20 10:03:57,647 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:03:57,647 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 10:03:57,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714000219] [2019-11-20 10:03:57,648 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-20 10:03:57,648 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:03:57,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:03:57,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:03:57,649 INFO L87 Difference]: Start difference. First operand 9 states and 12 transitions. cyclomatic complexity: 4 Second operand 3 states. [2019-11-20 10:03:57,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:03:57,675 INFO L93 Difference]: Finished difference Result 10 states and 13 transitions. [2019-11-20 10:03:57,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:03:57,676 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 13 transitions. [2019-11-20 10:03:57,677 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-20 10:03:57,677 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 13 transitions. [2019-11-20 10:03:57,678 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-20 10:03:57,678 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-20 10:03:57,678 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2019-11-20 10:03:57,678 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 10:03:57,678 INFO L688 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-11-20 10:03:57,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2019-11-20 10:03:57,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-11-20 10:03:57,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-11-20 10:03:57,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2019-11-20 10:03:57,680 INFO L711 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-11-20 10:03:57,681 INFO L591 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-11-20 10:03:57,681 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-20 10:03:57,681 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2019-11-20 10:03:57,682 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-20 10:03:57,682 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 10:03:57,682 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 10:03:57,682 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-20 10:03:57,682 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-20 10:03:57,682 INFO L794 eck$LassoCheckResult]: Stem: 66#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 59#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 60#L558 assume !(main_~array_size~0 < 1); 65#L558-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;sort_#in~x.base, sort_#in~x.offset, sort_#in~n := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sort_#t~mem4, sort_#t~mem5, sort_#t~mem6, sort_#t~mem7, sort_~temp~0, sort_#t~post3, sort_#t~post2, sort_~x.base, sort_~x.offset, sort_~n, sort_~pass~0, sort_~i~0;sort_~x.base, sort_~x.offset := sort_#in~x.base, sort_#in~x.offset;sort_~n := sort_#in~n;havoc sort_~pass~0;havoc sort_~i~0;sort_~pass~0 := 1; 64#L550-3 [2019-11-20 10:03:57,683 INFO L796 eck$LassoCheckResult]: Loop: 64#L550-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 61#L551-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 62#L552 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem5;havoc sort_#t~mem4;call sort_#t~mem6 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);sort_~temp~0 := sort_#t~mem6;havoc sort_#t~mem6;call sort_#t~mem7 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4);call write~int(sort_#t~mem7, sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);havoc sort_#t~mem7;call write~int(sort_~temp~0, sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 67#L551-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 68#L551-3 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 63#L550-2 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 64#L550-3 [2019-11-20 10:03:57,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:03:57,683 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 3 times [2019-11-20 10:03:57,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:03:57,683 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123319939] [2019-11-20 10:03:57,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:03:57,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:03:57,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:03:57,714 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 10:03:57,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:03:57,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1398152922, now seen corresponding path program 1 times [2019-11-20 10:03:57,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:03:57,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388560439] [2019-11-20 10:03:57,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:03:57,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:03:57,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:03:57,744 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 10:03:57,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:03:57,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1893874754, now seen corresponding path program 1 times [2019-11-20 10:03:57,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:03:57,746 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215146823] [2019-11-20 10:03:57,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:03:57,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:03:57,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:03:57,794 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 10:03:57,927 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2019-11-20 10:03:58,170 WARN L191 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-11-20 10:03:58,263 INFO L210 LassoAnalysis]: Preferences: [2019-11-20 10:03:58,264 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-20 10:03:58,264 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-20 10:03:58,264 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-20 10:03:58,265 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-20 10:03:58,265 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 10:03:58,265 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-20 10:03:58,265 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-20 10:03:58,266 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-2.i_Iteration3_Lasso [2019-11-20 10:03:58,266 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-20 10:03:58,266 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-20 10:03:58,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 10:03:58,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 10:03:58,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 10:03:58,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 10:03:58,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 10:03:58,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 10:03:58,499 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2019-11-20 10:03:58,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 10:03:58,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 10:03:58,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 10:03:58,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 10:03:58,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 10:03:58,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 10:03:58,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 10:03:58,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 10:03:59,051 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-20 10:03:59,056 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c2dee3fd-2af3-470d-8053-060721f65c40/bin/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 10:03:59,072 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 10:03:59,075 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 10:03:59,075 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 10:03:59,076 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 10:03:59,076 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 10:03:59,076 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 10:03:59,081 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 10:03:59,082 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 10:03:59,088 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c2dee3fd-2af3-470d-8053-060721f65c40/bin/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 10:03:59,103 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 10:03:59,106 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 10:03:59,106 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 10:03:59,106 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 10:03:59,107 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 10:03:59,107 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 10:03:59,108 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 10:03:59,108 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 10:03:59,111 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c2dee3fd-2af3-470d-8053-060721f65c40/bin/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 10:03:59,132 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 10:03:59,134 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 10:03:59,134 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 10:03:59,134 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 10:03:59,134 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 10:03:59,135 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 10:03:59,135 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 10:03:59,136 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 10:03:59,139 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c2dee3fd-2af3-470d-8053-060721f65c40/bin/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 10:03:59,161 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 10:03:59,163 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 10:03:59,163 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 10:03:59,163 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 10:03:59,163 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 10:03:59,169 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 10:03:59,170 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 10:03:59,175 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c2dee3fd-2af3-470d-8053-060721f65c40/bin/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 10:03:59,191 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 10:03:59,193 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 10:03:59,193 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 10:03:59,193 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 10:03:59,193 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 10:03:59,194 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 10:03:59,197 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 10:03:59,197 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 10:03:59,200 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c2dee3fd-2af3-470d-8053-060721f65c40/bin/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 10:03:59,220 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 10:03:59,222 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 10:03:59,222 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 10:03:59,222 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 10:03:59,222 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 10:03:59,223 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 10:03:59,224 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 10:03:59,224 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 10:03:59,227 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c2dee3fd-2af3-470d-8053-060721f65c40/bin/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 10:03:59,238 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 10:03:59,240 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 10:03:59,241 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 10:03:59,241 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 10:03:59,241 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 10:03:59,250 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 10:03:59,250 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 10:03:59,261 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c2dee3fd-2af3-470d-8053-060721f65c40/bin/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 10:03:59,278 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 10:03:59,281 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 10:03:59,281 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 10:03:59,281 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 10:03:59,281 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 10:03:59,282 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 10:03:59,282 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 10:03:59,283 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 10:03:59,284 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c2dee3fd-2af3-470d-8053-060721f65c40/bin/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 10:03:59,294 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 10:03:59,296 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 10:03:59,296 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 10:03:59,296 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 10:03:59,296 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 10:03:59,299 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 10:03:59,300 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 10:03:59,310 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c2dee3fd-2af3-470d-8053-060721f65c40/bin/uautomizer/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 10:03:59,330 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 10:03:59,333 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 10:03:59,334 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 10:03:59,334 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 10:03:59,334 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 10:03:59,349 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 10:03:59,349 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 10:03:59,371 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-20 10:03:59,479 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2019-11-20 10:03:59,479 INFO L444 ModelExtractionUtils]: 19 out of 37 variables were initially zero. Simplification set additionally 13 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c2dee3fd-2af3-470d-8053-060721f65c40/bin/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 10:03:59,578 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-20 10:03:59,596 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-11-20 10:03:59,596 INFO L510 LassoAnalysis]: Proved termination. [2019-11-20 10:03:59,597 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sort_~pass~0, v_rep(select #length ULTIMATE.start_sort_~x.base)_1) = -2*ULTIMATE.start_sort_~pass~0 + 1*v_rep(select #length ULTIMATE.start_sort_~x.base)_1 Supporting invariants [-2*ULTIMATE.start_sort_~n + 1*v_rep(select #length ULTIMATE.start_sort_~x.base)_1 >= 0] [2019-11-20 10:03:59,624 INFO L297 tatePredicateManager]: 4 out of 5 supporting invariants were superfluous and have been removed [2019-11-20 10:03:59,635 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-20 10:03:59,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:03:59,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:03:59,697 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-20 10:03:59,699 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:03:59,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:03:59,738 INFO L255 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 10:03:59,739 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:03:59,775 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 10:03:59,779 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-11-20 10:03:59,780 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 4 Second operand 4 states. [2019-11-20 10:03:59,870 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 4. Second operand 4 states. Result 16 states and 22 transitions. Complement of second has 5 states. [2019-11-20 10:03:59,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-20 10:03:59,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-20 10:03:59,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2019-11-20 10:03:59,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 4 letters. Loop has 6 letters. [2019-11-20 10:03:59,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 10:03:59,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 10 letters. Loop has 6 letters. [2019-11-20 10:03:59,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 10:03:59,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 4 letters. Loop has 12 letters. [2019-11-20 10:03:59,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 10:03:59,876 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 22 transitions. [2019-11-20 10:03:59,877 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-20 10:03:59,878 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 15 states and 21 transitions. [2019-11-20 10:03:59,878 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-11-20 10:03:59,878 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-11-20 10:03:59,878 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 21 transitions. [2019-11-20 10:03:59,879 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 10:03:59,879 INFO L688 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2019-11-20 10:03:59,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 21 transitions. [2019-11-20 10:03:59,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2019-11-20 10:03:59,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-20 10:03:59,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 20 transitions. [2019-11-20 10:03:59,887 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 20 transitions. [2019-11-20 10:03:59,887 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 20 transitions. [2019-11-20 10:03:59,887 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-20 10:03:59,888 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 20 transitions. [2019-11-20 10:03:59,891 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-20 10:03:59,891 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 10:03:59,891 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 10:03:59,892 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-20 10:03:59,892 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-20 10:03:59,892 INFO L794 eck$LassoCheckResult]: Stem: 173#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 165#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 166#L558 assume !(main_~array_size~0 < 1); 171#L558-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;sort_#in~x.base, sort_#in~x.offset, sort_#in~n := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sort_#t~mem4, sort_#t~mem5, sort_#t~mem6, sort_#t~mem7, sort_~temp~0, sort_#t~post3, sort_#t~post2, sort_~x.base, sort_~x.offset, sort_~n, sort_~pass~0, sort_~i~0;sort_~x.base, sort_~x.offset := sort_#in~x.base, sort_#in~x.offset;sort_~n := sort_#in~n;havoc sort_~pass~0;havoc sort_~i~0;sort_~pass~0 := 1; 172#L550-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 167#L551-3 [2019-11-20 10:03:59,892 INFO L796 eck$LassoCheckResult]: Loop: 167#L551-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 168#L552 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem5;havoc sort_#t~mem4;call sort_#t~mem6 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);sort_~temp~0 := sort_#t~mem6;havoc sort_#t~mem6;call sort_#t~mem7 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4);call write~int(sort_#t~mem7, sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);havoc sort_#t~mem7;call write~int(sort_~temp~0, sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 174#L551-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 167#L551-3 [2019-11-20 10:03:59,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:03:59,893 INFO L82 PathProgramCache]: Analyzing trace with hash 28695756, now seen corresponding path program 1 times [2019-11-20 10:03:59,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:03:59,893 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802781144] [2019-11-20 10:03:59,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:03:59,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:03:59,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:03:59,940 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 10:03:59,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:03:59,941 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 1 times [2019-11-20 10:03:59,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:03:59,941 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597811409] [2019-11-20 10:03:59,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:03:59,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:03:59,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:03:59,975 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 10:03:59,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:03:59,975 INFO L82 PathProgramCache]: Analyzing trace with hash 176800017, now seen corresponding path program 1 times [2019-11-20 10:03:59,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:03:59,976 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019565986] [2019-11-20 10:03:59,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:03:59,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:04:00,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:04:00,019 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 10:04:00,289 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-11-20 10:04:00,360 INFO L210 LassoAnalysis]: Preferences: [2019-11-20 10:04:00,360 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-20 10:04:00,360 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-20 10:04:00,360 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-20 10:04:00,360 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-20 10:04:00,360 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 10:04:00,361 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-20 10:04:00,361 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-20 10:04:00,361 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-2.i_Iteration4_Lasso [2019-11-20 10:04:00,361 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-20 10:04:00,361 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-20 10:04:00,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 10:04:00,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 10:04:00,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 10:04:00,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 10:04:00,528 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2019-11-20 10:04:00,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 10:04:00,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 10:04:00,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 10:04:00,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 10:04:00,591 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 10:04:00,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 10:04:00,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 10:04:00,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 10:04:00,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 10:04:00,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 10:04:00,980 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-20 10:04:00,980 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c2dee3fd-2af3-470d-8053-060721f65c40/bin/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 10:04:00,999 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 10:04:01,000 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 10:04:01,001 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 10:04:01,001 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 10:04:01,001 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 10:04:01,001 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 10:04:01,004 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 10:04:01,004 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 10:04:01,009 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c2dee3fd-2af3-470d-8053-060721f65c40/bin/uautomizer/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 10:04:01,030 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 10:04:01,032 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 10:04:01,032 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 10:04:01,032 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 10:04:01,032 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 10:04:01,033 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 10:04:01,033 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 10:04:01,033 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 10:04:01,035 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c2dee3fd-2af3-470d-8053-060721f65c40/bin/uautomizer/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 10:04:01,055 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 10:04:01,056 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 10:04:01,057 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 10:04:01,057 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 10:04:01,057 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 10:04:01,059 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 10:04:01,059 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 10:04:01,063 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c2dee3fd-2af3-470d-8053-060721f65c40/bin/uautomizer/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 10:04:01,079 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 10:04:01,082 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 10:04:01,082 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 10:04:01,083 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 10:04:01,083 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 10:04:01,088 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 10:04:01,089 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 10:04:01,095 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c2dee3fd-2af3-470d-8053-060721f65c40/bin/uautomizer/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 10:04:01,111 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 10:04:01,113 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 10:04:01,114 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 10:04:01,114 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 10:04:01,114 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 10:04:01,121 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 10:04:01,121 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 10:04:01,129 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c2dee3fd-2af3-470d-8053-060721f65c40/bin/uautomizer/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 10:04:01,146 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 10:04:01,151 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 10:04:01,151 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 10:04:01,151 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 10:04:01,152 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 10:04:01,166 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 10:04:01,167 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 10:04:01,189 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-20 10:04:01,275 INFO L443 ModelExtractionUtils]: Simplification made 24 calls to the SMT solver. [2019-11-20 10:04:01,275 INFO L444 ModelExtractionUtils]: 9 out of 37 variables were initially zero. Simplification set additionally 24 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c2dee3fd-2af3-470d-8053-060721f65c40/bin/uautomizer/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 10:04:01,292 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 10:04:01,295 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-20 10:04:01,295 INFO L510 LassoAnalysis]: Proved termination. [2019-11-20 10:04:01,295 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sort_~i~0, ULTIMATE.start_sort_~pass~0, ULTIMATE.start_sort_~n) = -1*ULTIMATE.start_sort_~i~0 - 1*ULTIMATE.start_sort_~pass~0 + 1*ULTIMATE.start_sort_~n Supporting invariants [] [2019-11-20 10:04:01,315 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-11-20 10:04:01,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:04:01,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:04:01,353 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 10:04:01,353 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:04:01,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:04:01,364 INFO L255 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 10:04:01,364 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:04:01,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:04:01,386 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 [2019-11-20 10:04:01,387 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 20 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-11-20 10:04:01,422 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 20 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 30 states and 44 transitions. Complement of second has 7 states. [2019-11-20 10:04:01,423 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 [2019-11-20 10:04:01,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-20 10:04:01,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2019-11-20 10:04:01,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 5 letters. Loop has 3 letters. [2019-11-20 10:04:01,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 10:04:01,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 8 letters. Loop has 3 letters. [2019-11-20 10:04:01,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 10:04:01,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 5 letters. Loop has 6 letters. [2019-11-20 10:04:01,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 10:04:01,425 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 44 transitions. [2019-11-20 10:04:01,427 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-20 10:04:01,428 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 20 states and 28 transitions. [2019-11-20 10:04:01,429 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-11-20 10:04:01,429 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-11-20 10:04:01,429 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 28 transitions. [2019-11-20 10:04:01,429 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 10:04:01,429 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 28 transitions. [2019-11-20 10:04:01,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 28 transitions. [2019-11-20 10:04:01,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 14. [2019-11-20 10:04:01,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-20 10:04:01,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2019-11-20 10:04:01,432 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-11-20 10:04:01,432 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-11-20 10:04:01,432 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-20 10:04:01,432 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2019-11-20 10:04:01,433 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-20 10:04:01,434 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 10:04:01,434 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 10:04:01,434 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:04:01,435 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-20 10:04:01,435 INFO L794 eck$LassoCheckResult]: Stem: 281#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 277#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 278#L558 assume !(main_~array_size~0 < 1); 279#L558-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;sort_#in~x.base, sort_#in~x.offset, sort_#in~n := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sort_#t~mem4, sort_#t~mem5, sort_#t~mem6, sort_#t~mem7, sort_~temp~0, sort_#t~post3, sort_#t~post2, sort_~x.base, sort_~x.offset, sort_~n, sort_~pass~0, sort_~i~0;sort_~x.base, sort_~x.offset := sort_#in~x.base, sort_#in~x.offset;sort_~n := sort_#in~n;havoc sort_~pass~0;havoc sort_~i~0;sort_~pass~0 := 1; 280#L550-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 275#L551-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 276#L552 assume !(sort_#t~mem4 > sort_#t~mem5);havoc sort_#t~mem5;havoc sort_#t~mem4; 283#L551-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 284#L551-3 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 271#L550-2 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 272#L550-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 273#L551-3 [2019-11-20 10:04:01,435 INFO L796 eck$LassoCheckResult]: Loop: 273#L551-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 274#L552 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem5;havoc sort_#t~mem4;call sort_#t~mem6 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);sort_~temp~0 := sort_#t~mem6;havoc sort_#t~mem6;call sort_#t~mem7 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4);call write~int(sort_#t~mem7, sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);havoc sort_#t~mem7;call write~int(sort_~temp~0, sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 282#L551-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 273#L551-3 [2019-11-20 10:04:01,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:04:01,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1421271829, now seen corresponding path program 1 times [2019-11-20 10:04:01,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:04:01,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242527840] [2019-11-20 10:04:01,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:04:01,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:04:01,495 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:04:01,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242527840] [2019-11-20 10:04:01,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [106503707] [2019-11-20 10:04:01,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c2dee3fd-2af3-470d-8053-060721f65c40/bin/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:04:01,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:04:01,568 INFO L255 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 10:04:01,569 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:04:01,593 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:04:01,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 10:04:01,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-11-20 10:04:01,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542450300] [2019-11-20 10:04:01,595 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-20 10:04:01,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:04:01,595 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 2 times [2019-11-20 10:04:01,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:04:01,596 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764892865] [2019-11-20 10:04:01,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:04:01,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:04:01,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:04:01,610 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 10:04:01,717 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:04:01,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 10:04:01,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-20 10:04:01,718 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. cyclomatic complexity: 7 Second operand 7 states. [2019-11-20 10:04:01,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:04:01,794 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2019-11-20 10:04:01,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 10:04:01,796 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 36 transitions. [2019-11-20 10:04:01,797 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-20 10:04:01,798 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 25 states and 34 transitions. [2019-11-20 10:04:01,798 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-11-20 10:04:01,798 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-11-20 10:04:01,799 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 34 transitions. [2019-11-20 10:04:01,799 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 10:04:01,799 INFO L688 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2019-11-20 10:04:01,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 34 transitions. [2019-11-20 10:04:01,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 17. [2019-11-20 10:04:01,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-20 10:04:01,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2019-11-20 10:04:01,804 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2019-11-20 10:04:01,805 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2019-11-20 10:04:01,805 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-20 10:04:01,805 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 23 transitions. [2019-11-20 10:04:01,806 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-20 10:04:01,808 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 10:04:01,808 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 10:04:01,808 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-11-20 10:04:01,809 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-20 10:04:01,809 INFO L794 eck$LassoCheckResult]: Stem: 365#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 356#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 357#L558 assume !(main_~array_size~0 < 1); 364#L558-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;sort_#in~x.base, sort_#in~x.offset, sort_#in~n := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sort_#t~mem4, sort_#t~mem5, sort_#t~mem6, sort_#t~mem7, sort_~temp~0, sort_#t~post3, sort_#t~post2, sort_~x.base, sort_~x.offset, sort_~n, sort_~pass~0, sort_~i~0;sort_~x.base, sort_~x.offset := sort_#in~x.base, sort_#in~x.offset;sort_~n := sort_#in~n;havoc sort_~pass~0;havoc sort_~i~0;sort_~pass~0 := 1; 366#L550-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 367#L551-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 369#L552 assume !(sort_#t~mem4 > sort_#t~mem5);havoc sort_#t~mem5;havoc sort_#t~mem4; 370#L551-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 360#L551-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 361#L552 assume !(sort_#t~mem4 > sort_#t~mem5);havoc sort_#t~mem5;havoc sort_#t~mem4; 372#L551-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 371#L551-3 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 362#L550-2 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 363#L550-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 358#L551-3 [2019-11-20 10:04:01,810 INFO L796 eck$LassoCheckResult]: Loop: 358#L551-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 359#L552 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem5;havoc sort_#t~mem4;call sort_#t~mem6 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);sort_~temp~0 := sort_#t~mem6;havoc sort_#t~mem6;call sort_#t~mem7 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4);call write~int(sort_#t~mem7, sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);havoc sort_#t~mem7;call write~int(sort_~temp~0, sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 368#L551-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 358#L551-3 [2019-11-20 10:04:01,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:04:01,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1373641048, now seen corresponding path program 2 times [2019-11-20 10:04:01,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:04:01,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985272281] [2019-11-20 10:04:01,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:04:01,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:04:01,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:04:01,869 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 10:04:01,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:04:01,869 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 3 times [2019-11-20 10:04:01,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:04:01,870 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221566107] [2019-11-20 10:04:01,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:04:01,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:04:01,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:04:01,900 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 10:04:01,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:04:01,900 INFO L82 PathProgramCache]: Analyzing trace with hash -307910395, now seen corresponding path program 1 times [2019-11-20 10:04:01,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:04:01,901 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127163632] [2019-11-20 10:04:01,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:04:01,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:04:02,278 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:04:02,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127163632] [2019-11-20 10:04:02,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1770901728] [2019-11-20 10:04:02,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c2dee3fd-2af3-470d-8053-060721f65c40/bin/uautomizer/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:04:02,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:04:02,343 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-20 10:04:02,345 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:04:02,431 INFO L343 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2019-11-20 10:04:02,432 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 10 [2019-11-20 10:04:02,433 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:04:02,435 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:04:02,436 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:04:02,436 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:3 [2019-11-20 10:04:02,449 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 10:04:02,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 10:04:02,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 15 [2019-11-20 10:04:02,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489736374] [2019-11-20 10:04:02,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:04:02,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-20 10:04:02,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2019-11-20 10:04:02,547 INFO L87 Difference]: Start difference. First operand 17 states and 23 transitions. cyclomatic complexity: 8 Second operand 15 states. [2019-11-20 10:04:02,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:04:02,711 INFO L93 Difference]: Finished difference Result 37 states and 50 transitions. [2019-11-20 10:04:02,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-20 10:04:02,712 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 50 transitions. [2019-11-20 10:04:02,713 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-20 10:04:02,716 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 37 states and 50 transitions. [2019-11-20 10:04:02,716 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2019-11-20 10:04:02,716 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2019-11-20 10:04:02,716 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 50 transitions. [2019-11-20 10:04:02,716 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 10:04:02,716 INFO L688 BuchiCegarLoop]: Abstraction has 37 states and 50 transitions. [2019-11-20 10:04:02,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 50 transitions. [2019-11-20 10:04:02,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 26. [2019-11-20 10:04:02,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-20 10:04:02,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2019-11-20 10:04:02,721 INFO L711 BuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2019-11-20 10:04:02,721 INFO L591 BuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2019-11-20 10:04:02,721 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-20 10:04:02,721 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 35 transitions. [2019-11-20 10:04:02,722 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-20 10:04:02,722 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 10:04:02,722 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 10:04:02,723 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:04:02,723 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-20 10:04:02,723 INFO L794 eck$LassoCheckResult]: Stem: 494#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 486#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 487#L558 assume !(main_~array_size~0 < 1); 488#L558-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;sort_#in~x.base, sort_#in~x.offset, sort_#in~n := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sort_#t~mem4, sort_#t~mem5, sort_#t~mem6, sort_#t~mem7, sort_~temp~0, sort_#t~post3, sort_#t~post2, sort_~x.base, sort_~x.offset, sort_~n, sort_~pass~0, sort_~i~0;sort_~x.base, sort_~x.offset := sort_#in~x.base, sort_#in~x.offset;sort_~n := sort_#in~n;havoc sort_~pass~0;havoc sort_~i~0;sort_~pass~0 := 1; 489#L550-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 490#L551-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 503#L552 assume !(sort_#t~mem4 > sort_#t~mem5);havoc sort_#t~mem5;havoc sort_#t~mem4; 499#L551-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 482#L551-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 483#L552 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem5;havoc sort_#t~mem4;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); 497#L551-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 502#L551-3 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 484#L550-2 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 485#L550-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 480#L551-3 [2019-11-20 10:04:02,724 INFO L796 eck$LassoCheckResult]: Loop: 480#L551-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 481#L552 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem5;havoc sort_#t~mem4;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); 496#L551-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 480#L551-3 [2019-11-20 10:04:02,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:04:02,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1371794006, now seen corresponding path program 2 times [2019-11-20 10:04:02,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:04:02,724 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91257139] [2019-11-20 10:04:02,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:04:02,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:04:02,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:04:02,769 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 10:04:02,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:04:02,773 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 4 times [2019-11-20 10:04:02,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:04:02,773 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062525537] [2019-11-20 10:04:02,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:04:02,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:04:02,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:04:02,783 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 10:04:02,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:04:02,784 INFO L82 PathProgramCache]: Analyzing trace with hash 501436231, now seen corresponding path program 3 times [2019-11-20 10:04:02,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:04:02,785 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328561618] [2019-11-20 10:04:02,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:04:02,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:04:02,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:04:02,838 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 10:04:03,376 WARN L191 SmtUtils]: Spent 418.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 97 [2019-11-20 10:04:03,449 INFO L210 LassoAnalysis]: Preferences: [2019-11-20 10:04:03,449 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-20 10:04:03,450 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-20 10:04:03,450 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-20 10:04:03,450 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-20 10:04:03,450 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 10:04:03,450 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-20 10:04:03,450 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-20 10:04:03,450 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-2.i_Iteration7_Lasso [2019-11-20 10:04:03,450 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-20 10:04:03,450 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-20 10:04:03,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 10:04:03,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 10:04:03,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 10:04:03,687 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2019-11-20 10:04:03,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 10:04:03,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 10:04:03,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 10:04:03,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 10:04:03,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 10:04:03,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 10:04:03,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 10:04:03,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 10:04:03,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 10:04:03,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 10:04:03,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 10:04:04,116 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-20 10:04:04,116 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c2dee3fd-2af3-470d-8053-060721f65c40/bin/uautomizer/z3 Starting monitored process 22 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 10:04:04,124 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 10:04:04,126 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 10:04:04,126 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 10:04:04,126 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 10:04:04,126 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 10:04:04,126 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 10:04:04,127 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 10:04:04,127 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 10:04:04,128 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c2dee3fd-2af3-470d-8053-060721f65c40/bin/uautomizer/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 10:04:04,151 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 10:04:04,154 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 10:04:04,154 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 10:04:04,155 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 10:04:04,155 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 10:04:04,157 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 10:04:04,157 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 10:04:04,161 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c2dee3fd-2af3-470d-8053-060721f65c40/bin/uautomizer/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 10:04:04,175 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 10:04:04,177 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 10:04:04,177 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 10:04:04,177 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 10:04:04,177 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 10:04:04,184 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 10:04:04,184 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 10:04:04,192 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c2dee3fd-2af3-470d-8053-060721f65c40/bin/uautomizer/z3 Starting monitored process 25 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 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 10:04:04,198 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 10:04:04,201 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 10:04:04,201 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 10:04:04,201 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 10:04:04,201 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 10:04:04,212 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 10:04:04,212 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 10:04:04,233 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-20 10:04:04,341 INFO L443 ModelExtractionUtils]: Simplification made 33 calls to the SMT solver. [2019-11-20 10:04:04,342 INFO L444 ModelExtractionUtils]: 5 out of 37 variables were initially zero. Simplification set additionally 28 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c2dee3fd-2af3-470d-8053-060721f65c40/bin/uautomizer/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 10:04:04,348 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-20 10:04:04,351 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-11-20 10:04:04,351 INFO L510 LassoAnalysis]: Proved termination. [2019-11-20 10:04:04,351 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sort_~i~0, v_rep(select #length ULTIMATE.start_sort_~x.base)_3) = -4*ULTIMATE.start_sort_~i~0 + 1*v_rep(select #length ULTIMATE.start_sort_~x.base)_3 Supporting invariants [1*ULTIMATE.start_sort_~x.offset >= 0] [2019-11-20 10:04:04,385 INFO L297 tatePredicateManager]: 7 out of 8 supporting invariants were superfluous and have been removed [2019-11-20 10:04:04,394 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-20 10:04:04,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:04:04,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:04:04,472 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-20 10:04:04,473 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:04:04,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:04:04,491 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 10:04:04,492 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:04:04,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:04:04,510 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-11-20 10:04:04,510 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 11 Second operand 4 states. [2019-11-20 10:04:04,566 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 50 states and 70 transitions. Complement of second has 8 states. [2019-11-20 10:04:04,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-20 10:04:04,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-20 10:04:04,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2019-11-20 10:04:04,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 14 letters. Loop has 3 letters. [2019-11-20 10:04:04,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 10:04:04,567 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-20 10:04:04,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:04:04,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:04:04,603 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-20 10:04:04,603 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:04:04,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:04:04,621 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 10:04:04,622 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:04:04,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:04:04,637 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 2 loop predicates [2019-11-20 10:04:04,637 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 11 Second operand 4 states. [2019-11-20 10:04:04,666 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 50 states and 70 transitions. Complement of second has 8 states. [2019-11-20 10:04:04,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-20 10:04:04,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-20 10:04:04,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2019-11-20 10:04:04,669 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 14 letters. Loop has 3 letters. [2019-11-20 10:04:04,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 10:04:04,669 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-20 10:04:04,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:04:04,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:04:04,704 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-20 10:04:04,705 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:04:04,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:04:04,734 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 10:04:04,734 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:04:04,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:04:04,748 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-11-20 10:04:04,748 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 11 Second operand 4 states. [2019-11-20 10:04:04,793 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 41 states and 58 transitions. Complement of second has 7 states. [2019-11-20 10:04:04,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-20 10:04:04,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-20 10:04:04,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2019-11-20 10:04:04,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 14 letters. Loop has 3 letters. [2019-11-20 10:04:04,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 10:04:04,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 17 letters. Loop has 3 letters. [2019-11-20 10:04:04,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 10:04:04,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 14 letters. Loop has 6 letters. [2019-11-20 10:04:04,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 10:04:04,798 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 58 transitions. [2019-11-20 10:04:04,799 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-20 10:04:04,799 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 0 states and 0 transitions. [2019-11-20 10:04:04,799 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-20 10:04:04,800 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-20 10:04:04,800 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-20 10:04:04,800 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 10:04:04,800 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 10:04:04,800 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 10:04:04,800 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 10:04:04,800 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-20 10:04:04,800 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-20 10:04:04,800 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-20 10:04:04,800 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-20 10:04:04,807 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 20.11 10:04:04 BoogieIcfgContainer [2019-11-20 10:04:04,808 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-20 10:04:04,808 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 10:04:04,808 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 10:04:04,808 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 10:04:04,809 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:03:57" (3/4) ... [2019-11-20 10:04:04,812 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-20 10:04:04,812 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 10:04:04,814 INFO L168 Benchmark]: Toolchain (without parser) took 8626.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 196.6 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -191.7 MB). Peak memory consumption was 4.9 MB. Max. memory is 11.5 GB. [2019-11-20 10:04:04,814 INFO L168 Benchmark]: CDTParser took 0.34 ms. Allocated memory is still 1.0 GB. Free memory is still 966.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 10:04:04,815 INFO L168 Benchmark]: CACSL2BoogieTranslator took 569.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -189.5 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. [2019-11-20 10:04:04,815 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.69 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2019-11-20 10:04:04,816 INFO L168 Benchmark]: Boogie Preprocessor took 28.75 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: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. [2019-11-20 10:04:04,817 INFO L168 Benchmark]: RCFGBuilder took 364.27 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: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 11.5 GB. [2019-11-20 10:04:04,817 INFO L168 Benchmark]: BuchiAutomizer took 7606.74 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 47.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -27.6 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. [2019-11-20 10:04:04,818 INFO L168 Benchmark]: Witness Printer took 4.55 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: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2019-11-20 10:04:04,821 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.34 ms. Allocated memory is still 1.0 GB. Free memory is still 966.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 569.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -189.5 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 47.69 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.75 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: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 364.27 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: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7606.74 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 47.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -27.6 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. * Witness Printer took 4.55 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: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (4 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -2 * pass + unknown-#length-unknown[x] and consists of 4 locations. One deterministic module has affine ranking function -1 * i + -1 * pass + n and consists of 4 locations. One nondeterministic module has affine ranking function -4 * i + unknown-#length-unknown[x] and consists of 5 locations. 4 modules have a trivial ranking function, the largest among these consists of 15 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.5s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 6.3s. Construction of modules took 0.2s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 26 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 26 states and ocurred in iteration 6. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1/1 HoareTripleCheckerStatistics: 87 SDtfs, 98 SDslu, 111 SDs, 0 SdLazy, 174 SolverSat, 35 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital193 mio100 ax109 hnf99 lsp88 ukn62 mio100 lsp64 div100 bol100 ite100 ukn100 eq178 hnf86 smp99 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 33ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...