./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/loops/bubble_sort-1.c --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/run_dir_4bbeefd0-6216-421b-bc79-a8ea8c88a176/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_4bbeefd0-6216-421b-bc79-a8ea8c88a176/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_4bbeefd0-6216-421b-bc79-a8ea8c88a176/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_4bbeefd0-6216-421b-bc79-a8ea8c88a176/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/loops/bubble_sort-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_4bbeefd0-6216-421b-bc79-a8ea8c88a176/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_4bbeefd0-6216-421b-bc79-a8ea8c88a176/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 33b3a1e4933d5e511f1e529d9f92c0b363f8dd4a ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud-vcloud-master/worker/run_dir_4bbeefd0-6216-421b-bc79-a8ea8c88a176/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-11-16 00:35:47,485 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:35:47,486 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:35:47,496 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:35:47,496 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:35:47,497 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:35:47,502 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:35:47,510 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:35:47,512 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:35:47,513 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:35:47,514 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:35:47,518 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:35:47,518 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:35:47,519 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:35:47,520 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:35:47,521 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:35:47,522 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:35:47,522 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:35:47,524 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:35:47,526 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:35:47,528 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:35:47,528 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:35:47,529 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:35:47,530 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:35:47,532 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:35:47,533 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:35:47,533 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:35:47,535 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:35:47,535 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:35:47,536 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:35:47,536 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:35:47,537 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:35:47,537 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:35:47,538 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:35:47,539 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:35:47,539 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:35:47,540 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:35:47,540 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:35:47,540 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:35:47,541 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:35:47,542 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:35:47,542 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_4bbeefd0-6216-421b-bc79-a8ea8c88a176/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-16 00:35:47,559 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:35:47,559 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:35:47,560 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:35:47,560 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:35:47,561 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:35:47,561 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-16 00:35:47,561 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-16 00:35:47,561 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-16 00:35:47,561 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-16 00:35:47,561 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-16 00:35:47,562 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-16 00:35:47,562 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:35:47,562 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:35:47,562 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-16 00:35:47,562 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:35:47,563 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:35:47,563 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:35:47,563 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-16 00:35:47,563 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-16 00:35:47,563 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-16 00:35:47,563 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:35:47,564 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:35:47,564 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-16 00:35:47,564 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:35:47,564 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-16 00:35:47,564 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:35:47,564 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:35:47,565 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-16 00:35:47,565 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:35:47,565 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:35:47,565 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-16 00:35:47,566 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-16 00:35:47,566 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_4bbeefd0-6216-421b-bc79-a8ea8c88a176/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 -> 33b3a1e4933d5e511f1e529d9f92c0b363f8dd4a [2019-11-16 00:35:47,590 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:35:47,601 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:35:47,606 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:35:47,607 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:35:47,608 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:35:47,608 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_4bbeefd0-6216-421b-bc79-a8ea8c88a176/bin/uautomizer/../../sv-benchmarks/c/loops/bubble_sort-1.c [2019-11-16 00:35:47,665 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4bbeefd0-6216-421b-bc79-a8ea8c88a176/bin/uautomizer/data/a31d8787f/b9ffd181cb4141cba87dcef11edc7269/FLAG703712303 [2019-11-16 00:35:48,073 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:35:48,074 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_4bbeefd0-6216-421b-bc79-a8ea8c88a176/sv-benchmarks/c/loops/bubble_sort-1.c [2019-11-16 00:35:48,079 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4bbeefd0-6216-421b-bc79-a8ea8c88a176/bin/uautomizer/data/a31d8787f/b9ffd181cb4141cba87dcef11edc7269/FLAG703712303 [2019-11-16 00:35:48,491 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_4bbeefd0-6216-421b-bc79-a8ea8c88a176/bin/uautomizer/data/a31d8787f/b9ffd181cb4141cba87dcef11edc7269 [2019-11-16 00:35:48,494 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:35:48,495 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:35:48,496 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:35:48,496 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:35:48,499 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:35:48,500 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:35:48" (1/1) ... [2019-11-16 00:35:48,503 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b0515df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:35:48, skipping insertion in model container [2019-11-16 00:35:48,503 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:35:48" (1/1) ... [2019-11-16 00:35:48,509 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:35:48,527 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:35:48,754 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:35:48,763 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:35:48,789 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:35:48,803 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:35:48,804 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:35:48 WrapperNode [2019-11-16 00:35:48,804 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:35:48,805 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:35:48,805 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:35:48,805 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:35:48,813 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:35:48" (1/1) ... [2019-11-16 00:35:48,822 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:35:48" (1/1) ... [2019-11-16 00:35:48,845 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:35:48,845 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:35:48,845 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:35:48,845 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:35:48,854 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:35:48" (1/1) ... [2019-11-16 00:35:48,854 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:35:48" (1/1) ... [2019-11-16 00:35:48,857 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:35:48" (1/1) ... [2019-11-16 00:35:48,857 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:35:48" (1/1) ... [2019-11-16 00:35:48,864 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:35:48" (1/1) ... [2019-11-16 00:35:48,869 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:35:48" (1/1) ... [2019-11-16 00:35:48,870 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:35:48" (1/1) ... [2019-11-16 00:35:48,873 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:35:48,873 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:35:48,874 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:35:48,874 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:35:48,874 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:35:48" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4bbeefd0-6216-421b-bc79-a8ea8c88a176/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:35:48,946 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-16 00:35:48,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-16 00:35:48,946 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:35:48,946 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:35:48,947 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-16 00:35:48,947 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-16 00:35:49,259 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:35:49,259 INFO L284 CfgBuilder]: Removed 14 assume(true) statements. [2019-11-16 00:35:49,260 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:35:49 BoogieIcfgContainer [2019-11-16 00:35:49,260 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:35:49,261 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-16 00:35:49,261 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-16 00:35:49,264 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-16 00:35:49,265 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:35:49,265 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 16.11 12:35:48" (1/3) ... [2019-11-16 00:35:49,266 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1e7d239d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:35:49, skipping insertion in model container [2019-11-16 00:35:49,266 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:35:49,267 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:35:48" (2/3) ... [2019-11-16 00:35:49,267 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1e7d239d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:35:49, skipping insertion in model container [2019-11-16 00:35:49,267 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:35:49,267 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:35:49" (3/3) ... [2019-11-16 00:35:49,268 INFO L371 chiAutomizerObserver]: Analyzing ICFG bubble_sort-1.c [2019-11-16 00:35:49,307 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-16 00:35:49,308 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-16 00:35:49,308 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-16 00:35:49,308 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:35:49,308 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:35:49,308 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-16 00:35:49,308 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:35:49,308 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-16 00:35:49,320 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states. [2019-11-16 00:35:49,338 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 14 [2019-11-16 00:35:49,338 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:35:49,339 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:35:49,343 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-16 00:35:49,343 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:35:49,343 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-16 00:35:49,343 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states. [2019-11-16 00:35:49,346 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 14 [2019-11-16 00:35:49,346 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:35:49,346 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:35:49,346 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-16 00:35:49,346 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:35:49,351 INFO L791 eck$LassoCheckResult]: Stem: 26#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_~argc, main_~#argv.base, main_~#argv.offset;main_~argc := main_#in~argc;main_~#argv.base, main_~#argv.offset := main_#in~argv.base, main_#in~argv.offset;q1_#in~argc, q1_#in~argv.base, q1_#in~argv.offset := main_~argc, main_~#argv.base, main_~#argv.offset;havoc q1_#t~nondet12, q1_#t~switch13, q1_#t~pre14, q1_#t~pre15, q1_#t~pre16, q1_#t~nondet18, q1_#t~mem19, q1_#t~mem20, q1_#t~post17, q1_~r~0, q1_~temp~0, q1_~argc, q1_~argv.base, q1_~argv.offset, q1_~N~0, q1_~#a~1.base, q1_~#a~1.offset, q1_~i~1;q1_~argc := q1_#in~argc;q1_~argv.base, q1_~argv.offset := q1_#in~argv.base, q1_#in~argv.offset; 11#L54true assume !(q1_~argc < 2);q1_~N~0 := q1_#t~nondet12;havoc q1_#t~nondet12;call q1_~#a~1.base, q1_~#a~1.offset := #Ultimate.allocOnStack(4 * q1_~N~0);havoc q1_~i~1;q1_#t~switch13 := false; 9#L63true assume q1_#t~switch13;q1_~i~1 := 0; 6#L64-3true [2019-11-16 00:35:49,352 INFO L793 eck$LassoCheckResult]: Loop: 6#L64-3true assume !!(q1_~i~1 < q1_~N~0);call write~int(q1_~i~1, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4); 7#L64-2true q1_#t~pre14 := 1 + q1_~i~1;q1_~i~1 := 1 + q1_~i~1;havoc q1_#t~pre14; 6#L64-3true [2019-11-16 00:35:49,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:35:49,356 INFO L82 PathProgramCache]: Analyzing trace with hash 925670, now seen corresponding path program 1 times [2019-11-16 00:35:49,361 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:35:49,362 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703894574] [2019-11-16 00:35:49,362 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:49,362 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:49,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:35:49,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:35:49,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:35:49,469 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703894574] [2019-11-16 00:35:49,470 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:35:49,470 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:35:49,470 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802600254] [2019-11-16 00:35:49,474 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:35:49,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:35:49,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1539, now seen corresponding path program 1 times [2019-11-16 00:35:49,475 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:35:49,475 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365443396] [2019-11-16 00:35:49,475 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:49,475 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:49,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:35:49,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:35:49,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:35:49,511 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:35:49,579 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:35:49,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:35:49,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:35:49,597 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 3 states. [2019-11-16 00:35:49,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:35:49,634 INFO L93 Difference]: Finished difference Result 24 states and 31 transitions. [2019-11-16 00:35:49,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:35:49,637 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 31 transitions. [2019-11-16 00:35:49,639 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-11-16 00:35:49,647 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 19 states and 25 transitions. [2019-11-16 00:35:49,648 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2019-11-16 00:35:49,649 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2019-11-16 00:35:49,649 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 25 transitions. [2019-11-16 00:35:49,650 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:35:49,650 INFO L688 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2019-11-16 00:35:49,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 25 transitions. [2019-11-16 00:35:49,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2019-11-16 00:35:49,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-11-16 00:35:49,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2019-11-16 00:35:49,676 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2019-11-16 00:35:49,677 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2019-11-16 00:35:49,677 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-16 00:35:49,677 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 24 transitions. [2019-11-16 00:35:49,678 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-11-16 00:35:49,678 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:35:49,678 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:35:49,678 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-16 00:35:49,678 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:35:49,679 INFO L791 eck$LassoCheckResult]: Stem: 77#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 72#L-1 main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_~argc, main_~#argv.base, main_~#argv.offset;main_~argc := main_#in~argc;main_~#argv.base, main_~#argv.offset := main_#in~argv.base, main_#in~argv.offset;q1_#in~argc, q1_#in~argv.base, q1_#in~argv.offset := main_~argc, main_~#argv.base, main_~#argv.offset;havoc q1_#t~nondet12, q1_#t~switch13, q1_#t~pre14, q1_#t~pre15, q1_#t~pre16, q1_#t~nondet18, q1_#t~mem19, q1_#t~mem20, q1_#t~post17, q1_~r~0, q1_~temp~0, q1_~argc, q1_~argv.base, q1_~argv.offset, q1_~N~0, q1_~#a~1.base, q1_~#a~1.offset, q1_~i~1;q1_~argc := q1_#in~argc;q1_~argv.base, q1_~argv.offset := q1_#in~argv.base, q1_#in~argv.offset; 73#L54 assume !(q1_~argc < 2);q1_~N~0 := q1_#t~nondet12;havoc q1_#t~nondet12;call q1_~#a~1.base, q1_~#a~1.offset := #Ultimate.allocOnStack(4 * q1_~N~0);havoc q1_~i~1;q1_#t~switch13 := false; 74#L63 assume !q1_#t~switch13;q1_#t~switch13 := q1_#t~switch13; 75#L67 assume !q1_#t~switch13;q1_#t~switch13 := true; 67#L71 assume q1_#t~switch13;q1_~i~1 := 0; 63#L72-3 [2019-11-16 00:35:49,679 INFO L793 eck$LassoCheckResult]: Loop: 63#L72-3 assume !!(q1_~i~1 < q1_~N~0);call write~int(q1_~i~1, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4); 65#L72-2 q1_#t~pre16 := 1 + q1_~i~1;q1_~i~1 := 1 + q1_~i~1;havoc q1_#t~pre16; 63#L72-3 [2019-11-16 00:35:49,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:35:49,679 INFO L82 PathProgramCache]: Analyzing trace with hash 889584664, now seen corresponding path program 1 times [2019-11-16 00:35:49,679 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:35:49,679 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89822149] [2019-11-16 00:35:49,680 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:49,680 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:49,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:35:49,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:35:49,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:35:49,731 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:35:49,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:35:49,734 INFO L82 PathProgramCache]: Analyzing trace with hash 2691, now seen corresponding path program 1 times [2019-11-16 00:35:49,735 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:35:49,735 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726353258] [2019-11-16 00:35:49,735 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:49,736 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:49,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:35:49,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:35:49,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:35:49,752 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:35:49,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:35:49,753 INFO L82 PathProgramCache]: Analyzing trace with hash 192371930, now seen corresponding path program 1 times [2019-11-16 00:35:49,753 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:35:49,753 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650947489] [2019-11-16 00:35:49,753 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:49,753 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:49,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:35:49,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:35:49,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:35:49,790 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:35:50,048 WARN L191 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 69 [2019-11-16 00:35:50,161 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:35:50,162 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:35:50,163 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:35:50,163 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:35:50,170 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:35:50,171 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:35:50,171 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:35:50,171 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:35:50,171 INFO L131 ssoRankerPreferences]: Filename of dumped script: bubble_sort-1.c_Iteration2_Lasso [2019-11-16 00:35:50,172 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:35:50,172 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:35:50,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:35:50,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:35:50,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:35:50,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:35:50,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:35:50,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:35:50,217 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:35:50,221 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:35:50,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:35:50,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:35:50,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:35:50,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:35:50,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:35:50,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:35:50,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:35:50,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:35:50,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:35:50,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:35:50,650 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:35:50,654 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:35:50,656 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:35:50,660 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:35:50,660 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:35:50,660 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:35:50,661 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:35:50,661 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:35:50,663 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:35:50,663 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:35:50,667 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:35:50,667 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:35:50,668 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:35:50,668 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:35:50,668 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:35:50,669 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:35:50,669 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:35:50,670 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:35:50,670 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:35:50,674 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:35:50,675 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:35:50,676 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:35:50,676 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:35:50,676 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:35:50,676 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:35:50,676 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:35:50,677 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:35:50,677 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:35:50,678 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:35:50,679 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:35:50,682 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:35:50,682 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:35:50,682 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:35:50,683 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:35:50,683 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:35:50,683 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:35:50,684 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:35:50,685 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:35:50,686 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:35:50,689 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:35:50,689 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:35:50,690 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:35:50,690 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:35:50,693 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:35:50,693 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:35:50,707 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:35:50,708 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:35:50,709 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:35:50,709 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:35:50,709 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:35:50,709 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:35:50,709 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:35:50,710 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:35:50,710 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:35:50,711 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:35:50,712 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:35:50,713 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:35:50,713 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:35:50,714 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:35:50,714 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:35:50,714 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:35:50,714 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:35:50,715 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:35:50,716 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:35:50,717 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:35:50,718 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:35:50,719 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:35:50,719 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:35:50,719 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:35:50,719 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:35:50,719 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:35:50,720 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:35:50,721 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:35:50,722 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:35:50,722 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:35:50,722 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:35:50,723 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:35:50,723 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:35:50,732 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:35:50,732 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:35:50,740 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:35:50,741 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:35:50,741 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:35:50,741 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:35:50,742 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:35:50,742 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:35:50,742 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:35:50,742 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:35:50,743 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:35:50,744 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:35:50,745 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:35:50,750 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:35:50,751 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:35:50,751 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:35:50,751 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:35:50,759 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:35:50,759 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:35:50,774 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:35:50,775 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:35:50,776 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:35:50,776 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:35:50,776 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:35:50,776 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:35:50,777 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:35:50,778 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:35:50,782 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:35:50,782 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:35:50,783 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:35:50,783 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:35:50,783 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:35:50,783 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:35:50,783 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:35:50,784 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:35:50,784 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:35:50,785 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:35:50,785 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:35:50,785 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:35:50,786 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:35:50,786 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:35:50,786 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:35:50,788 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:35:50,788 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:35:50,816 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:35:50,816 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:35:50,817 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:35:50,817 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:35:50,817 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:35:50,817 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:35:50,818 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:35:50,818 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:35:50,818 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:35:50,819 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:35:50,819 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:35:50,820 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:35:50,820 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:35:50,820 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:35:50,821 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:35:50,821 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:35:50,821 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:35:50,821 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:35:50,822 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:35:50,822 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:35:50,823 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:35:50,823 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:35:50,823 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:35:50,823 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:35:50,825 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:35:50,826 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:35:50,836 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:35:50,836 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:35:50,844 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:35:50,844 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:35:50,844 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:35:50,844 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:35:50,849 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:35:50,849 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:35:50,894 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:35:50,931 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-16 00:35:50,931 INFO L444 ModelExtractionUtils]: 12 out of 16 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-16 00:35:50,933 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:35:50,937 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-16 00:35:50,937 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:35:50,938 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_q1_~N~0, ULTIMATE.start_q1_~i~1) = 1*ULTIMATE.start_q1_~N~0 - 1*ULTIMATE.start_q1_~i~1 Supporting invariants [] [2019-11-16 00:35:50,951 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2019-11-16 00:35:50,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:35:50,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:35:50,994 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:35:50,996 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:35:51,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:35:51,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:35:51,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:35:51,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:35:51,020 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-16 00:35:51,021 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-11-16 00:35:51,065 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 28 states and 40 transitions. Complement of second has 7 states. [2019-11-16 00:35:51,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-16 00:35:51,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-16 00:35:51,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2019-11-16 00:35:51,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 6 letters. Loop has 2 letters. [2019-11-16 00:35:51,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:35:51,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 8 letters. Loop has 2 letters. [2019-11-16 00:35:51,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:35:51,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 6 letters. Loop has 4 letters. [2019-11-16 00:35:51,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:35:51,072 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 40 transitions. [2019-11-16 00:35:51,074 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2019-11-16 00:35:51,075 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 26 states and 36 transitions. [2019-11-16 00:35:51,075 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2019-11-16 00:35:51,075 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2019-11-16 00:35:51,075 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 36 transitions. [2019-11-16 00:35:51,076 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:35:51,076 INFO L688 BuchiCegarLoop]: Abstraction has 26 states and 36 transitions. [2019-11-16 00:35:51,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 36 transitions. [2019-11-16 00:35:51,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 19. [2019-11-16 00:35:51,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-16 00:35:51,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2019-11-16 00:35:51,079 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2019-11-16 00:35:51,079 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2019-11-16 00:35:51,079 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-16 00:35:51,080 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 26 transitions. [2019-11-16 00:35:51,082 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-11-16 00:35:51,082 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:35:51,082 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:35:51,083 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:35:51,083 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-16 00:35:51,084 INFO L791 eck$LassoCheckResult]: Stem: 176#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 171#L-1 main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_~argc, main_~#argv.base, main_~#argv.offset;main_~argc := main_#in~argc;main_~#argv.base, main_~#argv.offset := main_#in~argv.base, main_#in~argv.offset;q1_#in~argc, q1_#in~argv.base, q1_#in~argv.offset := main_~argc, main_~#argv.base, main_~#argv.offset;havoc q1_#t~nondet12, q1_#t~switch13, q1_#t~pre14, q1_#t~pre15, q1_#t~pre16, q1_#t~nondet18, q1_#t~mem19, q1_#t~mem20, q1_#t~post17, q1_~r~0, q1_~temp~0, q1_~argc, q1_~argv.base, q1_~argv.offset, q1_~N~0, q1_~#a~1.base, q1_~#a~1.offset, q1_~i~1;q1_~argc := q1_#in~argc;q1_~argv.base, q1_~argv.offset := q1_#in~argv.base, q1_#in~argv.offset; 172#L54 assume !(q1_~argc < 2);q1_~N~0 := q1_#t~nondet12;havoc q1_#t~nondet12;call q1_~#a~1.base, q1_~#a~1.offset := #Ultimate.allocOnStack(4 * q1_~N~0);havoc q1_~i~1;q1_#t~switch13 := false; 173#L63 assume !q1_#t~switch13;q1_#t~switch13 := q1_#t~switch13; 174#L67 assume !q1_#t~switch13;q1_#t~switch13 := true; 169#L71 assume !q1_#t~switch13; 167#L61 havoc q1_#t~switch13;bubblesort_#in~size, bubblesort_#in~item.base, bubblesort_#in~item.offset := q1_~N~0, q1_~#a~1.base, q1_~#a~1.offset;havoc bubblesort_#t~mem2, bubblesort_#t~mem3, bubblesort_#t~mem4, bubblesort_#t~mem5, bubblesort_#t~pre1, bubblesort_#t~pre0, bubblesort_~size, bubblesort_~item.base, bubblesort_~item.offset, bubblesort_~a~0, bubblesort_~b~0, bubblesort_~t~0;bubblesort_~size := bubblesort_#in~size;bubblesort_~item.base, bubblesort_~item.offset := bubblesort_#in~item.base, bubblesort_#in~item.offset;havoc bubblesort_~a~0;havoc bubblesort_~b~0;havoc bubblesort_~t~0;bubblesort_~a~0 := 1; 170#L16-3 [2019-11-16 00:35:51,084 INFO L793 eck$LassoCheckResult]: Loop: 170#L16-3 assume !!(bubblesort_~a~0 < bubblesort_~size);bubblesort_~b~0 := bubblesort_~size - 1; 158#L18-3 assume !(bubblesort_~b~0 >= bubblesort_~a~0); 159#L16-2 bubblesort_#t~pre0 := 1 + bubblesort_~a~0;bubblesort_~a~0 := 1 + bubblesort_~a~0;havoc bubblesort_#t~pre0; 170#L16-3 [2019-11-16 00:35:51,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:35:51,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1807321784, now seen corresponding path program 1 times [2019-11-16 00:35:51,084 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:35:51,085 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669247858] [2019-11-16 00:35:51,085 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:51,085 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:51,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:35:51,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:35:51,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:35:51,115 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669247858] [2019-11-16 00:35:51,115 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:35:51,115 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:35:51,116 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133174553] [2019-11-16 00:35:51,116 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:35:51,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:35:51,116 INFO L82 PathProgramCache]: Analyzing trace with hash 114407, now seen corresponding path program 1 times [2019-11-16 00:35:51,116 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:35:51,116 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865719436] [2019-11-16 00:35:51,117 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:51,117 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:51,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:35:51,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:35:51,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:35:51,130 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865719436] [2019-11-16 00:35:51,131 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:35:51,131 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:35:51,131 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112318539] [2019-11-16 00:35:51,131 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-16 00:35:51,132 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:35:51,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:35:51,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:35:51,132 INFO L87 Difference]: Start difference. First operand 19 states and 26 transitions. cyclomatic complexity: 10 Second operand 3 states. [2019-11-16 00:35:51,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:35:51,161 INFO L93 Difference]: Finished difference Result 20 states and 27 transitions. [2019-11-16 00:35:51,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:35:51,162 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 27 transitions. [2019-11-16 00:35:51,163 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-11-16 00:35:51,164 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 27 transitions. [2019-11-16 00:35:51,164 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2019-11-16 00:35:51,164 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2019-11-16 00:35:51,164 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 27 transitions. [2019-11-16 00:35:51,164 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:35:51,164 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2019-11-16 00:35:51,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 27 transitions. [2019-11-16 00:35:51,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-11-16 00:35:51,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-16 00:35:51,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2019-11-16 00:35:51,166 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2019-11-16 00:35:51,166 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2019-11-16 00:35:51,166 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-16 00:35:51,166 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 27 transitions. [2019-11-16 00:35:51,167 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-11-16 00:35:51,167 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:35:51,167 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:35:51,168 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:35:51,168 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-16 00:35:51,168 INFO L791 eck$LassoCheckResult]: Stem: 222#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 217#L-1 main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_~argc, main_~#argv.base, main_~#argv.offset;main_~argc := main_#in~argc;main_~#argv.base, main_~#argv.offset := main_#in~argv.base, main_#in~argv.offset;q1_#in~argc, q1_#in~argv.base, q1_#in~argv.offset := main_~argc, main_~#argv.base, main_~#argv.offset;havoc q1_#t~nondet12, q1_#t~switch13, q1_#t~pre14, q1_#t~pre15, q1_#t~pre16, q1_#t~nondet18, q1_#t~mem19, q1_#t~mem20, q1_#t~post17, q1_~r~0, q1_~temp~0, q1_~argc, q1_~argv.base, q1_~argv.offset, q1_~N~0, q1_~#a~1.base, q1_~#a~1.offset, q1_~i~1;q1_~argc := q1_#in~argc;q1_~argv.base, q1_~argv.offset := q1_#in~argv.base, q1_#in~argv.offset; 218#L54 assume !(q1_~argc < 2);q1_~N~0 := q1_#t~nondet12;havoc q1_#t~nondet12;call q1_~#a~1.base, q1_~#a~1.offset := #Ultimate.allocOnStack(4 * q1_~N~0);havoc q1_~i~1;q1_#t~switch13 := false; 219#L63 assume !q1_#t~switch13;q1_#t~switch13 := q1_#t~switch13; 220#L67 assume !q1_#t~switch13;q1_#t~switch13 := true; 215#L71 assume !q1_#t~switch13; 213#L61 havoc q1_#t~switch13;bubblesort_#in~size, bubblesort_#in~item.base, bubblesort_#in~item.offset := q1_~N~0, q1_~#a~1.base, q1_~#a~1.offset;havoc bubblesort_#t~mem2, bubblesort_#t~mem3, bubblesort_#t~mem4, bubblesort_#t~mem5, bubblesort_#t~pre1, bubblesort_#t~pre0, bubblesort_~size, bubblesort_~item.base, bubblesort_~item.offset, bubblesort_~a~0, bubblesort_~b~0, bubblesort_~t~0;bubblesort_~size := bubblesort_#in~size;bubblesort_~item.base, bubblesort_~item.offset := bubblesort_#in~item.base, bubblesort_#in~item.offset;havoc bubblesort_~a~0;havoc bubblesort_~b~0;havoc bubblesort_~t~0;bubblesort_~a~0 := 1; 216#L16-3 [2019-11-16 00:35:51,168 INFO L793 eck$LassoCheckResult]: Loop: 216#L16-3 assume !!(bubblesort_~a~0 < bubblesort_~size);bubblesort_~b~0 := bubblesort_~size - 1; 204#L18-3 assume !!(bubblesort_~b~0 >= bubblesort_~a~0); 205#L21 assume !(bubblesort_~b~0 - 1 < bubblesort_~size && bubblesort_~b~0 < bubblesort_~size); 210#L18-2 bubblesort_#t~pre1 := bubblesort_~b~0 - 1;bubblesort_~b~0 := bubblesort_~b~0 - 1;havoc bubblesort_#t~pre1; 211#L18-3 assume !(bubblesort_~b~0 >= bubblesort_~a~0); 223#L16-2 bubblesort_#t~pre0 := 1 + bubblesort_~a~0;bubblesort_~a~0 := 1 + bubblesort_~a~0;havoc bubblesort_#t~pre0; 216#L16-3 [2019-11-16 00:35:51,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:35:51,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1807321784, now seen corresponding path program 2 times [2019-11-16 00:35:51,168 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:35:51,169 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336399047] [2019-11-16 00:35:51,169 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:51,169 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:51,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:35:51,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:35:51,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:35:51,196 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336399047] [2019-11-16 00:35:51,196 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:35:51,196 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:35:51,197 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835805385] [2019-11-16 00:35:51,197 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:35:51,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:35:51,197 INFO L82 PathProgramCache]: Analyzing trace with hash -884895266, now seen corresponding path program 1 times [2019-11-16 00:35:51,198 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:35:51,198 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917766575] [2019-11-16 00:35:51,198 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:51,198 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:51,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:35:51,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:35:51,219 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:35:51,220 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917766575] [2019-11-16 00:35:51,220 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:35:51,220 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:35:51,220 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23347774] [2019-11-16 00:35:51,221 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-16 00:35:51,221 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:35:51,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:35:51,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:35:51,221 INFO L87 Difference]: Start difference. First operand 20 states and 27 transitions. cyclomatic complexity: 10 Second operand 3 states. [2019-11-16 00:35:51,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:35:51,236 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2019-11-16 00:35:51,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:35:51,237 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 27 transitions. [2019-11-16 00:35:51,238 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-11-16 00:35:51,238 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 21 states and 27 transitions. [2019-11-16 00:35:51,238 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2019-11-16 00:35:51,239 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2019-11-16 00:35:51,239 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 27 transitions. [2019-11-16 00:35:51,239 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:35:51,239 INFO L688 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2019-11-16 00:35:51,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 27 transitions. [2019-11-16 00:35:51,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2019-11-16 00:35:51,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-16 00:35:51,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2019-11-16 00:35:51,241 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2019-11-16 00:35:51,242 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2019-11-16 00:35:51,242 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-16 00:35:51,242 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 26 transitions. [2019-11-16 00:35:51,243 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-11-16 00:35:51,243 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:35:51,243 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:35:51,243 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:35:51,243 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:35:51,244 INFO L791 eck$LassoCheckResult]: Stem: 270#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 265#L-1 main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_~argc, main_~#argv.base, main_~#argv.offset;main_~argc := main_#in~argc;main_~#argv.base, main_~#argv.offset := main_#in~argv.base, main_#in~argv.offset;q1_#in~argc, q1_#in~argv.base, q1_#in~argv.offset := main_~argc, main_~#argv.base, main_~#argv.offset;havoc q1_#t~nondet12, q1_#t~switch13, q1_#t~pre14, q1_#t~pre15, q1_#t~pre16, q1_#t~nondet18, q1_#t~mem19, q1_#t~mem20, q1_#t~post17, q1_~r~0, q1_~temp~0, q1_~argc, q1_~argv.base, q1_~argv.offset, q1_~N~0, q1_~#a~1.base, q1_~#a~1.offset, q1_~i~1;q1_~argc := q1_#in~argc;q1_~argv.base, q1_~argv.offset := q1_#in~argv.base, q1_#in~argv.offset; 266#L54 assume !(q1_~argc < 2);q1_~N~0 := q1_#t~nondet12;havoc q1_#t~nondet12;call q1_~#a~1.base, q1_~#a~1.offset := #Ultimate.allocOnStack(4 * q1_~N~0);havoc q1_~i~1;q1_#t~switch13 := false; 267#L63 assume !q1_#t~switch13;q1_#t~switch13 := q1_#t~switch13; 268#L67 assume !q1_#t~switch13;q1_#t~switch13 := true; 260#L71 assume !q1_#t~switch13; 261#L61 havoc q1_#t~switch13;bubblesort_#in~size, bubblesort_#in~item.base, bubblesort_#in~item.offset := q1_~N~0, q1_~#a~1.base, q1_~#a~1.offset;havoc bubblesort_#t~mem2, bubblesort_#t~mem3, bubblesort_#t~mem4, bubblesort_#t~mem5, bubblesort_#t~pre1, bubblesort_#t~pre0, bubblesort_~size, bubblesort_~item.base, bubblesort_~item.offset, bubblesort_~a~0, bubblesort_~b~0, bubblesort_~t~0;bubblesort_~size := bubblesort_#in~size;bubblesort_~item.base, bubblesort_~item.offset := bubblesort_#in~item.base, bubblesort_#in~item.offset;havoc bubblesort_~a~0;havoc bubblesort_~b~0;havoc bubblesort_~t~0;bubblesort_~a~0 := 1; 264#L16-3 [2019-11-16 00:35:51,244 INFO L793 eck$LassoCheckResult]: Loop: 264#L16-3 assume !!(bubblesort_~a~0 < bubblesort_~size);bubblesort_~b~0 := bubblesort_~size - 1; 252#L18-3 assume !!(bubblesort_~b~0 >= bubblesort_~a~0); 253#L21 assume bubblesort_~b~0 - 1 < bubblesort_~size && bubblesort_~b~0 < bubblesort_~size;call bubblesort_#t~mem2 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);call bubblesort_#t~mem3 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 269#L23 assume bubblesort_#t~mem2 > bubblesort_#t~mem3;havoc bubblesort_#t~mem2;havoc bubblesort_#t~mem3;call bubblesort_#t~mem4 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);bubblesort_~t~0 := bubblesort_#t~mem4;havoc bubblesort_#t~mem4;call bubblesort_#t~mem5 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4);call write~int(bubblesort_#t~mem5, bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);havoc bubblesort_#t~mem5;call write~int(bubblesort_~t~0, bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 258#L18-2 bubblesort_#t~pre1 := bubblesort_~b~0 - 1;bubblesort_~b~0 := bubblesort_~b~0 - 1;havoc bubblesort_#t~pre1; 259#L18-3 assume !(bubblesort_~b~0 >= bubblesort_~a~0); 271#L16-2 bubblesort_#t~pre0 := 1 + bubblesort_~a~0;bubblesort_~a~0 := 1 + bubblesort_~a~0;havoc bubblesort_#t~pre0; 264#L16-3 [2019-11-16 00:35:51,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:35:51,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1807321784, now seen corresponding path program 3 times [2019-11-16 00:35:51,244 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:35:51,245 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771682812] [2019-11-16 00:35:51,245 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:51,245 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:51,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:35:51,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:35:51,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:35:51,258 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771682812] [2019-11-16 00:35:51,258 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:35:51,258 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:35:51,258 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211313989] [2019-11-16 00:35:51,259 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:35:51,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:35:51,259 INFO L82 PathProgramCache]: Analyzing trace with hash -1669532239, now seen corresponding path program 1 times [2019-11-16 00:35:51,259 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:35:51,259 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128891706] [2019-11-16 00:35:51,259 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:51,260 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:51,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:35:51,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:35:51,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:35:51,282 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:35:51,394 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2019-11-16 00:35:51,435 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:35:51,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:35:51,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:35:51,435 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-11-16 00:35:51,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:35:51,443 INFO L93 Difference]: Finished difference Result 20 states and 25 transitions. [2019-11-16 00:35:51,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:35:51,444 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 25 transitions. [2019-11-16 00:35:51,444 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-11-16 00:35:51,445 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 25 transitions. [2019-11-16 00:35:51,445 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2019-11-16 00:35:51,445 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2019-11-16 00:35:51,445 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 25 transitions. [2019-11-16 00:35:51,445 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:35:51,445 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2019-11-16 00:35:51,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 25 transitions. [2019-11-16 00:35:51,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-11-16 00:35:51,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-16 00:35:51,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2019-11-16 00:35:51,448 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2019-11-16 00:35:51,448 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2019-11-16 00:35:51,448 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-16 00:35:51,448 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 25 transitions. [2019-11-16 00:35:51,449 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-11-16 00:35:51,449 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:35:51,449 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:35:51,449 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:35:51,449 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:35:51,450 INFO L791 eck$LassoCheckResult]: Stem: 316#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 311#L-1 main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_~argc, main_~#argv.base, main_~#argv.offset;main_~argc := main_#in~argc;main_~#argv.base, main_~#argv.offset := main_#in~argv.base, main_#in~argv.offset;q1_#in~argc, q1_#in~argv.base, q1_#in~argv.offset := main_~argc, main_~#argv.base, main_~#argv.offset;havoc q1_#t~nondet12, q1_#t~switch13, q1_#t~pre14, q1_#t~pre15, q1_#t~pre16, q1_#t~nondet18, q1_#t~mem19, q1_#t~mem20, q1_#t~post17, q1_~r~0, q1_~temp~0, q1_~argc, q1_~argv.base, q1_~argv.offset, q1_~N~0, q1_~#a~1.base, q1_~#a~1.offset, q1_~i~1;q1_~argc := q1_#in~argc;q1_~argv.base, q1_~argv.offset := q1_#in~argv.base, q1_#in~argv.offset; 312#L54 assume !(q1_~argc < 2);q1_~N~0 := q1_#t~nondet12;havoc q1_#t~nondet12;call q1_~#a~1.base, q1_~#a~1.offset := #Ultimate.allocOnStack(4 * q1_~N~0);havoc q1_~i~1;q1_#t~switch13 := false; 313#L63 assume !q1_#t~switch13;q1_#t~switch13 := q1_#t~switch13; 314#L67 assume !q1_#t~switch13;q1_#t~switch13 := true; 306#L71 assume q1_#t~switch13;q1_~i~1 := 0; 300#L72-3 assume !(q1_~i~1 < q1_~N~0); 301#L72-4 q1_~i~1 := 0; 307#L74-3 [2019-11-16 00:35:51,450 INFO L793 eck$LassoCheckResult]: Loop: 307#L74-3 assume !!(q1_~i~1 < q1_~N~0);q1_~r~0 := q1_~i~1 + (if q1_#t~nondet18 < 0 && 0 != q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) then (if q1_~N~0 - q1_~i~1 < 0 then q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) + (q1_~N~0 - q1_~i~1) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) - (q1_~N~0 - q1_~i~1)) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1));havoc q1_#t~nondet18;call q1_#t~mem19 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);q1_~temp~0 := q1_#t~mem19;havoc q1_#t~mem19;call q1_#t~mem20 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4);call write~int(q1_#t~mem20, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);havoc q1_#t~mem20;call write~int(q1_~temp~0, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4); 309#L74-2 q1_#t~post17 := q1_~i~1;q1_~i~1 := 1 + q1_#t~post17;havoc q1_#t~post17; 307#L74-3 [2019-11-16 00:35:51,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:35:51,450 INFO L82 PathProgramCache]: Analyzing trace with hash 192371872, now seen corresponding path program 1 times [2019-11-16 00:35:51,450 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:35:51,451 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408412373] [2019-11-16 00:35:51,451 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:51,451 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:51,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:35:51,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:35:51,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:35:51,465 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:35:51,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:35:51,466 INFO L82 PathProgramCache]: Analyzing trace with hash 3139, now seen corresponding path program 1 times [2019-11-16 00:35:51,466 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:35:51,466 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838519535] [2019-11-16 00:35:51,466 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:51,466 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:51,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:35:51,470 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-16 00:35:51,470 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1462176973] [2019-11-16 00:35:51,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4bbeefd0-6216-421b-bc79-a8ea8c88a176/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-11-16 00:35:51,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:35:51,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:35:51,552 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:35:51,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:35:51,553 INFO L82 PathProgramCache]: Analyzing trace with hash 185777442, now seen corresponding path program 1 times [2019-11-16 00:35:51,553 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:35:51,553 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465155373] [2019-11-16 00:35:51,553 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:51,553 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:51,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:35:51,558 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-16 00:35:51,558 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1908531686] [2019-11-16 00:35:51,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4bbeefd0-6216-421b-bc79-a8ea8c88a176/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-11-16 00:35:51,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:35:51,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:35:51,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:35:51,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:35:51,709 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465155373] [2019-11-16 00:35:51,709 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-16 00:35:51,709 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1908531686] [2019-11-16 00:35:51,709 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:35:51,710 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:35:51,710 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57112140] [2019-11-16 00:35:51,867 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:35:51,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:35:51,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:35:51,868 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. cyclomatic complexity: 8 Second operand 5 states. [2019-11-16 00:35:51,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:35:51,949 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2019-11-16 00:35:51,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:35:51,954 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 51 transitions. [2019-11-16 00:35:51,955 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 23 [2019-11-16 00:35:51,955 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 41 states and 51 transitions. [2019-11-16 00:35:51,956 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2019-11-16 00:35:51,956 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2019-11-16 00:35:51,956 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 51 transitions. [2019-11-16 00:35:51,956 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:35:51,956 INFO L688 BuchiCegarLoop]: Abstraction has 41 states and 51 transitions. [2019-11-16 00:35:51,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 51 transitions. [2019-11-16 00:35:51,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 22. [2019-11-16 00:35:51,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-16 00:35:51,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2019-11-16 00:35:51,959 INFO L711 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2019-11-16 00:35:51,959 INFO L591 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2019-11-16 00:35:51,959 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-16 00:35:51,959 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. [2019-11-16 00:35:51,959 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-11-16 00:35:51,959 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:35:51,959 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:35:51,960 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:35:51,960 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:35:51,960 INFO L791 eck$LassoCheckResult]: Stem: 420#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 415#L-1 main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_~argc, main_~#argv.base, main_~#argv.offset;main_~argc := main_#in~argc;main_~#argv.base, main_~#argv.offset := main_#in~argv.base, main_#in~argv.offset;q1_#in~argc, q1_#in~argv.base, q1_#in~argv.offset := main_~argc, main_~#argv.base, main_~#argv.offset;havoc q1_#t~nondet12, q1_#t~switch13, q1_#t~pre14, q1_#t~pre15, q1_#t~pre16, q1_#t~nondet18, q1_#t~mem19, q1_#t~mem20, q1_#t~post17, q1_~r~0, q1_~temp~0, q1_~argc, q1_~argv.base, q1_~argv.offset, q1_~N~0, q1_~#a~1.base, q1_~#a~1.offset, q1_~i~1;q1_~argc := q1_#in~argc;q1_~argv.base, q1_~argv.offset := q1_#in~argv.base, q1_#in~argv.offset; 416#L54 assume !(q1_~argc < 2);q1_~N~0 := q1_#t~nondet12;havoc q1_#t~nondet12;call q1_~#a~1.base, q1_~#a~1.offset := #Ultimate.allocOnStack(4 * q1_~N~0);havoc q1_~i~1;q1_#t~switch13 := false; 417#L63 assume !q1_#t~switch13;q1_#t~switch13 := q1_#t~switch13; 418#L67 assume !q1_#t~switch13;q1_#t~switch13 := true; 409#L71 assume q1_#t~switch13;q1_~i~1 := 0; 402#L72-3 assume !(q1_~i~1 < q1_~N~0); 403#L72-4 q1_~i~1 := 0; 410#L74-3 assume !(q1_~i~1 < q1_~N~0); 411#L61 havoc q1_#t~switch13;bubblesort_#in~size, bubblesort_#in~item.base, bubblesort_#in~item.offset := q1_~N~0, q1_~#a~1.base, q1_~#a~1.offset;havoc bubblesort_#t~mem2, bubblesort_#t~mem3, bubblesort_#t~mem4, bubblesort_#t~mem5, bubblesort_#t~pre1, bubblesort_#t~pre0, bubblesort_~size, bubblesort_~item.base, bubblesort_~item.offset, bubblesort_~a~0, bubblesort_~b~0, bubblesort_~t~0;bubblesort_~size := bubblesort_#in~size;bubblesort_~item.base, bubblesort_~item.offset := bubblesort_#in~item.base, bubblesort_#in~item.offset;havoc bubblesort_~a~0;havoc bubblesort_~b~0;havoc bubblesort_~t~0;bubblesort_~a~0 := 1; 412#L16-3 [2019-11-16 00:35:51,960 INFO L793 eck$LassoCheckResult]: Loop: 412#L16-3 assume !!(bubblesort_~a~0 < bubblesort_~size);bubblesort_~b~0 := bubblesort_~size - 1; 400#L18-3 assume !!(bubblesort_~b~0 >= bubblesort_~a~0); 401#L21 assume bubblesort_~b~0 - 1 < bubblesort_~size && bubblesort_~b~0 < bubblesort_~size;call bubblesort_#t~mem2 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);call bubblesort_#t~mem3 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 419#L23 assume bubblesort_#t~mem2 > bubblesort_#t~mem3;havoc bubblesort_#t~mem2;havoc bubblesort_#t~mem3;call bubblesort_#t~mem4 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);bubblesort_~t~0 := bubblesort_#t~mem4;havoc bubblesort_#t~mem4;call bubblesort_#t~mem5 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4);call write~int(bubblesort_#t~mem5, bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);havoc bubblesort_#t~mem5;call write~int(bubblesort_~t~0, bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 407#L18-2 bubblesort_#t~pre1 := bubblesort_~b~0 - 1;bubblesort_~b~0 := bubblesort_~b~0 - 1;havoc bubblesort_#t~pre1; 408#L18-3 assume !(bubblesort_~b~0 >= bubblesort_~a~0); 421#L16-2 bubblesort_#t~pre0 := 1 + bubblesort_~a~0;bubblesort_~a~0 := 1 + bubblesort_~a~0;havoc bubblesort_#t~pre0; 412#L16-3 [2019-11-16 00:35:51,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:35:51,961 INFO L82 PathProgramCache]: Analyzing trace with hash 185777387, now seen corresponding path program 1 times [2019-11-16 00:35:51,961 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:35:51,961 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170081084] [2019-11-16 00:35:51,961 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:51,961 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:51,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:35:51,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:35:51,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:35:51,990 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:35:51,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:35:51,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1669532239, now seen corresponding path program 2 times [2019-11-16 00:35:51,990 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:35:51,991 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539016032] [2019-11-16 00:35:51,991 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:51,991 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:51,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:35:51,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:35:52,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:35:52,002 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:35:52,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:35:52,003 INFO L82 PathProgramCache]: Analyzing trace with hash -1443775097, now seen corresponding path program 1 times [2019-11-16 00:35:52,003 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:35:52,003 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412495041] [2019-11-16 00:35:52,003 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:52,004 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:52,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:35:52,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:35:52,082 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:35:52,083 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412495041] [2019-11-16 00:35:52,083 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:35:52,083 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:35:52,083 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413037804] [2019-11-16 00:35:52,218 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:35:52,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:35:52,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:35:52,218 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. cyclomatic complexity: 8 Second operand 6 states. [2019-11-16 00:35:52,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:35:52,319 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2019-11-16 00:35:52,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:35:52,320 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 34 transitions. [2019-11-16 00:35:52,321 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-11-16 00:35:52,321 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 23 states and 27 transitions. [2019-11-16 00:35:52,321 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-11-16 00:35:52,321 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-11-16 00:35:52,321 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 27 transitions. [2019-11-16 00:35:52,322 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:35:52,322 INFO L688 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2019-11-16 00:35:52,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 27 transitions. [2019-11-16 00:35:52,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2019-11-16 00:35:52,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-16 00:35:52,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2019-11-16 00:35:52,324 INFO L711 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-11-16 00:35:52,324 INFO L591 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-11-16 00:35:52,324 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-16 00:35:52,324 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 25 transitions. [2019-11-16 00:35:52,324 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-11-16 00:35:52,324 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:35:52,325 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:35:52,325 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:35:52,325 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:35:52,325 INFO L791 eck$LassoCheckResult]: Stem: 485#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 480#L-1 main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_~argc, main_~#argv.base, main_~#argv.offset;main_~argc := main_#in~argc;main_~#argv.base, main_~#argv.offset := main_#in~argv.base, main_#in~argv.offset;q1_#in~argc, q1_#in~argv.base, q1_#in~argv.offset := main_~argc, main_~#argv.base, main_~#argv.offset;havoc q1_#t~nondet12, q1_#t~switch13, q1_#t~pre14, q1_#t~pre15, q1_#t~pre16, q1_#t~nondet18, q1_#t~mem19, q1_#t~mem20, q1_#t~post17, q1_~r~0, q1_~temp~0, q1_~argc, q1_~argv.base, q1_~argv.offset, q1_~N~0, q1_~#a~1.base, q1_~#a~1.offset, q1_~i~1;q1_~argc := q1_#in~argc;q1_~argv.base, q1_~argv.offset := q1_#in~argv.base, q1_#in~argv.offset; 481#L54 assume !(q1_~argc < 2);q1_~N~0 := q1_#t~nondet12;havoc q1_#t~nondet12;call q1_~#a~1.base, q1_~#a~1.offset := #Ultimate.allocOnStack(4 * q1_~N~0);havoc q1_~i~1;q1_#t~switch13 := false; 482#L63 assume !q1_#t~switch13;q1_#t~switch13 := q1_#t~switch13; 483#L67 assume !q1_#t~switch13;q1_#t~switch13 := true; 476#L71 assume q1_#t~switch13;q1_~i~1 := 0; 468#L72-3 assume !!(q1_~i~1 < q1_~N~0);call write~int(q1_~i~1, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4); 469#L72-2 q1_#t~pre16 := 1 + q1_~i~1;q1_~i~1 := 1 + q1_~i~1;havoc q1_#t~pre16; 470#L72-3 assume !(q1_~i~1 < q1_~N~0); 471#L72-4 q1_~i~1 := 0; 474#L74-3 assume !!(q1_~i~1 < q1_~N~0);q1_~r~0 := q1_~i~1 + (if q1_#t~nondet18 < 0 && 0 != q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) then (if q1_~N~0 - q1_~i~1 < 0 then q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) + (q1_~N~0 - q1_~i~1) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) - (q1_~N~0 - q1_~i~1)) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1));havoc q1_#t~nondet18;call q1_#t~mem19 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);q1_~temp~0 := q1_#t~mem19;havoc q1_#t~mem19;call q1_#t~mem20 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4);call write~int(q1_#t~mem20, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);havoc q1_#t~mem20;call write~int(q1_~temp~0, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4); 475#L74-2 [2019-11-16 00:35:52,325 INFO L793 eck$LassoCheckResult]: Loop: 475#L74-2 q1_#t~post17 := q1_~i~1;q1_~i~1 := 1 + q1_#t~post17;havoc q1_#t~post17; 479#L74-3 assume !!(q1_~i~1 < q1_~N~0);q1_~r~0 := q1_~i~1 + (if q1_#t~nondet18 < 0 && 0 != q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) then (if q1_~N~0 - q1_~i~1 < 0 then q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) + (q1_~N~0 - q1_~i~1) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) - (q1_~N~0 - q1_~i~1)) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1));havoc q1_#t~nondet18;call q1_#t~mem19 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);q1_~temp~0 := q1_#t~mem19;havoc q1_#t~mem19;call q1_#t~mem20 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4);call write~int(q1_#t~mem20, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);havoc q1_#t~mem20;call write~int(q1_~temp~0, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4); 475#L74-2 [2019-11-16 00:35:52,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:35:52,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1465845666, now seen corresponding path program 1 times [2019-11-16 00:35:52,329 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:35:52,329 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557072973] [2019-11-16 00:35:52,329 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:52,329 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:52,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:35:52,338 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-16 00:35:52,338 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1527989991] [2019-11-16 00:35:52,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4bbeefd0-6216-421b-bc79-a8ea8c88a176/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-11-16 00:35:52,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:35:52,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:35:52,416 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:35:52,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:35:52,417 INFO L82 PathProgramCache]: Analyzing trace with hash 3199, now seen corresponding path program 2 times [2019-11-16 00:35:52,417 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:35:52,417 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247491174] [2019-11-16 00:35:52,417 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:52,417 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:52,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:35:52,421 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-16 00:35:52,421 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1796320079] [2019-11-16 00:35:52,422 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4bbeefd0-6216-421b-bc79-a8ea8c88a176/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:35:52,464 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-16 00:35:52,464 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2019-11-16 00:35:52,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:35:52,473 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:35:52,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:35:52,475 INFO L82 PathProgramCache]: Analyzing trace with hash -71585824, now seen corresponding path program 1 times [2019-11-16 00:35:52,475 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:35:52,475 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507823803] [2019-11-16 00:35:52,475 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:52,475 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:52,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:35:52,479 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-16 00:35:52,480 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1436229252] [2019-11-16 00:35:52,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4bbeefd0-6216-421b-bc79-a8ea8c88a176/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:35:52,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:35:52,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:35:52,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:35:52,598 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:35:52,599 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507823803] [2019-11-16 00:35:52,599 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-16 00:35:52,599 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1436229252] [2019-11-16 00:35:52,599 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:35:52,599 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-11-16 00:35:52,599 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624865177] [2019-11-16 00:35:52,769 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:35:52,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:35:52,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:35:52,769 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. cyclomatic complexity: 7 Second operand 7 states. [2019-11-16 00:35:52,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:35:52,873 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2019-11-16 00:35:52,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:35:52,876 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 57 transitions. [2019-11-16 00:35:52,877 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 23 [2019-11-16 00:35:52,877 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 47 states and 57 transitions. [2019-11-16 00:35:52,878 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2019-11-16 00:35:52,878 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2019-11-16 00:35:52,878 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 57 transitions. [2019-11-16 00:35:52,878 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:35:52,878 INFO L688 BuchiCegarLoop]: Abstraction has 47 states and 57 transitions. [2019-11-16 00:35:52,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 57 transitions. [2019-11-16 00:35:52,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 27. [2019-11-16 00:35:52,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-16 00:35:52,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2019-11-16 00:35:52,881 INFO L711 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2019-11-16 00:35:52,881 INFO L591 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2019-11-16 00:35:52,881 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-16 00:35:52,881 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 32 transitions. [2019-11-16 00:35:52,886 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-11-16 00:35:52,886 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:35:52,886 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:35:52,887 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:35:52,887 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:35:52,887 INFO L791 eck$LassoCheckResult]: Stem: 608#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 603#L-1 main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_~argc, main_~#argv.base, main_~#argv.offset;main_~argc := main_#in~argc;main_~#argv.base, main_~#argv.offset := main_#in~argv.base, main_#in~argv.offset;q1_#in~argc, q1_#in~argv.base, q1_#in~argv.offset := main_~argc, main_~#argv.base, main_~#argv.offset;havoc q1_#t~nondet12, q1_#t~switch13, q1_#t~pre14, q1_#t~pre15, q1_#t~pre16, q1_#t~nondet18, q1_#t~mem19, q1_#t~mem20, q1_#t~post17, q1_~r~0, q1_~temp~0, q1_~argc, q1_~argv.base, q1_~argv.offset, q1_~N~0, q1_~#a~1.base, q1_~#a~1.offset, q1_~i~1;q1_~argc := q1_#in~argc;q1_~argv.base, q1_~argv.offset := q1_#in~argv.base, q1_#in~argv.offset; 604#L54 assume !(q1_~argc < 2);q1_~N~0 := q1_#t~nondet12;havoc q1_#t~nondet12;call q1_~#a~1.base, q1_~#a~1.offset := #Ultimate.allocOnStack(4 * q1_~N~0);havoc q1_~i~1;q1_#t~switch13 := false; 605#L63 assume !q1_#t~switch13;q1_#t~switch13 := q1_#t~switch13; 606#L67 assume !q1_#t~switch13;q1_#t~switch13 := true; 597#L71 assume q1_#t~switch13;q1_~i~1 := 0; 590#L72-3 assume !!(q1_~i~1 < q1_~N~0);call write~int(q1_~i~1, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4); 591#L72-2 q1_#t~pre16 := 1 + q1_~i~1;q1_~i~1 := 1 + q1_~i~1;havoc q1_#t~pre16; 592#L72-3 assume !!(q1_~i~1 < q1_~N~0);call write~int(q1_~i~1, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4); 594#L72-2 q1_#t~pre16 := 1 + q1_~i~1;q1_~i~1 := 1 + q1_~i~1;havoc q1_#t~pre16; 614#L72-3 assume !(q1_~i~1 < q1_~N~0); 613#L72-4 q1_~i~1 := 0; 598#L74-3 assume !!(q1_~i~1 < q1_~N~0);q1_~r~0 := q1_~i~1 + (if q1_#t~nondet18 < 0 && 0 != q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) then (if q1_~N~0 - q1_~i~1 < 0 then q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) + (q1_~N~0 - q1_~i~1) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) - (q1_~N~0 - q1_~i~1)) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1));havoc q1_#t~nondet18;call q1_#t~mem19 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);q1_~temp~0 := q1_#t~mem19;havoc q1_#t~mem19;call q1_#t~mem20 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4);call write~int(q1_#t~mem20, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);havoc q1_#t~mem20;call write~int(q1_~temp~0, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4); 599#L74-2 [2019-11-16 00:35:52,887 INFO L793 eck$LassoCheckResult]: Loop: 599#L74-2 q1_#t~post17 := q1_~i~1;q1_~i~1 := 1 + q1_#t~post17;havoc q1_#t~post17; 602#L74-3 assume !!(q1_~i~1 < q1_~N~0);q1_~r~0 := q1_~i~1 + (if q1_#t~nondet18 < 0 && 0 != q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) then (if q1_~N~0 - q1_~i~1 < 0 then q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) + (q1_~N~0 - q1_~i~1) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) - (q1_~N~0 - q1_~i~1)) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1));havoc q1_#t~nondet18;call q1_#t~mem19 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);q1_~temp~0 := q1_#t~mem19;havoc q1_#t~mem19;call q1_#t~mem20 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4);call write~int(q1_#t~mem20, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);havoc q1_#t~mem20;call write~int(q1_~temp~0, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4); 599#L74-2 [2019-11-16 00:35:52,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:35:52,888 INFO L82 PathProgramCache]: Analyzing trace with hash -69873632, now seen corresponding path program 2 times [2019-11-16 00:35:52,888 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:35:52,888 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888327605] [2019-11-16 00:35:52,888 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:52,888 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:52,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:35:52,893 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-16 00:35:52,894 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2079588005] [2019-11-16 00:35:52,894 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4bbeefd0-6216-421b-bc79-a8ea8c88a176/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:35:52,948 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-16 00:35:52,948 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2019-11-16 00:35:52,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:35:52,970 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:35:52,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:35:52,970 INFO L82 PathProgramCache]: Analyzing trace with hash 3199, now seen corresponding path program 3 times [2019-11-16 00:35:52,970 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:35:52,971 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911841325] [2019-11-16 00:35:52,971 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:52,971 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:52,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:35:52,973 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-16 00:35:52,973 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1530045262] [2019-11-16 00:35:52,973 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4bbeefd0-6216-421b-bc79-a8ea8c88a176/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:35:53,023 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2019-11-16 00:35:53,024 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2019-11-16 00:35:53,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:35:53,032 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:35:53,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:35:53,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1570918622, now seen corresponding path program 2 times [2019-11-16 00:35:53,033 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:35:53,033 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003863851] [2019-11-16 00:35:53,033 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:53,033 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:53,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:35:53,038 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-16 00:35:53,038 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1951140030] [2019-11-16 00:35:53,038 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4bbeefd0-6216-421b-bc79-a8ea8c88a176/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:35:53,097 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-16 00:35:53,097 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2019-11-16 00:35:53,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:35:53,124 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:35:53,927 WARN L191 SmtUtils]: Spent 642.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 135 [2019-11-16 00:35:54,626 WARN L191 SmtUtils]: Spent 646.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 99 [2019-11-16 00:35:54,643 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:35:54,643 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:35:54,643 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:35:54,644 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:35:54,644 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:35:54,644 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:35:54,644 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:35:54,644 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:35:54,644 INFO L131 ssoRankerPreferences]: Filename of dumped script: bubble_sort-1.c_Iteration9_Lasso [2019-11-16 00:35:54,644 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:35:54,644 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:35:54,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:35:54,912 WARN L191 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2019-11-16 00:35:55,101 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 44 [2019-11-16 00:35:55,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:35:55,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:35:55,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:35:55,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:35:55,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:35:55,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:35:55,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:35:55,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:35:55,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:35:55,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:35:55,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:35:55,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:35:55,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:35:55,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:35:57,059 WARN L191 SmtUtils]: Spent 1.83 s on a formula simplification. DAG size of input: 79 DAG size of output: 55 [2019-11-16 00:35:57,258 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-11-16 00:35:57,803 WARN L191 SmtUtils]: Spent 544.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-11-16 00:35:57,886 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:35:57,886 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:35:57,886 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:35:57,887 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:35:57,887 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:35:57,887 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:35:57,887 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:35:57,888 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:35:57,888 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:35:57,895 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:35:57,896 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:35:57,896 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:35:57,897 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:35:57,897 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:35:57,897 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:35:57,898 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:35:57,898 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:35:57,900 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:35:57,900 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:35:57,901 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:35:57,901 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:35:57,901 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:35:57,901 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:35:57,902 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:35:57,902 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:35:57,905 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:35:57,906 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:35:57,906 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:35:57,907 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-16 00:35:57,907 INFO L203 nArgumentSynthesizer]: 3 loop disjuncts [2019-11-16 00:35:57,907 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:35:57,924 INFO L400 nArgumentSynthesizer]: We have 36 Motzkin's Theorem applications. [2019-11-16 00:35:57,924 INFO L401 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2019-11-16 00:35:58,825 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:35:59,157 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-11-16 00:35:59,158 INFO L444 ModelExtractionUtils]: 30 out of 50 variables were initially zero. Simplification set additionally 17 variables to zero. [2019-11-16 00:35:59,159 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:35:59,161 INFO L438 nArgumentSynthesizer]: Removed 6 redundant supporting invariants from a total of 6. [2019-11-16 00:35:59,161 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:35:59,162 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_q1_~N~0, ULTIMATE.start_q1_~i~1) = 1*ULTIMATE.start_q1_~N~0 - 1*ULTIMATE.start_q1_~i~1 Supporting invariants [] [2019-11-16 00:35:59,168 INFO L297 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2019-11-16 00:35:59,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:35:59,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:35:59,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:35:59,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:35:59,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:35:59,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:35:59,210 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:35:59,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:35:59,217 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-16 00:35:59,218 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 32 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-11-16 00:35:59,245 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 32 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 38 states and 48 transitions. Complement of second has 4 states. [2019-11-16 00:35:59,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-16 00:35:59,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-16 00:35:59,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2019-11-16 00:35:59,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 13 letters. Loop has 2 letters. [2019-11-16 00:35:59,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:35:59,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 15 letters. Loop has 2 letters. [2019-11-16 00:35:59,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:35:59,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 13 letters. Loop has 4 letters. [2019-11-16 00:35:59,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:35:59,249 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 48 transitions. [2019-11-16 00:35:59,250 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-16 00:35:59,250 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 29 states and 35 transitions. [2019-11-16 00:35:59,250 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2019-11-16 00:35:59,250 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2019-11-16 00:35:59,250 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 35 transitions. [2019-11-16 00:35:59,250 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:35:59,251 INFO L688 BuchiCegarLoop]: Abstraction has 29 states and 35 transitions. [2019-11-16 00:35:59,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 35 transitions. [2019-11-16 00:35:59,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-11-16 00:35:59,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-16 00:35:59,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2019-11-16 00:35:59,253 INFO L711 BuchiCegarLoop]: Abstraction has 28 states and 34 transitions. [2019-11-16 00:35:59,253 INFO L591 BuchiCegarLoop]: Abstraction has 28 states and 34 transitions. [2019-11-16 00:35:59,253 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-16 00:35:59,253 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 34 transitions. [2019-11-16 00:35:59,253 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-16 00:35:59,253 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:35:59,256 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:35:59,257 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:35:59,258 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:35:59,258 INFO L791 eck$LassoCheckResult]: Stem: 748#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 743#L-1 main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_~argc, main_~#argv.base, main_~#argv.offset;main_~argc := main_#in~argc;main_~#argv.base, main_~#argv.offset := main_#in~argv.base, main_#in~argv.offset;q1_#in~argc, q1_#in~argv.base, q1_#in~argv.offset := main_~argc, main_~#argv.base, main_~#argv.offset;havoc q1_#t~nondet12, q1_#t~switch13, q1_#t~pre14, q1_#t~pre15, q1_#t~pre16, q1_#t~nondet18, q1_#t~mem19, q1_#t~mem20, q1_#t~post17, q1_~r~0, q1_~temp~0, q1_~argc, q1_~argv.base, q1_~argv.offset, q1_~N~0, q1_~#a~1.base, q1_~#a~1.offset, q1_~i~1;q1_~argc := q1_#in~argc;q1_~argv.base, q1_~argv.offset := q1_#in~argv.base, q1_#in~argv.offset; 744#L54 assume !(q1_~argc < 2);q1_~N~0 := q1_#t~nondet12;havoc q1_#t~nondet12;call q1_~#a~1.base, q1_~#a~1.offset := #Ultimate.allocOnStack(4 * q1_~N~0);havoc q1_~i~1;q1_#t~switch13 := false; 745#L63 assume !q1_#t~switch13;q1_#t~switch13 := q1_#t~switch13; 746#L67 assume !q1_#t~switch13;q1_#t~switch13 := true; 739#L71 assume q1_#t~switch13;q1_~i~1 := 0; 728#L72-3 assume !!(q1_~i~1 < q1_~N~0);call write~int(q1_~i~1, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4); 729#L72-2 q1_#t~pre16 := 1 + q1_~i~1;q1_~i~1 := 1 + q1_~i~1;havoc q1_#t~pre16; 753#L72-3 assume !(q1_~i~1 < q1_~N~0); 750#L72-4 q1_~i~1 := 0; 735#L74-3 assume !!(q1_~i~1 < q1_~N~0);q1_~r~0 := q1_~i~1 + (if q1_#t~nondet18 < 0 && 0 != q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) then (if q1_~N~0 - q1_~i~1 < 0 then q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) + (q1_~N~0 - q1_~i~1) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) - (q1_~N~0 - q1_~i~1)) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1));havoc q1_#t~nondet18;call q1_#t~mem19 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);q1_~temp~0 := q1_#t~mem19;havoc q1_#t~mem19;call q1_#t~mem20 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4);call write~int(q1_#t~mem20, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);havoc q1_#t~mem20;call write~int(q1_~temp~0, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4); 736#L74-2 q1_#t~post17 := q1_~i~1;q1_~i~1 := 1 + q1_#t~post17;havoc q1_#t~post17; 742#L74-3 assume !(q1_~i~1 < q1_~N~0); 740#L61 havoc q1_#t~switch13;bubblesort_#in~size, bubblesort_#in~item.base, bubblesort_#in~item.offset := q1_~N~0, q1_~#a~1.base, q1_~#a~1.offset;havoc bubblesort_#t~mem2, bubblesort_#t~mem3, bubblesort_#t~mem4, bubblesort_#t~mem5, bubblesort_#t~pre1, bubblesort_#t~pre0, bubblesort_~size, bubblesort_~item.base, bubblesort_~item.offset, bubblesort_~a~0, bubblesort_~b~0, bubblesort_~t~0;bubblesort_~size := bubblesort_#in~size;bubblesort_~item.base, bubblesort_~item.offset := bubblesort_#in~item.base, bubblesort_#in~item.offset;havoc bubblesort_~a~0;havoc bubblesort_~b~0;havoc bubblesort_~t~0;bubblesort_~a~0 := 1; 741#L16-3 [2019-11-16 00:35:59,258 INFO L793 eck$LassoCheckResult]: Loop: 741#L16-3 assume !!(bubblesort_~a~0 < bubblesort_~size);bubblesort_~b~0 := bubblesort_~size - 1; 726#L18-3 assume !!(bubblesort_~b~0 >= bubblesort_~a~0); 727#L21 assume bubblesort_~b~0 - 1 < bubblesort_~size && bubblesort_~b~0 < bubblesort_~size;call bubblesort_#t~mem2 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);call bubblesort_#t~mem3 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 747#L23 assume bubblesort_#t~mem2 > bubblesort_#t~mem3;havoc bubblesort_#t~mem2;havoc bubblesort_#t~mem3;call bubblesort_#t~mem4 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);bubblesort_~t~0 := bubblesort_#t~mem4;havoc bubblesort_#t~mem4;call bubblesort_#t~mem5 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4);call write~int(bubblesort_#t~mem5, bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);havoc bubblesort_#t~mem5;call write~int(bubblesort_~t~0, bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 733#L18-2 bubblesort_#t~pre1 := bubblesort_~b~0 - 1;bubblesort_~b~0 := bubblesort_~b~0 - 1;havoc bubblesort_#t~pre1; 734#L18-3 assume !(bubblesort_~b~0 >= bubblesort_~a~0); 749#L16-2 bubblesort_#t~pre0 := 1 + bubblesort_~a~0;bubblesort_~a~0 := 1 + bubblesort_~a~0;havoc bubblesort_#t~pre0; 741#L16-3 [2019-11-16 00:35:59,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:35:59,258 INFO L82 PathProgramCache]: Analyzing trace with hash 2075806767, now seen corresponding path program 1 times [2019-11-16 00:35:59,259 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:35:59,259 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710517752] [2019-11-16 00:35:59,259 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:59,259 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:59,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:35:59,264 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-16 00:35:59,265 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [888997263] [2019-11-16 00:35:59,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4bbeefd0-6216-421b-bc79-a8ea8c88a176/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:35:59,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:35:59,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:35:59,360 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:35:59,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:35:59,360 INFO L82 PathProgramCache]: Analyzing trace with hash -1669532239, now seen corresponding path program 3 times [2019-11-16 00:35:59,360 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:35:59,360 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038056597] [2019-11-16 00:35:59,361 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:59,361 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:59,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:35:59,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:35:59,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:35:59,368 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:35:59,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:35:59,368 INFO L82 PathProgramCache]: Analyzing trace with hash -548718141, now seen corresponding path program 1 times [2019-11-16 00:35:59,368 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:35:59,368 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697852181] [2019-11-16 00:35:59,369 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:59,369 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:59,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:35:59,377 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-16 00:35:59,377 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [238732419] [2019-11-16 00:35:59,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4bbeefd0-6216-421b-bc79-a8ea8c88a176/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:35:59,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:35:59,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:35:59,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:35:59,473 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-16 00:35:59,474 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697852181] [2019-11-16 00:35:59,474 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-16 00:35:59,474 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [238732419] [2019-11-16 00:35:59,474 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:35:59,474 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-11-16 00:35:59,474 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8288625] [2019-11-16 00:35:59,593 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:35:59,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:35:59,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:35:59,594 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. cyclomatic complexity: 9 Second operand 6 states. [2019-11-16 00:35:59,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:35:59,692 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2019-11-16 00:35:59,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:35:59,692 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 41 transitions. [2019-11-16 00:35:59,693 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-16 00:35:59,693 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 28 states and 33 transitions. [2019-11-16 00:35:59,693 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2019-11-16 00:35:59,694 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2019-11-16 00:35:59,694 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 33 transitions. [2019-11-16 00:35:59,694 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:35:59,694 INFO L688 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2019-11-16 00:35:59,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 33 transitions. [2019-11-16 00:35:59,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2019-11-16 00:35:59,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-16 00:35:59,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2019-11-16 00:35:59,696 INFO L711 BuchiCegarLoop]: Abstraction has 25 states and 29 transitions. [2019-11-16 00:35:59,696 INFO L591 BuchiCegarLoop]: Abstraction has 25 states and 29 transitions. [2019-11-16 00:35:59,696 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-16 00:35:59,696 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 29 transitions. [2019-11-16 00:35:59,697 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-16 00:35:59,697 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:35:59,697 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:35:59,697 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:35:59,697 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:35:59,698 INFO L791 eck$LassoCheckResult]: Stem: 887#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 882#L-1 main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_~argc, main_~#argv.base, main_~#argv.offset;main_~argc := main_#in~argc;main_~#argv.base, main_~#argv.offset := main_#in~argv.base, main_#in~argv.offset;q1_#in~argc, q1_#in~argv.base, q1_#in~argv.offset := main_~argc, main_~#argv.base, main_~#argv.offset;havoc q1_#t~nondet12, q1_#t~switch13, q1_#t~pre14, q1_#t~pre15, q1_#t~pre16, q1_#t~nondet18, q1_#t~mem19, q1_#t~mem20, q1_#t~post17, q1_~r~0, q1_~temp~0, q1_~argc, q1_~argv.base, q1_~argv.offset, q1_~N~0, q1_~#a~1.base, q1_~#a~1.offset, q1_~i~1;q1_~argc := q1_#in~argc;q1_~argv.base, q1_~argv.offset := q1_#in~argv.base, q1_#in~argv.offset; 883#L54 assume !(q1_~argc < 2);q1_~N~0 := q1_#t~nondet12;havoc q1_#t~nondet12;call q1_~#a~1.base, q1_~#a~1.offset := #Ultimate.allocOnStack(4 * q1_~N~0);havoc q1_~i~1;q1_#t~switch13 := false; 884#L63 assume !q1_#t~switch13;q1_#t~switch13 := q1_#t~switch13; 885#L67 assume !q1_#t~switch13;q1_#t~switch13 := true; 878#L71 assume q1_#t~switch13;q1_~i~1 := 0; 868#L72-3 assume !!(q1_~i~1 < q1_~N~0);call write~int(q1_~i~1, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4); 869#L72-2 q1_#t~pre16 := 1 + q1_~i~1;q1_~i~1 := 1 + q1_~i~1;havoc q1_#t~pre16; 870#L72-3 assume !!(q1_~i~1 < q1_~N~0);call write~int(q1_~i~1, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4); 871#L72-2 q1_#t~pre16 := 1 + q1_~i~1;q1_~i~1 := 1 + q1_~i~1;havoc q1_#t~pre16; 890#L72-3 assume !(q1_~i~1 < q1_~N~0); 889#L72-4 q1_~i~1 := 0; 874#L74-3 assume !!(q1_~i~1 < q1_~N~0);q1_~r~0 := q1_~i~1 + (if q1_#t~nondet18 < 0 && 0 != q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) then (if q1_~N~0 - q1_~i~1 < 0 then q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) + (q1_~N~0 - q1_~i~1) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) - (q1_~N~0 - q1_~i~1)) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1));havoc q1_#t~nondet18;call q1_#t~mem19 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);q1_~temp~0 := q1_#t~mem19;havoc q1_#t~mem19;call q1_#t~mem20 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4);call write~int(q1_#t~mem20, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);havoc q1_#t~mem20;call write~int(q1_~temp~0, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4); 875#L74-2 q1_#t~post17 := q1_~i~1;q1_~i~1 := 1 + q1_#t~post17;havoc q1_#t~post17; 876#L74-3 assume !!(q1_~i~1 < q1_~N~0);q1_~r~0 := q1_~i~1 + (if q1_#t~nondet18 < 0 && 0 != q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) then (if q1_~N~0 - q1_~i~1 < 0 then q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) + (q1_~N~0 - q1_~i~1) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) - (q1_~N~0 - q1_~i~1)) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1));havoc q1_#t~nondet18;call q1_#t~mem19 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);q1_~temp~0 := q1_#t~mem19;havoc q1_#t~mem19;call q1_#t~mem20 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4);call write~int(q1_#t~mem20, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);havoc q1_#t~mem20;call write~int(q1_~temp~0, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4); 877#L74-2 q1_#t~post17 := q1_~i~1;q1_~i~1 := 1 + q1_#t~post17;havoc q1_#t~post17; 881#L74-3 assume !(q1_~i~1 < q1_~N~0); 879#L61 havoc q1_#t~switch13;bubblesort_#in~size, bubblesort_#in~item.base, bubblesort_#in~item.offset := q1_~N~0, q1_~#a~1.base, q1_~#a~1.offset;havoc bubblesort_#t~mem2, bubblesort_#t~mem3, bubblesort_#t~mem4, bubblesort_#t~mem5, bubblesort_#t~pre1, bubblesort_#t~pre0, bubblesort_~size, bubblesort_~item.base, bubblesort_~item.offset, bubblesort_~a~0, bubblesort_~b~0, bubblesort_~t~0;bubblesort_~size := bubblesort_#in~size;bubblesort_~item.base, bubblesort_~item.offset := bubblesort_#in~item.base, bubblesort_#in~item.offset;havoc bubblesort_~a~0;havoc bubblesort_~b~0;havoc bubblesort_~t~0;bubblesort_~a~0 := 1; 880#L16-3 [2019-11-16 00:35:59,698 INFO L793 eck$LassoCheckResult]: Loop: 880#L16-3 assume !!(bubblesort_~a~0 < bubblesort_~size);bubblesort_~b~0 := bubblesort_~size - 1; 866#L18-3 assume !!(bubblesort_~b~0 >= bubblesort_~a~0); 867#L21 assume bubblesort_~b~0 - 1 < bubblesort_~size && bubblesort_~b~0 < bubblesort_~size;call bubblesort_#t~mem2 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);call bubblesort_#t~mem3 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 886#L23 assume bubblesort_#t~mem2 > bubblesort_#t~mem3;havoc bubblesort_#t~mem2;havoc bubblesort_#t~mem3;call bubblesort_#t~mem4 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);bubblesort_~t~0 := bubblesort_#t~mem4;havoc bubblesort_#t~mem4;call bubblesort_#t~mem5 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4);call write~int(bubblesort_#t~mem5, bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);havoc bubblesort_#t~mem5;call write~int(bubblesort_~t~0, bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 872#L18-2 bubblesort_#t~pre1 := bubblesort_~b~0 - 1;bubblesort_~b~0 := bubblesort_~b~0 - 1;havoc bubblesort_#t~pre1; 873#L18-3 assume !(bubblesort_~b~0 >= bubblesort_~a~0); 888#L16-2 bubblesort_#t~pre0 := 1 + bubblesort_~a~0;bubblesort_~a~0 := 1 + bubblesort_~a~0;havoc bubblesort_#t~pre0; 880#L16-3 [2019-11-16 00:35:59,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:35:59,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1273080179, now seen corresponding path program 2 times [2019-11-16 00:35:59,698 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:35:59,698 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568855059] [2019-11-16 00:35:59,699 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:59,699 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:59,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:35:59,704 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-16 00:35:59,704 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [563111715] [2019-11-16 00:35:59,705 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4bbeefd0-6216-421b-bc79-a8ea8c88a176/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:35:59,778 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-16 00:35:59,778 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2019-11-16 00:35:59,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:35:59,804 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:35:59,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:35:59,805 INFO L82 PathProgramCache]: Analyzing trace with hash -1669532239, now seen corresponding path program 4 times [2019-11-16 00:35:59,805 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:35:59,805 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958297467] [2019-11-16 00:35:59,805 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:59,805 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:59,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:35:59,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:35:59,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:35:59,812 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:35:59,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:35:59,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1247881215, now seen corresponding path program 2 times [2019-11-16 00:35:59,813 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:35:59,813 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253821270] [2019-11-16 00:35:59,813 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:59,813 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:59,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:35:59,819 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-16 00:35:59,819 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2121123980] [2019-11-16 00:35:59,819 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4bbeefd0-6216-421b-bc79-a8ea8c88a176/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:35:59,906 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-16 00:35:59,906 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2019-11-16 00:35:59,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:35:59,940 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:36:01,612 WARN L191 SmtUtils]: Spent 1.54 s on a formula simplification. DAG size of input: 218 DAG size of output: 182 [2019-11-16 00:36:04,276 WARN L191 SmtUtils]: Spent 2.24 s on a formula simplification. DAG size of input: 223 DAG size of output: 123 [2019-11-16 00:36:04,278 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:36:04,278 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:36:04,278 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:36:04,278 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:36:04,278 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:36:04,278 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:36:04,278 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:36:04,278 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:36:04,278 INFO L131 ssoRankerPreferences]: Filename of dumped script: bubble_sort-1.c_Iteration11_Lasso [2019-11-16 00:36:04,279 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:36:04,279 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:36:04,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:36:04,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:36:04,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:36:04,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:36:04,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:36:04,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:36:04,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:36:04,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:36:04,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:36:04,318 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:36:04,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:36:04,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:36:04,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:36:04,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:36:04,798 WARN L191 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 68 [2019-11-16 00:36:04,877 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:36:04,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:36:04,887 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:36: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-11-16 00:36: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-11-16 00:36: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-11-16 00:36:04,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:36:04,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:36:05,112 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 58 [2019-11-16 00:36:05,599 WARN L191 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 58 [2019-11-16 00:36:05,692 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:36:05,692 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:36:05,693 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:36:05,693 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:36:05,693 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:36:05,693 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:36:05,694 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:36:05,694 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:36:05,694 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:36:05,694 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:36:05,695 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:36:05,695 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:36:05,695 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:36:05,696 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:36:05,696 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:36:05,696 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:36:05,696 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:36:05,696 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:36:05,696 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:36:05,697 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:36:05,697 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:36:05,697 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:36:05,697 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:36:05,697 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:36:05,698 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:36:05,698 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:36:05,698 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:36:05,700 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:36:05,700 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:36:05,700 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:36:05,700 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:36:05,701 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:36:05,701 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:36:05,701 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:36:05,701 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:36:05,701 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:36:05,701 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:36:05,703 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:36:05,703 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:36:05,704 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:36:05,704 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:36:05,704 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:36:05,704 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:36:05,705 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:36:05,705 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:36:05,705 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:36:05,705 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:36:05,706 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:36:05,706 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:36:05,706 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:36:05,707 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:36:05,707 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:36:05,707 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:36:05,707 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:36:05,708 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:36:05,708 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:36:05,709 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:36:05,709 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:36:05,709 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:36:05,709 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:36:05,710 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:36:05,710 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:36:05,712 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:36:05,713 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:36:05,713 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:36:05,713 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:36:05,714 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:36:05,714 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:36:05,714 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:36:05,714 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:36:05,714 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:36:05,715 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:36:05,715 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:36:05,716 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:36:05,716 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:36:05,716 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:36:05,716 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:36:05,716 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:36:05,717 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:36:05,717 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:36:05,717 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:36:05,717 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:36:05,718 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:36:05,718 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:36:05,718 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:36:05,718 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:36:05,719 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:36:05,719 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:36:05,719 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:36:05,720 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:36:05,720 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:36:05,720 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:36:05,721 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:36:05,721 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:36:05,721 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:36:05,721 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:36:05,721 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:36:05,721 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:36:05,722 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:36:05,722 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:36:05,723 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:36:05,723 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:36:05,723 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:36:05,723 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:36:05,724 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:36:05,724 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:36:05,725 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:36:05,725 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:36:05,726 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:36:05,726 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:36:05,726 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:36:05,727 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:36:05,727 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:36:05,727 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:36:05,727 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:36:05,728 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:36:05,728 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:36:05,728 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:36:05,728 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:36:05,729 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:36:05,729 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:36:05,729 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:36:05,729 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:36:05,729 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:36:05,730 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:36:05,730 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:36:05,731 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:36:05,731 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-16 00:36:05,731 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:36:05,731 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:36:05,732 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-16 00:36:05,733 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:36:05,737 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:36:05,738 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:36:05,738 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:36:05,739 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-16 00:36:05,739 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:36:05,739 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:36:05,742 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-16 00:36:05,742 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:36:05,781 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:36:05,826 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-11-16 00:36:05,827 INFO L444 ModelExtractionUtils]: 34 out of 40 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-11-16 00:36:05,827 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:36:05,828 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-16 00:36:05,829 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:36:05,829 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_bubblesort_~a~0, ULTIMATE.start_bubblesort_~size) = -1*ULTIMATE.start_bubblesort_~a~0 + 1*ULTIMATE.start_bubblesort_~size Supporting invariants [] [2019-11-16 00:36:05,893 INFO L297 tatePredicateManager]: 14 out of 14 supporting invariants were superfluous and have been removed [2019-11-16 00:36:05,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:36:05,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:36:05,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:36:05,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:36:05,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:36:05,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:36:05,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:36:05,954 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:36:05,954 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-16 00:36:05,955 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 29 transitions. cyclomatic complexity: 7 Second operand 3 states. [2019-11-16 00:36:05,969 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 29 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 32 states and 39 transitions. Complement of second has 4 states. [2019-11-16 00:36:05,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-16 00:36:05,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-16 00:36:05,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2019-11-16 00:36:05,971 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 18 letters. Loop has 7 letters. [2019-11-16 00:36:05,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:36:05,971 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 25 letters. Loop has 7 letters. [2019-11-16 00:36:05,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:36:05,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 18 letters. Loop has 14 letters. [2019-11-16 00:36:05,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:36:05,972 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 39 transitions. [2019-11-16 00:36:05,973 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-16 00:36:05,973 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 31 states and 38 transitions. [2019-11-16 00:36:05,973 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-11-16 00:36:05,973 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2019-11-16 00:36:05,973 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 38 transitions. [2019-11-16 00:36:05,974 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:36:05,974 INFO L688 BuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2019-11-16 00:36:05,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 38 transitions. [2019-11-16 00:36:05,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-11-16 00:36:05,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-16 00:36:05,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2019-11-16 00:36:05,976 INFO L711 BuchiCegarLoop]: Abstraction has 30 states and 37 transitions. [2019-11-16 00:36:05,976 INFO L591 BuchiCegarLoop]: Abstraction has 30 states and 37 transitions. [2019-11-16 00:36:05,976 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-11-16 00:36:05,976 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 37 transitions. [2019-11-16 00:36:05,976 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-16 00:36:05,977 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:36:05,977 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:36:05,977 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:36:05,977 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-16 00:36:05,980 INFO L791 eck$LassoCheckResult]: Stem: 1099#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1093#L-1 main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_~argc, main_~#argv.base, main_~#argv.offset;main_~argc := main_#in~argc;main_~#argv.base, main_~#argv.offset := main_#in~argv.base, main_#in~argv.offset;q1_#in~argc, q1_#in~argv.base, q1_#in~argv.offset := main_~argc, main_~#argv.base, main_~#argv.offset;havoc q1_#t~nondet12, q1_#t~switch13, q1_#t~pre14, q1_#t~pre15, q1_#t~pre16, q1_#t~nondet18, q1_#t~mem19, q1_#t~mem20, q1_#t~post17, q1_~r~0, q1_~temp~0, q1_~argc, q1_~argv.base, q1_~argv.offset, q1_~N~0, q1_~#a~1.base, q1_~#a~1.offset, q1_~i~1;q1_~argc := q1_#in~argc;q1_~argv.base, q1_~argv.offset := q1_#in~argv.base, q1_#in~argv.offset; 1094#L54 assume !(q1_~argc < 2);q1_~N~0 := q1_#t~nondet12;havoc q1_#t~nondet12;call q1_~#a~1.base, q1_~#a~1.offset := #Ultimate.allocOnStack(4 * q1_~N~0);havoc q1_~i~1;q1_#t~switch13 := false; 1095#L63 assume !q1_#t~switch13;q1_#t~switch13 := q1_#t~switch13; 1096#L67 assume !q1_#t~switch13;q1_#t~switch13 := true; 1085#L71 assume q1_#t~switch13;q1_~i~1 := 0; 1078#L72-3 assume !!(q1_~i~1 < q1_~N~0);call write~int(q1_~i~1, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4); 1079#L72-2 q1_#t~pre16 := 1 + q1_~i~1;q1_~i~1 := 1 + q1_~i~1;havoc q1_#t~pre16; 1080#L72-3 assume !!(q1_~i~1 < q1_~N~0);call write~int(q1_~i~1, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4); 1081#L72-2 q1_#t~pre16 := 1 + q1_~i~1;q1_~i~1 := 1 + q1_~i~1;havoc q1_#t~pre16; 1103#L72-3 assume !(q1_~i~1 < q1_~N~0); 1102#L72-4 q1_~i~1 := 0; 1086#L74-3 assume !!(q1_~i~1 < q1_~N~0);q1_~r~0 := q1_~i~1 + (if q1_#t~nondet18 < 0 && 0 != q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) then (if q1_~N~0 - q1_~i~1 < 0 then q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) + (q1_~N~0 - q1_~i~1) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) - (q1_~N~0 - q1_~i~1)) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1));havoc q1_#t~nondet18;call q1_#t~mem19 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);q1_~temp~0 := q1_#t~mem19;havoc q1_#t~mem19;call q1_#t~mem20 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4);call write~int(q1_#t~mem20, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);havoc q1_#t~mem20;call write~int(q1_~temp~0, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4); 1087#L74-2 q1_#t~post17 := q1_~i~1;q1_~i~1 := 1 + q1_#t~post17;havoc q1_#t~post17; 1088#L74-3 assume !!(q1_~i~1 < q1_~N~0);q1_~r~0 := q1_~i~1 + (if q1_#t~nondet18 < 0 && 0 != q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) then (if q1_~N~0 - q1_~i~1 < 0 then q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) + (q1_~N~0 - q1_~i~1) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) - (q1_~N~0 - q1_~i~1)) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1));havoc q1_#t~nondet18;call q1_#t~mem19 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);q1_~temp~0 := q1_#t~mem19;havoc q1_#t~mem19;call q1_#t~mem20 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4);call write~int(q1_#t~mem20, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);havoc q1_#t~mem20;call write~int(q1_~temp~0, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4); 1089#L74-2 q1_#t~post17 := q1_~i~1;q1_~i~1 := 1 + q1_#t~post17;havoc q1_#t~post17; 1092#L74-3 assume !(q1_~i~1 < q1_~N~0); 1090#L61 havoc q1_#t~switch13;bubblesort_#in~size, bubblesort_#in~item.base, bubblesort_#in~item.offset := q1_~N~0, q1_~#a~1.base, q1_~#a~1.offset;havoc bubblesort_#t~mem2, bubblesort_#t~mem3, bubblesort_#t~mem4, bubblesort_#t~mem5, bubblesort_#t~pre1, bubblesort_#t~pre0, bubblesort_~size, bubblesort_~item.base, bubblesort_~item.offset, bubblesort_~a~0, bubblesort_~b~0, bubblesort_~t~0;bubblesort_~size := bubblesort_#in~size;bubblesort_~item.base, bubblesort_~item.offset := bubblesort_#in~item.base, bubblesort_#in~item.offset;havoc bubblesort_~a~0;havoc bubblesort_~b~0;havoc bubblesort_~t~0;bubblesort_~a~0 := 1; 1091#L16-3 assume !!(bubblesort_~a~0 < bubblesort_~size);bubblesort_~b~0 := bubblesort_~size - 1; 1074#L18-3 [2019-11-16 00:36:05,980 INFO L793 eck$LassoCheckResult]: Loop: 1074#L18-3 assume !!(bubblesort_~b~0 >= bubblesort_~a~0); 1075#L21 assume bubblesort_~b~0 - 1 < bubblesort_~size && bubblesort_~b~0 < bubblesort_~size;call bubblesort_#t~mem2 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);call bubblesort_#t~mem3 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 1097#L23 assume bubblesort_#t~mem2 > bubblesort_#t~mem3;havoc bubblesort_#t~mem2;havoc bubblesort_#t~mem3;call bubblesort_#t~mem4 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);bubblesort_~t~0 := bubblesort_#t~mem4;havoc bubblesort_#t~mem4;call bubblesort_#t~mem5 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4);call write~int(bubblesort_#t~mem5, bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);havoc bubblesort_#t~mem5;call write~int(bubblesort_~t~0, bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 1082#L18-2 bubblesort_#t~pre1 := bubblesort_~b~0 - 1;bubblesort_~b~0 := bubblesort_~b~0 - 1;havoc bubblesort_#t~pre1; 1074#L18-3 [2019-11-16 00:36:05,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:36:05,981 INFO L82 PathProgramCache]: Analyzing trace with hash 810779970, now seen corresponding path program 1 times [2019-11-16 00:36:05,981 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:36:05,981 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349950526] [2019-11-16 00:36:05,981 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:05,981 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:05,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:36:05,988 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-16 00:36:05,988 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1683779483] [2019-11-16 00:36:05,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4bbeefd0-6216-421b-bc79-a8ea8c88a176/bin/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:36:06,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:36:06,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:36:06,104 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:36:06,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:36:06,104 INFO L82 PathProgramCache]: Analyzing trace with hash 3789515, now seen corresponding path program 1 times [2019-11-16 00:36:06,105 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:36:06,105 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729824209] [2019-11-16 00:36:06,105 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:06,105 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:06,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:36:06,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:36:06,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:36:06,114 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:36:06,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:36:06,114 INFO L82 PathProgramCache]: Analyzing trace with hash 618057612, now seen corresponding path program 1 times [2019-11-16 00:36:06,115 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:36:06,115 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233776942] [2019-11-16 00:36:06,115 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:06,115 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:06,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:36:06,121 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-16 00:36:06,121 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [512409778] [2019-11-16 00:36:06,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4bbeefd0-6216-421b-bc79-a8ea8c88a176/bin/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:36:06,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:36:06,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:36:06,242 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:36:08,159 WARN L191 SmtUtils]: Spent 1.81 s on a formula simplification. DAG size of input: 222 DAG size of output: 188 [2019-11-16 00:36:13,948 WARN L191 SmtUtils]: Spent 5.44 s on a formula simplification. DAG size of input: 226 DAG size of output: 130 [2019-11-16 00:36:13,950 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:36:13,950 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:36:13,950 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:36:13,950 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:36:13,951 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:36:13,951 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:36:13,951 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:36:13,951 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:36:13,951 INFO L131 ssoRankerPreferences]: Filename of dumped script: bubble_sort-1.c_Iteration12_Lasso [2019-11-16 00:36:13,951 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:36:13,951 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:36:13,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:36:13,962 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:36:13,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:36:13,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:36:13,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:36:13,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:36:13,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:36:13,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:36:13,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:36:14,615 WARN L191 SmtUtils]: Spent 497.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 74 [2019-11-16 00:36:14,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:36:14,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:36:14,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:36:14,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:36:14,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:36:14,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-11-16 00:36:14,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:36:14,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:36:14,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:36:14,723 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:36:14,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:36:14,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:36:14,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:36:15,061 WARN L191 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 74 [2019-11-16 00:36:15,707 WARN L191 SmtUtils]: Spent 431.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 73 [2019-11-16 00:36:15,809 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:36:15,810 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:36:15,810 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:36:15,810 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:36:15,811 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:36:15,811 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:36:15,811 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:36:15,811 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:36:15,811 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:36:15,811 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:36:15,812 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:36:15,812 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:36:15,812 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:36:15,812 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:36:15,812 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:36:15,812 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:36:15,813 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:36:15,813 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:36:15,813 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:36:15,813 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:36:15,813 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:36:15,814 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:36:15,814 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:36:15,814 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:36:15,814 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:36:15,815 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:36:15,815 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:36:15,820 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:36:15,820 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:36:15,821 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:36:15,821 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:36:15,821 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:36:15,821 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:36:15,821 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:36:15,822 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:36:15,822 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:36:15,822 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:36:15,823 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:36:15,823 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:36:15,823 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:36:15,823 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:36:15,824 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:36:15,824 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:36:15,824 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:36:15,824 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:36:15,825 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:36:15,825 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:36:15,825 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:36:15,825 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:36:15,826 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:36:15,826 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:36:15,826 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:36:15,826 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:36:15,827 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:36:15,828 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:36:15,828 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:36:15,828 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:36:15,828 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:36:15,828 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:36:15,829 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:36:15,829 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:36:15,829 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:36:15,829 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:36:15,830 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:36:15,830 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:36:15,830 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:36:15,830 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:36:15,830 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:36:15,831 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:36:15,831 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:36:15,831 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:36:15,831 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:36:15,832 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:36:15,832 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:36:15,832 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:36:15,832 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:36:15,832 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:36:15,834 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:36:15,834 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:36:15,836 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:36:15,837 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:36:15,837 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:36:15,837 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-16 00:36:15,837 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:36:15,838 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:36:15,840 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-16 00:36:15,840 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:36:15,882 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:36:15,910 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-11-16 00:36:15,911 INFO L444 ModelExtractionUtils]: 34 out of 40 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-11-16 00:36:15,911 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:36:15,912 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-16 00:36:15,912 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:36:15,912 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_bubblesort_~a~0, ULTIMATE.start_bubblesort_~b~0) = -2*ULTIMATE.start_bubblesort_~a~0 + 2*ULTIMATE.start_bubblesort_~b~0 + 1 Supporting invariants [] [2019-11-16 00:36:15,981 INFO L297 tatePredicateManager]: 14 out of 14 supporting invariants were superfluous and have been removed [2019-11-16 00:36:15,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:36:16,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:36:16,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:36:16,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:36:16,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:36:16,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:36:16,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:36:16,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:36:16,037 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-16 00:36:16,037 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 37 transitions. cyclomatic complexity: 11 Second operand 3 states. [2019-11-16 00:36:16,060 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 37 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 50 states and 65 transitions. Complement of second has 7 states. [2019-11-16 00:36:16,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-16 00:36:16,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-16 00:36:16,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2019-11-16 00:36:16,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 19 letters. Loop has 4 letters. [2019-11-16 00:36:16,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:36:16,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 23 letters. Loop has 4 letters. [2019-11-16 00:36:16,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:36:16,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 19 letters. Loop has 8 letters. [2019-11-16 00:36:16,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:36:16,063 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 65 transitions. [2019-11-16 00:36:16,064 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-16 00:36:16,064 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 37 states and 46 transitions. [2019-11-16 00:36:16,064 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-11-16 00:36:16,064 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-11-16 00:36:16,065 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 46 transitions. [2019-11-16 00:36:16,065 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:36:16,065 INFO L688 BuchiCegarLoop]: Abstraction has 37 states and 46 transitions. [2019-11-16 00:36:16,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 46 transitions. [2019-11-16 00:36:16,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 30. [2019-11-16 00:36:16,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-16 00:36:16,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2019-11-16 00:36:16,067 INFO L711 BuchiCegarLoop]: Abstraction has 30 states and 36 transitions. [2019-11-16 00:36:16,067 INFO L591 BuchiCegarLoop]: Abstraction has 30 states and 36 transitions. [2019-11-16 00:36:16,067 INFO L424 BuchiCegarLoop]: ======== Iteration 13============ [2019-11-16 00:36:16,067 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 36 transitions. [2019-11-16 00:36:16,068 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-16 00:36:16,068 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:36:16,068 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:36:16,068 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:36:16,068 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-16 00:36:16,069 INFO L791 eck$LassoCheckResult]: Stem: 1328#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1322#L-1 main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_~argc, main_~#argv.base, main_~#argv.offset;main_~argc := main_#in~argc;main_~#argv.base, main_~#argv.offset := main_#in~argv.base, main_#in~argv.offset;q1_#in~argc, q1_#in~argv.base, q1_#in~argv.offset := main_~argc, main_~#argv.base, main_~#argv.offset;havoc q1_#t~nondet12, q1_#t~switch13, q1_#t~pre14, q1_#t~pre15, q1_#t~pre16, q1_#t~nondet18, q1_#t~mem19, q1_#t~mem20, q1_#t~post17, q1_~r~0, q1_~temp~0, q1_~argc, q1_~argv.base, q1_~argv.offset, q1_~N~0, q1_~#a~1.base, q1_~#a~1.offset, q1_~i~1;q1_~argc := q1_#in~argc;q1_~argv.base, q1_~argv.offset := q1_#in~argv.base, q1_#in~argv.offset; 1323#L54 assume !(q1_~argc < 2);q1_~N~0 := q1_#t~nondet12;havoc q1_#t~nondet12;call q1_~#a~1.base, q1_~#a~1.offset := #Ultimate.allocOnStack(4 * q1_~N~0);havoc q1_~i~1;q1_#t~switch13 := false; 1324#L63 assume !q1_#t~switch13;q1_#t~switch13 := q1_#t~switch13; 1325#L67 assume !q1_#t~switch13;q1_#t~switch13 := true; 1314#L71 assume q1_#t~switch13;q1_~i~1 := 0; 1307#L72-3 assume !!(q1_~i~1 < q1_~N~0);call write~int(q1_~i~1, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4); 1308#L72-2 q1_#t~pre16 := 1 + q1_~i~1;q1_~i~1 := 1 + q1_~i~1;havoc q1_#t~pre16; 1309#L72-3 assume !!(q1_~i~1 < q1_~N~0);call write~int(q1_~i~1, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4); 1310#L72-2 q1_#t~pre16 := 1 + q1_~i~1;q1_~i~1 := 1 + q1_~i~1;havoc q1_#t~pre16; 1332#L72-3 assume !(q1_~i~1 < q1_~N~0); 1331#L72-4 q1_~i~1 := 0; 1315#L74-3 assume !!(q1_~i~1 < q1_~N~0);q1_~r~0 := q1_~i~1 + (if q1_#t~nondet18 < 0 && 0 != q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) then (if q1_~N~0 - q1_~i~1 < 0 then q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) + (q1_~N~0 - q1_~i~1) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) - (q1_~N~0 - q1_~i~1)) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1));havoc q1_#t~nondet18;call q1_#t~mem19 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);q1_~temp~0 := q1_#t~mem19;havoc q1_#t~mem19;call q1_#t~mem20 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4);call write~int(q1_#t~mem20, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);havoc q1_#t~mem20;call write~int(q1_~temp~0, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4); 1316#L74-2 q1_#t~post17 := q1_~i~1;q1_~i~1 := 1 + q1_#t~post17;havoc q1_#t~post17; 1317#L74-3 assume !!(q1_~i~1 < q1_~N~0);q1_~r~0 := q1_~i~1 + (if q1_#t~nondet18 < 0 && 0 != q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) then (if q1_~N~0 - q1_~i~1 < 0 then q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) + (q1_~N~0 - q1_~i~1) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) - (q1_~N~0 - q1_~i~1)) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1));havoc q1_#t~nondet18;call q1_#t~mem19 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);q1_~temp~0 := q1_#t~mem19;havoc q1_#t~mem19;call q1_#t~mem20 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4);call write~int(q1_#t~mem20, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);havoc q1_#t~mem20;call write~int(q1_~temp~0, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4); 1318#L74-2 q1_#t~post17 := q1_~i~1;q1_~i~1 := 1 + q1_#t~post17;havoc q1_#t~post17; 1321#L74-3 assume !(q1_~i~1 < q1_~N~0); 1319#L61 havoc q1_#t~switch13;bubblesort_#in~size, bubblesort_#in~item.base, bubblesort_#in~item.offset := q1_~N~0, q1_~#a~1.base, q1_~#a~1.offset;havoc bubblesort_#t~mem2, bubblesort_#t~mem3, bubblesort_#t~mem4, bubblesort_#t~mem5, bubblesort_#t~pre1, bubblesort_#t~pre0, bubblesort_~size, bubblesort_~item.base, bubblesort_~item.offset, bubblesort_~a~0, bubblesort_~b~0, bubblesort_~t~0;bubblesort_~size := bubblesort_#in~size;bubblesort_~item.base, bubblesort_~item.offset := bubblesort_#in~item.base, bubblesort_#in~item.offset;havoc bubblesort_~a~0;havoc bubblesort_~b~0;havoc bubblesort_~t~0;bubblesort_~a~0 := 1; 1320#L16-3 assume !!(bubblesort_~a~0 < bubblesort_~size);bubblesort_~b~0 := bubblesort_~size - 1; 1305#L18-3 assume !!(bubblesort_~b~0 >= bubblesort_~a~0); 1306#L21 assume bubblesort_~b~0 - 1 < bubblesort_~size && bubblesort_~b~0 < bubblesort_~size;call bubblesort_#t~mem2 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);call bubblesort_#t~mem3 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 1327#L23 assume !(bubblesort_#t~mem2 > bubblesort_#t~mem3);havoc bubblesort_#t~mem2;havoc bubblesort_#t~mem3; 1312#L18-2 bubblesort_#t~pre1 := bubblesort_~b~0 - 1;bubblesort_~b~0 := bubblesort_~b~0 - 1;havoc bubblesort_#t~pre1; 1313#L18-3 assume !(bubblesort_~b~0 >= bubblesort_~a~0); 1330#L16-2 bubblesort_#t~pre0 := 1 + bubblesort_~a~0;bubblesort_~a~0 := 1 + bubblesort_~a~0;havoc bubblesort_#t~pre0; 1329#L16-3 assume !!(bubblesort_~a~0 < bubblesort_~size);bubblesort_~b~0 := bubblesort_~size - 1; 1303#L18-3 [2019-11-16 00:36:16,069 INFO L793 eck$LassoCheckResult]: Loop: 1303#L18-3 assume !!(bubblesort_~b~0 >= bubblesort_~a~0); 1304#L21 assume bubblesort_~b~0 - 1 < bubblesort_~size && bubblesort_~b~0 < bubblesort_~size;call bubblesort_#t~mem2 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);call bubblesort_#t~mem3 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 1326#L23 assume bubblesort_#t~mem2 > bubblesort_#t~mem3;havoc bubblesort_#t~mem2;havoc bubblesort_#t~mem3;call bubblesort_#t~mem4 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);bubblesort_~t~0 := bubblesort_#t~mem4;havoc bubblesort_#t~mem4;call bubblesort_#t~mem5 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4);call write~int(bubblesort_#t~mem5, bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);havoc bubblesort_#t~mem5;call write~int(bubblesort_~t~0, bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 1311#L18-2 bubblesort_#t~pre1 := bubblesort_~b~0 - 1;bubblesort_~b~0 := bubblesort_~b~0 - 1;havoc bubblesort_#t~pre1; 1303#L18-3 [2019-11-16 00:36:16,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:36:16,069 INFO L82 PathProgramCache]: Analyzing trace with hash 31459128, now seen corresponding path program 1 times [2019-11-16 00:36:16,069 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:36:16,069 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420759002] [2019-11-16 00:36:16,069 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:16,072 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:16,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:36:16,077 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-16 00:36:16,078 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1229032181] [2019-11-16 00:36:16,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4bbeefd0-6216-421b-bc79-a8ea8c88a176/bin/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:36:16,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:36:16,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-16 00:36:16,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:36:16,221 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-16 00:36:16,222 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420759002] [2019-11-16 00:36:16,222 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-16 00:36:16,222 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1229032181] [2019-11-16 00:36:16,222 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:36:16,222 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-11-16 00:36:16,222 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826984209] [2019-11-16 00:36:16,223 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:36:16,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:36:16,223 INFO L82 PathProgramCache]: Analyzing trace with hash 3789515, now seen corresponding path program 2 times [2019-11-16 00:36:16,223 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:36:16,223 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398717338] [2019-11-16 00:36:16,223 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:16,224 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:16,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:36:16,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:36:16,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:36:16,231 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:36:16,327 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:36:16,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:36:16,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:36:16,327 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. cyclomatic complexity: 10 Second operand 8 states. [2019-11-16 00:36:16,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:36:16,509 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2019-11-16 00:36:16,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-16 00:36:16,509 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 65 transitions. [2019-11-16 00:36:16,510 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-16 00:36:16,511 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 37 states and 44 transitions. [2019-11-16 00:36:16,511 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-11-16 00:36:16,511 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-11-16 00:36:16,511 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 44 transitions. [2019-11-16 00:36:16,511 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:36:16,511 INFO L688 BuchiCegarLoop]: Abstraction has 37 states and 44 transitions. [2019-11-16 00:36:16,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 44 transitions. [2019-11-16 00:36:16,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 34. [2019-11-16 00:36:16,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-16 00:36:16,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2019-11-16 00:36:16,514 INFO L711 BuchiCegarLoop]: Abstraction has 34 states and 40 transitions. [2019-11-16 00:36:16,514 INFO L591 BuchiCegarLoop]: Abstraction has 34 states and 40 transitions. [2019-11-16 00:36:16,514 INFO L424 BuchiCegarLoop]: ======== Iteration 14============ [2019-11-16 00:36:16,514 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 40 transitions. [2019-11-16 00:36:16,514 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-16 00:36:16,514 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:36:16,515 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:36:16,515 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:36:16,515 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-16 00:36:16,516 INFO L791 eck$LassoCheckResult]: Stem: 1510#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1504#L-1 main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_~argc, main_~#argv.base, main_~#argv.offset;main_~argc := main_#in~argc;main_~#argv.base, main_~#argv.offset := main_#in~argv.base, main_#in~argv.offset;q1_#in~argc, q1_#in~argv.base, q1_#in~argv.offset := main_~argc, main_~#argv.base, main_~#argv.offset;havoc q1_#t~nondet12, q1_#t~switch13, q1_#t~pre14, q1_#t~pre15, q1_#t~pre16, q1_#t~nondet18, q1_#t~mem19, q1_#t~mem20, q1_#t~post17, q1_~r~0, q1_~temp~0, q1_~argc, q1_~argv.base, q1_~argv.offset, q1_~N~0, q1_~#a~1.base, q1_~#a~1.offset, q1_~i~1;q1_~argc := q1_#in~argc;q1_~argv.base, q1_~argv.offset := q1_#in~argv.base, q1_#in~argv.offset; 1505#L54 assume !(q1_~argc < 2);q1_~N~0 := q1_#t~nondet12;havoc q1_#t~nondet12;call q1_~#a~1.base, q1_~#a~1.offset := #Ultimate.allocOnStack(4 * q1_~N~0);havoc q1_~i~1;q1_#t~switch13 := false; 1506#L63 assume !q1_#t~switch13;q1_#t~switch13 := q1_#t~switch13; 1507#L67 assume !q1_#t~switch13;q1_#t~switch13 := true; 1495#L71 assume q1_#t~switch13;q1_~i~1 := 0; 1487#L72-3 assume !!(q1_~i~1 < q1_~N~0);call write~int(q1_~i~1, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4); 1488#L72-2 q1_#t~pre16 := 1 + q1_~i~1;q1_~i~1 := 1 + q1_~i~1;havoc q1_#t~pre16; 1489#L72-3 assume !!(q1_~i~1 < q1_~N~0);call write~int(q1_~i~1, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4); 1490#L72-2 q1_#t~pre16 := 1 + q1_~i~1;q1_~i~1 := 1 + q1_~i~1;havoc q1_#t~pre16; 1494#L72-3 assume !!(q1_~i~1 < q1_~N~0);call write~int(q1_~i~1, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4); 1516#L72-2 q1_#t~pre16 := 1 + q1_~i~1;q1_~i~1 := 1 + q1_~i~1;havoc q1_#t~pre16; 1515#L72-3 assume !(q1_~i~1 < q1_~N~0); 1513#L72-4 q1_~i~1 := 0; 1496#L74-3 assume !!(q1_~i~1 < q1_~N~0);q1_~r~0 := q1_~i~1 + (if q1_#t~nondet18 < 0 && 0 != q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) then (if q1_~N~0 - q1_~i~1 < 0 then q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) + (q1_~N~0 - q1_~i~1) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) - (q1_~N~0 - q1_~i~1)) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1));havoc q1_#t~nondet18;call q1_#t~mem19 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);q1_~temp~0 := q1_#t~mem19;havoc q1_#t~mem19;call q1_#t~mem20 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4);call write~int(q1_#t~mem20, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);havoc q1_#t~mem20;call write~int(q1_~temp~0, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4); 1497#L74-2 q1_#t~post17 := q1_~i~1;q1_~i~1 := 1 + q1_#t~post17;havoc q1_#t~post17; 1502#L74-3 assume !!(q1_~i~1 < q1_~N~0);q1_~r~0 := q1_~i~1 + (if q1_#t~nondet18 < 0 && 0 != q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) then (if q1_~N~0 - q1_~i~1 < 0 then q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) + (q1_~N~0 - q1_~i~1) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) - (q1_~N~0 - q1_~i~1)) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1));havoc q1_#t~nondet18;call q1_#t~mem19 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);q1_~temp~0 := q1_#t~mem19;havoc q1_#t~mem19;call q1_#t~mem20 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4);call write~int(q1_#t~mem20, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);havoc q1_#t~mem20;call write~int(q1_~temp~0, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4); 1503#L74-2 q1_#t~post17 := q1_~i~1;q1_~i~1 := 1 + q1_#t~post17;havoc q1_#t~post17; 1498#L74-3 assume !!(q1_~i~1 < q1_~N~0);q1_~r~0 := q1_~i~1 + (if q1_#t~nondet18 < 0 && 0 != q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) then (if q1_~N~0 - q1_~i~1 < 0 then q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) + (q1_~N~0 - q1_~i~1) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) - (q1_~N~0 - q1_~i~1)) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1));havoc q1_#t~nondet18;call q1_#t~mem19 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);q1_~temp~0 := q1_#t~mem19;havoc q1_#t~mem19;call q1_#t~mem20 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4);call write~int(q1_#t~mem20, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);havoc q1_#t~mem20;call write~int(q1_~temp~0, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4); 1499#L74-2 q1_#t~post17 := q1_~i~1;q1_~i~1 := 1 + q1_#t~post17;havoc q1_#t~post17; 1514#L74-3 assume !(q1_~i~1 < q1_~N~0); 1500#L61 havoc q1_#t~switch13;bubblesort_#in~size, bubblesort_#in~item.base, bubblesort_#in~item.offset := q1_~N~0, q1_~#a~1.base, q1_~#a~1.offset;havoc bubblesort_#t~mem2, bubblesort_#t~mem3, bubblesort_#t~mem4, bubblesort_#t~mem5, bubblesort_#t~pre1, bubblesort_#t~pre0, bubblesort_~size, bubblesort_~item.base, bubblesort_~item.offset, bubblesort_~a~0, bubblesort_~b~0, bubblesort_~t~0;bubblesort_~size := bubblesort_#in~size;bubblesort_~item.base, bubblesort_~item.offset := bubblesort_#in~item.base, bubblesort_#in~item.offset;havoc bubblesort_~a~0;havoc bubblesort_~b~0;havoc bubblesort_~t~0;bubblesort_~a~0 := 1; 1501#L16-3 assume !!(bubblesort_~a~0 < bubblesort_~size);bubblesort_~b~0 := bubblesort_~size - 1; 1485#L18-3 assume !!(bubblesort_~b~0 >= bubblesort_~a~0); 1486#L21 assume bubblesort_~b~0 - 1 < bubblesort_~size && bubblesort_~b~0 < bubblesort_~size;call bubblesort_#t~mem2 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);call bubblesort_#t~mem3 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 1509#L23 assume !(bubblesort_#t~mem2 > bubblesort_#t~mem3);havoc bubblesort_#t~mem2;havoc bubblesort_#t~mem3; 1492#L18-2 bubblesort_#t~pre1 := bubblesort_~b~0 - 1;bubblesort_~b~0 := bubblesort_~b~0 - 1;havoc bubblesort_#t~pre1; 1493#L18-3 assume !(bubblesort_~b~0 >= bubblesort_~a~0); 1512#L16-2 bubblesort_#t~pre0 := 1 + bubblesort_~a~0;bubblesort_~a~0 := 1 + bubblesort_~a~0;havoc bubblesort_#t~pre0; 1511#L16-3 assume !!(bubblesort_~a~0 < bubblesort_~size);bubblesort_~b~0 := bubblesort_~size - 1; 1483#L18-3 [2019-11-16 00:36:16,516 INFO L793 eck$LassoCheckResult]: Loop: 1483#L18-3 assume !!(bubblesort_~b~0 >= bubblesort_~a~0); 1484#L21 assume bubblesort_~b~0 - 1 < bubblesort_~size && bubblesort_~b~0 < bubblesort_~size;call bubblesort_#t~mem2 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);call bubblesort_#t~mem3 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 1508#L23 assume bubblesort_#t~mem2 > bubblesort_#t~mem3;havoc bubblesort_#t~mem2;havoc bubblesort_#t~mem3;call bubblesort_#t~mem4 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);bubblesort_~t~0 := bubblesort_#t~mem4;havoc bubblesort_#t~mem4;call bubblesort_#t~mem5 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4);call write~int(bubblesort_#t~mem5, bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);havoc bubblesort_#t~mem5;call write~int(bubblesort_~t~0, bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 1491#L18-2 bubblesort_#t~pre1 := bubblesort_~b~0 - 1;bubblesort_~b~0 := bubblesort_~b~0 - 1;havoc bubblesort_#t~pre1; 1483#L18-3 [2019-11-16 00:36:16,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:36:16,516 INFO L82 PathProgramCache]: Analyzing trace with hash 1103015548, now seen corresponding path program 2 times [2019-11-16 00:36:16,516 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:36:16,516 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672592729] [2019-11-16 00:36:16,516 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:16,517 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:16,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:36:16,527 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-16 00:36:16,529 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [967712608] [2019-11-16 00:36:16,529 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4bbeefd0-6216-421b-bc79-a8ea8c88a176/bin/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:36:16,623 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-16 00:36:16,623 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:36:16,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-16 00:36:16,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:36:16,697 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-16 00:36:16,698 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672592729] [2019-11-16 00:36:16,698 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-16 00:36:16,698 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [967712608] [2019-11-16 00:36:16,698 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:36:16,698 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-11-16 00:36:16,698 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901188356] [2019-11-16 00:36:16,699 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:36:16,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:36:16,699 INFO L82 PathProgramCache]: Analyzing trace with hash 3789515, now seen corresponding path program 3 times [2019-11-16 00:36:16,699 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:36:16,699 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818033292] [2019-11-16 00:36:16,699 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:16,699 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:16,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:36:16,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:36:16,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:36:16,709 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:36:16,828 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:36:16,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-16 00:36:16,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:36:16,828 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. cyclomatic complexity: 10 Second operand 9 states. [2019-11-16 00:36:17,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:36:17,053 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2019-11-16 00:36:17,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-16 00:36:17,054 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 57 transitions. [2019-11-16 00:36:17,054 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-16 00:36:17,055 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 47 states and 57 transitions. [2019-11-16 00:36:17,055 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-11-16 00:36:17,055 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-11-16 00:36:17,055 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 57 transitions. [2019-11-16 00:36:17,056 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:36:17,056 INFO L688 BuchiCegarLoop]: Abstraction has 47 states and 57 transitions. [2019-11-16 00:36:17,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 57 transitions. [2019-11-16 00:36:17,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 38. [2019-11-16 00:36:17,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-16 00:36:17,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2019-11-16 00:36:17,058 INFO L711 BuchiCegarLoop]: Abstraction has 38 states and 45 transitions. [2019-11-16 00:36:17,058 INFO L591 BuchiCegarLoop]: Abstraction has 38 states and 45 transitions. [2019-11-16 00:36:17,059 INFO L424 BuchiCegarLoop]: ======== Iteration 15============ [2019-11-16 00:36:17,059 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 45 transitions. [2019-11-16 00:36:17,059 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-16 00:36:17,059 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:36:17,063 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:36:17,065 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:36:17,065 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-16 00:36:17,066 INFO L791 eck$LassoCheckResult]: Stem: 1701#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1695#L-1 main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_~argc, main_~#argv.base, main_~#argv.offset;main_~argc := main_#in~argc;main_~#argv.base, main_~#argv.offset := main_#in~argv.base, main_#in~argv.offset;q1_#in~argc, q1_#in~argv.base, q1_#in~argv.offset := main_~argc, main_~#argv.base, main_~#argv.offset;havoc q1_#t~nondet12, q1_#t~switch13, q1_#t~pre14, q1_#t~pre15, q1_#t~pre16, q1_#t~nondet18, q1_#t~mem19, q1_#t~mem20, q1_#t~post17, q1_~r~0, q1_~temp~0, q1_~argc, q1_~argv.base, q1_~argv.offset, q1_~N~0, q1_~#a~1.base, q1_~#a~1.offset, q1_~i~1;q1_~argc := q1_#in~argc;q1_~argv.base, q1_~argv.offset := q1_#in~argv.base, q1_#in~argv.offset; 1696#L54 assume !(q1_~argc < 2);q1_~N~0 := q1_#t~nondet12;havoc q1_#t~nondet12;call q1_~#a~1.base, q1_~#a~1.offset := #Ultimate.allocOnStack(4 * q1_~N~0);havoc q1_~i~1;q1_#t~switch13 := false; 1697#L63 assume !q1_#t~switch13;q1_#t~switch13 := q1_#t~switch13; 1698#L67 assume !q1_#t~switch13;q1_#t~switch13 := true; 1686#L71 assume q1_#t~switch13;q1_~i~1 := 0; 1679#L72-3 assume !!(q1_~i~1 < q1_~N~0);call write~int(q1_~i~1, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4); 1680#L72-2 q1_#t~pre16 := 1 + q1_~i~1;q1_~i~1 := 1 + q1_~i~1;havoc q1_#t~pre16; 1681#L72-3 assume !!(q1_~i~1 < q1_~N~0);call write~int(q1_~i~1, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4); 1682#L72-2 q1_#t~pre16 := 1 + q1_~i~1;q1_~i~1 := 1 + q1_~i~1;havoc q1_#t~pre16; 1685#L72-3 assume !!(q1_~i~1 < q1_~N~0);call write~int(q1_~i~1, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4); 1709#L72-2 q1_#t~pre16 := 1 + q1_~i~1;q1_~i~1 := 1 + q1_~i~1;havoc q1_#t~pre16; 1708#L72-3 assume !(q1_~i~1 < q1_~N~0); 1706#L72-4 q1_~i~1 := 0; 1687#L74-3 assume !!(q1_~i~1 < q1_~N~0);q1_~r~0 := q1_~i~1 + (if q1_#t~nondet18 < 0 && 0 != q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) then (if q1_~N~0 - q1_~i~1 < 0 then q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) + (q1_~N~0 - q1_~i~1) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) - (q1_~N~0 - q1_~i~1)) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1));havoc q1_#t~nondet18;call q1_#t~mem19 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);q1_~temp~0 := q1_#t~mem19;havoc q1_#t~mem19;call q1_#t~mem20 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4);call write~int(q1_#t~mem20, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);havoc q1_#t~mem20;call write~int(q1_~temp~0, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4); 1688#L74-2 q1_#t~post17 := q1_~i~1;q1_~i~1 := 1 + q1_#t~post17;havoc q1_#t~post17; 1693#L74-3 assume !!(q1_~i~1 < q1_~N~0);q1_~r~0 := q1_~i~1 + (if q1_#t~nondet18 < 0 && 0 != q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) then (if q1_~N~0 - q1_~i~1 < 0 then q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) + (q1_~N~0 - q1_~i~1) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) - (q1_~N~0 - q1_~i~1)) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1));havoc q1_#t~nondet18;call q1_#t~mem19 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);q1_~temp~0 := q1_#t~mem19;havoc q1_#t~mem19;call q1_#t~mem20 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4);call write~int(q1_#t~mem20, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);havoc q1_#t~mem20;call write~int(q1_~temp~0, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4); 1694#L74-2 q1_#t~post17 := q1_~i~1;q1_~i~1 := 1 + q1_#t~post17;havoc q1_#t~post17; 1689#L74-3 assume !!(q1_~i~1 < q1_~N~0);q1_~r~0 := q1_~i~1 + (if q1_#t~nondet18 < 0 && 0 != q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) then (if q1_~N~0 - q1_~i~1 < 0 then q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) + (q1_~N~0 - q1_~i~1) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) - (q1_~N~0 - q1_~i~1)) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1));havoc q1_#t~nondet18;call q1_#t~mem19 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);q1_~temp~0 := q1_#t~mem19;havoc q1_#t~mem19;call q1_#t~mem20 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4);call write~int(q1_#t~mem20, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);havoc q1_#t~mem20;call write~int(q1_~temp~0, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4); 1690#L74-2 q1_#t~post17 := q1_~i~1;q1_~i~1 := 1 + q1_#t~post17;havoc q1_#t~post17; 1707#L74-3 assume !(q1_~i~1 < q1_~N~0); 1691#L61 havoc q1_#t~switch13;bubblesort_#in~size, bubblesort_#in~item.base, bubblesort_#in~item.offset := q1_~N~0, q1_~#a~1.base, q1_~#a~1.offset;havoc bubblesort_#t~mem2, bubblesort_#t~mem3, bubblesort_#t~mem4, bubblesort_#t~mem5, bubblesort_#t~pre1, bubblesort_#t~pre0, bubblesort_~size, bubblesort_~item.base, bubblesort_~item.offset, bubblesort_~a~0, bubblesort_~b~0, bubblesort_~t~0;bubblesort_~size := bubblesort_#in~size;bubblesort_~item.base, bubblesort_~item.offset := bubblesort_#in~item.base, bubblesort_#in~item.offset;havoc bubblesort_~a~0;havoc bubblesort_~b~0;havoc bubblesort_~t~0;bubblesort_~a~0 := 1; 1692#L16-3 assume !!(bubblesort_~a~0 < bubblesort_~size);bubblesort_~b~0 := bubblesort_~size - 1; 1703#L18-3 assume !!(bubblesort_~b~0 >= bubblesort_~a~0); 1712#L21 assume bubblesort_~b~0 - 1 < bubblesort_~size && bubblesort_~b~0 < bubblesort_~size;call bubblesort_#t~mem2 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);call bubblesort_#t~mem3 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 1711#L23 assume !(bubblesort_#t~mem2 > bubblesort_#t~mem3);havoc bubblesort_#t~mem2;havoc bubblesort_#t~mem3; 1684#L18-2 bubblesort_#t~pre1 := bubblesort_~b~0 - 1;bubblesort_~b~0 := bubblesort_~b~0 - 1;havoc bubblesort_#t~pre1; 1677#L18-3 assume !!(bubblesort_~b~0 >= bubblesort_~a~0); 1678#L21 assume bubblesort_~b~0 - 1 < bubblesort_~size && bubblesort_~b~0 < bubblesort_~size;call bubblesort_#t~mem2 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);call bubblesort_#t~mem3 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 1700#L23 assume !(bubblesort_#t~mem2 > bubblesort_#t~mem3);havoc bubblesort_#t~mem2;havoc bubblesort_#t~mem3; 1702#L18-2 bubblesort_#t~pre1 := bubblesort_~b~0 - 1;bubblesort_~b~0 := bubblesort_~b~0 - 1;havoc bubblesort_#t~pre1; 1710#L18-3 assume !(bubblesort_~b~0 >= bubblesort_~a~0); 1705#L16-2 bubblesort_#t~pre0 := 1 + bubblesort_~a~0;bubblesort_~a~0 := 1 + bubblesort_~a~0;havoc bubblesort_#t~pre0; 1704#L16-3 assume !!(bubblesort_~a~0 < bubblesort_~size);bubblesort_~b~0 := bubblesort_~size - 1; 1675#L18-3 [2019-11-16 00:36:17,066 INFO L793 eck$LassoCheckResult]: Loop: 1675#L18-3 assume !!(bubblesort_~b~0 >= bubblesort_~a~0); 1676#L21 assume bubblesort_~b~0 - 1 < bubblesort_~size && bubblesort_~b~0 < bubblesort_~size;call bubblesort_#t~mem2 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);call bubblesort_#t~mem3 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 1699#L23 assume bubblesort_#t~mem2 > bubblesort_#t~mem3;havoc bubblesort_#t~mem2;havoc bubblesort_#t~mem3;call bubblesort_#t~mem4 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);bubblesort_~t~0 := bubblesort_#t~mem4;havoc bubblesort_#t~mem4;call bubblesort_#t~mem5 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4);call write~int(bubblesort_#t~mem5, bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);havoc bubblesort_#t~mem5;call write~int(bubblesort_~t~0, bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 1683#L18-2 bubblesort_#t~pre1 := bubblesort_~b~0 - 1;bubblesort_~b~0 := bubblesort_~b~0 - 1;havoc bubblesort_#t~pre1; 1675#L18-3 [2019-11-16 00:36:17,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:36:17,067 INFO L82 PathProgramCache]: Analyzing trace with hash 545700084, now seen corresponding path program 3 times [2019-11-16 00:36:17,067 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:36:17,067 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509085454] [2019-11-16 00:36:17,067 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:17,067 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:17,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:36:17,074 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-16 00:36:17,074 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [411579271] [2019-11-16 00:36:17,074 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4bbeefd0-6216-421b-bc79-a8ea8c88a176/bin/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:36:17,323 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-16 00:36:17,323 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2019-11-16 00:36:17,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:36:17,381 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:36:17,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:36:17,381 INFO L82 PathProgramCache]: Analyzing trace with hash 3789515, now seen corresponding path program 4 times [2019-11-16 00:36:17,381 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:36:17,382 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435769473] [2019-11-16 00:36:17,382 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:17,382 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:17,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:36:17,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:36:17,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:36:17,389 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:36:17,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:36:17,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1677403586, now seen corresponding path program 1 times [2019-11-16 00:36:17,389 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:36:17,390 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673569301] [2019-11-16 00:36:17,390 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:17,390 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:17,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:36:17,394 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-16 00:36:17,395 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [201213561] [2019-11-16 00:36:17,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4bbeefd0-6216-421b-bc79-a8ea8c88a176/bin/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:36:17,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:36:17,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 39 conjunts are in the unsatisfiable core [2019-11-16 00:36:17,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:36:17,530 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-11-16 00:36:17,530 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:36:17,534 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:36:17,535 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:36:17,535 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-11-16 00:36:17,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:36:17,663 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 73 [2019-11-16 00:36:17,663 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:36:17,671 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-11-16 00:36:17,671 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:36:17,677 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-11-16 00:36:17,678 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-16 00:36:17,687 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-11-16 00:36:17,688 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-16 00:36:17,701 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-11-16 00:36:17,702 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-16 00:36:17,708 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 76 [2019-11-16 00:36:17,708 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-16 00:36:17,776 INFO L567 ElimStorePlain]: treesize reduction 78, result has 45.8 percent of original size [2019-11-16 00:36:17,788 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:36:17,789 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2019-11-16 00:36:17,789 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-16 00:36:17,806 INFO L567 ElimStorePlain]: treesize reduction 9, result has 83.0 percent of original size [2019-11-16 00:36:17,807 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:36:17,807 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 7 variables, input treesize:497, output treesize:28 [2019-11-16 00:36:18,134 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:36:18,135 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:36:18,135 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 10 [2019-11-16 00:36:18,136 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:36:18,169 INFO L567 ElimStorePlain]: treesize reduction 20, result has 54.5 percent of original size [2019-11-16 00:36:18,170 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:36:18,171 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:84, output treesize:3 [2019-11-16 00:36:18,207 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:36:18,207 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673569301] [2019-11-16 00:36:18,207 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-16 00:36:18,207 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [201213561] [2019-11-16 00:36:18,208 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:36:18,208 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-11-16 00:36:18,208 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397133778] [2019-11-16 00:36:18,301 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:36:18,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-16 00:36:18,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2019-11-16 00:36:18,301 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. cyclomatic complexity: 11 Second operand 20 states. [2019-11-16 00:36:20,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:36:20,167 INFO L93 Difference]: Finished difference Result 174 states and 212 transitions. [2019-11-16 00:36:20,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-11-16 00:36:20,168 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 174 states and 212 transitions. [2019-11-16 00:36:20,182 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 20 [2019-11-16 00:36:20,183 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 174 states to 174 states and 212 transitions. [2019-11-16 00:36:20,184 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 70 [2019-11-16 00:36:20,184 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 70 [2019-11-16 00:36:20,184 INFO L73 IsDeterministic]: Start isDeterministic. Operand 174 states and 212 transitions. [2019-11-16 00:36:20,184 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:36:20,184 INFO L688 BuchiCegarLoop]: Abstraction has 174 states and 212 transitions. [2019-11-16 00:36:20,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states and 212 transitions. [2019-11-16 00:36:20,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 77. [2019-11-16 00:36:20,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-11-16 00:36:20,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 94 transitions. [2019-11-16 00:36:20,191 INFO L711 BuchiCegarLoop]: Abstraction has 77 states and 94 transitions. [2019-11-16 00:36:20,191 INFO L591 BuchiCegarLoop]: Abstraction has 77 states and 94 transitions. [2019-11-16 00:36:20,191 INFO L424 BuchiCegarLoop]: ======== Iteration 16============ [2019-11-16 00:36:20,191 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 77 states and 94 transitions. [2019-11-16 00:36:20,192 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-16 00:36:20,194 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:36:20,194 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:36:20,195 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:36:20,196 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-16 00:36:20,196 INFO L791 eck$LassoCheckResult]: Stem: 2094#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2087#L-1 main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_~argc, main_~#argv.base, main_~#argv.offset;main_~argc := main_#in~argc;main_~#argv.base, main_~#argv.offset := main_#in~argv.base, main_#in~argv.offset;q1_#in~argc, q1_#in~argv.base, q1_#in~argv.offset := main_~argc, main_~#argv.base, main_~#argv.offset;havoc q1_#t~nondet12, q1_#t~switch13, q1_#t~pre14, q1_#t~pre15, q1_#t~pre16, q1_#t~nondet18, q1_#t~mem19, q1_#t~mem20, q1_#t~post17, q1_~r~0, q1_~temp~0, q1_~argc, q1_~argv.base, q1_~argv.offset, q1_~N~0, q1_~#a~1.base, q1_~#a~1.offset, q1_~i~1;q1_~argc := q1_#in~argc;q1_~argv.base, q1_~argv.offset := q1_#in~argv.base, q1_#in~argv.offset; 2088#L54 assume !(q1_~argc < 2);q1_~N~0 := q1_#t~nondet12;havoc q1_#t~nondet12;call q1_~#a~1.base, q1_~#a~1.offset := #Ultimate.allocOnStack(4 * q1_~N~0);havoc q1_~i~1;q1_#t~switch13 := false; 2089#L63 assume !q1_#t~switch13;q1_#t~switch13 := q1_#t~switch13; 2090#L67 assume !q1_#t~switch13;q1_#t~switch13 := true; 2078#L71 assume q1_#t~switch13;q1_~i~1 := 0; 2071#L72-3 assume !!(q1_~i~1 < q1_~N~0);call write~int(q1_~i~1, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4); 2072#L72-2 q1_#t~pre16 := 1 + q1_~i~1;q1_~i~1 := 1 + q1_~i~1;havoc q1_#t~pre16; 2107#L72-3 assume !!(q1_~i~1 < q1_~N~0);call write~int(q1_~i~1, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4); 2108#L72-2 q1_#t~pre16 := 1 + q1_~i~1;q1_~i~1 := 1 + q1_~i~1;havoc q1_#t~pre16; 2073#L72-3 assume !!(q1_~i~1 < q1_~N~0);call write~int(q1_~i~1, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4); 2074#L72-2 q1_#t~pre16 := 1 + q1_~i~1;q1_~i~1 := 1 + q1_~i~1;havoc q1_#t~pre16; 2077#L72-3 assume !(q1_~i~1 < q1_~N~0); 2100#L72-4 q1_~i~1 := 0; 2101#L74-3 assume !!(q1_~i~1 < q1_~N~0);q1_~r~0 := q1_~i~1 + (if q1_#t~nondet18 < 0 && 0 != q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) then (if q1_~N~0 - q1_~i~1 < 0 then q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) + (q1_~N~0 - q1_~i~1) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) - (q1_~N~0 - q1_~i~1)) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1));havoc q1_#t~nondet18;call q1_#t~mem19 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);q1_~temp~0 := q1_#t~mem19;havoc q1_#t~mem19;call q1_#t~mem20 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4);call write~int(q1_#t~mem20, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);havoc q1_#t~mem20;call write~int(q1_~temp~0, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4); 2084#L74-2 q1_#t~post17 := q1_~i~1;q1_~i~1 := 1 + q1_#t~post17;havoc q1_#t~post17; 2085#L74-3 assume !!(q1_~i~1 < q1_~N~0);q1_~r~0 := q1_~i~1 + (if q1_#t~nondet18 < 0 && 0 != q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) then (if q1_~N~0 - q1_~i~1 < 0 then q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) + (q1_~N~0 - q1_~i~1) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) - (q1_~N~0 - q1_~i~1)) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1));havoc q1_#t~nondet18;call q1_#t~mem19 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);q1_~temp~0 := q1_#t~mem19;havoc q1_#t~mem19;call q1_#t~mem20 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4);call write~int(q1_#t~mem20, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);havoc q1_#t~mem20;call write~int(q1_~temp~0, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4); 2086#L74-2 q1_#t~post17 := q1_~i~1;q1_~i~1 := 1 + q1_#t~post17;havoc q1_#t~post17; 2081#L74-3 assume !!(q1_~i~1 < q1_~N~0);q1_~r~0 := q1_~i~1 + (if q1_#t~nondet18 < 0 && 0 != q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) then (if q1_~N~0 - q1_~i~1 < 0 then q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) + (q1_~N~0 - q1_~i~1) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) - (q1_~N~0 - q1_~i~1)) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1));havoc q1_#t~nondet18;call q1_#t~mem19 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);q1_~temp~0 := q1_#t~mem19;havoc q1_#t~mem19;call q1_#t~mem20 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4);call write~int(q1_#t~mem20, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);havoc q1_#t~mem20;call write~int(q1_~temp~0, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4); 2082#L74-2 q1_#t~post17 := q1_~i~1;q1_~i~1 := 1 + q1_#t~post17;havoc q1_#t~post17; 2079#L74-3 assume !(q1_~i~1 < q1_~N~0); 2080#L61 havoc q1_#t~switch13;bubblesort_#in~size, bubblesort_#in~item.base, bubblesort_#in~item.offset := q1_~N~0, q1_~#a~1.base, q1_~#a~1.offset;havoc bubblesort_#t~mem2, bubblesort_#t~mem3, bubblesort_#t~mem4, bubblesort_#t~mem5, bubblesort_#t~pre1, bubblesort_#t~pre0, bubblesort_~size, bubblesort_~item.base, bubblesort_~item.offset, bubblesort_~a~0, bubblesort_~b~0, bubblesort_~t~0;bubblesort_~size := bubblesort_#in~size;bubblesort_~item.base, bubblesort_~item.offset := bubblesort_#in~item.base, bubblesort_#in~item.offset;havoc bubblesort_~a~0;havoc bubblesort_~b~0;havoc bubblesort_~t~0;bubblesort_~a~0 := 1; 2083#L16-3 assume !!(bubblesort_~a~0 < bubblesort_~size);bubblesort_~b~0 := bubblesort_~size - 1; 2097#L18-3 assume !!(bubblesort_~b~0 >= bubblesort_~a~0); 2092#L21 assume bubblesort_~b~0 - 1 < bubblesort_~size && bubblesort_~b~0 < bubblesort_~size;call bubblesort_#t~mem2 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);call bubblesort_#t~mem3 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 2093#L23 assume bubblesort_#t~mem2 > bubblesort_#t~mem3;havoc bubblesort_#t~mem2;havoc bubblesort_#t~mem3;call bubblesort_#t~mem4 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);bubblesort_~t~0 := bubblesort_#t~mem4;havoc bubblesort_#t~mem4;call bubblesort_#t~mem5 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4);call write~int(bubblesort_#t~mem5, bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);havoc bubblesort_#t~mem5;call write~int(bubblesort_~t~0, bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 2096#L18-2 bubblesort_#t~pre1 := bubblesort_~b~0 - 1;bubblesort_~b~0 := bubblesort_~b~0 - 1;havoc bubblesort_#t~pre1; 2125#L18-3 assume !!(bubblesort_~b~0 >= bubblesort_~a~0); 2112#L21 assume bubblesort_~b~0 - 1 < bubblesort_~size && bubblesort_~b~0 < bubblesort_~size;call bubblesort_#t~mem2 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);call bubblesort_#t~mem3 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 2114#L23 assume !(bubblesort_#t~mem2 > bubblesort_#t~mem3);havoc bubblesort_#t~mem2;havoc bubblesort_#t~mem3; 2113#L18-2 bubblesort_#t~pre1 := bubblesort_~b~0 - 1;bubblesort_~b~0 := bubblesort_~b~0 - 1;havoc bubblesort_#t~pre1; 2111#L18-3 assume !(bubblesort_~b~0 >= bubblesort_~a~0); 2099#L16-2 bubblesort_#t~pre0 := 1 + bubblesort_~a~0;bubblesort_~a~0 := 1 + bubblesort_~a~0;havoc bubblesort_#t~pre0; 2098#L16-3 assume !!(bubblesort_~a~0 < bubblesort_~size);bubblesort_~b~0 := bubblesort_~size - 1; 2067#L18-3 [2019-11-16 00:36:20,197 INFO L793 eck$LassoCheckResult]: Loop: 2067#L18-3 assume !!(bubblesort_~b~0 >= bubblesort_~a~0); 2068#L21 assume bubblesort_~b~0 - 1 < bubblesort_~size && bubblesort_~b~0 < bubblesort_~size;call bubblesort_#t~mem2 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);call bubblesort_#t~mem3 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 2091#L23 assume bubblesort_#t~mem2 > bubblesort_#t~mem3;havoc bubblesort_#t~mem2;havoc bubblesort_#t~mem3;call bubblesort_#t~mem4 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);bubblesort_~t~0 := bubblesort_#t~mem4;havoc bubblesort_#t~mem4;call bubblesort_#t~mem5 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4);call write~int(bubblesort_#t~mem5, bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);havoc bubblesort_#t~mem5;call write~int(bubblesort_~t~0, bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 2075#L18-2 bubblesort_#t~pre1 := bubblesort_~b~0 - 1;bubblesort_~b~0 := bubblesort_~b~0 - 1;havoc bubblesort_#t~pre1; 2067#L18-3 [2019-11-16 00:36:20,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:36:20,197 INFO L82 PathProgramCache]: Analyzing trace with hash -134358286, now seen corresponding path program 2 times [2019-11-16 00:36:20,197 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:36:20,197 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117877648] [2019-11-16 00:36:20,197 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:20,198 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:20,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:36:20,204 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-16 00:36:20,205 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [205461084] [2019-11-16 00:36:20,205 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4bbeefd0-6216-421b-bc79-a8ea8c88a176/bin/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:36:20,318 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-16 00:36:20,318 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2019-11-16 00:36:20,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:36:20,370 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:36:20,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:36:20,371 INFO L82 PathProgramCache]: Analyzing trace with hash 3789515, now seen corresponding path program 5 times [2019-11-16 00:36:20,371 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:36:20,371 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952679788] [2019-11-16 00:36:20,372 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:20,372 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:20,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:36:20,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:36:20,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:36:20,380 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:36:20,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:36:20,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1090597572, now seen corresponding path program 3 times [2019-11-16 00:36:20,381 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:36:20,381 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257792416] [2019-11-16 00:36:20,382 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:20,382 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:20,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:36:20,389 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-16 00:36:20,389 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [840091921] [2019-11-16 00:36:20,389 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4bbeefd0-6216-421b-bc79-a8ea8c88a176/bin/uautomizer/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:36:24,956 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-16 00:36:24,956 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:36:24,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 32 conjunts are in the unsatisfiable core [2019-11-16 00:36:24,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:36:25,044 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:36:25,045 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:36:25,045 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 33 [2019-11-16 00:36:25,046 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:36:25,057 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:36:25,057 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:36:25,057 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:78, output treesize:33 [2019-11-16 00:36:25,173 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:36:25,173 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:36:25,174 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 12 [2019-11-16 00:36:25,174 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:36:25,180 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:36:25,181 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:36:25,182 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:61, output treesize:5 [2019-11-16 00:36:25,198 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-16 00:36:25,198 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257792416] [2019-11-16 00:36:25,198 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-16 00:36:25,198 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [840091921] [2019-11-16 00:36:25,199 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:36:25,199 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-11-16 00:36:25,199 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344898748] [2019-11-16 00:36:25,262 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:36:25,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-16 00:36:25,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2019-11-16 00:36:25,263 INFO L87 Difference]: Start difference. First operand 77 states and 94 transitions. cyclomatic complexity: 23 Second operand 18 states. [2019-11-16 00:36:25,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:36:25,826 INFO L93 Difference]: Finished difference Result 127 states and 157 transitions. [2019-11-16 00:36:25,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-16 00:36:25,827 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 127 states and 157 transitions. [2019-11-16 00:36:25,828 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2019-11-16 00:36:25,830 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 127 states to 127 states and 157 transitions. [2019-11-16 00:36:25,830 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2019-11-16 00:36:25,830 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2019-11-16 00:36:25,831 INFO L73 IsDeterministic]: Start isDeterministic. Operand 127 states and 157 transitions. [2019-11-16 00:36:25,831 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:36:25,831 INFO L688 BuchiCegarLoop]: Abstraction has 127 states and 157 transitions. [2019-11-16 00:36:25,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states and 157 transitions. [2019-11-16 00:36:25,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 75. [2019-11-16 00:36:25,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-11-16 00:36:25,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 92 transitions. [2019-11-16 00:36:25,841 INFO L711 BuchiCegarLoop]: Abstraction has 75 states and 92 transitions. [2019-11-16 00:36:25,841 INFO L591 BuchiCegarLoop]: Abstraction has 75 states and 92 transitions. [2019-11-16 00:36:25,841 INFO L424 BuchiCegarLoop]: ======== Iteration 17============ [2019-11-16 00:36:25,842 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states and 92 transitions. [2019-11-16 00:36:25,842 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-16 00:36:25,842 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:36:25,843 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:36:25,847 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:36:25,847 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-16 00:36:25,847 INFO L791 eck$LassoCheckResult]: Stem: 2462#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2456#L-1 main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_~argc, main_~#argv.base, main_~#argv.offset;main_~argc := main_#in~argc;main_~#argv.base, main_~#argv.offset := main_#in~argv.base, main_#in~argv.offset;q1_#in~argc, q1_#in~argv.base, q1_#in~argv.offset := main_~argc, main_~#argv.base, main_~#argv.offset;havoc q1_#t~nondet12, q1_#t~switch13, q1_#t~pre14, q1_#t~pre15, q1_#t~pre16, q1_#t~nondet18, q1_#t~mem19, q1_#t~mem20, q1_#t~post17, q1_~r~0, q1_~temp~0, q1_~argc, q1_~argv.base, q1_~argv.offset, q1_~N~0, q1_~#a~1.base, q1_~#a~1.offset, q1_~i~1;q1_~argc := q1_#in~argc;q1_~argv.base, q1_~argv.offset := q1_#in~argv.base, q1_#in~argv.offset; 2457#L54 assume !(q1_~argc < 2);q1_~N~0 := q1_#t~nondet12;havoc q1_#t~nondet12;call q1_~#a~1.base, q1_~#a~1.offset := #Ultimate.allocOnStack(4 * q1_~N~0);havoc q1_~i~1;q1_#t~switch13 := false; 2458#L63 assume !q1_#t~switch13;q1_#t~switch13 := q1_#t~switch13; 2459#L67 assume !q1_#t~switch13;q1_#t~switch13 := true; 2449#L71 assume q1_#t~switch13;q1_~i~1 := 0; 2437#L72-3 assume !!(q1_~i~1 < q1_~N~0);call write~int(q1_~i~1, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4); 2438#L72-2 q1_#t~pre16 := 1 + q1_~i~1;q1_~i~1 := 1 + q1_~i~1;havoc q1_#t~pre16; 2444#L72-3 assume !!(q1_~i~1 < q1_~N~0);call write~int(q1_~i~1, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4); 2480#L72-2 q1_#t~pre16 := 1 + q1_~i~1;q1_~i~1 := 1 + q1_~i~1;havoc q1_#t~pre16; 2439#L72-3 assume !!(q1_~i~1 < q1_~N~0);call write~int(q1_~i~1, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4); 2440#L72-2 q1_#t~pre16 := 1 + q1_~i~1;q1_~i~1 := 1 + q1_~i~1;havoc q1_#t~pre16; 2479#L72-3 assume !(q1_~i~1 < q1_~N~0); 2470#L72-4 q1_~i~1 := 0; 2471#L74-3 assume !!(q1_~i~1 < q1_~N~0);q1_~r~0 := q1_~i~1 + (if q1_#t~nondet18 < 0 && 0 != q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) then (if q1_~N~0 - q1_~i~1 < 0 then q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) + (q1_~N~0 - q1_~i~1) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) - (q1_~N~0 - q1_~i~1)) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1));havoc q1_#t~nondet18;call q1_#t~mem19 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);q1_~temp~0 := q1_#t~mem19;havoc q1_#t~mem19;call q1_#t~mem20 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4);call write~int(q1_#t~mem20, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);havoc q1_#t~mem20;call write~int(q1_~temp~0, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4); 2452#L74-2 q1_#t~post17 := q1_~i~1;q1_~i~1 := 1 + q1_#t~post17;havoc q1_#t~post17; 2453#L74-3 assume !!(q1_~i~1 < q1_~N~0);q1_~r~0 := q1_~i~1 + (if q1_#t~nondet18 < 0 && 0 != q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) then (if q1_~N~0 - q1_~i~1 < 0 then q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) + (q1_~N~0 - q1_~i~1) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) - (q1_~N~0 - q1_~i~1)) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1));havoc q1_#t~nondet18;call q1_#t~mem19 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);q1_~temp~0 := q1_#t~mem19;havoc q1_#t~mem19;call q1_#t~mem20 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4);call write~int(q1_#t~mem20, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);havoc q1_#t~mem20;call write~int(q1_~temp~0, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4); 2454#L74-2 q1_#t~post17 := q1_~i~1;q1_~i~1 := 1 + q1_#t~post17;havoc q1_#t~post17; 2455#L74-3 assume !!(q1_~i~1 < q1_~N~0);q1_~r~0 := q1_~i~1 + (if q1_#t~nondet18 < 0 && 0 != q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) then (if q1_~N~0 - q1_~i~1 < 0 then q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) + (q1_~N~0 - q1_~i~1) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) - (q1_~N~0 - q1_~i~1)) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1));havoc q1_#t~nondet18;call q1_#t~mem19 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);q1_~temp~0 := q1_#t~mem19;havoc q1_#t~mem19;call q1_#t~mem20 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4);call write~int(q1_#t~mem20, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);havoc q1_#t~mem20;call write~int(q1_~temp~0, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4); 2477#L74-2 q1_#t~post17 := q1_~i~1;q1_~i~1 := 1 + q1_#t~post17;havoc q1_#t~post17; 2472#L74-3 assume !(q1_~i~1 < q1_~N~0); 2473#L61 havoc q1_#t~switch13;bubblesort_#in~size, bubblesort_#in~item.base, bubblesort_#in~item.offset := q1_~N~0, q1_~#a~1.base, q1_~#a~1.offset;havoc bubblesort_#t~mem2, bubblesort_#t~mem3, bubblesort_#t~mem4, bubblesort_#t~mem5, bubblesort_#t~pre1, bubblesort_#t~pre0, bubblesort_~size, bubblesort_~item.base, bubblesort_~item.offset, bubblesort_~a~0, bubblesort_~b~0, bubblesort_~t~0;bubblesort_~size := bubblesort_#in~size;bubblesort_~item.base, bubblesort_~item.offset := bubblesort_#in~item.base, bubblesort_#in~item.offset;havoc bubblesort_~a~0;havoc bubblesort_~b~0;havoc bubblesort_~t~0;bubblesort_~a~0 := 1; 2465#L16-3 assume !!(bubblesort_~a~0 < bubblesort_~size);bubblesort_~b~0 := bubblesort_~size - 1; 2466#L18-3 assume !!(bubblesort_~b~0 >= bubblesort_~a~0); 2507#L21 assume bubblesort_~b~0 - 1 < bubblesort_~size && bubblesort_~b~0 < bubblesort_~size;call bubblesort_#t~mem2 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);call bubblesort_#t~mem3 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 2506#L23 assume !(bubblesort_#t~mem2 > bubblesort_#t~mem3);havoc bubblesort_#t~mem2;havoc bubblesort_#t~mem3; 2443#L18-2 bubblesort_#t~pre1 := bubblesort_~b~0 - 1;bubblesort_~b~0 := bubblesort_~b~0 - 1;havoc bubblesort_#t~pre1; 2435#L18-3 assume !!(bubblesort_~b~0 >= bubblesort_~a~0); 2436#L21 assume bubblesort_~b~0 - 1 < bubblesort_~size && bubblesort_~b~0 < bubblesort_~size;call bubblesort_#t~mem2 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);call bubblesort_#t~mem3 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 2461#L23 assume bubblesort_#t~mem2 > bubblesort_#t~mem3;havoc bubblesort_#t~mem2;havoc bubblesort_#t~mem3;call bubblesort_#t~mem4 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);bubblesort_~t~0 := bubblesort_#t~mem4;havoc bubblesort_#t~mem4;call bubblesort_#t~mem5 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4);call write~int(bubblesort_#t~mem5, bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);havoc bubblesort_#t~mem5;call write~int(bubblesort_~t~0, bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 2490#L18-2 bubblesort_#t~pre1 := bubblesort_~b~0 - 1;bubblesort_~b~0 := bubblesort_~b~0 - 1;havoc bubblesort_#t~pre1; 2487#L18-3 assume !(bubblesort_~b~0 >= bubblesort_~a~0); 2488#L16-2 bubblesort_#t~pre0 := 1 + bubblesort_~a~0;bubblesort_~a~0 := 1 + bubblesort_~a~0;havoc bubblesort_#t~pre0; 2484#L16-3 assume !!(bubblesort_~a~0 < bubblesort_~size);bubblesort_~b~0 := bubblesort_~size - 1; 2442#L18-3 [2019-11-16 00:36:25,848 INFO L793 eck$LassoCheckResult]: Loop: 2442#L18-3 assume !!(bubblesort_~b~0 >= bubblesort_~a~0); 2483#L21 assume bubblesort_~b~0 - 1 < bubblesort_~size && bubblesort_~b~0 < bubblesort_~size;call bubblesort_#t~mem2 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);call bubblesort_#t~mem3 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 2478#L23 assume bubblesort_#t~mem2 > bubblesort_#t~mem3;havoc bubblesort_#t~mem2;havoc bubblesort_#t~mem3;call bubblesort_#t~mem4 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);bubblesort_~t~0 := bubblesort_#t~mem4;havoc bubblesort_#t~mem4;call bubblesort_#t~mem5 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4);call write~int(bubblesort_#t~mem5, bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);havoc bubblesort_#t~mem5;call write~int(bubblesort_~t~0, bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 2441#L18-2 bubblesort_#t~pre1 := bubblesort_~b~0 - 1;bubblesort_~b~0 := bubblesort_~b~0 - 1;havoc bubblesort_#t~pre1; 2442#L18-3 [2019-11-16 00:36:25,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:36:25,848 INFO L82 PathProgramCache]: Analyzing trace with hash 543853042, now seen corresponding path program 4 times [2019-11-16 00:36:25,848 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:36:25,849 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204584173] [2019-11-16 00:36:25,849 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:25,849 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:25,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:36:25,854 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-16 00:36:25,854 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1507931224] [2019-11-16 00:36:25,854 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4bbeefd0-6216-421b-bc79-a8ea8c88a176/bin/uautomizer/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:36:25,977 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-16 00:36:25,977 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2019-11-16 00:36:25,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:36:26,007 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:36:26,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:36:26,008 INFO L82 PathProgramCache]: Analyzing trace with hash 3789515, now seen corresponding path program 6 times [2019-11-16 00:36:26,008 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:36:26,008 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750531273] [2019-11-16 00:36:26,008 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:26,008 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:26,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:36:26,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:36:26,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:36:26,014 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:36:26,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:36:26,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1937505340, now seen corresponding path program 5 times [2019-11-16 00:36:26,015 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:36:26,015 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112830155] [2019-11-16 00:36:26,015 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:26,015 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:26,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:36:26,020 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-16 00:36:26,020 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1772658987] [2019-11-16 00:36:26,021 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4bbeefd0-6216-421b-bc79-a8ea8c88a176/bin/uautomizer/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:36:40,688 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-11-16 00:36:40,689 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2019-11-16 00:36:40,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:36:40,724 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:37:26,853 WARN L191 SmtUtils]: Spent 46.06 s on a formula simplification. DAG size of input: 350 DAG size of output: 278 [2019-11-16 00:47:13,495 WARN L191 SmtUtils]: Spent 9.74 m on a formula simplification. DAG size of input: 658 DAG size of output: 193 [2019-11-16 00:47:13,499 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:47:13,499 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:47:13,499 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:47:13,499 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:47:13,499 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:47:13,499 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:47:13,499 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:47:13,499 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:47:13,499 INFO L131 ssoRankerPreferences]: Filename of dumped script: bubble_sort-1.c_Iteration17_Lasso [2019-11-16 00:47:13,499 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:47:13,499 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:47:13,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:47:13,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:47:13,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:47:13,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:47:13,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:47:13,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:47:13,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:47:13,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:47:13,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:47:13,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:47:13,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:47:13,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:47:14,071 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-11-16 00:47:14,074 INFO L168 Benchmark]: Toolchain (without parser) took 685579.41 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 410.5 MB). Free memory was 941.1 MB in the beginning and 929.7 MB in the end (delta: 11.4 MB). Peak memory consumption was 544.8 MB. Max. memory is 11.5 GB. [2019-11-16 00:47:14,075 INFO L168 Benchmark]: CDTParser took 0.48 ms. Allocated memory is still 1.0 GB. Free memory is still 958.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:47:14,075 INFO L168 Benchmark]: CACSL2BoogieTranslator took 308.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 941.1 MB in the beginning and 1.1 GB in the end (delta: -194.0 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. [2019-11-16 00:47:14,076 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:47:14,076 INFO L168 Benchmark]: Boogie Preprocessor took 28.08 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:47:14,076 INFO L168 Benchmark]: RCFGBuilder took 387.17 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: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:47:14,077 INFO L168 Benchmark]: BuchiAutomizer took 684812.18 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 269.0 MB). Free memory was 1.1 GB in the beginning and 929.7 MB in the end (delta: 177.6 MB). Peak memory consumption was 569.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:47:14,079 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.48 ms. Allocated memory is still 1.0 GB. Free memory is still 958.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 308.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 941.1 MB in the beginning and 1.1 GB in the end (delta: -194.0 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 39.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.08 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 387.17 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: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 684812.18 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 269.0 MB). Free memory was 1.1 GB in the beginning and 929.7 MB in the end (delta: 177.6 MB). Peak memory consumption was 569.4 MB. Max. memory is 11.5 GB. * 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...