./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-memsafety/java_BubbleSort-alloca-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_86461fb1-9130-430f-99b3-7a63c3a03261/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_86461fb1-9130-430f-99b3-7a63c3a03261/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_86461fb1-9130-430f-99b3-7a63c3a03261/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_86461fb1-9130-430f-99b3-7a63c3a03261/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/java_BubbleSort-alloca-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_86461fb1-9130-430f-99b3-7a63c3a03261/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_86461fb1-9130-430f-99b3-7a63c3a03261/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 32bit --witnessprinter.graph.data.programhash 862be090098a4271d6e1a31a6f1302665ccfc795 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud-vcloud-master/worker/run_dir_86461fb1-9130-430f-99b3-7a63c3a03261/bin/uautomizer/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 02:46:39,378 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 02:46:39,381 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 02:46:39,392 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 02:46:39,392 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 02:46:39,393 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 02:46:39,395 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 02:46:39,397 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 02:46:39,399 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 02:46:39,400 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 02:46:39,401 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 02:46:39,402 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 02:46:39,402 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 02:46:39,403 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 02:46:39,404 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 02:46:39,405 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 02:46:39,406 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 02:46:39,407 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 02:46:39,409 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 02:46:39,411 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 02:46:39,412 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 02:46:39,414 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 02:46:39,415 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 02:46:39,416 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 02:46:39,418 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 02:46:39,419 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 02:46:39,419 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 02:46:39,420 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 02:46:39,420 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 02:46:39,421 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 02:46:39,421 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 02:46:39,422 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 02:46:39,423 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 02:46:39,424 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 02:46:39,425 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 02:46:39,425 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 02:46:39,426 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 02:46:39,426 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 02:46:39,426 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 02:46:39,427 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 02:46:39,428 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 02:46:39,429 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_86461fb1-9130-430f-99b3-7a63c3a03261/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-20 02:46:39,444 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 02:46:39,445 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 02:46:39,446 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 02:46:39,446 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 02:46:39,446 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 02:46:39,446 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-20 02:46:39,447 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-20 02:46:39,447 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-20 02:46:39,447 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-20 02:46:39,447 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-20 02:46:39,447 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-20 02:46:39,448 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 02:46:39,448 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 02:46:39,448 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-20 02:46:39,448 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 02:46:39,448 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 02:46:39,449 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 02:46:39,449 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-20 02:46:39,449 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-20 02:46:39,449 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-20 02:46:39,450 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 02:46:39,450 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 02:46:39,450 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-20 02:46:39,450 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 02:46:39,450 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-20 02:46:39,451 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 02:46:39,451 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 02:46:39,451 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-20 02:46:39,451 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 02:46:39,452 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 02:46:39,452 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-20 02:46:39,453 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-20 02:46:39,453 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_86461fb1-9130-430f-99b3-7a63c3a03261/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 862be090098a4271d6e1a31a6f1302665ccfc795 [2019-11-20 02:46:39,590 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 02:46:39,601 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 02:46:39,604 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 02:46:39,606 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 02:46:39,606 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 02:46:39,607 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_86461fb1-9130-430f-99b3-7a63c3a03261/bin/uautomizer/../../sv-benchmarks/c/array-memsafety/java_BubbleSort-alloca-1.i [2019-11-20 02:46:39,661 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_86461fb1-9130-430f-99b3-7a63c3a03261/bin/uautomizer/data/b3d4abe3b/610919a9326b4d9a95862a7647c795d6/FLAGdf2f3b663 [2019-11-20 02:46:40,151 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 02:46:40,152 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_86461fb1-9130-430f-99b3-7a63c3a03261/sv-benchmarks/c/array-memsafety/java_BubbleSort-alloca-1.i [2019-11-20 02:46:40,164 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_86461fb1-9130-430f-99b3-7a63c3a03261/bin/uautomizer/data/b3d4abe3b/610919a9326b4d9a95862a7647c795d6/FLAGdf2f3b663 [2019-11-20 02:46:40,438 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_86461fb1-9130-430f-99b3-7a63c3a03261/bin/uautomizer/data/b3d4abe3b/610919a9326b4d9a95862a7647c795d6 [2019-11-20 02:46:40,440 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 02:46:40,442 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 02:46:40,443 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 02:46:40,443 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 02:46:40,446 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 02:46:40,447 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:46:40" (1/1) ... [2019-11-20 02:46:40,449 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d30bae3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:46:40, skipping insertion in model container [2019-11-20 02:46:40,450 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:46:40" (1/1) ... [2019-11-20 02:46:40,456 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 02:46:40,499 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 02:46:40,892 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 02:46:40,902 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 02:46:40,938 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 02:46:40,999 INFO L192 MainTranslator]: Completed translation [2019-11-20 02:46:40,999 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:46:40 WrapperNode [2019-11-20 02:46:40,999 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 02:46:41,002 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 02:46:41,002 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 02:46:41,002 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 02:46:41,011 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:46:40" (1/1) ... [2019-11-20 02:46:41,027 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:46:40" (1/1) ... [2019-11-20 02:46:41,045 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 02:46:41,045 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 02:46:41,046 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 02:46:41,046 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 02:46:41,054 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:46:40" (1/1) ... [2019-11-20 02:46:41,055 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:46:40" (1/1) ... [2019-11-20 02:46:41,058 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:46:40" (1/1) ... [2019-11-20 02:46:41,058 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:46:40" (1/1) ... [2019-11-20 02:46:41,064 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:46:40" (1/1) ... [2019-11-20 02:46:41,068 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:46:40" (1/1) ... [2019-11-20 02:46:41,070 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:46:40" (1/1) ... [2019-11-20 02:46:41,072 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 02:46:41,073 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 02:46:41,073 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 02:46:41,073 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 02:46:41,074 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:46:40" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_86461fb1-9130-430f-99b3-7a63c3a03261/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:46:41,130 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-20 02:46:41,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-20 02:46:41,130 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 02:46:41,131 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-20 02:46:41,131 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 02:46:41,131 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 02:46:41,411 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 02:46:41,411 INFO L285 CfgBuilder]: Removed 9 assume(true) statements. [2019-11-20 02:46:41,412 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:46:41 BoogieIcfgContainer [2019-11-20 02:46:41,412 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 02:46:41,413 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-20 02:46:41,413 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-20 02:46:41,416 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-20 02:46:41,417 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-20 02:46:41,417 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.11 02:46:40" (1/3) ... [2019-11-20 02:46:41,418 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@609cdbed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 02:46:41, skipping insertion in model container [2019-11-20 02:46:41,418 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-20 02:46:41,419 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:46:40" (2/3) ... [2019-11-20 02:46:41,419 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@609cdbed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 02:46:41, skipping insertion in model container [2019-11-20 02:46:41,419 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-20 02:46:41,419 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:46:41" (3/3) ... [2019-11-20 02:46:41,421 INFO L371 chiAutomizerObserver]: Analyzing ICFG java_BubbleSort-alloca-1.i [2019-11-20 02:46:41,480 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-20 02:46:41,481 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-20 02:46:41,481 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-20 02:46:41,481 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 02:46:41,481 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 02:46:41,481 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-20 02:46:41,481 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 02:46:41,482 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-20 02:46:41,497 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2019-11-20 02:46:41,525 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-20 02:46:41,525 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 02:46:41,525 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 02:46:41,532 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-20 02:46:41,532 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-20 02:46:41,532 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-20 02:46:41,532 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2019-11-20 02:46:41,535 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-20 02:46:41,535 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 02:46:41,535 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 02:46:41,535 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-20 02:46:41,535 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-20 02:46:41,543 INFO L794 eck$LassoCheckResult]: Stem: 15#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 13#L-1true havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 9#L523true assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 14#L523-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;main_~i~1 := 0; 4#L528-3true [2019-11-20 02:46:41,543 INFO L796 eck$LassoCheckResult]: Loop: 4#L528-3true assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 3#L528-2true main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 4#L528-3true [2019-11-20 02:46:41,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:46:41,550 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2019-11-20 02:46:41,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:46:41,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603094687] [2019-11-20 02:46:41,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:46:41,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:46:41,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:46:41,709 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 02:46:41,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:46:41,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2019-11-20 02:46:41,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:46:41,711 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183003973] [2019-11-20 02:46:41,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:46:41,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:46:41,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:46:41,726 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 02:46:41,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:46:41,728 INFO L82 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2019-11-20 02:46:41,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:46:41,728 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552233976] [2019-11-20 02:46:41,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:46:41,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:46:41,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:46:41,763 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 02:46:41,944 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-11-20 02:46:42,009 INFO L210 LassoAnalysis]: Preferences: [2019-11-20 02:46:42,010 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-20 02:46:42,010 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-20 02:46:42,010 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-20 02:46:42,010 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-20 02:46:42,010 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:46:42,010 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-20 02:46:42,011 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-20 02:46:42,011 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-1.i_Iteration1_Lasso [2019-11-20 02:46:42,011 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-20 02:46:42,011 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-20 02:46:42,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:46:42,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:46:42,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:46:42,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:46:42,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:46:42,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:46:42,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:46:42,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:46:42,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:46:42,485 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-20 02:46:42,488 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_86461fb1-9130-430f-99b3-7a63c3a03261/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) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:46:42,494 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 02:46:42,496 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 02:46:42,496 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 02:46:42,497 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 02:46:42,497 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 02:46:42,497 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 02:46:42,499 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 02:46:42,499 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 02:46:42,503 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_86461fb1-9130-430f-99b3-7a63c3a03261/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) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:46:42,511 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 02:46:42,512 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 02:46:42,512 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 02:46:42,512 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 02:46:42,512 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 02:46:42,513 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 02:46:42,513 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 02:46:42,514 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 02:46:42,519 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_86461fb1-9130-430f-99b3-7a63c3a03261/bin/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 02:46:42,534 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 02:46:42,536 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 02:46:42,537 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 02:46:42,537 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 02:46:42,537 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 02:46:42,540 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 02:46:42,541 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:46:42,545 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_86461fb1-9130-430f-99b3-7a63c3a03261/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-20 02:46:42,555 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 02:46:42,557 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 02:46:42,557 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 02:46:42,557 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 02:46:42,557 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 02:46:42,561 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 02:46:42,561 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 02:46:42,565 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_86461fb1-9130-430f-99b3-7a63c3a03261/bin/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 02:46:42,575 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 02:46:42,577 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 02:46:42,577 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 02:46:42,577 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 02:46:42,577 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 02:46:42,577 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 02:46:42,578 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 02:46:42,578 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 02:46:42,580 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_86461fb1-9130-430f-99b3-7a63c3a03261/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) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:46:42,592 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 02:46:42,594 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 02:46:42,594 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 02:46:42,595 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 02:46:42,595 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 02:46:42,595 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 02:46:42,596 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 02:46:42,596 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 02:46:42,598 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_86461fb1-9130-430f-99b3-7a63c3a03261/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-20 02:46:42,615 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 02:46:42,617 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 02:46:42,617 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 02:46:42,618 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 02:46:42,618 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 02:46:42,618 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 02:46:42,619 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 02:46:42,619 INFO L402 nArgumentSynthesizer]: A total of 0 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-20 02:46:42,621 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_86461fb1-9130-430f-99b3-7a63c3a03261/bin/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:46:42,632 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 02:46:42,634 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 02:46:42,634 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 02:46:42,634 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 02:46:42,634 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 02:46:42,648 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 02:46:42,649 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 02:46:42,667 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-20 02:46:42,771 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2019-11-20 02:46:42,771 INFO L444 ModelExtractionUtils]: 3 out of 22 variables were initially zero. Simplification set additionally 15 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_86461fb1-9130-430f-99b3-7a63c3a03261/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-20 02:46:42,787 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-20 02:46:42,791 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-11-20 02:46:42,791 INFO L510 LassoAnalysis]: Proved termination. [2019-11-20 02:46:42,792 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1, v_rep(select #length ULTIMATE.start_main_~numbers~0.base)_1) = -4*ULTIMATE.start_main_~i~1 + 1*v_rep(select #length ULTIMATE.start_main_~numbers~0.base)_1 Supporting invariants [1*ULTIMATE.start_main_~numbers~0.offset >= 0] [2019-11-20 02:46:42,831 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2019-11-20 02:46:42,844 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-20 02:46:42,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:46:42,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:46:42,899 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 02:46:42,900 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:46:42,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:46:42,914 INFO L255 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 02:46:42,914 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:46:42,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:46:42,964 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-20 02:46:42,965 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states. Second operand 3 states. [2019-11-20 02:46:43,052 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states.. Second operand 3 states. Result 38 states and 56 transitions. Complement of second has 7 states. [2019-11-20 02:46:43,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-20 02:46:43,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-20 02:46:43,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2019-11-20 02:46:43,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 4 letters. Loop has 2 letters. [2019-11-20 02:46:43,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 02:46:43,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 6 letters. Loop has 2 letters. [2019-11-20 02:46:43,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 02:46:43,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 4 letters. Loop has 4 letters. [2019-11-20 02:46:43,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 02:46:43,060 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 56 transitions. [2019-11-20 02:46:43,063 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-20 02:46:43,067 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 13 states and 18 transitions. [2019-11-20 02:46:43,068 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-20 02:46:43,068 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-20 02:46:43,069 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 18 transitions. [2019-11-20 02:46:43,069 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 02:46:43,070 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2019-11-20 02:46:43,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 18 transitions. [2019-11-20 02:46:43,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-11-20 02:46:43,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-20 02:46:43,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2019-11-20 02:46:43,110 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2019-11-20 02:46:43,110 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2019-11-20 02:46:43,110 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-20 02:46:43,110 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2019-11-20 02:46:43,113 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-20 02:46:43,114 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 02:46:43,114 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 02:46:43,114 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-20 02:46:43,115 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-20 02:46:43,115 INFO L794 eck$LassoCheckResult]: Stem: 126#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 120#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 121#L523 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 122#L523-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;main_~i~1 := 0; 123#L528-3 assume !(main_~i~1 < main_~array_size~0); 127#L528-4 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; 130#L515-3 [2019-11-20 02:46:43,115 INFO L796 eck$LassoCheckResult]: Loop: 130#L515-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 129#L516-3 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 131#L515-2 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 130#L515-3 [2019-11-20 02:46:43,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:46:43,116 INFO L82 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 1 times [2019-11-20 02:46:43,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:46:43,116 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543499454] [2019-11-20 02:46:43,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:46:43,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:46:43,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:46:43,221 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543499454] [2019-11-20 02:46:43,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:46:43,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:46:43,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354591489] [2019-11-20 02:46:43,225 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-20 02:46:43,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:46:43,226 INFO L82 PathProgramCache]: Analyzing trace with hash 60779, now seen corresponding path program 1 times [2019-11-20 02:46:43,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:46:43,232 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091742490] [2019-11-20 02:46:43,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:46:43,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:46:43,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:46:43,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091742490] [2019-11-20 02:46:43,254 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:46:43,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 02:46:43,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253750051] [2019-11-20 02:46:43,254 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-20 02:46:43,255 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:46:43,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 02:46:43,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:46:43,258 INFO L87 Difference]: Start difference. First operand 13 states and 18 transitions. cyclomatic complexity: 7 Second operand 3 states. [2019-11-20 02:46:43,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:46:43,281 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2019-11-20 02:46:43,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 02:46:43,282 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 19 transitions. [2019-11-20 02:46:43,283 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-20 02:46:43,283 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 19 transitions. [2019-11-20 02:46:43,283 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-11-20 02:46:43,284 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-11-20 02:46:43,284 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2019-11-20 02:46:43,284 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 02:46:43,284 INFO L688 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-11-20 02:46:43,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2019-11-20 02:46:43,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-11-20 02:46:43,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-20 02:46:43,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2019-11-20 02:46:43,286 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-11-20 02:46:43,287 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-11-20 02:46:43,287 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-20 02:46:43,287 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2019-11-20 02:46:43,287 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-20 02:46:43,288 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 02:46:43,288 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 02:46:43,288 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-20 02:46:43,288 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-20 02:46:43,289 INFO L794 eck$LassoCheckResult]: Stem: 161#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 155#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 156#L523 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 157#L523-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;main_~i~1 := 0; 158#L528-3 assume !(main_~i~1 < main_~array_size~0); 162#L528-4 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; 165#L515-3 [2019-11-20 02:46:43,289 INFO L796 eck$LassoCheckResult]: Loop: 165#L515-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 166#L516-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); 167#L517 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem4;havoc sort_#t~mem5;call sort_#t~mem6 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);sort_~temp~0 := sort_#t~mem6;havoc sort_#t~mem6;call sort_#t~mem7 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4);call write~int(sort_#t~mem7, sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);havoc sort_#t~mem7;call write~int(sort_~temp~0, sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 163#L516-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 164#L516-3 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 168#L515-2 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 165#L515-3 [2019-11-20 02:46:43,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:46:43,289 INFO L82 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 2 times [2019-11-20 02:46:43,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:46:43,290 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820107132] [2019-11-20 02:46:43,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:46:43,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:46:43,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:46:43,334 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820107132] [2019-11-20 02:46:43,334 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:46:43,334 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:46:43,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959005464] [2019-11-20 02:46:43,335 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-20 02:46:43,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:46:43,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1812321306, now seen corresponding path program 1 times [2019-11-20 02:46:43,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:46:43,336 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238395596] [2019-11-20 02:46:43,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:46:43,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:46:43,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:46:43,371 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 02:46:43,484 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2019-11-20 02:46:43,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:46:43,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:46:43,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:46:43,526 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. cyclomatic complexity: 7 Second operand 4 states. [2019-11-20 02:46:43,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:46:43,559 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2019-11-20 02:46:43,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:46:43,560 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 19 transitions. [2019-11-20 02:46:43,561 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-20 02:46:43,561 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 19 transitions. [2019-11-20 02:46:43,561 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-11-20 02:46:43,562 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-11-20 02:46:43,562 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2019-11-20 02:46:43,562 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 02:46:43,562 INFO L688 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-11-20 02:46:43,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2019-11-20 02:46:43,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2019-11-20 02:46:43,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-20 02:46:43,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2019-11-20 02:46:43,564 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2019-11-20 02:46:43,564 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2019-11-20 02:46:43,564 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-20 02:46:43,564 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 18 transitions. [2019-11-20 02:46:43,565 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-20 02:46:43,565 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 02:46:43,565 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 02:46:43,566 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:46:43,566 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-20 02:46:43,566 INFO L794 eck$LassoCheckResult]: Stem: 197#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 191#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 192#L523 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 193#L523-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;main_~i~1 := 0; 194#L528-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 195#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 196#L528-3 assume !(main_~i~1 < main_~array_size~0); 198#L528-4 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; 201#L515-3 [2019-11-20 02:46:43,566 INFO L796 eck$LassoCheckResult]: Loop: 201#L515-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 202#L516-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); 203#L517 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem4;havoc sort_#t~mem5;call sort_#t~mem6 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);sort_~temp~0 := sort_#t~mem6;havoc sort_#t~mem6;call sort_#t~mem7 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4);call write~int(sort_#t~mem7, sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);havoc sort_#t~mem7;call write~int(sort_~temp~0, sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 199#L516-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 200#L516-3 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 204#L515-2 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 201#L515-3 [2019-11-20 02:46:43,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:46:43,567 INFO L82 PathProgramCache]: Analyzing trace with hash 176793839, now seen corresponding path program 1 times [2019-11-20 02:46:43,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:46:43,567 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478067422] [2019-11-20 02:46:43,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:46:43,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:46:43,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:46:43,614 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 02:46:43,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:46:43,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1812321306, now seen corresponding path program 2 times [2019-11-20 02:46:43,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:46:43,615 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293952655] [2019-11-20 02:46:43,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:46:43,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:46:43,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:46:43,649 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 02:46:43,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:46:43,650 INFO L82 PathProgramCache]: Analyzing trace with hash -256077176, now seen corresponding path program 1 times [2019-11-20 02:46:43,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:46:43,650 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733695984] [2019-11-20 02:46:43,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:46:43,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:46:43,745 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 02:46:43,746 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733695984] [2019-11-20 02:46:43,746 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [649212591] [2019-11-20 02:46:43,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_86461fb1-9130-430f-99b3-7a63c3a03261/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 02:46:43,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:46:43,831 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 02:46:43,833 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:46:43,872 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 02:46:43,872 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 02:46:43,873 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2019-11-20 02:46:43,873 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777676944] [2019-11-20 02:46:43,994 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2019-11-20 02:46:44,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:46:44,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 02:46:44,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-20 02:46:44,037 INFO L87 Difference]: Start difference. First operand 14 states and 18 transitions. cyclomatic complexity: 6 Second operand 8 states. [2019-11-20 02:46:44,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:46:44,145 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2019-11-20 02:46:44,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-20 02:46:44,147 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 29 transitions. [2019-11-20 02:46:44,148 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-20 02:46:44,148 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 17 states and 20 transitions. [2019-11-20 02:46:44,148 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-11-20 02:46:44,149 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-11-20 02:46:44,149 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 20 transitions. [2019-11-20 02:46:44,149 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 02:46:44,149 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-11-20 02:46:44,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 20 transitions. [2019-11-20 02:46:44,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-11-20 02:46:44,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-20 02:46:44,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2019-11-20 02:46:44,151 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2019-11-20 02:46:44,151 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2019-11-20 02:46:44,151 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-20 02:46:44,151 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. [2019-11-20 02:46:44,152 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-20 02:46:44,152 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 02:46:44,152 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 02:46:44,152 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2019-11-20 02:46:44,153 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-20 02:46:44,153 INFO L794 eck$LassoCheckResult]: Stem: 295#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 289#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 290#L523 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 291#L523-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;main_~i~1 := 0; 292#L528-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 296#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 297#L528-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 293#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 294#L528-3 assume !(main_~i~1 < main_~array_size~0); 300#L528-4 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; 301#L515-3 [2019-11-20 02:46:44,153 INFO L796 eck$LassoCheckResult]: Loop: 301#L515-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 303#L516-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); 304#L517 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem4;havoc sort_#t~mem5;call sort_#t~mem6 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);sort_~temp~0 := sort_#t~mem6;havoc sort_#t~mem6;call sort_#t~mem7 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4);call write~int(sort_#t~mem7, sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);havoc sort_#t~mem7;call write~int(sort_~temp~0, sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 298#L516-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 299#L516-3 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 302#L515-2 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 301#L515-3 [2019-11-20 02:46:44,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:46:44,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1899756335, now seen corresponding path program 2 times [2019-11-20 02:46:44,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:46:44,154 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374985209] [2019-11-20 02:46:44,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:46:44,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:46:44,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:46:44,196 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 02:46:44,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:46:44,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1812321306, now seen corresponding path program 3 times [2019-11-20 02:46:44,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:46:44,206 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983433238] [2019-11-20 02:46:44,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:46:44,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:46:44,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:46:44,235 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 02:46:44,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:46:44,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1808202986, now seen corresponding path program 2 times [2019-11-20 02:46:44,237 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:46:44,237 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671903900] [2019-11-20 02:46:44,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:46:44,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:46:44,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:46:44,301 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 02:46:44,676 WARN L191 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 77 [2019-11-20 02:46:44,753 INFO L210 LassoAnalysis]: Preferences: [2019-11-20 02:46:44,753 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-20 02:46:44,753 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-20 02:46:44,753 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-20 02:46:44,753 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-20 02:46:44,753 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:46:44,753 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-20 02:46:44,754 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-20 02:46:44,754 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-1.i_Iteration5_Lasso [2019-11-20 02:46:44,754 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-20 02:46:44,754 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-20 02:46:44,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:46:44,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:46:44,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:46:44,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:46:44,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:46:44,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:46:44,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:46:44,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:46:44,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:46:44,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:46:44,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:46:44,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:46:44,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:46:44,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:46:44,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:46:44,935 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2019-11-20 02:46:44,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:46:45,315 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-20 02:46:45,315 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_86461fb1-9130-430f-99b3-7a63c3a03261/bin/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:46:45,331 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 02:46:45,332 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 02:46:45,333 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 02:46:45,333 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 02:46:45,333 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 02:46:45,333 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 02:46:45,334 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 02:46:45,334 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 02:46:45,335 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_86461fb1-9130-430f-99b3-7a63c3a03261/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) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:46:45,343 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 02:46:45,345 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 02:46:45,345 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 02:46:45,345 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 02:46:45,345 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 02:46:45,347 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 02:46:45,347 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 02:46:45,351 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_86461fb1-9130-430f-99b3-7a63c3a03261/bin/uautomizer/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 02:46:45,365 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 02:46:45,366 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 02:46:45,367 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 02:46:45,367 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 02:46:45,367 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 02:46:45,367 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 02:46:45,368 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 02:46:45,368 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:46:45,374 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_86461fb1-9130-430f-99b3-7a63c3a03261/bin/uautomizer/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 02:46:45,383 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 02:46:45,385 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 02:46:45,385 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 02:46:45,385 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 02:46:45,385 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 02:46:45,385 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 02:46:45,386 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 02:46:45,386 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 02:46:45,388 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_86461fb1-9130-430f-99b3-7a63c3a03261/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-20 02:46:45,395 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 02:46:45,397 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 02:46:45,397 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 02:46:45,397 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 02:46:45,397 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 02:46:45,399 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 02:46:45,399 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 02:46:45,403 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_86461fb1-9130-430f-99b3-7a63c3a03261/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-20 02:46:45,411 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 02:46:45,412 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 02:46:45,413 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 02:46:45,413 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 02:46:45,413 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 02:46:45,413 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 02:46:45,414 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 02:46:45,414 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 02:46:45,415 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_86461fb1-9130-430f-99b3-7a63c3a03261/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) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:46:45,429 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 02:46:45,431 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 02:46:45,431 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 02:46:45,432 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 02:46:45,432 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 02:46:45,432 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 02:46:45,432 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 02:46:45,433 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 02:46:45,440 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_86461fb1-9130-430f-99b3-7a63c3a03261/bin/uautomizer/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 02:46:45,460 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 02:46:45,461 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 02:46:45,461 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 02:46:45,462 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 02:46:45,462 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 02:46:45,462 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 02:46:45,462 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 02:46:45,463 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:46:45,464 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_86461fb1-9130-430f-99b3-7a63c3a03261/bin/uautomizer/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:46:45,483 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 02:46:45,485 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 02:46:45,485 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 02:46:45,485 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 02:46:45,485 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 02:46:45,487 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 02:46:45,487 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 02:46:45,491 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_86461fb1-9130-430f-99b3-7a63c3a03261/bin/uautomizer/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:46:45,508 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 02:46:45,509 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 02:46:45,510 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 02:46:45,510 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 02:46:45,510 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 02:46:45,510 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 02:46:45,511 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 02:46:45,511 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 02:46:45,515 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_86461fb1-9130-430f-99b3-7a63c3a03261/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) [2019-11-20 02:46:45,523 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 02:46:45,525 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 02:46:45,525 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 02:46:45,525 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 02:46:45,526 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 02:46:45,526 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 02:46:45,528 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 02:46:45,528 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:46:45,530 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_86461fb1-9130-430f-99b3-7a63c3a03261/bin/uautomizer/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 02:46:45,539 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 02:46:45,541 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 02:46:45,541 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 02:46:45,541 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 02:46:45,541 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 02:46:45,541 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 02:46:45,542 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 02:46:45,542 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:46:45,544 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_86461fb1-9130-430f-99b3-7a63c3a03261/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) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:46:45,549 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 02:46:45,550 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 02:46:45,550 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 02:46:45,551 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 02:46:45,551 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 02:46:45,552 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 02:46:45,552 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 02:46:45,556 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_86461fb1-9130-430f-99b3-7a63c3a03261/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-20 02:46:45,568 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 02:46:45,570 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 02:46:45,570 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 02:46:45,570 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 02:46:45,570 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 02:46:45,570 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 02:46:45,571 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 02:46:45,572 INFO L402 nArgumentSynthesizer]: A total of 0 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-20 02:46:45,573 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_86461fb1-9130-430f-99b3-7a63c3a03261/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) [2019-11-20 02:46:45,583 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 02:46:45,584 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 02:46:45,584 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 02:46:45,585 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 02:46:45,585 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 02:46:45,585 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 02:46:45,586 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 02:46:45,586 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:46:45,588 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_86461fb1-9130-430f-99b3-7a63c3a03261/bin/uautomizer/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 02:46:45,615 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 02:46:45,618 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 02:46:45,618 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 02:46:45,618 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 02:46:45,618 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 02:46:45,635 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 02:46:45,635 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:46:45,654 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-20 02:46:45,696 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2019-11-20 02:46:45,697 INFO L444 ModelExtractionUtils]: 22 out of 40 variables were initially zero. Simplification set additionally 15 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_86461fb1-9130-430f-99b3-7a63c3a03261/bin/uautomizer/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 02:46:45,700 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:46:45,704 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-20 02:46:45,704 INFO L510 LassoAnalysis]: Proved termination. [2019-11-20 02:46:45,704 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sort_~pass~0, ULTIMATE.start_sort_~n) = -1*ULTIMATE.start_sort_~pass~0 + 1*ULTIMATE.start_sort_~n Supporting invariants [] [2019-11-20 02:46:45,716 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-11-20 02:46:45,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:46:45,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:46:45,742 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 02:46:45,743 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:46:45,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:46:45,757 INFO L255 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 02:46:45,758 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:46:45,769 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 02:46:45,770 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-20 02:46:45,770 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-11-20 02:46:45,789 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 22 states and 28 transitions. Complement of second has 4 states. [2019-11-20 02:46:45,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-20 02:46:45,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-20 02:46:45,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2019-11-20 02:46:45,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 10 letters. Loop has 6 letters. [2019-11-20 02:46:45,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 02:46:45,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 16 letters. Loop has 6 letters. [2019-11-20 02:46:45,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 02:46:45,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 10 letters. Loop has 12 letters. [2019-11-20 02:46:45,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 02:46:45,791 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 28 transitions. [2019-11-20 02:46:45,792 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-20 02:46:45,793 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 21 states and 27 transitions. [2019-11-20 02:46:45,793 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-20 02:46:45,793 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-20 02:46:45,793 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 27 transitions. [2019-11-20 02:46:45,793 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 02:46:45,794 INFO L688 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2019-11-20 02:46:45,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 27 transitions. [2019-11-20 02:46:45,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2019-11-20 02:46:45,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-20 02:46:45,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2019-11-20 02:46:45,796 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2019-11-20 02:46:45,796 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2019-11-20 02:46:45,796 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-20 02:46:45,796 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 26 transitions. [2019-11-20 02:46:45,797 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-20 02:46:45,797 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 02:46:45,797 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 02:46:45,797 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:46:45,797 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-20 02:46:45,798 INFO L794 eck$LassoCheckResult]: Stem: 417#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 411#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 412#L523 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 413#L523-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;main_~i~1 := 0; 414#L528-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 418#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 419#L528-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 415#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 416#L528-3 assume !(main_~i~1 < main_~array_size~0); 424#L528-4 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; 425#L515-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 421#L516-3 [2019-11-20 02:46:45,798 INFO L796 eck$LassoCheckResult]: Loop: 421#L516-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); 426#L517 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem4;havoc sort_#t~mem5;call sort_#t~mem6 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);sort_~temp~0 := sort_#t~mem6;havoc sort_#t~mem6;call sort_#t~mem7 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4);call write~int(sort_#t~mem7, sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);havoc sort_#t~mem7;call write~int(sort_~temp~0, sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 420#L516-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 421#L516-3 [2019-11-20 02:46:45,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:46:45,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1237095790, now seen corresponding path program 1 times [2019-11-20 02:46:45,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:46:45,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675067958] [2019-11-20 02:46:45,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:46:45,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:46:45,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:46:45,838 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 02:46:45,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:46:45,842 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 1 times [2019-11-20 02:46:45,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:46:45,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390469396] [2019-11-20 02:46:45,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:46:45,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:46:45,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:46:45,859 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 02:46:45,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:46:45,860 INFO L82 PathProgramCache]: Analyzing trace with hash -793648259, now seen corresponding path program 1 times [2019-11-20 02:46:45,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:46:45,861 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369174246] [2019-11-20 02:46:45,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:46:45,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:46:45,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:46:45,882 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 02:46:46,181 WARN L191 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 79 [2019-11-20 02:46:46,245 INFO L210 LassoAnalysis]: Preferences: [2019-11-20 02:46:46,245 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-20 02:46:46,245 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-20 02:46:46,245 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-20 02:46:46,245 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-20 02:46:46,245 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:46:46,245 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-20 02:46:46,245 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-20 02:46:46,246 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-1.i_Iteration6_Lasso [2019-11-20 02:46:46,246 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-20 02:46:46,246 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-20 02:46:46,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:46:46,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:46:46,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:46:46,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:46:46,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:46:46,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:46:46,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-20 02:46:46,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:46:46,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:46:46,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-20 02:46:46,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:46:46,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:46:46,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:46:46,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:46:46,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:46:46,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:46:46,728 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-20 02:46:46,728 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_86461fb1-9130-430f-99b3-7a63c3a03261/bin/uautomizer/z3 Starting monitored process 29 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 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:46:46,738 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 02:46:46,739 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 02:46:46,739 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 02:46:46,739 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 02:46:46,739 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 02:46:46,740 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 02:46:46,740 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 02:46:46,740 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 02:46:46,741 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_86461fb1-9130-430f-99b3-7a63c3a03261/bin/uautomizer/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:46:46,747 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 02:46:46,749 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 02:46:46,749 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 02:46:46,749 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 02:46:46,749 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 02:46:46,749 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 02:46:46,750 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 02:46:46,750 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 02:46:46,751 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_86461fb1-9130-430f-99b3-7a63c3a03261/bin/uautomizer/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:46:46,756 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 02:46:46,757 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 02:46:46,757 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 02:46:46,757 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 02:46:46,758 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 02:46:46,759 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 02:46:46,759 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 02:46:46,761 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_86461fb1-9130-430f-99b3-7a63c3a03261/bin/uautomizer/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:46:46,765 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 02:46:46,767 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 02:46:46,767 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 02:46:46,767 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 02:46:46,767 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 02:46:46,767 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 02:46:46,768 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 02:46:46,768 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 02:46:46,769 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_86461fb1-9130-430f-99b3-7a63c3a03261/bin/uautomizer/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:46:46,773 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 02:46:46,775 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 02:46:46,775 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 02:46:46,775 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 02:46:46,776 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 02:46:46,782 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 02:46:46,783 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 02:46:46,802 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-20 02:46:46,855 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2019-11-20 02:46:46,855 INFO L444 ModelExtractionUtils]: 6 out of 40 variables were initially zero. Simplification set additionally 30 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_86461fb1-9130-430f-99b3-7a63c3a03261/bin/uautomizer/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 02:46:46,867 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:46:46,869 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-11-20 02:46:46,870 INFO L510 LassoAnalysis]: Proved termination. [2019-11-20 02:46:46,870 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sort_~i~0, v_rep(select #length ULTIMATE.start_main_#t~malloc9.base)_3) = -4*ULTIMATE.start_sort_~i~0 + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc9.base)_3 Supporting invariants [1*ULTIMATE.start_sort_~x.offset >= 0] [2019-11-20 02:46:46,885 INFO L297 tatePredicateManager]: 3 out of 5 supporting invariants were superfluous and have been removed [2019-11-20 02:46:46,894 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-20 02:46:46,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:46:46,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:46:46,946 INFO L255 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-20 02:46:46,947 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:46:46,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:46:46,993 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 02:46:46,993 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:46:47,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:46:47,018 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2019-11-20 02:46:47,018 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 26 transitions. cyclomatic complexity: 9 Second operand 5 states. [2019-11-20 02:46:47,094 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 26 transitions. cyclomatic complexity: 9. Second operand 5 states. Result 36 states and 50 transitions. Complement of second has 9 states. [2019-11-20 02:46:47,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-20 02:46:47,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-20 02:46:47,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 15 transitions. [2019-11-20 02:46:47,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 15 transitions. Stem has 11 letters. Loop has 3 letters. [2019-11-20 02:46:47,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 02:46:47,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 15 transitions. Stem has 14 letters. Loop has 3 letters. [2019-11-20 02:46:47,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 02:46:47,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 15 transitions. Stem has 11 letters. Loop has 6 letters. [2019-11-20 02:46:47,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 02:46:47,099 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 50 transitions. [2019-11-20 02:46:47,100 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-20 02:46:47,101 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 26 states and 34 transitions. [2019-11-20 02:46:47,101 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-20 02:46:47,101 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-20 02:46:47,101 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 34 transitions. [2019-11-20 02:46:47,101 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 02:46:47,101 INFO L688 BuchiCegarLoop]: Abstraction has 26 states and 34 transitions. [2019-11-20 02:46:47,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 34 transitions. [2019-11-20 02:46:47,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 20. [2019-11-20 02:46:47,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-20 02:46:47,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2019-11-20 02:46:47,103 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2019-11-20 02:46:47,103 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2019-11-20 02:46:47,103 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-20 02:46:47,103 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 25 transitions. [2019-11-20 02:46:47,104 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-20 02:46:47,104 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 02:46:47,104 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 02:46:47,105 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:46:47,105 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-20 02:46:47,105 INFO L794 eck$LassoCheckResult]: Stem: 570#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 564#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 565#L523 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 566#L523-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;main_~i~1 := 0; 567#L528-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 568#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 569#L528-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 571#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 583#L528-3 assume !(main_~i~1 < main_~array_size~0); 576#L528-4 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; 577#L515-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 579#L516-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); 580#L517 assume !(sort_#t~mem4 > sort_#t~mem5);havoc sort_#t~mem4;havoc sort_#t~mem5; 574#L516-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 575#L516-3 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 581#L515-2 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 582#L515-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 573#L516-3 [2019-11-20 02:46:47,105 INFO L796 eck$LassoCheckResult]: Loop: 573#L516-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); 578#L517 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem4;havoc sort_#t~mem5;call sort_#t~mem6 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);sort_~temp~0 := sort_#t~mem6;havoc sort_#t~mem6;call sort_#t~mem7 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4);call write~int(sort_#t~mem7, sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);havoc sort_#t~mem7;call write~int(sort_~temp~0, sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 572#L516-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 573#L516-3 [2019-11-20 02:46:47,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:46:47,106 INFO L82 PathProgramCache]: Analyzing trace with hash 221564791, now seen corresponding path program 1 times [2019-11-20 02:46:47,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:46:47,106 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558470420] [2019-11-20 02:46:47,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:46:47,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:46:47,152 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-20 02:46:47,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558470420] [2019-11-20 02:46:47,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1932979625] [2019-11-20 02:46:47,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_86461fb1-9130-430f-99b3-7a63c3a03261/bin/uautomizer/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 02:46:47,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:46:47,202 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-20 02:46:47,203 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:46:47,262 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 02:46:47,262 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 02:46:47,263 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 11 [2019-11-20 02:46:47,263 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796288315] [2019-11-20 02:46:47,263 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-20 02:46:47,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:46:47,263 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 2 times [2019-11-20 02:46:47,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:46:47,264 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555102893] [2019-11-20 02:46:47,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:46:47,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:46:47,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:46:47,279 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 02:46:47,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:46:47,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-20 02:46:47,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-11-20 02:46:47,348 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. cyclomatic complexity: 8 Second operand 12 states. [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Exception during sending of exit command (exit): Broken pipe [2019-11-20 02:46:47,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:46:47,566 INFO L93 Difference]: Finished difference Result 49 states and 61 transitions. [2019-11-20 02:46:47,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-20 02:46:47,567 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 61 transitions. [2019-11-20 02:46:47,568 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-20 02:46:47,569 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 34 states and 43 transitions. [2019-11-20 02:46:47,569 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-11-20 02:46:47,569 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-11-20 02:46:47,569 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 43 transitions. [2019-11-20 02:46:47,570 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 02:46:47,570 INFO L688 BuchiCegarLoop]: Abstraction has 34 states and 43 transitions. [2019-11-20 02:46:47,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 43 transitions. [2019-11-20 02:46:47,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 25. [2019-11-20 02:46:47,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-20 02:46:47,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2019-11-20 02:46:47,573 INFO L711 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2019-11-20 02:46:47,573 INFO L591 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2019-11-20 02:46:47,573 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-20 02:46:47,573 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 31 transitions. [2019-11-20 02:46:47,574 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-20 02:46:47,574 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 02:46:47,574 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 02:46:47,575 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:46:47,575 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-20 02:46:47,575 INFO L794 eck$LassoCheckResult]: Stem: 719#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 713#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 714#L523 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 715#L523-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;main_~i~1 := 0; 716#L528-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 717#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 718#L528-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 720#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 737#L528-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 733#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 732#L528-3 assume !(main_~i~1 < main_~array_size~0); 725#L528-4 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; 726#L515-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 728#L516-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); 729#L517 assume !(sort_#t~mem4 > sort_#t~mem5);havoc sort_#t~mem4;havoc sort_#t~mem5; 723#L516-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 724#L516-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); 735#L517 assume !(sort_#t~mem4 > sort_#t~mem5);havoc sort_#t~mem4;havoc sort_#t~mem5; 736#L516-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 734#L516-3 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 730#L515-2 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 731#L515-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 722#L516-3 [2019-11-20 02:46:47,575 INFO L796 eck$LassoCheckResult]: Loop: 722#L516-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); 727#L517 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem4;havoc sort_#t~mem5;call sort_#t~mem6 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);sort_~temp~0 := sort_#t~mem6;havoc sort_#t~mem6;call sort_#t~mem7 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4);call write~int(sort_#t~mem7, sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);havoc sort_#t~mem7;call write~int(sort_~temp~0, sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 721#L516-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 722#L516-3 [2019-11-20 02:46:47,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:46:47,576 INFO L82 PathProgramCache]: Analyzing trace with hash -135460634, now seen corresponding path program 2 times [2019-11-20 02:46:47,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:46:47,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796833052] [2019-11-20 02:46:47,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:46:47,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:46:47,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:46:47,603 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 02:46:47,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:46:47,604 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 3 times [2019-11-20 02:46:47,604 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:46:47,604 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989912676] [2019-11-20 02:46:47,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:46:47,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:46:47,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:46:47,611 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 02:46:47,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:46:47,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1761549573, now seen corresponding path program 1 times [2019-11-20 02:46:47,612 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:46:47,612 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251821576] [2019-11-20 02:46:47,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:46:47,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:46:47,863 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 02:46:47,864 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251821576] [2019-11-20 02:46:47,864 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2034080934] [2019-11-20 02:46:47,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_86461fb1-9130-430f-99b3-7a63c3a03261/bin/uautomizer/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 02:46:47,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:46:47,910 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-20 02:46:47,911 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:46:47,995 INFO L343 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2019-11-20 02:46:47,996 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 10 [2019-11-20 02:46:47,996 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:46:47,998 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:46:47,998 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:46:47,998 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:3 [2019-11-20 02:46:48,013 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 02:46:48,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 02:46:48,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 16 [2019-11-20 02:46:48,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888096934] [2019-11-20 02:46:48,077 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:46:48,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-20 02:46:48,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2019-11-20 02:46:48,078 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. cyclomatic complexity: 9 Second operand 16 states. [2019-11-20 02:46:48,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:46:48,285 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2019-11-20 02:46:48,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-20 02:46:48,286 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 51 transitions. [2019-11-20 02:46:48,287 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-20 02:46:48,288 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 40 states and 51 transitions. [2019-11-20 02:46:48,289 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2019-11-20 02:46:48,289 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2019-11-20 02:46:48,289 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 51 transitions. [2019-11-20 02:46:48,289 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 02:46:48,289 INFO L688 BuchiCegarLoop]: Abstraction has 40 states and 51 transitions. [2019-11-20 02:46:48,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 51 transitions. [2019-11-20 02:46:48,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 34. [2019-11-20 02:46:48,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-20 02:46:48,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2019-11-20 02:46:48,293 INFO L711 BuchiCegarLoop]: Abstraction has 34 states and 43 transitions. [2019-11-20 02:46:48,293 INFO L591 BuchiCegarLoop]: Abstraction has 34 states and 43 transitions. [2019-11-20 02:46:48,293 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-20 02:46:48,293 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 43 transitions. [2019-11-20 02:46:48,294 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-20 02:46:48,294 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 02:46:48,294 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 02:46:48,295 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:46:48,295 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-20 02:46:48,295 INFO L794 eck$LassoCheckResult]: Stem: 890#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 884#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 885#L523 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 886#L523-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;main_~i~1 := 0; 887#L528-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 888#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 889#L528-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 891#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 910#L528-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 909#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 908#L528-3 assume !(main_~i~1 < main_~array_size~0); 896#L528-4 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; 897#L515-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 903#L516-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); 914#L517 assume !(sort_#t~mem4 > sort_#t~mem5);havoc sort_#t~mem4;havoc sort_#t~mem5; 894#L516-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 895#L516-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); 900#L517 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem4;havoc sort_#t~mem5;call sort_#t~mem6 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);sort_~temp~0 := sort_#t~mem6;havoc sort_#t~mem6;call sort_#t~mem7 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4);call write~int(sort_#t~mem7, sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);havoc sort_#t~mem7;call write~int(sort_~temp~0, sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 907#L516-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 913#L516-3 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 901#L515-2 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 902#L515-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 893#L516-3 [2019-11-20 02:46:48,295 INFO L796 eck$LassoCheckResult]: Loop: 893#L516-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); 917#L517 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem4;havoc sort_#t~mem5;call sort_#t~mem6 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);sort_~temp~0 := sort_#t~mem6;havoc sort_#t~mem6;call sort_#t~mem7 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4);call write~int(sort_#t~mem7, sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);havoc sort_#t~mem7;call write~int(sort_~temp~0, sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 892#L516-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 893#L516-3 [2019-11-20 02:46:48,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:46:48,296 INFO L82 PathProgramCache]: Analyzing trace with hash -137307676, now seen corresponding path program 2 times [2019-11-20 02:46:48,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:46:48,296 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880076620] [2019-11-20 02:46:48,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:46:48,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:46:48,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:46:48,321 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 02:46:48,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:46:48,321 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 4 times [2019-11-20 02:46:48,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:46:48,322 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047349614] [2019-11-20 02:46:48,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:46:48,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:46:48,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:46:48,329 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 02:46:48,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:46:48,329 INFO L82 PathProgramCache]: Analyzing trace with hash -1724071097, now seen corresponding path program 3 times [2019-11-20 02:46:48,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:46:48,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150619705] [2019-11-20 02:46:48,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:46:48,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:46:48,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:46:48,360 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 02:46:49,062 WARN L191 SmtUtils]: Spent 624.00 ms on a formula simplification. DAG size of input: 186 DAG size of output: 146 [2019-11-20 02:46:49,189 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-11-20 02:46:49,191 INFO L210 LassoAnalysis]: Preferences: [2019-11-20 02:46:49,191 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-20 02:46:49,191 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-20 02:46:49,191 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-20 02:46:49,191 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-20 02:46:49,191 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:46:49,191 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-20 02:46:49,191 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-20 02:46:49,191 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-1.i_Iteration9_Lasso [2019-11-20 02:46:49,191 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-20 02:46:49,191 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-20 02:46:49,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:46:49,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:46:49,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:46:49,307 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: MapEliminator tries to combine Int and (Array Int Int) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceSelectStoreTerm(MapEliminator.java:592) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceStoreTerms(MapEliminator.java:542) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:330) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:109) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:278) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:612) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.access$16(LassoCheck.java:539) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:957) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:865) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:458) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-20 02:46:49,309 INFO L168 Benchmark]: Toolchain (without parser) took 8868.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 189.3 MB). Free memory was 944.7 MB in the beginning and 901.8 MB in the end (delta: 42.9 MB). Peak memory consumption was 232.2 MB. Max. memory is 11.5 GB. [2019-11-20 02:46:49,310 INFO L168 Benchmark]: CDTParser took 0.24 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-20 02:46:49,310 INFO L168 Benchmark]: CACSL2BoogieTranslator took 558.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -178.1 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2019-11-20 02:46:49,310 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.31 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-20 02:46:49,311 INFO L168 Benchmark]: Boogie Preprocessor took 26.99 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-20 02:46:49,311 INFO L168 Benchmark]: RCFGBuilder took 339.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-11-20 02:46:49,312 INFO L168 Benchmark]: BuchiAutomizer took 7895.78 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 50.3 MB). Free memory was 1.1 GB in the beginning and 901.8 MB in the end (delta: 192.0 MB). Peak memory consumption was 242.3 MB. Max. memory is 11.5 GB. [2019-11-20 02:46:49,314 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.24 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 558.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -178.1 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 43.31 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.99 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 339.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7895.78 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 50.3 MB). Free memory was 1.1 GB in the beginning and 901.8 MB in the end (delta: 192.0 MB). Peak memory consumption was 242.3 MB. 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.buchiautomizer: - ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: MapEliminator tries to combine Int and (Array Int Int): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...