./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 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_c323f869-58fb-4155-b1a1-ca805f2c994e/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_c323f869-58fb-4155-b1a1-ca805f2c994e/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_c323f869-58fb-4155-b1a1-ca805f2c994e/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_c323f869-58fb-4155-b1a1-ca805f2c994e/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/java_BubbleSort-alloca-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_c323f869-58fb-4155-b1a1-ca805f2c994e/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_c323f869-58fb-4155-b1a1-ca805f2c994e/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_c323f869-58fb-4155-b1a1-ca805f2c994e/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-6b5699a [2019-11-25 08:51:47,848 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:51:47,850 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:51:47,864 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:51:47,865 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:51:47,866 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:51:47,868 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:51:47,876 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:51:47,880 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:51:47,884 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:51:47,885 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:51:47,886 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:51:47,887 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:51:47,889 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:51:47,890 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:51:47,891 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:51:47,892 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:51:47,893 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:51:47,895 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:51:47,899 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:51:47,904 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:51:47,907 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:51:47,909 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:51:47,910 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:51:47,914 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:51:47,915 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:51:47,915 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:51:47,916 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:51:47,917 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:51:47,918 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:51:47,918 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:51:47,918 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:51:47,919 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:51:47,920 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:51:47,921 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:51:47,921 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:51:47,922 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:51:47,922 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:51:47,922 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:51:47,923 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:51:47,924 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:51:47,925 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_c323f869-58fb-4155-b1a1-ca805f2c994e/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-25 08:51:47,958 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:51:47,969 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:51:47,970 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:51:47,970 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:51:47,970 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:51:47,970 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-25 08:51:47,971 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-25 08:51:47,971 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-25 08:51:47,971 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-25 08:51:47,971 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-25 08:51:47,971 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-25 08:51:47,972 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:51:47,972 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 08:51:47,972 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-25 08:51:47,972 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 08:51:47,972 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 08:51:47,973 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:51:47,973 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-25 08:51:47,973 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-25 08:51:47,973 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-25 08:51:47,974 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 08:51:47,974 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-25 08:51:47,974 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-25 08:51:47,974 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:51:47,974 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-25 08:51:47,975 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:51:47,975 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:51:47,975 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-25 08:51:47,975 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:51:47,975 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 08:51:47,976 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-25 08:51:47,976 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-25 08:51:47,977 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_c323f869-58fb-4155-b1a1-ca805f2c994e/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-25 08:51:48,110 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:51:48,121 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:51:48,124 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:51:48,126 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:51:48,126 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:51:48,127 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_c323f869-58fb-4155-b1a1-ca805f2c994e/bin/uautomizer/../../sv-benchmarks/c/array-memsafety/java_BubbleSort-alloca-1.i [2019-11-25 08:51:48,177 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c323f869-58fb-4155-b1a1-ca805f2c994e/bin/uautomizer/data/1980b7bdd/64bacbc964ba48fca0a119274f182278/FLAG1093947c8 [2019-11-25 08:51:48,678 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:51:48,679 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_c323f869-58fb-4155-b1a1-ca805f2c994e/sv-benchmarks/c/array-memsafety/java_BubbleSort-alloca-1.i [2019-11-25 08:51:48,700 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c323f869-58fb-4155-b1a1-ca805f2c994e/bin/uautomizer/data/1980b7bdd/64bacbc964ba48fca0a119274f182278/FLAG1093947c8 [2019-11-25 08:51:49,195 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_c323f869-58fb-4155-b1a1-ca805f2c994e/bin/uautomizer/data/1980b7bdd/64bacbc964ba48fca0a119274f182278 [2019-11-25 08:51:49,197 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:51:49,198 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-25 08:51:49,199 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:51:49,199 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:51:49,202 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:51:49,203 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:51:49" (1/1) ... [2019-11-25 08:51:49,205 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@df7037e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:51:49, skipping insertion in model container [2019-11-25 08:51:49,205 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:51:49" (1/1) ... [2019-11-25 08:51:49,215 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:51:49,258 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:51:49,559 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:51:49,568 INFO L201 MainTranslator]: Completed pre-run [2019-11-25 08:51:49,609 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:51:49,668 INFO L205 MainTranslator]: Completed translation [2019-11-25 08:51:49,668 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:51:49 WrapperNode [2019-11-25 08:51:49,668 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 08:51:49,669 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-25 08:51:49,669 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-25 08:51:49,669 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-25 08:51:49,677 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:51:49" (1/1) ... [2019-11-25 08:51:49,690 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:51:49" (1/1) ... [2019-11-25 08:51:49,708 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-25 08:51:49,709 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 08:51:49,709 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 08:51:49,709 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 08:51:49,717 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:51:49" (1/1) ... [2019-11-25 08:51:49,718 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:51:49" (1/1) ... [2019-11-25 08:51:49,720 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:51:49" (1/1) ... [2019-11-25 08:51:49,721 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:51:49" (1/1) ... [2019-11-25 08:51:49,737 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:51:49" (1/1) ... [2019-11-25 08:51:49,750 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:51:49" (1/1) ... [2019-11-25 08:51:49,751 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:51:49" (1/1) ... [2019-11-25 08:51:49,757 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 08:51:49,758 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 08:51:49,766 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 08:51:49,767 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 08:51:49,768 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:51:49" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c323f869-58fb-4155-b1a1-ca805f2c994e/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:51:49,830 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-25 08:51:49,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-25 08:51:49,830 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-25 08:51:49,831 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-25 08:51:49,831 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 08:51:49,831 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 08:51:50,130 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 08:51:50,130 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-11-25 08:51:50,131 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:51:50 BoogieIcfgContainer [2019-11-25 08:51:50,131 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 08:51:50,132 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-25 08:51:50,132 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-25 08:51:50,135 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-25 08:51:50,136 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-25 08:51:50,136 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 25.11 08:51:49" (1/3) ... [2019-11-25 08:51:50,137 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@776ad3b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 25.11 08:51:50, skipping insertion in model container [2019-11-25 08:51:50,137 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-25 08:51:50,137 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:51:49" (2/3) ... [2019-11-25 08:51:50,137 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@776ad3b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 25.11 08:51:50, skipping insertion in model container [2019-11-25 08:51:50,137 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-25 08:51:50,137 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:51:50" (3/3) ... [2019-11-25 08:51:50,139 INFO L371 chiAutomizerObserver]: Analyzing ICFG java_BubbleSort-alloca-1.i [2019-11-25 08:51:50,175 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-25 08:51:50,175 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-25 08:51:50,175 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-25 08:51:50,175 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 08:51:50,175 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 08:51:50,175 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-25 08:51:50,176 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 08:51:50,176 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-25 08:51:50,188 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2019-11-25 08:51:50,207 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-25 08:51:50,207 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:51:50,207 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:51:50,213 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-25 08:51:50,213 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-25 08:51:50,213 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-25 08:51:50,213 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2019-11-25 08:51:50,215 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-25 08:51:50,215 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:51:50,215 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:51:50,215 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-25 08:51:50,215 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-25 08:51:50,222 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-25 08:51:50,222 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-25 08:51:50,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:51:50,228 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2019-11-25 08:51:50,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:51:50,234 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919081980] [2019-11-25 08:51:50,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:51:50,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:51:50,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:51:50,333 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:51:50,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:51:50,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2019-11-25 08:51:50,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:51:50,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42416741] [2019-11-25 08:51:50,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:51:50,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:51:50,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:51:50,351 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:51:50,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:51:50,353 INFO L82 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2019-11-25 08:51:50,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:51:50,353 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195542456] [2019-11-25 08:51:50,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:51:50,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:51:50,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:51:50,390 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:51:50,706 WARN L192 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-11-25 08:51:50,761 INFO L210 LassoAnalysis]: Preferences: [2019-11-25 08:51:50,762 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-25 08:51:50,762 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-25 08:51:50,762 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-25 08:51:50,762 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-25 08:51:50,762 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:51:50,762 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-25 08:51:50,762 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-25 08:51:50,762 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-1.i_Iteration1_Lasso [2019-11-25 08:51:50,763 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-25 08:51:50,763 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-25 08:51:50,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-25 08:51:50,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:51:50,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-25 08:51:50,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:51:50,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:51:50,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:51:50,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:51:50,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:51:50,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:51:51,194 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-25 08:51:51,199 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c323f869-58fb-4155-b1a1-ca805f2c994e/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-25 08:51:51,203 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:51:51,205 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:51:51,205 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:51:51,206 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:51:51,206 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:51:51,206 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:51:51,207 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:51:51,208 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:51:51,210 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c323f869-58fb-4155-b1a1-ca805f2c994e/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-25 08:51:51,220 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:51:51,222 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:51:51,222 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:51:51,222 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:51:51,222 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:51:51,222 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:51:51,223 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:51:51,223 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:51:51,231 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c323f869-58fb-4155-b1a1-ca805f2c994e/bin/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:51:51,240 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:51:51,243 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:51:51,244 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:51:51,244 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:51:51,244 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:51:51,253 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:51:51,254 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-25 08:51:51,259 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c323f869-58fb-4155-b1a1-ca805f2c994e/bin/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:51:51,279 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:51:51,281 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:51:51,282 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:51:51,282 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:51:51,282 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:51:51,287 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:51:51,287 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:51:51,293 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c323f869-58fb-4155-b1a1-ca805f2c994e/bin/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:51:51,300 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:51:51,302 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:51:51,302 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:51:51,302 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:51:51,302 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:51:51,302 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:51:51,303 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:51:51,303 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:51:51,305 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c323f869-58fb-4155-b1a1-ca805f2c994e/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-25 08:51:51,311 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:51:51,312 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:51:51,312 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:51:51,313 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:51:51,313 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:51:51,313 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:51:51,313 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:51:51,314 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:51:51,315 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c323f869-58fb-4155-b1a1-ca805f2c994e/bin/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:51:51,321 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:51:51,323 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:51:51,323 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:51:51,323 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:51:51,323 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:51:51,323 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:51:51,324 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:51:51,325 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:51:51,326 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c323f869-58fb-4155-b1a1-ca805f2c994e/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) [2019-11-25 08:51:51,357 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:51:51,359 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:51:51,359 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:51:51,359 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:51:51,360 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:51:51,373 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:51:51,373 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-25 08:51:51,387 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-25 08:51:51,432 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2019-11-25 08:51:51,432 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_c323f869-58fb-4155-b1a1-ca805f2c994e/bin/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:51:51,446 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:51:51,450 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-11-25 08:51:51,450 INFO L510 LassoAnalysis]: Proved termination. [2019-11-25 08:51:51,451 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-25 08:51:51,469 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2019-11-25 08:51:51,478 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-25 08:51:51,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:51:51,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:51:51,540 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-25 08:51:51,542 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:51:51,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:51:51,556 INFO L255 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-25 08:51:51,556 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:51:51,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:51:51,604 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-25 08:51:51,605 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states. Second operand 3 states. [2019-11-25 08:51:51,701 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-25 08:51:51,703 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-25 08:51:51,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-25 08:51:51,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2019-11-25 08:51:51,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 4 letters. Loop has 2 letters. [2019-11-25 08:51:51,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:51:51,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 6 letters. Loop has 2 letters. [2019-11-25 08:51:51,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:51:51,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 4 letters. Loop has 4 letters. [2019-11-25 08:51:51,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:51:51,710 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 56 transitions. [2019-11-25 08:51:51,716 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-25 08:51:51,720 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 13 states and 18 transitions. [2019-11-25 08:51:51,721 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-25 08:51:51,721 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-25 08:51:51,722 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 18 transitions. [2019-11-25 08:51:51,723 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-25 08:51:51,723 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2019-11-25 08:51:51,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 18 transitions. [2019-11-25 08:51:51,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-11-25 08:51:51,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-25 08:51:51,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2019-11-25 08:51:51,757 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2019-11-25 08:51:51,757 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2019-11-25 08:51:51,757 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-25 08:51:51,758 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2019-11-25 08:51:51,760 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-25 08:51:51,760 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:51:51,760 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:51:51,761 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-25 08:51:51,761 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-25 08:51:51,761 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-25 08:51:51,761 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-25 08:51:51,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:51:51,762 INFO L82 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 1 times [2019-11-25 08:51:51,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:51:51,762 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363261116] [2019-11-25 08:51:51,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:51:51,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:51:51,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:51:51,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363261116] [2019-11-25 08:51:51,865 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:51:51,865 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:51:51,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167633897] [2019-11-25 08:51:51,868 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-25 08:51:51,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:51:51,869 INFO L82 PathProgramCache]: Analyzing trace with hash 60779, now seen corresponding path program 1 times [2019-11-25 08:51:51,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:51:51,869 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512825012] [2019-11-25 08:51:51,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:51:51,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:51:51,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:51:51,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512825012] [2019-11-25 08:51:51,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:51:51,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:51:51,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096296965] [2019-11-25 08:51:51,896 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-25 08:51:51,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:51:51,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:51:51,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:51:51,900 INFO L87 Difference]: Start difference. First operand 13 states and 18 transitions. cyclomatic complexity: 7 Second operand 3 states. [2019-11-25 08:51:51,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:51:51,922 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2019-11-25 08:51:51,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:51:51,923 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 19 transitions. [2019-11-25 08:51:51,924 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-25 08:51:51,924 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 19 transitions. [2019-11-25 08:51:51,925 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-11-25 08:51:51,925 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-11-25 08:51:51,925 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2019-11-25 08:51:51,925 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-25 08:51:51,925 INFO L688 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-11-25 08:51:51,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2019-11-25 08:51:51,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-11-25 08:51:51,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-25 08:51:51,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2019-11-25 08:51:51,927 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-11-25 08:51:51,927 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-11-25 08:51:51,928 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-25 08:51:51,928 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2019-11-25 08:51:51,928 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-25 08:51:51,928 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:51:51,929 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:51:51,929 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-25 08:51:51,929 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-25 08:51:51,929 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-25 08:51:51,930 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-25 08:51:51,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:51:51,930 INFO L82 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 2 times [2019-11-25 08:51:51,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:51:51,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714481562] [2019-11-25 08:51:51,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:51:51,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:51:51,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:51:51,982 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714481562] [2019-11-25 08:51:51,982 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:51:51,982 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:51:51,982 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870616397] [2019-11-25 08:51:51,983 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-25 08:51:51,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:51:51,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1812321306, now seen corresponding path program 1 times [2019-11-25 08:51:51,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:51:51,983 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975005525] [2019-11-25 08:51:51,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:51:51,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:51:52,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:51:52,015 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:51:52,138 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:51:52,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:51:52,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:51:52,139 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. cyclomatic complexity: 7 Second operand 4 states. [2019-11-25 08:51:52,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:51:52,160 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2019-11-25 08:51:52,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:51:52,161 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 19 transitions. [2019-11-25 08:51:52,162 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-25 08:51:52,162 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 19 transitions. [2019-11-25 08:51:52,162 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-11-25 08:51:52,163 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-11-25 08:51:52,163 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2019-11-25 08:51:52,163 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-25 08:51:52,163 INFO L688 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-11-25 08:51:52,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2019-11-25 08:51:52,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2019-11-25 08:51:52,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-25 08:51:52,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2019-11-25 08:51:52,165 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2019-11-25 08:51:52,165 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2019-11-25 08:51:52,165 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-25 08:51:52,165 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 18 transitions. [2019-11-25 08:51:52,166 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-25 08:51:52,166 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:51:52,166 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:51:52,167 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:51:52,167 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-25 08:51:52,167 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-25 08:51:52,167 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-25 08:51:52,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:51:52,168 INFO L82 PathProgramCache]: Analyzing trace with hash 176793839, now seen corresponding path program 1 times [2019-11-25 08:51:52,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:51:52,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209761294] [2019-11-25 08:51:52,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:51:52,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:51:52,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:51:52,212 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:51:52,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:51:52,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1812321306, now seen corresponding path program 2 times [2019-11-25 08:51:52,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:51:52,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358238584] [2019-11-25 08:51:52,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:51:52,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:51:52,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:51:52,253 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:51:52,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:51:52,254 INFO L82 PathProgramCache]: Analyzing trace with hash -256077176, now seen corresponding path program 1 times [2019-11-25 08:51:52,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:51:52,254 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803577457] [2019-11-25 08:51:52,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:51:52,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:51:52,343 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-25 08:51:52,344 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803577457] [2019-11-25 08:51:52,344 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1568807632] [2019-11-25 08:51:52,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c323f869-58fb-4155-b1a1-ca805f2c994e/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-25 08:51:52,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:51:52,419 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-25 08:51:52,420 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:51:52,457 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-25 08:51:52,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:51:52,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2019-11-25 08:51:52,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418818871] [2019-11-25 08:51:52,605 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:51:52,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-25 08:51:52,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-25 08:51:52,606 INFO L87 Difference]: Start difference. First operand 14 states and 18 transitions. cyclomatic complexity: 6 Second operand 8 states. [2019-11-25 08:51:52,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:51:52,708 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2019-11-25 08:51:52,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-25 08:51:52,710 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 29 transitions. [2019-11-25 08:51:52,711 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-25 08:51:52,711 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 17 states and 20 transitions. [2019-11-25 08:51:52,711 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-11-25 08:51:52,712 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-11-25 08:51:52,712 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 20 transitions. [2019-11-25 08:51:52,712 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-25 08:51:52,712 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-11-25 08:51:52,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 20 transitions. [2019-11-25 08:51:52,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-11-25 08:51:52,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-25 08:51:52,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2019-11-25 08:51:52,714 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2019-11-25 08:51:52,714 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2019-11-25 08:51:52,714 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-25 08:51:52,714 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. [2019-11-25 08:51:52,714 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-25 08:51:52,715 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:51:52,715 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:51:52,715 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2019-11-25 08:51:52,715 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-25 08:51:52,715 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-25 08:51:52,715 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-25 08:51:52,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:51:52,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1899756335, now seen corresponding path program 2 times [2019-11-25 08:51:52,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:51:52,716 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488983074] [2019-11-25 08:51:52,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:51:52,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:51:52,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:51:52,755 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:51:52,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:51:52,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1812321306, now seen corresponding path program 3 times [2019-11-25 08:51:52,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:51:52,763 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411915439] [2019-11-25 08:51:52,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:51:52,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:51:52,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:51:52,785 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:51:52,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:51:52,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1808202986, now seen corresponding path program 2 times [2019-11-25 08:51:52,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:51:52,786 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913277700] [2019-11-25 08:51:52,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:51:52,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:51:52,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:51:52,842 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:51:53,181 WARN L192 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 77 [2019-11-25 08:51:53,252 INFO L210 LassoAnalysis]: Preferences: [2019-11-25 08:51:53,252 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-25 08:51:53,252 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-25 08:51:53,252 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-25 08:51:53,252 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-25 08:51:53,252 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:51:53,252 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-25 08:51:53,252 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-25 08:51:53,252 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-1.i_Iteration5_Lasso [2019-11-25 08:51:53,252 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-25 08:51:53,252 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-25 08:51:53,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-25 08:51:53,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:51:53,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:51:53,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:51:53,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:51:53,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:51:53,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:51:53,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:51:53,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:51:53,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:51:53,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:51:53,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:51:53,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:51:53,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:51:53,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:51:53,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:51:53,778 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-25 08:51:53,778 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c323f869-58fb-4155-b1a1-ca805f2c994e/bin/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:51:53,793 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:51:53,795 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:51:53,795 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:51:53,795 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:51:53,795 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:51:53,795 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:51:53,796 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:51:53,796 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:51:53,798 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c323f869-58fb-4155-b1a1-ca805f2c994e/bin/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:51:53,813 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:51:53,815 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:51:53,815 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:51:53,815 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:51:53,815 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:51:53,819 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:51:53,819 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:51:53,823 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c323f869-58fb-4155-b1a1-ca805f2c994e/bin/uautomizer/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:51:53,832 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:51:53,833 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:51:53,834 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:51:53,834 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:51:53,834 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:51:53,834 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:51:53,835 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:51:53,835 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:51:53,836 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c323f869-58fb-4155-b1a1-ca805f2c994e/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) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:51:53,848 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:51:53,849 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:51:53,850 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:51:53,850 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:51:53,850 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:51:53,850 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:51:53,851 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:51:53,851 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:51:53,852 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c323f869-58fb-4155-b1a1-ca805f2c994e/bin/uautomizer/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:51:53,858 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:51:53,860 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:51:53,860 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:51:53,861 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:51:53,861 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:51:53,863 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:51:53,863 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-25 08:51:53,867 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c323f869-58fb-4155-b1a1-ca805f2c994e/bin/uautomizer/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:51:53,872 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:51:53,874 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:51:53,874 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:51:53,874 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:51:53,874 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:51:53,874 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:51:53,875 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:51:53,875 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:51:53,876 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c323f869-58fb-4155-b1a1-ca805f2c994e/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-25 08:51:53,880 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:51:53,882 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:51:53,882 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:51:53,882 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:51:53,882 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:51:53,882 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:51:53,883 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:51:53,883 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:51:53,884 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c323f869-58fb-4155-b1a1-ca805f2c994e/bin/uautomizer/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:51:53,892 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:51:53,893 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:51:53,894 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:51:53,894 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:51:53,894 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:51:53,894 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:51:53,895 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:51:53,895 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:51:53,896 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c323f869-58fb-4155-b1a1-ca805f2c994e/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-25 08:51:53,904 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:51:53,905 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:51:53,906 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:51:53,906 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:51:53,906 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:51:53,908 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:51:53,908 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-25 08:51:53,911 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c323f869-58fb-4155-b1a1-ca805f2c994e/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) [2019-11-25 08:51:53,920 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:51:53,922 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:51:53,922 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:51:53,922 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:51:53,922 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:51:53,922 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:51:53,923 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:51:53,923 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:51:53,927 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c323f869-58fb-4155-b1a1-ca805f2c994e/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-25 08:51:53,936 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:51:53,938 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:51:53,938 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:51:53,938 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:51:53,938 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:51:53,938 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:51:53,939 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:51:53,939 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-25 08:51:53,941 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c323f869-58fb-4155-b1a1-ca805f2c994e/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-25 08:51:53,952 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:51:53,953 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:51:53,953 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:51:53,954 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:51:53,954 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:51:53,954 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:51:53,955 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:51:53,955 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-25 08:51:53,957 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c323f869-58fb-4155-b1a1-ca805f2c994e/bin/uautomizer/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:51:53,964 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:51:53,966 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:51:53,966 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:51:53,966 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:51:53,966 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:51:53,968 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:51:53,968 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:51:53,975 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c323f869-58fb-4155-b1a1-ca805f2c994e/bin/uautomizer/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:51:53,981 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:51:53,982 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:51:53,982 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:51:53,982 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:51:53,982 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:51:53,982 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:51:53,983 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:51:53,983 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:51:53,984 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c323f869-58fb-4155-b1a1-ca805f2c994e/bin/uautomizer/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:51:53,989 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:51:53,990 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:51:53,990 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:51:53,990 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:51:53,990 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:51:53,990 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:51:53,991 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:51:53,991 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:51:53,992 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c323f869-58fb-4155-b1a1-ca805f2c994e/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) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:51:54,007 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:51:54,012 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:51:54,012 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:51:54,012 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:51:54,013 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:51:54,024 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:51:54,025 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-25 08:51:54,042 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-25 08:51:54,081 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2019-11-25 08:51:54,082 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_c323f869-58fb-4155-b1a1-ca805f2c994e/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-25 08:51:54,086 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-25 08:51:54,089 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-25 08:51:54,089 INFO L510 LassoAnalysis]: Proved termination. [2019-11-25 08:51:54,089 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-25 08:51:54,103 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-11-25 08:51:54,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:51:54,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:51:54,164 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-25 08:51:54,165 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:51:54,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:51:54,178 INFO L255 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-25 08:51:54,179 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:51:54,214 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-25 08:51:54,214 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-25 08:51:54,214 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-11-25 08:51:54,228 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-25 08:51:54,228 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-25 08:51:54,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-25 08:51:54,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2019-11-25 08:51:54,229 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 10 letters. Loop has 6 letters. [2019-11-25 08:51:54,229 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:51:54,229 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 16 letters. Loop has 6 letters. [2019-11-25 08:51:54,229 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:51:54,229 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 10 letters. Loop has 12 letters. [2019-11-25 08:51:54,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:51:54,230 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 28 transitions. [2019-11-25 08:51:54,231 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-25 08:51:54,231 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 21 states and 27 transitions. [2019-11-25 08:51:54,231 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-25 08:51:54,232 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-25 08:51:54,232 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 27 transitions. [2019-11-25 08:51:54,232 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-25 08:51:54,232 INFO L688 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2019-11-25 08:51:54,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 27 transitions. [2019-11-25 08:51:54,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2019-11-25 08:51:54,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-25 08:51:54,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2019-11-25 08:51:54,234 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2019-11-25 08:51:54,234 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2019-11-25 08:51:54,234 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-25 08:51:54,234 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 26 transitions. [2019-11-25 08:51:54,234 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-25 08:51:54,234 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:51:54,234 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:51:54,235 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:51:54,235 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-25 08:51:54,235 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-25 08:51:54,235 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-25 08:51:54,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:51:54,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1237095790, now seen corresponding path program 1 times [2019-11-25 08:51:54,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:51:54,236 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931027444] [2019-11-25 08:51:54,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:51:54,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:51:54,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:51:54,264 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:51:54,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:51:54,265 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 1 times [2019-11-25 08:51:54,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:51:54,265 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354007261] [2019-11-25 08:51:54,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:51:54,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:51:54,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:51:54,282 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:51:54,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:51:54,282 INFO L82 PathProgramCache]: Analyzing trace with hash -793648259, now seen corresponding path program 1 times [2019-11-25 08:51:54,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:51:54,282 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513931033] [2019-11-25 08:51:54,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:51:54,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:51:54,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:51:54,328 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:51:54,655 WARN L192 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 79 [2019-11-25 08:51:54,730 INFO L210 LassoAnalysis]: Preferences: [2019-11-25 08:51:54,730 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-25 08:51:54,730 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-25 08:51:54,730 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-25 08:51:54,730 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-25 08:51:54,730 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:51:54,731 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-25 08:51:54,731 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-25 08:51:54,731 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-1.i_Iteration6_Lasso [2019-11-25 08:51:54,731 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-25 08:51:54,731 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-25 08:51:54,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:51:54,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:51:54,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:51:54,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:51:54,881 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2019-11-25 08:51:54,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:51:54,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:51:54,943 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:51:54,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:51:54,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:51:54,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:51:54,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:51:54,954 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:51:54,957 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:51:54,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:51:54,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:51:54,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:51:55,290 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-25 08:51:55,290 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c323f869-58fb-4155-b1a1-ca805f2c994e/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-25 08:51:55,295 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:51:55,297 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:51:55,297 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:51:55,297 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:51:55,297 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:51:55,297 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:51:55,298 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:51:55,298 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:51:55,299 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c323f869-58fb-4155-b1a1-ca805f2c994e/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) [2019-11-25 08:51:55,303 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:51:55,304 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:51:55,304 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:51:55,304 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:51:55,304 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:51:55,304 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:51:55,306 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:51:55,306 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:51:55,307 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c323f869-58fb-4155-b1a1-ca805f2c994e/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 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:51:55,318 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:51:55,320 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:51:55,320 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:51:55,320 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:51:55,321 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:51:55,322 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:51:55,322 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-25 08:51:55,327 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c323f869-58fb-4155-b1a1-ca805f2c994e/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-25 08:51:55,334 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:51:55,336 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:51:55,336 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:51:55,336 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:51:55,336 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:51:55,336 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:51:55,337 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:51:55,337 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:51:55,338 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c323f869-58fb-4155-b1a1-ca805f2c994e/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-25 08:51:55,342 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:51:55,343 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:51:55,344 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:51:55,344 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:51:55,344 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:51:55,352 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:51:55,352 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-25 08:51:55,371 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-25 08:51:55,413 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2019-11-25 08:51:55,413 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_c323f869-58fb-4155-b1a1-ca805f2c994e/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) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:51:55,416 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-25 08:51:55,418 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-11-25 08:51:55,418 INFO L510 LassoAnalysis]: Proved termination. [2019-11-25 08:51:55,418 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-25 08:51:55,445 INFO L297 tatePredicateManager]: 3 out of 5 supporting invariants were superfluous and have been removed [2019-11-25 08:51:55,454 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-25 08:51:55,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:51:55,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:51:55,506 INFO L255 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-25 08:51:55,507 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:51:55,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:51:55,534 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-25 08:51:55,534 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:51:55,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:51:55,550 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-25 08:51:55,550 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 26 transitions. cyclomatic complexity: 9 Second operand 5 states. [2019-11-25 08:51:55,608 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-25 08:51:55,611 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-25 08:51:55,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-25 08:51:55,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 15 transitions. [2019-11-25 08:51:55,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 15 transitions. Stem has 11 letters. Loop has 3 letters. [2019-11-25 08:51:55,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:51:55,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 15 transitions. Stem has 14 letters. Loop has 3 letters. [2019-11-25 08:51:55,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:51:55,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 15 transitions. Stem has 11 letters. Loop has 6 letters. [2019-11-25 08:51:55,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:51:55,613 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 50 transitions. [2019-11-25 08:51:55,614 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-25 08:51:55,615 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 26 states and 34 transitions. [2019-11-25 08:51:55,615 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-25 08:51:55,615 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-25 08:51:55,615 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 34 transitions. [2019-11-25 08:51:55,615 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-25 08:51:55,616 INFO L688 BuchiCegarLoop]: Abstraction has 26 states and 34 transitions. [2019-11-25 08:51:55,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 34 transitions. [2019-11-25 08:51:55,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 20. [2019-11-25 08:51:55,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-25 08:51:55,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2019-11-25 08:51:55,618 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2019-11-25 08:51:55,618 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2019-11-25 08:51:55,618 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-25 08:51:55,618 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 25 transitions. [2019-11-25 08:51:55,618 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-25 08:51:55,618 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:51:55,618 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:51:55,619 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:51:55,619 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-25 08:51:55,619 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-25 08:51:55,620 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-25 08:51:55,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:51:55,620 INFO L82 PathProgramCache]: Analyzing trace with hash 221564791, now seen corresponding path program 1 times [2019-11-25 08:51:55,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:51:55,620 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048806707] [2019-11-25 08:51:55,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:51:55,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:51:55,654 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-25 08:51:55,655 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048806707] [2019-11-25 08:51:55,655 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [82710024] [2019-11-25 08:51:55,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c323f869-58fb-4155-b1a1-ca805f2c994e/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-25 08:51:55,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:51:55,699 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-25 08:51:55,700 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:51:55,766 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-25 08:51:55,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:51:55,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 11 [2019-11-25 08:51:55,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670850799] [2019-11-25 08:51:55,767 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-25 08:51:55,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:51:55,768 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 2 times [2019-11-25 08:51:55,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:51:55,768 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836902147] [2019-11-25 08:51:55,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:51:55,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:51:55,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:51:55,775 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:51:55,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:51:55,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-25 08:51:55,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-11-25 08:51:55,876 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. cyclomatic complexity: 8 Second operand 12 states. [2019-11-25 08:51:56,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:51:56,097 INFO L93 Difference]: Finished difference Result 49 states and 61 transitions. [2019-11-25 08:51:56,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-25 08:51:56,098 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 61 transitions. [2019-11-25 08:51:56,099 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-25 08:51:56,100 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 34 states and 43 transitions. [2019-11-25 08:51:56,100 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-11-25 08:51:56,100 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-11-25 08:51:56,100 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 43 transitions. [2019-11-25 08:51:56,100 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-25 08:51:56,100 INFO L688 BuchiCegarLoop]: Abstraction has 34 states and 43 transitions. [2019-11-25 08:51:56,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 43 transitions. [2019-11-25 08:51:56,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 25. [2019-11-25 08:51:56,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-25 08:51:56,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2019-11-25 08:51:56,103 INFO L711 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2019-11-25 08:51:56,103 INFO L591 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2019-11-25 08:51:56,103 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-25 08:51:56,103 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 31 transitions. [2019-11-25 08:51:56,104 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-25 08:51:56,104 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:51:56,104 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:51:56,105 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:51:56,105 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-25 08:51:56,105 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-25 08:51:56,105 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-25 08:51:56,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:51:56,106 INFO L82 PathProgramCache]: Analyzing trace with hash -135460634, now seen corresponding path program 2 times [2019-11-25 08:51:56,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:51:56,106 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454034504] [2019-11-25 08:51:56,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:51:56,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:51:56,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:51:56,142 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:51:56,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:51:56,142 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 3 times [2019-11-25 08:51:56,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:51:56,143 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701311868] [2019-11-25 08:51:56,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:51:56,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:51:56,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:51:56,150 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:51:56,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:51:56,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1761549573, now seen corresponding path program 1 times [2019-11-25 08:51:56,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:51:56,151 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717008194] [2019-11-25 08:51:56,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:51:56,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:51:56,399 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-25 08:51:56,399 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717008194] [2019-11-25 08:51:56,399 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1623732409] [2019-11-25 08:51:56,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c323f869-58fb-4155-b1a1-ca805f2c994e/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-25 08:51:56,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:51:56,443 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-25 08:51:56,445 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:51:56,520 INFO L343 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2019-11-25 08:51:56,521 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 10 [2019-11-25 08:51:56,521 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:51:56,522 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:51:56,523 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:51:56,523 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:3 [2019-11-25 08:51:56,540 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-25 08:51:56,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:51:56,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 16 [2019-11-25 08:51:56,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143365777] [2019-11-25 08:51:56,598 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:51:56,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-25 08:51:56,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2019-11-25 08:51:56,599 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. cyclomatic complexity: 9 Second operand 16 states. [2019-11-25 08:51:56,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:51:56,793 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2019-11-25 08:51:56,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-25 08:51:56,795 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 51 transitions. [2019-11-25 08:51:56,795 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-25 08:51:56,796 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 40 states and 51 transitions. [2019-11-25 08:51:56,796 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2019-11-25 08:51:56,796 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2019-11-25 08:51:56,796 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 51 transitions. [2019-11-25 08:51:56,797 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-25 08:51:56,797 INFO L688 BuchiCegarLoop]: Abstraction has 40 states and 51 transitions. [2019-11-25 08:51:56,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 51 transitions. [2019-11-25 08:51:56,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 34. [2019-11-25 08:51:56,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-25 08:51:56,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2019-11-25 08:51:56,799 INFO L711 BuchiCegarLoop]: Abstraction has 34 states and 43 transitions. [2019-11-25 08:51:56,800 INFO L591 BuchiCegarLoop]: Abstraction has 34 states and 43 transitions. [2019-11-25 08:51:56,800 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-25 08:51:56,800 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 43 transitions. [2019-11-25 08:51:56,800 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-25 08:51:56,800 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:51:56,800 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:51:56,801 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:51:56,801 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-25 08:51:56,801 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-25 08:51:56,801 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-25 08:51:56,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:51:56,802 INFO L82 PathProgramCache]: Analyzing trace with hash -137307676, now seen corresponding path program 2 times [2019-11-25 08:51:56,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:51:56,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759954506] [2019-11-25 08:51:56,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:51:56,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:51:56,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:51:56,841 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:51:56,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:51:56,841 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 4 times [2019-11-25 08:51:56,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:51:56,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811593507] [2019-11-25 08:51:56,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:51:56,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:51:56,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:51:56,848 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:51:56,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:51:56,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1724071097, now seen corresponding path program 3 times [2019-11-25 08:51:56,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:51:56,848 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315798109] [2019-11-25 08:51:56,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:51:56,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:51:56,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:51:56,878 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:51:57,526 WARN L192 SmtUtils]: Spent 564.00 ms on a formula simplification. DAG size of input: 186 DAG size of output: 146 [2019-11-25 08:51:57,637 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-11-25 08:51:57,638 INFO L210 LassoAnalysis]: Preferences: [2019-11-25 08:51:57,638 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-25 08:51:57,639 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-25 08:51:57,639 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-25 08:51:57,639 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-25 08:51:57,639 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:51:57,639 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-25 08:51:57,639 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-25 08:51:57,639 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-1.i_Iteration9_Lasso [2019-11-25 08:51:57,639 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-25 08:51:57,639 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-25 08:51:57,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:51:57,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:51:57,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:51:57,750 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-25 08:51:57,752 INFO L168 Benchmark]: Toolchain (without parser) took 8554.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 173.0 MB). Free memory was 940.8 MB in the beginning and 893.8 MB in the end (delta: 47.0 MB). Peak memory consumption was 220.0 MB. Max. memory is 11.5 GB. [2019-11-25 08:51:57,753 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:51:57,753 INFO L168 Benchmark]: CACSL2BoogieTranslator took 469.72 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.5 MB). Free memory was 940.8 MB in the beginning and 1.1 GB in the end (delta: -160.2 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-11-25 08:51:57,753 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.48 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:51:57,754 INFO L168 Benchmark]: Boogie Preprocessor took 48.56 ms. Allocated memory is still 1.1 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-25 08:51:57,754 INFO L168 Benchmark]: RCFGBuilder took 373.71 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2019-11-25 08:51:57,754 INFO L168 Benchmark]: BuchiAutomizer took 7619.86 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 54.5 MB). Free memory was 1.1 GB in the beginning and 893.8 MB in the end (delta: 179.5 MB). Peak memory consumption was 234.0 MB. Max. memory is 11.5 GB. [2019-11-25 08:51:57,757 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 469.72 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.5 MB). Free memory was 940.8 MB in the beginning and 1.1 GB in the end (delta: -160.2 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 39.48 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 48.56 ms. Allocated memory is still 1.1 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 373.71 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7619.86 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 54.5 MB). Free memory was 1.1 GB in the beginning and 893.8 MB in the end (delta: 179.5 MB). Peak memory consumption was 234.0 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...