./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 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_a685d1b6-1f60-45fa-b23e-abcd8bac6f7b/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_a685d1b6-1f60-45fa-b23e-abcd8bac6f7b/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_a685d1b6-1f60-45fa-b23e-abcd8bac6f7b/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_a685d1b6-1f60-45fa-b23e-abcd8bac6f7b/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_a685d1b6-1f60-45fa-b23e-abcd8bac6f7b/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_a685d1b6-1f60-45fa-b23e-abcd8bac6f7b/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-6b5699a [2019-11-25 08:48:33,973 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:48:33,975 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:48:33,990 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:48:33,990 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:48:33,992 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:48:33,994 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:48:34,003 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:48:34,008 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:48:34,012 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:48:34,014 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:48:34,015 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:48:34,015 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:48:34,017 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:48:34,019 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:48:34,020 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:48:34,021 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:48:34,021 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:48:34,024 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:48:34,028 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:48:34,032 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:48:34,035 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:48:34,036 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:48:34,037 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:48:34,039 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:48:34,040 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:48:34,040 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:48:34,041 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:48:34,042 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:48:34,043 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:48:34,043 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:48:34,044 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:48:34,045 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:48:34,045 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:48:34,046 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:48:34,046 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:48:34,047 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:48:34,047 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:48:34,047 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:48:34,048 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:48:34,050 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:48:34,050 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_a685d1b6-1f60-45fa-b23e-abcd8bac6f7b/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-25 08:48:34,078 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:48:34,089 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:48:34,090 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:48:34,090 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:48:34,090 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:48:34,091 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-25 08:48:34,091 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-25 08:48:34,091 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-25 08:48:34,091 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-25 08:48:34,091 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-25 08:48:34,092 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-25 08:48:34,092 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:48:34,092 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-25 08:48:34,092 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 08:48:34,092 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:48:34,093 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-25 08:48:34,093 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-25 08:48:34,093 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-25 08:48:34,093 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-25 08:48:34,094 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-25 08:48:34,094 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:48:34,095 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-25 08:48:34,095 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:48:34,095 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:48:34,095 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-25 08:48:34,096 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:48:34,096 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 08:48:34,096 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-25 08:48:34,097 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-25 08:48:34,098 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_a685d1b6-1f60-45fa-b23e-abcd8bac6f7b/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-25 08:48:34,254 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:48:34,269 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:48:34,272 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:48:34,279 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:48:34,281 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:48:34,282 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_a685d1b6-1f60-45fa-b23e-abcd8bac6f7b/bin/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/java_BubbleSort-alloca-2.i [2019-11-25 08:48:34,337 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a685d1b6-1f60-45fa-b23e-abcd8bac6f7b/bin/uautomizer/data/7d2a706dd/d74b8ad7215d44c083b78bfe181da64d/FLAG353814b04 [2019-11-25 08:48:34,814 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:48:34,815 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_a685d1b6-1f60-45fa-b23e-abcd8bac6f7b/sv-benchmarks/c/termination-memory-alloca/java_BubbleSort-alloca-2.i [2019-11-25 08:48:34,829 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a685d1b6-1f60-45fa-b23e-abcd8bac6f7b/bin/uautomizer/data/7d2a706dd/d74b8ad7215d44c083b78bfe181da64d/FLAG353814b04 [2019-11-25 08:48:35,302 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_a685d1b6-1f60-45fa-b23e-abcd8bac6f7b/bin/uautomizer/data/7d2a706dd/d74b8ad7215d44c083b78bfe181da64d [2019-11-25 08:48:35,305 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:48:35,306 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-25 08:48:35,306 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:48:35,307 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:48:35,310 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:48:35,311 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:48:35" (1/1) ... [2019-11-25 08:48:35,313 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@115c0d1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:48:35, skipping insertion in model container [2019-11-25 08:48:35,313 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:48:35" (1/1) ... [2019-11-25 08:48:35,320 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:48:35,358 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:48:35,685 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:48:35,695 INFO L201 MainTranslator]: Completed pre-run [2019-11-25 08:48:35,733 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:48:35,777 INFO L205 MainTranslator]: Completed translation [2019-11-25 08:48:35,777 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:48:35 WrapperNode [2019-11-25 08:48:35,777 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 08:48:35,778 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-25 08:48:35,778 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-25 08:48:35,778 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-25 08:48:35,786 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:48:35" (1/1) ... [2019-11-25 08:48:35,798 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:48:35" (1/1) ... [2019-11-25 08:48:35,817 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-25 08:48:35,818 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 08:48:35,818 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 08:48:35,818 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 08:48:35,826 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:48:35" (1/1) ... [2019-11-25 08:48:35,826 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:48:35" (1/1) ... [2019-11-25 08:48:35,829 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:48:35" (1/1) ... [2019-11-25 08:48:35,829 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:48:35" (1/1) ... [2019-11-25 08:48:35,834 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:48:35" (1/1) ... [2019-11-25 08:48:35,838 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:48:35" (1/1) ... [2019-11-25 08:48:35,839 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:48:35" (1/1) ... [2019-11-25 08:48:35,841 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 08:48:35,842 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 08:48:35,842 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 08:48:35,842 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 08:48:35,842 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:48:35" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a685d1b6-1f60-45fa-b23e-abcd8bac6f7b/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-25 08:48:35,922 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-25 08:48:35,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-25 08:48:35,923 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-25 08:48:35,923 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-25 08:48:35,923 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 08:48:35,923 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 08:48:36,145 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 08:48:36,145 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-25 08:48:36,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:48:36 BoogieIcfgContainer [2019-11-25 08:48:36,146 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 08:48:36,147 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-25 08:48:36,147 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-25 08:48:36,150 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-25 08:48:36,151 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-25 08:48:36,151 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 25.11 08:48:35" (1/3) ... [2019-11-25 08:48:36,152 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@604c3f88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 25.11 08:48:36, skipping insertion in model container [2019-11-25 08:48:36,152 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-25 08:48:36,152 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:48:35" (2/3) ... [2019-11-25 08:48:36,152 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@604c3f88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 25.11 08:48:36, skipping insertion in model container [2019-11-25 08:48:36,152 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-25 08:48:36,153 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:48:36" (3/3) ... [2019-11-25 08:48:36,154 INFO L371 chiAutomizerObserver]: Analyzing ICFG java_BubbleSort-alloca-2.i [2019-11-25 08:48:36,199 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-25 08:48:36,199 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-25 08:48:36,201 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-25 08:48:36,201 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 08:48:36,201 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 08:48:36,201 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-25 08:48:36,202 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 08:48:36,202 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-25 08:48:36,213 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2019-11-25 08:48:36,239 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-25 08:48:36,239 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:48:36,239 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:48:36,246 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-25 08:48:36,246 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-25 08:48:36,247 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-25 08:48:36,247 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2019-11-25 08:48:36,250 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-25 08:48:36,250 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:48:36,250 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:48:36,251 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-25 08:48:36,251 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-25 08:48:36,259 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-25 08:48:36,259 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-25 08:48:36,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:36,265 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2019-11-25 08:48:36,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:48:36,274 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568270085] [2019-11-25 08:48:36,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:48:36,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:48:36,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:48:36,393 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:48:36,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:36,394 INFO L82 PathProgramCache]: Analyzing trace with hash 47218, now seen corresponding path program 1 times [2019-11-25 08:48:36,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:48:36,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735905670] [2019-11-25 08:48:36,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:48:36,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:36,420 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-25 08:48:36,421 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735905670] [2019-11-25 08:48:36,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:48:36,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:48:36,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940217924] [2019-11-25 08:48:36,427 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-25 08:48:36,428 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:48:36,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-25 08:48:36,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-25 08:48:36,441 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 2 states. [2019-11-25 08:48:36,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:48:36,447 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2019-11-25 08:48:36,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-25 08:48:36,448 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 16 transitions. [2019-11-25 08:48:36,449 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-25 08:48:36,453 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 9 states and 12 transitions. [2019-11-25 08:48:36,454 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-11-25 08:48:36,454 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-11-25 08:48:36,454 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 12 transitions. [2019-11-25 08:48:36,455 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-25 08:48:36,455 INFO L688 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2019-11-25 08:48:36,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 12 transitions. [2019-11-25 08:48:36,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-11-25 08:48:36,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-11-25 08:48:36,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 12 transitions. [2019-11-25 08:48:36,480 INFO L711 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2019-11-25 08:48:36,480 INFO L591 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2019-11-25 08:48:36,480 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-25 08:48:36,480 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 12 transitions. [2019-11-25 08:48:36,481 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-25 08:48:36,481 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:48:36,481 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:48:36,482 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-25 08:48:36,482 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-25 08:48:36,482 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-25 08:48:36,482 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-25 08:48:36,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:36,483 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2019-11-25 08:48:36,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:48:36,483 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056296071] [2019-11-25 08:48:36,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:48:36,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:48:36,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:48:36,508 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:48:36,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:36,508 INFO L82 PathProgramCache]: Analyzing trace with hash 46877, now seen corresponding path program 1 times [2019-11-25 08:48:36,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:48:36,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306484226] [2019-11-25 08:48:36,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:48:36,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:36,540 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-25 08:48:36,540 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306484226] [2019-11-25 08:48:36,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:48:36,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:48:36,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373016614] [2019-11-25 08:48:36,541 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-25 08:48:36,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:48:36,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:48:36,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:48:36,542 INFO L87 Difference]: Start difference. First operand 9 states and 12 transitions. cyclomatic complexity: 4 Second operand 3 states. [2019-11-25 08:48:36,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:48:36,589 INFO L93 Difference]: Finished difference Result 10 states and 13 transitions. [2019-11-25 08:48:36,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:48:36,590 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 13 transitions. [2019-11-25 08:48:36,591 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-25 08:48:36,591 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 13 transitions. [2019-11-25 08:48:36,591 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-25 08:48:36,592 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-25 08:48:36,592 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2019-11-25 08:48:36,592 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-25 08:48:36,592 INFO L688 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-11-25 08:48:36,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2019-11-25 08:48:36,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-11-25 08:48:36,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-11-25 08:48:36,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2019-11-25 08:48:36,594 INFO L711 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-11-25 08:48:36,594 INFO L591 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-11-25 08:48:36,594 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-25 08:48:36,594 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2019-11-25 08:48:36,595 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-25 08:48:36,595 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:48:36,595 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:48:36,596 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-25 08:48:36,596 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-25 08:48:36,596 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-25 08:48:36,596 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-25 08:48:36,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:36,597 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 3 times [2019-11-25 08:48:36,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:48:36,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371347150] [2019-11-25 08:48:36,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:48:36,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:48:36,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:48:36,628 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:48:36,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:36,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1398152922, now seen corresponding path program 1 times [2019-11-25 08:48:36,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:48:36,632 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067467533] [2019-11-25 08:48:36,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:48:36,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:48:36,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:48:36,688 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:48:36,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:36,689 INFO L82 PathProgramCache]: Analyzing trace with hash -1893874754, now seen corresponding path program 1 times [2019-11-25 08:48:36,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:48:36,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414195107] [2019-11-25 08:48:36,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:48:36,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:48:36,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:48:36,756 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:48:36,901 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2019-11-25 08:48:37,033 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2019-11-25 08:48:37,289 WARN L192 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-11-25 08:48:37,383 INFO L210 LassoAnalysis]: Preferences: [2019-11-25 08:48:37,384 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-25 08:48:37,384 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-25 08:48:37,384 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-25 08:48:37,384 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-25 08:48:37,384 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:48:37,385 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-25 08:48:37,385 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-25 08:48:37,385 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-2.i_Iteration3_Lasso [2019-11-25 08:48:37,385 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-25 08:48:37,385 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-25 08:48:37,417 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-25 08:48:37,424 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-25 08:48:37,427 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-25 08:48:37,430 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-25 08:48:37,439 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-25 08:48:37,442 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-25 08:48:37,609 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2019-11-25 08:48:37,653 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-25 08:48:37,657 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-25 08:48:37,661 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-25 08:48:37,665 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-25 08:48:37,667 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-25 08:48:37,669 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-25 08:48:37,674 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-25 08:48:37,676 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-25 08:48:38,084 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-25 08:48:38,093 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a685d1b6-1f60-45fa-b23e-abcd8bac6f7b/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-25 08:48:38,100 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-25 08:48:38,102 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:48:38,103 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:48:38,103 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:48:38,104 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:48:38,104 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:48:38,109 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:48:38,109 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-25 08:48:38,115 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a685d1b6-1f60-45fa-b23e-abcd8bac6f7b/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-25 08:48:38,130 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-25 08:48:38,132 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:48:38,133 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:48:38,133 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:48:38,133 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:48:38,133 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:48:38,134 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:48:38,134 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-25 08:48:38,137 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a685d1b6-1f60-45fa-b23e-abcd8bac6f7b/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-25 08:48:38,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-25 08:48:38,154 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:48:38,154 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:48:38,154 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:48:38,155 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:48:38,155 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:48:38,157 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:48:38,157 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-25 08:48:38,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_a685d1b6-1f60-45fa-b23e-abcd8bac6f7b/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) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:48:38,178 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-25 08:48:38,180 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:48:38,180 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:48:38,180 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:48:38,180 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:48:38,187 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:48:38,188 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-25 08:48:38,193 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a685d1b6-1f60-45fa-b23e-abcd8bac6f7b/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) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:48:38,205 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:48:38,207 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:48:38,207 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:48:38,207 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:48:38,208 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:48:38,208 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:48:38,213 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:48:38,213 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:48:38,215 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a685d1b6-1f60-45fa-b23e-abcd8bac6f7b/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-25 08:48:38,226 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:48:38,228 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:48:38,228 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:48:38,228 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:48:38,228 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:48:38,228 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:48:38,229 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:48:38,230 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:48:38,231 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a685d1b6-1f60-45fa-b23e-abcd8bac6f7b/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) [2019-11-25 08:48:38,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-25 08:48:38,240 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:48:38,240 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:48:38,240 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:48:38,241 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:48:38,248 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:48:38,248 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:48:38,257 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a685d1b6-1f60-45fa-b23e-abcd8bac6f7b/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-25 08:48:38,264 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-25 08:48:38,267 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:48:38,267 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:48:38,267 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:48:38,267 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:48:38,270 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:48:38,270 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-25 08:48:38,275 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a685d1b6-1f60-45fa-b23e-abcd8bac6f7b/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) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:48:38,303 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-25 08:48:38,307 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:48:38,307 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:48:38,307 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:48:38,307 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:48:38,307 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:48:38,309 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:48:38,310 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:48:38,313 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a685d1b6-1f60-45fa-b23e-abcd8bac6f7b/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-25 08:48:38,321 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-25 08:48:38,323 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:48:38,323 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:48:38,323 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:48:38,323 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:48:38,348 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:48:38,348 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-25 08:48:38,366 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-25 08:48:38,503 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2019-11-25 08:48:38,503 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_a685d1b6-1f60-45fa-b23e-abcd8bac6f7b/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-25 08:48:38,582 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-25 08:48:38,586 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-11-25 08:48:38,586 INFO L510 LassoAnalysis]: Proved termination. [2019-11-25 08:48:38,587 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-25 08:48:38,621 INFO L297 tatePredicateManager]: 4 out of 5 supporting invariants were superfluous and have been removed [2019-11-25 08:48:38,633 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-25 08:48:38,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:38,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:38,697 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-25 08:48:38,699 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:48:38,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:38,739 INFO L255 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-25 08:48:38,740 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:48:38,762 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-25 08:48:38,766 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-25 08:48:38,766 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 4 Second operand 4 states. [2019-11-25 08:48:38,840 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-25 08:48:38,841 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-25 08:48:38,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-25 08:48:38,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2019-11-25 08:48:38,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 4 letters. Loop has 6 letters. [2019-11-25 08:48:38,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:48:38,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 10 letters. Loop has 6 letters. [2019-11-25 08:48:38,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:48:38,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 4 letters. Loop has 12 letters. [2019-11-25 08:48:38,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:48:38,846 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 22 transitions. [2019-11-25 08:48:38,847 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-25 08:48:38,847 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 15 states and 21 transitions. [2019-11-25 08:48:38,848 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-11-25 08:48:38,848 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-11-25 08:48:38,848 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 21 transitions. [2019-11-25 08:48:38,848 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-25 08:48:38,848 INFO L688 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2019-11-25 08:48:38,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 21 transitions. [2019-11-25 08:48:38,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2019-11-25 08:48:38,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-25 08:48:38,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 20 transitions. [2019-11-25 08:48:38,856 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 20 transitions. [2019-11-25 08:48:38,856 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 20 transitions. [2019-11-25 08:48:38,856 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-25 08:48:38,856 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 20 transitions. [2019-11-25 08:48:38,857 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-25 08:48:38,859 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:48:38,859 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:48:38,859 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-25 08:48:38,860 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-25 08:48:38,860 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-25 08:48:38,860 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-25 08:48:38,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:38,861 INFO L82 PathProgramCache]: Analyzing trace with hash 28695756, now seen corresponding path program 1 times [2019-11-25 08:48:38,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:48:38,861 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834862301] [2019-11-25 08:48:38,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:48:38,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:48:38,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:48:38,881 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:48:38,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:38,882 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 1 times [2019-11-25 08:48:38,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:48:38,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062748567] [2019-11-25 08:48:38,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:48:38,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:48:38,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:48:38,899 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:48:38,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:38,899 INFO L82 PathProgramCache]: Analyzing trace with hash 176800017, now seen corresponding path program 1 times [2019-11-25 08:48:38,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:48:38,900 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918450717] [2019-11-25 08:48:38,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:48:38,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:48:38,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:48:38,936 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:48:39,230 WARN L192 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-11-25 08:48:39,293 INFO L210 LassoAnalysis]: Preferences: [2019-11-25 08:48:39,294 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-25 08:48:39,294 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-25 08:48:39,294 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-25 08:48:39,294 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-25 08:48:39,294 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:48:39,294 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-25 08:48:39,294 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-25 08:48:39,294 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-2.i_Iteration4_Lasso [2019-11-25 08:48:39,295 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-25 08:48:39,295 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-25 08:48:39,299 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-25 08:48:39,306 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-25 08:48:39,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-25 08:48:39,311 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-25 08:48:39,437 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2019-11-25 08:48:39,506 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-25 08:48:39,512 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-25 08:48:39,517 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-25 08:48:39,519 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-25 08:48:39,522 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-25 08:48:39,525 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-25 08:48:39,527 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-25 08:48:39,531 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-25 08:48:39,534 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-25 08:48:39,537 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-25 08:48:39,848 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-25 08:48:39,849 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a685d1b6-1f60-45fa-b23e-abcd8bac6f7b/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-25 08:48:39,869 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-25 08:48:39,871 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:48:39,871 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:48:39,871 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:48:39,871 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:48:39,871 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:48:39,874 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:48:39,874 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-25 08:48:39,876 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a685d1b6-1f60-45fa-b23e-abcd8bac6f7b/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-25 08:48:39,894 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-25 08:48:39,896 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:48:39,896 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:48:39,896 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:48:39,896 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:48:39,897 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:48:39,897 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:48:39,897 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-25 08:48:39,899 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a685d1b6-1f60-45fa-b23e-abcd8bac6f7b/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-25 08:48:39,915 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-25 08:48:39,916 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:48:39,917 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:48:39,917 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:48:39,917 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:48:39,919 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:48:39,920 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-25 08:48:39,924 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a685d1b6-1f60-45fa-b23e-abcd8bac6f7b/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) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:48:39,943 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-25 08:48:39,945 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:48:39,945 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:48:39,945 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:48:39,946 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:48:39,950 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:48:39,950 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-25 08:48:39,956 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a685d1b6-1f60-45fa-b23e-abcd8bac6f7b/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) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:48:39,971 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-25 08:48:39,973 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:48:39,973 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:48:39,973 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:48:39,973 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:48:39,980 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:48:39,981 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-25 08:48:39,988 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a685d1b6-1f60-45fa-b23e-abcd8bac6f7b/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-25 08:48:40,006 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-25 08:48:40,010 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:48:40,010 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:48:40,010 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:48:40,011 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:48:40,024 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:48:40,024 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-25 08:48:40,045 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-25 08:48:40,116 INFO L443 ModelExtractionUtils]: Simplification made 24 calls to the SMT solver. [2019-11-25 08:48:40,116 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_a685d1b6-1f60-45fa-b23e-abcd8bac6f7b/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-25 08:48:40,125 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-25 08:48:40,128 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-25 08:48:40,128 INFO L510 LassoAnalysis]: Proved termination. [2019-11-25 08:48:40,129 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-25 08:48:40,141 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-11-25 08:48:40,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:40,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:40,166 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-25 08:48:40,167 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:48:40,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:40,176 INFO L255 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-25 08:48:40,176 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:48:40,196 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-25 08:48:40,196 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-25 08:48:40,196 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 20 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-11-25 08:48:40,230 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-25 08:48:40,232 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-25 08:48:40,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-25 08:48:40,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2019-11-25 08:48:40,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 5 letters. Loop has 3 letters. [2019-11-25 08:48:40,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:48:40,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 8 letters. Loop has 3 letters. [2019-11-25 08:48:40,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:48:40,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 5 letters. Loop has 6 letters. [2019-11-25 08:48:40,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:48:40,234 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 44 transitions. [2019-11-25 08:48:40,237 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-25 08:48:40,237 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 20 states and 28 transitions. [2019-11-25 08:48:40,238 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-11-25 08:48:40,238 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-11-25 08:48:40,238 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 28 transitions. [2019-11-25 08:48:40,238 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-25 08:48:40,238 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 28 transitions. [2019-11-25 08:48:40,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 28 transitions. [2019-11-25 08:48:40,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 14. [2019-11-25 08:48:40,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-25 08:48:40,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2019-11-25 08:48:40,240 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-11-25 08:48:40,240 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-11-25 08:48:40,240 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-25 08:48:40,240 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2019-11-25 08:48:40,241 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-25 08:48:40,241 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:48:40,241 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:48:40,246 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:48:40,246 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-25 08:48:40,246 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-25 08:48:40,246 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-25 08:48:40,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:40,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1421271829, now seen corresponding path program 1 times [2019-11-25 08:48:40,247 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:48:40,248 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802350649] [2019-11-25 08:48:40,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:48:40,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:40,323 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-25 08:48:40,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802350649] [2019-11-25 08:48:40,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1175531700] [2019-11-25 08:48:40,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a685d1b6-1f60-45fa-b23e-abcd8bac6f7b/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-25 08:48:40,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:40,373 INFO L255 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-25 08:48:40,375 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:48:40,394 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-25 08:48:40,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:48:40,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-11-25 08:48:40,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060262641] [2019-11-25 08:48:40,400 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-25 08:48:40,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:40,401 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 2 times [2019-11-25 08:48:40,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:48:40,402 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546789360] [2019-11-25 08:48:40,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:48:40,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:48:40,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:48:40,425 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:48:40,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:48:40,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-25 08:48:40,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-25 08:48:40,527 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. cyclomatic complexity: 7 Second operand 7 states. [2019-11-25 08:48:40,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:48:40,597 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2019-11-25 08:48:40,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-25 08:48:40,598 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 36 transitions. [2019-11-25 08:48:40,599 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-25 08:48:40,600 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 25 states and 34 transitions. [2019-11-25 08:48:40,600 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-11-25 08:48:40,600 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-11-25 08:48:40,601 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 34 transitions. [2019-11-25 08:48:40,601 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-25 08:48:40,601 INFO L688 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2019-11-25 08:48:40,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 34 transitions. [2019-11-25 08:48:40,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 17. [2019-11-25 08:48:40,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-25 08:48:40,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2019-11-25 08:48:40,603 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2019-11-25 08:48:40,603 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2019-11-25 08:48:40,604 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-25 08:48:40,604 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 23 transitions. [2019-11-25 08:48:40,604 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-25 08:48:40,604 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:48:40,605 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:48:40,606 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-11-25 08:48:40,606 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-25 08:48:40,606 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-25 08:48:40,606 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-25 08:48:40,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:40,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1373641048, now seen corresponding path program 2 times [2019-11-25 08:48:40,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:48:40,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178275649] [2019-11-25 08:48:40,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:48:40,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:48:40,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:48:40,639 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:48:40,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:40,640 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 3 times [2019-11-25 08:48:40,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:48:40,640 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943600876] [2019-11-25 08:48:40,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:48:40,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:48:40,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:48:40,657 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:48:40,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:40,658 INFO L82 PathProgramCache]: Analyzing trace with hash -307910395, now seen corresponding path program 1 times [2019-11-25 08:48:40,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:48:40,658 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142066873] [2019-11-25 08:48:40,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:48:40,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:41,020 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-25 08:48:41,020 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142066873] [2019-11-25 08:48:41,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2035450469] [2019-11-25 08:48:41,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a685d1b6-1f60-45fa-b23e-abcd8bac6f7b/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-25 08:48:41,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:41,085 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-25 08:48:41,086 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:48:41,184 INFO L343 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2019-11-25 08:48:41,185 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-25 08:48:41,186 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:48:41,189 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:48:41,189 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-25 08:48:41,189 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:3 [2019-11-25 08:48:41,211 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-25 08:48:41,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:48:41,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 15 [2019-11-25 08:48:41,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556187388] [2019-11-25 08:48:41,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:48:41,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-25 08:48:41,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2019-11-25 08:48:41,322 INFO L87 Difference]: Start difference. First operand 17 states and 23 transitions. cyclomatic complexity: 8 Second operand 15 states. [2019-11-25 08:48:41,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:48:41,518 INFO L93 Difference]: Finished difference Result 37 states and 50 transitions. [2019-11-25 08:48:41,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-25 08:48:41,520 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 50 transitions. [2019-11-25 08:48:41,521 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-25 08:48:41,523 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 37 states and 50 transitions. [2019-11-25 08:48:41,524 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2019-11-25 08:48:41,524 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2019-11-25 08:48:41,524 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 50 transitions. [2019-11-25 08:48:41,524 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-25 08:48:41,524 INFO L688 BuchiCegarLoop]: Abstraction has 37 states and 50 transitions. [2019-11-25 08:48:41,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 50 transitions. [2019-11-25 08:48:41,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 26. [2019-11-25 08:48:41,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-25 08:48:41,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2019-11-25 08:48:41,528 INFO L711 BuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2019-11-25 08:48:41,528 INFO L591 BuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2019-11-25 08:48:41,528 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-25 08:48:41,528 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 35 transitions. [2019-11-25 08:48:41,529 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-25 08:48:41,529 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:48:41,529 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:48:41,533 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:48:41,533 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-25 08:48:41,534 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-25 08:48:41,534 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-25 08:48:41,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:41,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1371794006, now seen corresponding path program 2 times [2019-11-25 08:48:41,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:48:41,534 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573557647] [2019-11-25 08:48:41,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:48:41,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:48:41,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:48:41,591 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:48:41,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:41,595 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 4 times [2019-11-25 08:48:41,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:48:41,595 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267297336] [2019-11-25 08:48:41,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:48:41,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:48:41,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:48:41,608 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:48:41,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:41,609 INFO L82 PathProgramCache]: Analyzing trace with hash 501436231, now seen corresponding path program 3 times [2019-11-25 08:48:41,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:48:41,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449164969] [2019-11-25 08:48:41,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:48:41,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:48:41,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:48:41,675 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:48:42,213 WARN L192 SmtUtils]: Spent 427.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 97 [2019-11-25 08:48:42,327 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2019-11-25 08:48:42,333 INFO L210 LassoAnalysis]: Preferences: [2019-11-25 08:48:42,333 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-25 08:48:42,333 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-25 08:48:42,333 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-25 08:48:42,333 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-25 08:48:42,333 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:48:42,333 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-25 08:48:42,333 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-25 08:48:42,333 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-2.i_Iteration7_Lasso [2019-11-25 08:48:42,334 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-25 08:48:42,334 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-25 08:48:42,337 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-25 08:48:42,355 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-25 08:48:42,359 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-25 08:48:42,577 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2019-11-25 08:48:42,650 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-25 08:48:42,653 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-25 08:48:42,655 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-25 08:48:42,657 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-25 08:48:42,660 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-25 08:48:42,662 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-25 08:48:42,664 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-25 08:48:42,666 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-25 08:48:42,674 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-25 08:48:42,677 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-25 08:48:42,681 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-25 08:48:43,023 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-25 08:48:43,023 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a685d1b6-1f60-45fa-b23e-abcd8bac6f7b/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-25 08:48:43,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-25 08:48:43,031 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:48:43,031 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:48:43,031 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:48:43,031 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:48:43,031 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:48:43,032 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:48:43,032 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:48:43,033 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a685d1b6-1f60-45fa-b23e-abcd8bac6f7b/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) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:48:43,038 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-25 08:48:43,039 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:48:43,040 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:48:43,040 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:48:43,040 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:48:43,041 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:48:43,041 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-25 08:48:43,045 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a685d1b6-1f60-45fa-b23e-abcd8bac6f7b/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-25 08:48:43,058 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-25 08:48:43,060 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:48:43,060 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:48:43,060 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:48:43,060 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:48:43,064 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:48:43,064 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-25 08:48:43,071 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a685d1b6-1f60-45fa-b23e-abcd8bac6f7b/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) [2019-11-25 08:48:43,082 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-25 08:48:43,084 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:48:43,084 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:48:43,084 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:48:43,085 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:48:43,093 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:48:43,093 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:48:43,113 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-25 08:48:43,177 INFO L443 ModelExtractionUtils]: Simplification made 33 calls to the SMT solver. [2019-11-25 08:48:43,177 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_a685d1b6-1f60-45fa-b23e-abcd8bac6f7b/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-25 08:48:43,182 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-25 08:48:43,184 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-11-25 08:48:43,184 INFO L510 LassoAnalysis]: Proved termination. [2019-11-25 08:48:43,184 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_sort_~x.base)_3, ULTIMATE.start_sort_~i~0) = 1*v_rep(select #length ULTIMATE.start_sort_~x.base)_3 - 4*ULTIMATE.start_sort_~i~0 Supporting invariants [1*ULTIMATE.start_sort_~x.offset >= 0] [2019-11-25 08:48:43,217 INFO L297 tatePredicateManager]: 7 out of 8 supporting invariants were superfluous and have been removed [2019-11-25 08:48:43,219 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-25 08:48:43,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:43,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:43,272 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-25 08:48:43,273 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:48:43,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:43,289 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-25 08:48:43,290 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:48:43,304 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-25 08:48:43,304 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-25 08:48:43,304 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 11 Second operand 4 states. [2019-11-25 08:48:43,350 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-25 08:48:43,352 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-25 08:48:43,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-25 08:48:43,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2019-11-25 08:48:43,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 14 letters. Loop has 3 letters. [2019-11-25 08:48:43,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:48:43,352 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-25 08:48:43,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:43,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:43,385 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-25 08:48:43,385 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:48:43,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:43,401 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-25 08:48:43,401 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:48:43,413 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-25 08:48:43,414 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-25 08:48:43,414 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 11 Second operand 4 states. [2019-11-25 08:48:43,445 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-25 08:48:43,449 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-25 08:48:43,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-25 08:48:43,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2019-11-25 08:48:43,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 14 letters. Loop has 3 letters. [2019-11-25 08:48:43,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:48:43,450 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-25 08:48:43,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:43,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:43,483 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-25 08:48:43,484 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:48:43,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:43,497 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-25 08:48:43,497 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:48:43,509 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-25 08:48:43,509 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-25 08:48:43,510 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 11 Second operand 4 states. [2019-11-25 08:48:43,556 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-25 08:48:43,557 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-25 08:48:43,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-25 08:48:43,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2019-11-25 08:48:43,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 14 letters. Loop has 3 letters. [2019-11-25 08:48:43,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:48:43,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 17 letters. Loop has 3 letters. [2019-11-25 08:48:43,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:48:43,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 14 letters. Loop has 6 letters. [2019-11-25 08:48:43,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:48:43,560 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 58 transitions. [2019-11-25 08:48:43,561 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-25 08:48:43,561 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 0 states and 0 transitions. [2019-11-25 08:48:43,562 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-25 08:48:43,562 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-25 08:48:43,562 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-25 08:48:43,562 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-25 08:48:43,562 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-25 08:48:43,562 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-25 08:48:43,562 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-25 08:48:43,563 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-25 08:48:43,563 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-25 08:48:43,563 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-25 08:48:43,563 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-25 08:48:43,568 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 25.11 08:48:43 BoogieIcfgContainer [2019-11-25 08:48:43,568 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-25 08:48:43,568 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 08:48:43,568 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 08:48:43,569 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 08:48:43,569 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:48:36" (3/4) ... [2019-11-25 08:48:43,572 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-25 08:48:43,572 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 08:48:43,574 INFO L168 Benchmark]: Toolchain (without parser) took 8267.94 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 315.6 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -169.6 MB). Peak memory consumption was 146.1 MB. Max. memory is 11.5 GB. [2019-11-25 08:48:43,574 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:48:43,575 INFO L168 Benchmark]: CACSL2BoogieTranslator took 471.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -166.5 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2019-11-25 08:48:43,575 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-25 08:48:43,576 INFO L168 Benchmark]: Boogie Preprocessor took 23.56 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:48:43,576 INFO L168 Benchmark]: RCFGBuilder took 304.73 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: 21.4 MB). Peak memory consumption was 21.4 MB. Max. memory is 11.5 GB. [2019-11-25 08:48:43,577 INFO L168 Benchmark]: BuchiAutomizer took 7421.41 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 187.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -31.1 MB). Peak memory consumption was 156.0 MB. Max. memory is 11.5 GB. [2019-11-25 08:48:43,577 INFO L168 Benchmark]: Witness Printer took 4.04 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:48:43,580 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.25 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 471.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -166.5 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 39.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.56 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 304.73 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: 21.4 MB). Peak memory consumption was 21.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7421.41 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 187.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -31.1 MB). Peak memory consumption was 156.0 MB. Max. memory is 11.5 GB. * Witness Printer took 4.04 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (4 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -2 * pass + unknown-#length-unknown[x] and consists of 4 locations. One deterministic module has affine ranking function -1 * i + -1 * pass + n and consists of 4 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[x] + -4 * i 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.3s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 6.2s. Construction of modules took 0.2s. Büchi inclusion checks took 0.7s. 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: 28ms 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...