./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 cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_f33fa524-4cf2-493d-b3b8-fe4b33f44f50/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f33fa524-4cf2-493d-b3b8-fe4b33f44f50/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f33fa524-4cf2-493d-b3b8-fe4b33f44f50/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f33fa524-4cf2-493d-b3b8-fe4b33f44f50/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/java_BubbleSort-alloca-1.i -s /tmp/vcloud-vcloud-master/worker/working_dir_f33fa524-4cf2-493d-b3b8-fe4b33f44f50/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f33fa524-4cf2-493d-b3b8-fe4b33f44f50/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/working_dir_f33fa524-4cf2-493d-b3b8-fe4b33f44f50/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-cad4683 [2019-10-22 08:58:58,864 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:58:58,865 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:58:58,878 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:58:58,878 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:58:58,879 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:58:58,880 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:58:58,882 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:58:58,884 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:58:58,885 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:58:58,885 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:58:58,887 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:58:58,888 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:58:58,888 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:58:58,889 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:58:58,890 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:58:58,891 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:58:58,891 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:58:58,892 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:58:58,894 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:58:58,902 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:58:58,903 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:58:58,904 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:58:58,904 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:58:58,906 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:58:58,910 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:58:58,910 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:58:58,911 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:58:58,911 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:58:58,912 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:58:58,912 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:58:58,912 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:58:58,913 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:58:58,913 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:58:58,914 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:58:58,914 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:58:58,916 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:58:58,916 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:58:58,916 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:58:58,917 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:58:58,917 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:58:58,918 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f33fa524-4cf2-493d-b3b8-fe4b33f44f50/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-10-22 08:58:58,941 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:58:58,941 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:58:58,942 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:58:58,943 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:58:58,943 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:58:58,943 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 08:58:58,943 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 08:58:58,943 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 08:58:58,943 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 08:58:58,943 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 08:58:58,944 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 08:58:58,944 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:58:58,944 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 08:58:58,944 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 08:58:58,944 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:58:58,944 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 08:58:58,945 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:58:58,945 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 08:58:58,945 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 08:58:58,945 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 08:58:58,945 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 08:58:58,945 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:58:58,945 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 08:58:58,946 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:58:58,946 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 08:58:58,946 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:58:58,947 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:58:58,948 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 08:58:58,948 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:58:58,948 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:58:58,948 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 08:58:58,949 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 08:58:58,949 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/working_dir_f33fa524-4cf2-493d-b3b8-fe4b33f44f50/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-10-22 08:58:58,981 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:58:58,993 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:58:58,996 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:58:58,997 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:58:58,997 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:58:58,998 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f33fa524-4cf2-493d-b3b8-fe4b33f44f50/bin/uautomizer/../../sv-benchmarks/c/array-memsafety/java_BubbleSort-alloca-1.i [2019-10-22 08:58:59,045 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f33fa524-4cf2-493d-b3b8-fe4b33f44f50/bin/uautomizer/data/ff7c6d883/ac3dcbfa91454a77b42486f2c84f74c2/FLAG811d8267f [2019-10-22 08:58:59,542 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:58:59,542 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f33fa524-4cf2-493d-b3b8-fe4b33f44f50/sv-benchmarks/c/array-memsafety/java_BubbleSort-alloca-1.i [2019-10-22 08:58:59,555 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f33fa524-4cf2-493d-b3b8-fe4b33f44f50/bin/uautomizer/data/ff7c6d883/ac3dcbfa91454a77b42486f2c84f74c2/FLAG811d8267f [2019-10-22 08:58:59,854 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f33fa524-4cf2-493d-b3b8-fe4b33f44f50/bin/uautomizer/data/ff7c6d883/ac3dcbfa91454a77b42486f2c84f74c2 [2019-10-22 08:58:59,857 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:58:59,858 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:58:59,859 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:58:59,859 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:58:59,862 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:58:59,863 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:58:59" (1/1) ... [2019-10-22 08:58:59,865 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@aa4e5a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:59, skipping insertion in model container [2019-10-22 08:58:59,866 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:58:59" (1/1) ... [2019-10-22 08:58:59,873 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:58:59,912 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:59:00,225 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:59:00,233 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:59:00,276 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:59:00,322 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:59:00,322 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:00 WrapperNode [2019-10-22 08:59:00,323 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:59:00,323 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:59:00,323 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:59:00,324 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:59:00,331 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:00" (1/1) ... [2019-10-22 08:59:00,346 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:00" (1/1) ... [2019-10-22 08:59:00,372 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:59:00,373 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:59:00,373 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:59:00,373 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:59:00,380 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:00" (1/1) ... [2019-10-22 08:59:00,380 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:00" (1/1) ... [2019-10-22 08:59:00,383 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:00" (1/1) ... [2019-10-22 08:59:00,383 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:00" (1/1) ... [2019-10-22 08:59:00,388 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:00" (1/1) ... [2019-10-22 08:59:00,393 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:00" (1/1) ... [2019-10-22 08:59:00,394 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:00" (1/1) ... [2019-10-22 08:59:00,396 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:59:00,397 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:59:00,397 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:59:00,397 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:59:00,398 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f33fa524-4cf2-493d-b3b8-fe4b33f44f50/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-10-22 08:59:00,467 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 08:59:00,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 08:59:00,468 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 08:59:00,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 08:59:00,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:59:00,468 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:59:00,826 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:59:00,826 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-10-22 08:59:00,827 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:59:00 BoogieIcfgContainer [2019-10-22 08:59:00,828 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:59:00,828 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 08:59:00,828 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 08:59:00,834 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 08:59:00,834 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:59:00,835 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 08:58:59" (1/3) ... [2019-10-22 08:59:00,836 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6295b444 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:59:00, skipping insertion in model container [2019-10-22 08:59:00,839 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:59:00,839 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:00" (2/3) ... [2019-10-22 08:59:00,840 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6295b444 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:59:00, skipping insertion in model container [2019-10-22 08:59:00,840 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:59:00,840 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:59:00" (3/3) ... [2019-10-22 08:59:00,842 INFO L371 chiAutomizerObserver]: Analyzing ICFG java_BubbleSort-alloca-1.i [2019-10-22 08:59:00,892 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 08:59:00,892 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 08:59:00,892 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 08:59:00,892 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:59:00,892 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:59:00,892 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 08:59:00,892 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:59:00,893 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 08:59:00,906 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2019-10-22 08:59:00,928 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-10-22 08:59:00,931 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:00,931 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:00,937 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-10-22 08:59:00,937 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:59:00,938 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 08:59:00,938 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2019-10-22 08:59:00,939 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-10-22 08:59:00,940 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:00,940 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:00,940 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-10-22 08:59:00,940 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:59:00,948 INFO L791 eck$LassoCheckResult]: Stem: 15#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 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-10-22 08:59:00,949 INFO L793 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-10-22 08:59:00,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:00,954 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2019-10-22 08:59:00,961 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:00,962 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724793666] [2019-10-22 08:59:00,962 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:00,963 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:00,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:01,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:01,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:01,087 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:01,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:01,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2019-10-22 08:59:01,088 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:01,088 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062633935] [2019-10-22 08:59:01,088 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:01,088 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:01,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:01,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:01,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:01,105 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:01,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:01,107 INFO L82 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2019-10-22 08:59:01,107 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:01,107 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976760167] [2019-10-22 08:59:01,107 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:01,107 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:01,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:01,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:01,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:01,137 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:01,311 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:59:01,312 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:59:01,312 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:59:01,312 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:59:01,313 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:59:01,313 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:59:01,313 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:59:01,313 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:59:01,313 INFO L131 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-1.i_Iteration1_Lasso [2019-10-22 08:59:01,313 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:59:01,313 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:59:01,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:01,344 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:01,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:01,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:01,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:01,356 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:01,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:01,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:01,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:01,684 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-10-22 08:59:01,850 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:59:01,854 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:59:01,856 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-10-22 08:59:01,857 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:01,857 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:01,858 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:01,858 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:01,859 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:01,860 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:01,860 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:01,863 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:01,864 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-10-22 08:59:01,865 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:01,866 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:01,866 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:01,867 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:01,867 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:01,867 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:01,867 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:01,868 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:01,869 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:01,869 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:01,869 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:01,870 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:01,870 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:01,872 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:01,872 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:01,876 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:01,877 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-10-22 08:59:01,877 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:01,878 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:01,878 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:01,878 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:01,886 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:01,889 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:01,893 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:01,893 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-10-22 08:59:01,894 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:01,894 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:01,894 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:01,894 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:01,895 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:01,895 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:01,895 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:01,896 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:01,897 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-10-22 08:59:01,897 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:01,897 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:01,897 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:01,898 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:01,898 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:01,909 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:01,910 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:01,911 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:01,911 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-10-22 08:59:01,912 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:01,912 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:01,912 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:01,912 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:01,912 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:01,913 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:01,913 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:01,914 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:01,914 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-10-22 08:59:01,915 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:01,915 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:01,916 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:01,916 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:01,925 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:01,925 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:02,005 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:59:02,089 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-10-22 08:59:02,090 INFO L444 ModelExtractionUtils]: 16 out of 22 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-10-22 08:59:02,093 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:59:02,094 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:59:02,095 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:59:02,095 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1, ULTIMATE.start_main_~array_size~0) = -1*ULTIMATE.start_main_~i~1 + 1*ULTIMATE.start_main_~array_size~0 Supporting invariants [] [2019-10-22 08:59:02,104 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-10-22 08:59:02,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:02,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:02,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:59:02,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:02,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:02,157 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:59:02,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:02,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:02,185 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-10-22 08:59:02,186 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states. Second operand 3 states. [2019-10-22 08:59:02,236 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-10-22 08:59:02,237 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-10-22 08:59:02,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:59:02,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2019-10-22 08:59:02,240 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 4 letters. Loop has 2 letters. [2019-10-22 08:59:02,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:02,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 6 letters. Loop has 2 letters. [2019-10-22 08:59:02,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:02,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 4 letters. Loop has 4 letters. [2019-10-22 08:59:02,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:02,243 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 56 transitions. [2019-10-22 08:59:02,245 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 08:59:02,249 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 13 states and 18 transitions. [2019-10-22 08:59:02,250 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-10-22 08:59:02,251 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-10-22 08:59:02,251 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 18 transitions. [2019-10-22 08:59:02,252 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:59:02,252 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2019-10-22 08:59:02,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 18 transitions. [2019-10-22 08:59:02,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-10-22 08:59:02,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-10-22 08:59:02,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2019-10-22 08:59:02,280 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2019-10-22 08:59:02,280 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2019-10-22 08:59:02,280 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 08:59:02,280 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2019-10-22 08:59:02,281 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 08:59:02,281 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:02,281 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:02,281 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-10-22 08:59:02,281 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:59:02,282 INFO L791 eck$LassoCheckResult]: Stem: 117#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 111#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; 112#L523 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 113#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; 114#L528-3 assume !(main_~i~1 < main_~array_size~0); 118#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; 121#L515-3 [2019-10-22 08:59:02,282 INFO L793 eck$LassoCheckResult]: Loop: 121#L515-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 120#L516-3 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 122#L515-2 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 121#L515-3 [2019-10-22 08:59:02,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:02,282 INFO L82 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 1 times [2019-10-22 08:59:02,283 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:02,283 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223193552] [2019-10-22 08:59:02,283 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:02,283 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:02,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:02,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:02,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:02,345 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223193552] [2019-10-22 08:59:02,346 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:02,346 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:59:02,346 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670796702] [2019-10-22 08:59:02,348 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:59:02,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:02,348 INFO L82 PathProgramCache]: Analyzing trace with hash 60779, now seen corresponding path program 1 times [2019-10-22 08:59:02,348 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:02,349 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641118058] [2019-10-22 08:59:02,349 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:02,349 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:02,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:02,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:02,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:02,361 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641118058] [2019-10-22 08:59:02,362 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:02,362 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:59:02,362 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679977144] [2019-10-22 08:59:02,363 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 08:59:02,363 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:02,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:59:02,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:02,367 INFO L87 Difference]: Start difference. First operand 13 states and 18 transitions. cyclomatic complexity: 7 Second operand 3 states. [2019-10-22 08:59:02,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:02,388 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2019-10-22 08:59:02,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:59:02,389 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 19 transitions. [2019-10-22 08:59:02,390 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-10-22 08:59:02,391 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 19 transitions. [2019-10-22 08:59:02,391 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-10-22 08:59:02,392 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-10-22 08:59:02,392 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2019-10-22 08:59:02,392 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:59:02,392 INFO L688 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-10-22 08:59:02,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2019-10-22 08:59:02,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-10-22 08:59:02,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-10-22 08:59:02,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2019-10-22 08:59:02,394 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-10-22 08:59:02,394 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-10-22 08:59:02,395 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 08:59:02,395 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2019-10-22 08:59:02,395 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-10-22 08:59:02,395 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:02,396 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:02,396 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-10-22 08:59:02,396 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-10-22 08:59:02,396 INFO L791 eck$LassoCheckResult]: Stem: 152#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 146#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; 147#L523 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 148#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; 149#L528-3 assume !(main_~i~1 < main_~array_size~0); 153#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; 156#L515-3 [2019-10-22 08:59:02,397 INFO L793 eck$LassoCheckResult]: Loop: 156#L515-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 157#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); 158#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); 154#L516-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 155#L516-3 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 159#L515-2 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 156#L515-3 [2019-10-22 08:59:02,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:02,397 INFO L82 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 2 times [2019-10-22 08:59:02,397 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:02,398 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643342547] [2019-10-22 08:59:02,398 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:02,398 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:02,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:02,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:02,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:02,423 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643342547] [2019-10-22 08:59:02,423 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:02,423 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:59:02,423 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735820265] [2019-10-22 08:59:02,424 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:59:02,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:02,424 INFO L82 PathProgramCache]: Analyzing trace with hash 1812321306, now seen corresponding path program 1 times [2019-10-22 08:59:02,424 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:02,424 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426818007] [2019-10-22 08:59:02,425 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:02,425 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:02,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:02,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:02,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:02,440 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:02,558 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:02,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:59:02,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:59:02,559 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. cyclomatic complexity: 7 Second operand 4 states. [2019-10-22 08:59:02,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:02,583 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2019-10-22 08:59:02,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:59:02,584 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 19 transitions. [2019-10-22 08:59:02,584 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-10-22 08:59:02,585 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 19 transitions. [2019-10-22 08:59:02,585 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-10-22 08:59:02,585 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-10-22 08:59:02,585 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2019-10-22 08:59:02,585 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:59:02,586 INFO L688 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-10-22 08:59:02,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2019-10-22 08:59:02,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2019-10-22 08:59:02,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-10-22 08:59:02,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2019-10-22 08:59:02,587 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2019-10-22 08:59:02,588 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2019-10-22 08:59:02,588 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 08:59:02,588 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 18 transitions. [2019-10-22 08:59:02,588 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-10-22 08:59:02,589 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:02,589 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:02,589 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:02,589 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-10-22 08:59:02,589 INFO L791 eck$LassoCheckResult]: Stem: 188#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 182#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; 183#L523 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 184#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; 185#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; 186#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 187#L528-3 assume !(main_~i~1 < main_~array_size~0); 189#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; 192#L515-3 [2019-10-22 08:59:02,590 INFO L793 eck$LassoCheckResult]: Loop: 192#L515-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 193#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); 194#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); 190#L516-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 191#L516-3 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 195#L515-2 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 192#L515-3 [2019-10-22 08:59:02,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:02,590 INFO L82 PathProgramCache]: Analyzing trace with hash 176793839, now seen corresponding path program 1 times [2019-10-22 08:59:02,591 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:02,591 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89799773] [2019-10-22 08:59:02,591 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:02,591 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:02,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:02,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:02,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:02,613 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:02,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:02,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1812321306, now seen corresponding path program 2 times [2019-10-22 08:59:02,613 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:02,614 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396236809] [2019-10-22 08:59:02,614 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:02,614 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:02,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:02,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:02,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:02,629 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:02,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:02,630 INFO L82 PathProgramCache]: Analyzing trace with hash -256077176, now seen corresponding path program 1 times [2019-10-22 08:59:02,630 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:02,630 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589040875] [2019-10-22 08:59:02,630 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:02,630 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:02,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:02,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:02,689 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 08:59:02,690 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589040875] [2019-10-22 08:59:02,690 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [157037767] [2019-10-22 08:59:02,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f33fa524-4cf2-493d-b3b8-fe4b33f44f50/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:59:02,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:02,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-22 08:59:02,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:02,790 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 08:59:02,790 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:59:02,790 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2019-10-22 08:59:02,791 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941282054] [2019-10-22 08:59:02,909 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:02,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-22 08:59:02,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-22 08:59:02,910 INFO L87 Difference]: Start difference. First operand 14 states and 18 transitions. cyclomatic complexity: 6 Second operand 8 states. [2019-10-22 08:59:03,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:03,022 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2019-10-22 08:59:03,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 08:59:03,023 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 29 transitions. [2019-10-22 08:59:03,023 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-10-22 08:59:03,024 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 17 states and 20 transitions. [2019-10-22 08:59:03,024 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-10-22 08:59:03,024 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-10-22 08:59:03,024 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 20 transitions. [2019-10-22 08:59:03,024 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:59:03,024 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-10-22 08:59:03,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 20 transitions. [2019-10-22 08:59:03,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-10-22 08:59:03,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-10-22 08:59:03,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2019-10-22 08:59:03,026 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2019-10-22 08:59:03,026 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2019-10-22 08:59:03,026 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-10-22 08:59:03,026 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. [2019-10-22 08:59:03,032 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-10-22 08:59:03,032 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:03,032 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:03,032 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:03,033 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-10-22 08:59:03,033 INFO L791 eck$LassoCheckResult]: Stem: 286#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 280#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; 281#L523 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 282#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; 283#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; 284#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 285#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; 287#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 295#L528-3 assume !(main_~i~1 < main_~array_size~0); 290#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; 291#L515-3 [2019-10-22 08:59:03,033 INFO L793 eck$LassoCheckResult]: Loop: 291#L515-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 292#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); 293#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); 288#L516-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 289#L516-3 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 294#L515-2 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 291#L515-3 [2019-10-22 08:59:03,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:03,033 INFO L82 PathProgramCache]: Analyzing trace with hash -1899756335, now seen corresponding path program 2 times [2019-10-22 08:59:03,033 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:03,033 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249821996] [2019-10-22 08:59:03,033 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:03,034 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:03,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:03,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:03,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:03,067 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:03,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:03,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1812321306, now seen corresponding path program 3 times [2019-10-22 08:59:03,072 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:03,072 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72476308] [2019-10-22 08:59:03,072 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:03,072 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:03,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:03,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:03,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:03,087 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:03,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:03,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1808202986, now seen corresponding path program 2 times [2019-10-22 08:59:03,088 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:03,089 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087202668] [2019-10-22 08:59:03,089 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:03,089 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:03,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:03,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:03,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:03,128 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:03,453 WARN L191 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 78 [2019-10-22 08:59:03,552 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:59:03,552 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:59:03,552 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:59:03,552 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:59:03,552 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:59:03,552 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:59:03,553 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:59:03,553 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:59:03,553 INFO L131 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-1.i_Iteration5_Lasso [2019-10-22 08:59:03,553 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:59:03,553 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:59:03,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:03,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:03,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:03,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:03,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:03,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:03,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:03,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:03,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:03,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:03,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:03,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:03,591 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:03,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:03,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:03,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:04,031 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:59:04,032 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:59:04,032 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-10-22 08:59:04,033 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:04,033 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:04,033 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:04,033 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:04,033 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:04,034 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:04,034 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:04,037 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:04,039 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-10-22 08:59:04,041 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:04,041 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:04,041 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:04,041 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:04,042 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:04,042 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:04,044 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:04,044 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-10-22 08:59:04,045 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:04,045 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:04,045 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:04,045 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:04,045 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:04,046 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:04,046 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:04,054 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:04,055 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:04,055 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:04,055 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:04,056 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:04,056 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:04,056 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:04,056 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:04,056 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:04,057 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:04,057 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-10-22 08:59:04,058 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:04,058 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:04,058 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:04,058 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:04,059 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:04,059 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:04,062 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:04,063 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-10-22 08:59:04,063 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:04,063 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:04,064 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:04,064 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:04,064 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:04,064 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:04,064 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:04,065 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:04,065 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-10-22 08:59:04,066 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:04,066 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:04,066 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:04,066 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:04,070 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:04,070 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:04,071 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:04,071 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:04,072 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:04,072 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:04,072 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:04,075 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:04,075 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:04,075 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:04,075 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:04,075 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:04,076 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:04,076 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-10-22 08:59:04,077 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:04,077 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:04,077 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:04,077 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:04,078 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:04,078 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:04,081 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:04,083 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-10-22 08:59:04,084 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:04,085 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:04,086 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:04,086 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:04,086 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:04,086 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:04,086 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:04,087 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:04,087 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-10-22 08:59:04,088 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:04,088 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:04,088 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:04,088 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:04,088 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:04,089 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:04,090 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:04,091 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:04,091 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-10-22 08:59:04,092 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:04,092 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:04,092 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:04,092 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:04,092 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:04,093 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:04,093 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:04,094 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:04,094 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-10-22 08:59:04,094 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:04,095 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:04,095 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:04,095 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:04,096 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:04,096 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:04,098 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:04,098 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-10-22 08:59:04,100 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:04,100 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:04,100 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:04,100 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:04,101 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:04,101 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:04,101 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:04,102 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:04,102 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-10-22 08:59:04,103 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:04,104 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:04,104 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:04,105 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:04,105 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:04,105 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:04,105 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:04,106 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:04,106 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-10-22 08:59:04,107 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:04,108 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:04,109 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:04,109 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:04,113 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:04,117 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:04,156 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:59:04,183 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-10-22 08:59:04,183 INFO L444 ModelExtractionUtils]: 33 out of 40 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-10-22 08:59:04,184 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:59:04,185 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:59:04,185 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:59:04,185 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-10-22 08:59:04,198 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-10-22 08:59:04,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:04,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:04,225 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:59:04,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:04,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:04,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:59:04,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:04,251 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 08:59:04,252 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-10-22 08:59:04,252 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-10-22 08:59:04,272 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-10-22 08:59:04,273 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-10-22 08:59:04,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:59:04,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2019-10-22 08:59:04,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 10 letters. Loop has 6 letters. [2019-10-22 08:59:04,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:04,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 16 letters. Loop has 6 letters. [2019-10-22 08:59:04,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:04,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 10 letters. Loop has 12 letters. [2019-10-22 08:59:04,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:04,275 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 28 transitions. [2019-10-22 08:59:04,276 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:59:04,276 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 21 states and 27 transitions. [2019-10-22 08:59:04,276 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-10-22 08:59:04,276 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-10-22 08:59:04,276 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 27 transitions. [2019-10-22 08:59:04,276 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:59:04,276 INFO L688 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2019-10-22 08:59:04,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 27 transitions. [2019-10-22 08:59:04,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2019-10-22 08:59:04,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-10-22 08:59:04,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2019-10-22 08:59:04,280 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2019-10-22 08:59:04,280 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2019-10-22 08:59:04,280 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-10-22 08:59:04,280 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 26 transitions. [2019-10-22 08:59:04,281 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:59:04,281 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:04,281 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:04,282 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:04,282 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:59:04,282 INFO L791 eck$LassoCheckResult]: Stem: 408#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 402#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; 403#L523 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 404#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; 405#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; 409#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 410#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; 406#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 407#L528-3 assume !(main_~i~1 < main_~array_size~0); 415#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; 416#L515-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 412#L516-3 [2019-10-22 08:59:04,282 INFO L793 eck$LassoCheckResult]: Loop: 412#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); 417#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); 411#L516-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 412#L516-3 [2019-10-22 08:59:04,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:04,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1237095790, now seen corresponding path program 1 times [2019-10-22 08:59:04,283 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:04,283 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041163903] [2019-10-22 08:59:04,283 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:04,283 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:04,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:04,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:04,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:04,310 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:04,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:04,313 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 1 times [2019-10-22 08:59:04,313 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:04,313 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607296544] [2019-10-22 08:59:04,313 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:04,313 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:04,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:04,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:04,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:04,323 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:04,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:04,323 INFO L82 PathProgramCache]: Analyzing trace with hash -793648259, now seen corresponding path program 1 times [2019-10-22 08:59:04,323 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:04,323 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809727469] [2019-10-22 08:59:04,324 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:04,324 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:04,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:04,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:04,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:04,348 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:04,654 WARN L191 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 80 [2019-10-22 08:59:04,709 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:59:04,710 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:59:04,710 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:59:04,710 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:59:04,710 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:59:04,710 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:59:04,710 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:59:04,710 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:59:04,710 INFO L131 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-1.i_Iteration6_Lasso [2019-10-22 08:59:04,710 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:59:04,710 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:59:04,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:04,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:04,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:04,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:04,872 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:04,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:04,880 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:04,882 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:04,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:04,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:04,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:04,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:04,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:04,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:04,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:04,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:05,121 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:59:05,121 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:59:05,121 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-10-22 08:59:05,122 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:05,122 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:05,122 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:05,122 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:05,122 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:05,123 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:05,123 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:05,124 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:05,124 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:05,125 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:05,125 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:05,125 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:05,125 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:05,125 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:05,125 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:05,126 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:05,126 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:05,126 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-10-22 08:59:05,127 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:05,127 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:05,127 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:05,127 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:05,127 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:05,128 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:05,128 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:05,130 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:05,130 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:05,131 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:05,131 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:05,131 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:05,131 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:05,134 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:05,134 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:05,175 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:59:05,197 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-10-22 08:59:05,197 INFO L444 ModelExtractionUtils]: 33 out of 40 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-10-22 08:59:05,197 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:59:05,198 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-10-22 08:59:05,199 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:59:05,199 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc9.base)_3, ULTIMATE.start_sort_~i~0) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc9.base)_3 - 4*ULTIMATE.start_sort_~i~0 Supporting invariants [1*ULTIMATE.start_sort_~x.offset >= 0] [2019-10-22 08:59:05,219 INFO L297 tatePredicateManager]: 3 out of 5 supporting invariants were superfluous and have been removed [2019-10-22 08:59:05,223 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-22 08:59:05,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:05,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:05,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-22 08:59:05,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:05,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:05,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-22 08:59:05,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:05,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:05,318 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-10-22 08:59:05,318 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 26 transitions. cyclomatic complexity: 9 Second operand 5 states. [2019-10-22 08:59:05,387 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-10-22 08:59:05,389 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-10-22 08:59:05,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-10-22 08:59:05,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 15 transitions. [2019-10-22 08:59:05,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 15 transitions. Stem has 11 letters. Loop has 3 letters. [2019-10-22 08:59:05,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:05,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 15 transitions. Stem has 14 letters. Loop has 3 letters. [2019-10-22 08:59:05,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:05,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 15 transitions. Stem has 11 letters. Loop has 6 letters. [2019-10-22 08:59:05,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:05,392 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 50 transitions. [2019-10-22 08:59:05,393 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:59:05,393 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 26 states and 34 transitions. [2019-10-22 08:59:05,394 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-10-22 08:59:05,394 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-10-22 08:59:05,394 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 34 transitions. [2019-10-22 08:59:05,394 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:59:05,396 INFO L688 BuchiCegarLoop]: Abstraction has 26 states and 34 transitions. [2019-10-22 08:59:05,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 34 transitions. [2019-10-22 08:59:05,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 20. [2019-10-22 08:59:05,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-10-22 08:59:05,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2019-10-22 08:59:05,399 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2019-10-22 08:59:05,399 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2019-10-22 08:59:05,399 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-10-22 08:59:05,399 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 25 transitions. [2019-10-22 08:59:05,400 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:59:05,400 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:05,400 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:05,400 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:05,401 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:59:05,401 INFO L791 eck$LassoCheckResult]: Stem: 561#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 555#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; 556#L523 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 557#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; 558#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; 559#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 560#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; 562#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 574#L528-3 assume !(main_~i~1 < main_~array_size~0); 567#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; 568#L515-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 570#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); 571#L517 assume !(sort_#t~mem4 > sort_#t~mem5);havoc sort_#t~mem4;havoc sort_#t~mem5; 565#L516-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 566#L516-3 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 572#L515-2 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 573#L515-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 564#L516-3 [2019-10-22 08:59:05,401 INFO L793 eck$LassoCheckResult]: Loop: 564#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); 569#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); 563#L516-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 564#L516-3 [2019-10-22 08:59:05,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:05,401 INFO L82 PathProgramCache]: Analyzing trace with hash 221564791, now seen corresponding path program 1 times [2019-10-22 08:59:05,402 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:05,402 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770881281] [2019-10-22 08:59:05,402 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:05,405 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:05,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:05,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:05,447 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-22 08:59:05,447 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770881281] [2019-10-22 08:59:05,448 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [393695957] [2019-10-22 08:59:05,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f33fa524-4cf2-493d-b3b8-fe4b33f44f50/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:59:05,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:05,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-22 08:59:05,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:05,597 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 08:59:05,597 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:59:05,597 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 11 [2019-10-22 08:59:05,597 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786513746] [2019-10-22 08:59:05,598 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:59:05,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:05,598 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 2 times [2019-10-22 08:59:05,598 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:05,598 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053909373] [2019-10-22 08:59:05,599 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:05,599 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:05,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:05,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:05,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:05,611 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:05,693 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:05,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-22 08:59:05,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-10-22 08:59:05,694 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. cyclomatic complexity: 8 Second operand 12 states. [2019-10-22 08:59:05,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:05,880 INFO L93 Difference]: Finished difference Result 49 states and 61 transitions. [2019-10-22 08:59:05,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-22 08:59:05,881 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 61 transitions. [2019-10-22 08:59:05,881 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:59:05,881 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 34 states and 43 transitions. [2019-10-22 08:59:05,882 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-10-22 08:59:05,882 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-10-22 08:59:05,882 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 43 transitions. [2019-10-22 08:59:05,882 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:59:05,882 INFO L688 BuchiCegarLoop]: Abstraction has 34 states and 43 transitions. [2019-10-22 08:59:05,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 43 transitions. [2019-10-22 08:59:05,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 25. [2019-10-22 08:59:05,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-22 08:59:05,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2019-10-22 08:59:05,883 INFO L711 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2019-10-22 08:59:05,883 INFO L591 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2019-10-22 08:59:05,883 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-10-22 08:59:05,883 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 31 transitions. [2019-10-22 08:59:05,884 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:59:05,884 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:05,884 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:05,884 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:05,884 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:59:05,884 INFO L791 eck$LassoCheckResult]: Stem: 710#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 704#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; 705#L523 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 706#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; 707#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; 708#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 709#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; 711#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 728#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; 724#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 723#L528-3 assume !(main_~i~1 < main_~array_size~0); 716#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; 717#L515-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 719#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); 720#L517 assume !(sort_#t~mem4 > sort_#t~mem5);havoc sort_#t~mem4;havoc sort_#t~mem5; 714#L516-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 715#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); 726#L517 assume !(sort_#t~mem4 > sort_#t~mem5);havoc sort_#t~mem4;havoc sort_#t~mem5; 727#L516-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 725#L516-3 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 721#L515-2 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 722#L515-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 713#L516-3 [2019-10-22 08:59:05,884 INFO L793 eck$LassoCheckResult]: Loop: 713#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); 718#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); 712#L516-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 713#L516-3 [2019-10-22 08:59:05,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:05,885 INFO L82 PathProgramCache]: Analyzing trace with hash -135460634, now seen corresponding path program 2 times [2019-10-22 08:59:05,885 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:05,885 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041518977] [2019-10-22 08:59:05,885 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:05,885 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:05,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:05,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:05,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:05,905 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:05,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:05,905 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 3 times [2019-10-22 08:59:05,905 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:05,905 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087023265] [2019-10-22 08:59:05,905 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:05,906 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:05,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:05,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:05,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:05,911 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:05,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:05,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1761549573, now seen corresponding path program 1 times [2019-10-22 08:59:05,912 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:05,912 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165947812] [2019-10-22 08:59:05,912 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:05,912 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:05,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:05,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:06,125 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 08:59:06,125 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165947812] [2019-10-22 08:59:06,125 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [903398899] [2019-10-22 08:59:06,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f33fa524-4cf2-493d-b3b8-fe4b33f44f50/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:59:06,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:06,179 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-22 08:59:06,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:06,264 INFO L341 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2019-10-22 08:59:06,264 INFO L375 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-10-22 08:59:06,265 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:59:06,266 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:59:06,266 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:59:06,266 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:3 [2019-10-22 08:59:06,274 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-22 08:59:06,275 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:59:06,275 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 16 [2019-10-22 08:59:06,275 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528436193] [2019-10-22 08:59:06,345 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:06,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-22 08:59:06,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2019-10-22 08:59:06,345 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. cyclomatic complexity: 9 Second operand 16 states. [2019-10-22 08:59:06,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:06,540 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2019-10-22 08:59:06,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-22 08:59:06,540 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 51 transitions. [2019-10-22 08:59:06,541 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-10-22 08:59:06,541 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 40 states and 51 transitions. [2019-10-22 08:59:06,541 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2019-10-22 08:59:06,542 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2019-10-22 08:59:06,542 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 51 transitions. [2019-10-22 08:59:06,542 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:59:06,542 INFO L688 BuchiCegarLoop]: Abstraction has 40 states and 51 transitions. [2019-10-22 08:59:06,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 51 transitions. [2019-10-22 08:59:06,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 34. [2019-10-22 08:59:06,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-10-22 08:59:06,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2019-10-22 08:59:06,546 INFO L711 BuchiCegarLoop]: Abstraction has 34 states and 43 transitions. [2019-10-22 08:59:06,546 INFO L591 BuchiCegarLoop]: Abstraction has 34 states and 43 transitions. [2019-10-22 08:59:06,546 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-10-22 08:59:06,546 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 43 transitions. [2019-10-22 08:59:06,546 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:59:06,547 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:06,547 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:06,547 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:06,547 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:59:06,547 INFO L791 eck$LassoCheckResult]: Stem: 881#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 875#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; 876#L523 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 877#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; 878#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; 879#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 880#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; 882#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 901#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; 900#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 899#L528-3 assume !(main_~i~1 < main_~array_size~0); 887#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; 888#L515-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 894#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); 905#L517 assume !(sort_#t~mem4 > sort_#t~mem5);havoc sort_#t~mem4;havoc sort_#t~mem5; 885#L516-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 886#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); 891#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); 898#L516-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 904#L516-3 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 892#L515-2 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 893#L515-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 884#L516-3 [2019-10-22 08:59:06,548 INFO L793 eck$LassoCheckResult]: Loop: 884#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); 908#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); 883#L516-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 884#L516-3 [2019-10-22 08:59:06,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:06,548 INFO L82 PathProgramCache]: Analyzing trace with hash -137307676, now seen corresponding path program 2 times [2019-10-22 08:59:06,548 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:06,548 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062648958] [2019-10-22 08:59:06,548 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:06,548 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:06,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:06,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:06,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:06,573 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:06,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:06,573 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 4 times [2019-10-22 08:59:06,573 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:06,573 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157309291] [2019-10-22 08:59:06,573 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:06,574 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:06,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:06,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:06,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:06,579 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:06,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:06,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1724071097, now seen corresponding path program 3 times [2019-10-22 08:59:06,580 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:06,580 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846765541] [2019-10-22 08:59:06,580 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:06,580 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:06,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:06,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:06,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:06,611 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:07,145 WARN L191 SmtUtils]: Spent 461.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 147 [2019-10-22 08:59:07,241 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:59:07,241 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:59:07,241 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:59:07,241 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:59:07,241 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:59:07,241 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:59:07,241 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:59:07,241 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:59:07,242 INFO L131 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-1.i_Iteration9_Lasso [2019-10-22 08:59:07,242 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:59:07,242 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:59:07,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:07,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:07,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:07,297 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:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.access$16(LassoCheck.java:536) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:951) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:862) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:248) 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-10-22 08:59:07,300 INFO L168 Benchmark]: Toolchain (without parser) took 7442.80 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 329.3 MB). Free memory was 944.5 MB in the beginning and 986.0 MB in the end (delta: -41.5 MB). Peak memory consumption was 287.7 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:07,301 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:59:07,301 INFO L168 Benchmark]: CACSL2BoogieTranslator took 464.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -170.1 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:07,301 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.16 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:59:07,302 INFO L168 Benchmark]: Boogie Preprocessor took 23.72 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:59:07,303 INFO L168 Benchmark]: RCFGBuilder took 431.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.9 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:07,303 INFO L168 Benchmark]: BuchiAutomizer took 6471.03 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 191.4 MB). Free memory was 1.1 GB in the beginning and 986.0 MB in the end (delta: 107.7 MB). Peak memory consumption was 299.1 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:07,305 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 464.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -170.1 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 49.16 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.72 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 431.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.9 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6471.03 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 191.4 MB). Free memory was 1.1 GB in the beginning and 986.0 MB in the end (delta: 107.7 MB). Peak memory consumption was 299.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - 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...