./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-memsafety/java_BubbleSort-alloca-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 20ed64ec Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/array-memsafety/java_BubbleSort-alloca-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 862be090098a4271d6e1a31a6f1302665ccfc795 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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.2.1-dev-20ed64e [2021-08-27 17:38:06,402 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-27 17:38:06,405 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-27 17:38:06,437 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-27 17:38:06,437 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-27 17:38:06,440 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-27 17:38:06,441 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-27 17:38:06,446 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-27 17:38:06,448 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-27 17:38:06,452 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-27 17:38:06,457 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-27 17:38:06,458 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-27 17:38:06,458 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-27 17:38:06,460 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-27 17:38:06,461 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-27 17:38:06,465 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-27 17:38:06,465 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-27 17:38:06,466 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-27 17:38:06,466 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-27 17:38:06,467 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-27 17:38:06,468 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-27 17:38:06,471 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-27 17:38:06,473 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-27 17:38:06,473 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-27 17:38:06,478 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-27 17:38:06,478 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-27 17:38:06,479 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-27 17:38:06,479 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-27 17:38:06,479 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-27 17:38:06,480 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-27 17:38:06,480 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-27 17:38:06,480 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-27 17:38:06,481 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-27 17:38:06,481 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-27 17:38:06,482 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-27 17:38:06,482 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-27 17:38:06,482 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-27 17:38:06,482 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-27 17:38:06,483 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-27 17:38:06,483 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-27 17:38:06,483 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-27 17:38:06,486 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-08-27 17:38:06,514 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-27 17:38:06,514 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-27 17:38:06,515 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-27 17:38:06,515 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-27 17:38:06,516 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-27 17:38:06,516 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-27 17:38:06,516 INFO L138 SettingsManager]: * Use SBE=true [2021-08-27 17:38:06,517 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-08-27 17:38:06,517 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-08-27 17:38:06,517 INFO L138 SettingsManager]: * Use old map elimination=false [2021-08-27 17:38:06,517 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-08-27 17:38:06,517 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-08-27 17:38:06,517 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-08-27 17:38:06,518 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-27 17:38:06,518 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-27 17:38:06,518 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-27 17:38:06,518 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-27 17:38:06,518 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-27 17:38:06,518 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-27 17:38:06,518 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-08-27 17:38:06,518 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-08-27 17:38:06,518 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-08-27 17:38:06,518 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-27 17:38:06,518 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-27 17:38:06,518 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-08-27 17:38:06,519 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-27 17:38:06,519 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-08-27 17:38:06,519 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-27 17:38:06,519 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-27 17:38:06,519 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-27 17:38:06,519 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-27 17:38:06,519 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-27 17:38:06,520 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-08-27 17:38:06,520 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 862be090098a4271d6e1a31a6f1302665ccfc795 [2021-08-27 17:38:06,789 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-27 17:38:06,802 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-27 17:38:06,803 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-27 17:38:06,804 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-27 17:38:06,804 INFO L275 PluginConnector]: CDTParser initialized [2021-08-27 17:38:06,805 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/java_BubbleSort-alloca-1.i [2021-08-27 17:38:06,867 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10e7baa66/d1502a252d054b9ba95237f6d1d23e64/FLAGf5b9e01a4 [2021-08-27 17:38:07,231 INFO L306 CDTParser]: Found 1 translation units. [2021-08-27 17:38:07,231 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/java_BubbleSort-alloca-1.i [2021-08-27 17:38:07,238 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10e7baa66/d1502a252d054b9ba95237f6d1d23e64/FLAGf5b9e01a4 [2021-08-27 17:38:07,252 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10e7baa66/d1502a252d054b9ba95237f6d1d23e64 [2021-08-27 17:38:07,253 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-27 17:38:07,254 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-27 17:38:07,255 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-27 17:38:07,255 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-27 17:38:07,257 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-27 17:38:07,257 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 05:38:07" (1/1) ... [2021-08-27 17:38:07,258 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55b26cd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:38:07, skipping insertion in model container [2021-08-27 17:38:07,258 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 05:38:07" (1/1) ... [2021-08-27 17:38:07,262 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-27 17:38:07,279 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 17:38:07,484 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 17:38:07,489 INFO L203 MainTranslator]: Completed pre-run [2021-08-27 17:38:07,536 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 17:38:07,564 INFO L208 MainTranslator]: Completed translation [2021-08-27 17:38:07,565 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:38:07 WrapperNode [2021-08-27 17:38:07,565 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-27 17:38:07,566 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-27 17:38:07,566 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-27 17:38:07,566 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-27 17:38:07,570 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:38:07" (1/1) ... [2021-08-27 17:38:07,593 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:38:07" (1/1) ... [2021-08-27 17:38:07,620 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-27 17:38:07,621 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-27 17:38:07,621 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-27 17:38:07,621 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-27 17:38:07,626 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:38:07" (1/1) ... [2021-08-27 17:38:07,626 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:38:07" (1/1) ... [2021-08-27 17:38:07,628 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:38:07" (1/1) ... [2021-08-27 17:38:07,640 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:38:07" (1/1) ... [2021-08-27 17:38:07,644 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:38:07" (1/1) ... [2021-08-27 17:38:07,647 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:38:07" (1/1) ... [2021-08-27 17:38:07,648 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:38:07" (1/1) ... [2021-08-27 17:38:07,661 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-27 17:38:07,662 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-27 17:38:07,662 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-27 17:38:07,662 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-27 17:38:07,663 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:38:07" (1/1) ... [2021-08-27 17:38:07,669 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:38:07,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:38:07,714 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:38:07,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-08-27 17:38:07,792 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-08-27 17:38:07,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-27 17:38:07,793 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-27 17:38:07,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-27 17:38:07,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-27 17:38:07,793 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-27 17:38:08,012 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-27 17:38:08,012 INFO L299 CfgBuilder]: Removed 9 assume(true) statements. [2021-08-27 17:38:08,013 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 05:38:08 BoogieIcfgContainer [2021-08-27 17:38:08,014 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-27 17:38:08,014 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-08-27 17:38:08,014 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-08-27 17:38:08,016 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-08-27 17:38:08,017 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 17:38:08,017 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.08 05:38:07" (1/3) ... [2021-08-27 17:38:08,017 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@ac3f10a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.08 05:38:08, skipping insertion in model container [2021-08-27 17:38:08,017 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 17:38:08,017 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:38:07" (2/3) ... [2021-08-27 17:38:08,018 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@ac3f10a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.08 05:38:08, skipping insertion in model container [2021-08-27 17:38:08,018 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 17:38:08,018 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 05:38:08" (3/3) ... [2021-08-27 17:38:08,018 INFO L389 chiAutomizerObserver]: Analyzing ICFG java_BubbleSort-alloca-1.i [2021-08-27 17:38:08,064 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-08-27 17:38:08,069 INFO L360 BuchiCegarLoop]: Hoare is false [2021-08-27 17:38:08,069 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-08-27 17:38:08,069 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-27 17:38:08,069 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-27 17:38:08,070 INFO L364 BuchiCegarLoop]: Difference is false [2021-08-27 17:38:08,070 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-27 17:38:08,070 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-08-27 17:38:08,091 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:38:08,107 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2021-08-27 17:38:08,107 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:38:08,107 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:38:08,110 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2021-08-27 17:38:08,111 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-27 17:38:08,111 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-08-27 17:38:08,111 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:38:08,112 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2021-08-27 17:38:08,112 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:38:08,112 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:38:08,112 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2021-08-27 17:38:08,112 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-27 17:38:08,116 INFO L791 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 11#L-1true havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 13#L523true assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 14#L523-2true call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~1 := 0; 6#L528-3true [2021-08-27 17:38:08,116 INFO L793 eck$LassoCheckResult]: Loop: 6#L528-3true assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 10#L528-2true main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 6#L528-3true [2021-08-27 17:38:08,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:38:08,119 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2021-08-27 17:38:08,135 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:38:08,136 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361121187] [2021-08-27 17:38:08,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:38:08,138 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:38:08,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:38:08,246 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:38:08,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:38:08,275 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:38:08,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:38:08,283 INFO L82 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2021-08-27 17:38:08,283 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:38:08,283 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310298198] [2021-08-27 17:38:08,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:38:08,284 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:38:08,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:38:08,300 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:38:08,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:38:08,304 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:38:08,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:38:08,306 INFO L82 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2021-08-27 17:38:08,306 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:38:08,306 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466569208] [2021-08-27 17:38:08,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:38:08,306 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:38:08,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:38:08,332 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:38:08,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:38:08,356 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:38:08,664 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 17:38:08,665 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 17:38:08,665 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 17:38:08,665 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 17:38:08,665 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-27 17:38:08,665 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:38:08,665 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 17:38:08,665 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 17:38:08,665 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-1.i_Iteration1_Lasso [2021-08-27 17:38:08,665 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 17:38:08,665 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 17:38:08,688 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:38:08,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:38:08,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:38:08,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:38:08,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:38:08,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:38:08,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:38:08,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:38:08,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:38:08,972 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 17:38:08,975 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-27 17:38:08,976 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:38:08,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:38:08,977 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:38:08,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2021-08-27 17:38:08,979 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:38:08,986 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:38:08,986 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:38:08,986 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:38:08,986 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:38:08,987 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:38:08,989 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:38:08,989 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:38:09,000 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:38:09,020 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2021-08-27 17:38:09,021 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:38:09,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:38:09,022 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:38:09,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2021-08-27 17:38:09,024 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:38:09,032 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:38:09,032 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:38:09,032 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:38:09,032 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:38:09,032 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:38:09,033 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:38:09,033 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:38:09,048 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:38:09,083 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2021-08-27 17:38:09,083 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:38:09,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:38:09,089 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:38:09,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2021-08-27 17:38:09,091 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:38:09,098 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:38:09,098 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:38:09,098 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:38:09,098 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:38:09,101 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:38:09,101 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:38:09,116 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:38:09,133 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2021-08-27 17:38:09,133 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:38:09,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:38:09,134 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:38:09,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2021-08-27 17:38:09,136 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:38:09,143 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:38:09,143 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:38:09,143 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:38:09,143 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:38:09,143 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:38:09,144 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:38:09,144 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:38:09,145 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:38:09,160 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2021-08-27 17:38:09,160 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:38:09,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:38:09,161 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:38:09,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2021-08-27 17:38:09,163 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:38:09,170 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:38:09,171 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:38:09,171 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:38:09,171 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:38:09,171 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:38:09,171 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:38:09,171 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:38:09,186 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:38:09,206 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2021-08-27 17:38:09,207 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:38:09,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:38:09,208 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:38:09,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2021-08-27 17:38:09,210 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:38:09,217 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:38:09,217 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:38:09,217 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:38:09,217 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:38:09,224 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:38:09,224 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:38:09,253 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-27 17:38:09,298 INFO L443 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver. [2021-08-27 17:38:09,298 INFO L444 ModelExtractionUtils]: 6 out of 22 variables were initially zero. Simplification set additionally 12 variables to zero. [2021-08-27 17:38:09,299 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:38:09,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:38:09,345 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:38:09,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2021-08-27 17:38:09,457 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-27 17:38:09,471 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-08-27 17:38:09,472 INFO L513 LassoAnalysis]: Proved termination. [2021-08-27 17:38:09,472 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~numbers~0.offset, ULTIMATE.start_main_~i~1, v_rep(select #length ULTIMATE.start_main_~numbers~0.base)_1) = -1*ULTIMATE.start_main_~numbers~0.offset - 4*ULTIMATE.start_main_~i~1 + 1*v_rep(select #length ULTIMATE.start_main_~numbers~0.base)_1 Supporting invariants [] [2021-08-27 17:38:09,489 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2021-08-27 17:38:09,499 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2021-08-27 17:38:09,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:38:09,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:38:09,541 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-27 17:38:09,542 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:38:09,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:38:09,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 17:38:09,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:38:09,603 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2021-08-27 17:38:09,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:38:09,615 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 [2021-08-27 17:38:09,616 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:38:09,655 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 38 states and 56 transitions. Complement of second has 7 states. [2021-08-27 17:38:09,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2021-08-27 17:38:09,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:38:09,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2021-08-27 17:38:09,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 4 letters. Loop has 2 letters. [2021-08-27 17:38:09,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 17:38:09,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 6 letters. Loop has 2 letters. [2021-08-27 17:38:09,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 17:38:09,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 4 letters. Loop has 4 letters. [2021-08-27 17:38:09,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 17:38:09,660 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 56 transitions. [2021-08-27 17:38:09,662 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-27 17:38:09,665 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 13 states and 18 transitions. [2021-08-27 17:38:09,665 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2021-08-27 17:38:09,665 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2021-08-27 17:38:09,666 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 18 transitions. [2021-08-27 17:38:09,666 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:38:09,666 INFO L681 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2021-08-27 17:38:09,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 18 transitions. [2021-08-27 17:38:09,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2021-08-27 17:38:09,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:38:09,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2021-08-27 17:38:09,681 INFO L704 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2021-08-27 17:38:09,681 INFO L587 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2021-08-27 17:38:09,682 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-08-27 17:38:09,682 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2021-08-27 17:38:09,682 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-27 17:38:09,682 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:38:09,682 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:38:09,683 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-08-27 17:38:09,683 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-27 17:38:09,683 INFO L791 eck$LassoCheckResult]: Stem: 111#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 112#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 113#L523 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 114#L523-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~1 := 0; 117#L528-3 assume !(main_~i~1 < main_~array_size~0); 115#L528-4 sort_#in~x.base, sort_#in~x.offset, sort_#in~n := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sort_#t~mem4, sort_#t~mem5, sort_#t~mem6, sort_#t~mem7, sort_~temp~0, sort_#t~post3, sort_#t~post2, sort_~x.base, sort_~x.offset, sort_~n, sort_~pass~0, sort_~i~0;sort_~x.base, sort_~x.offset := sort_#in~x.base, sort_#in~x.offset;sort_~n := sort_#in~n;havoc sort_~pass~0;havoc sort_~i~0;sort_~pass~0 := 1; 116#L515-3 [2021-08-27 17:38:09,683 INFO L793 eck$LassoCheckResult]: Loop: 116#L515-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 120#L516-3 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 121#L515-2 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 116#L515-3 [2021-08-27 17:38:09,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:38:09,684 INFO L82 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 1 times [2021-08-27 17:38:09,684 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:38:09,684 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087958231] [2021-08-27 17:38:09,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:38:09,684 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:38:09,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:38:09,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:38:09,729 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:38:09,729 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087958231] [2021-08-27 17:38:09,730 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087958231] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 17:38:09,730 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 17:38:09,730 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 17:38:09,730 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145012003] [2021-08-27 17:38:09,732 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 17:38:09,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:38:09,733 INFO L82 PathProgramCache]: Analyzing trace with hash 60779, now seen corresponding path program 1 times [2021-08-27 17:38:09,733 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:38:09,733 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603001649] [2021-08-27 17:38:09,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:38:09,733 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:38:09,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:38:09,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:38:09,744 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:38:09,745 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603001649] [2021-08-27 17:38:09,745 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603001649] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 17:38:09,745 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 17:38:09,745 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-27 17:38:09,745 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72706883] [2021-08-27 17:38:09,745 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 17:38:09,746 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:38:09,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 17:38:09,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 17:38:09,749 INFO L87 Difference]: Start difference. First operand 13 states and 18 transitions. cyclomatic complexity: 7 Second operand has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:38:09,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:38:09,760 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2021-08-27 17:38:09,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 17:38:09,761 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 19 transitions. [2021-08-27 17:38:09,761 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2021-08-27 17:38:09,762 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 19 transitions. [2021-08-27 17:38:09,762 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2021-08-27 17:38:09,762 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2021-08-27 17:38:09,762 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2021-08-27 17:38:09,762 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:38:09,762 INFO L681 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2021-08-27 17:38:09,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2021-08-27 17:38:09,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2021-08-27 17:38:09,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:38:09,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2021-08-27 17:38:09,764 INFO L704 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2021-08-27 17:38:09,764 INFO L587 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2021-08-27 17:38:09,764 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-08-27 17:38:09,764 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2021-08-27 17:38:09,764 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2021-08-27 17:38:09,764 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:38:09,764 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:38:09,765 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-08-27 17:38:09,765 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2021-08-27 17:38:09,765 INFO L791 eck$LassoCheckResult]: Stem: 146#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 147#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 148#L523 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 149#L523-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~1 := 0; 152#L528-3 assume !(main_~i~1 < main_~array_size~0); 150#L528-4 sort_#in~x.base, sort_#in~x.offset, sort_#in~n := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sort_#t~mem4, sort_#t~mem5, sort_#t~mem6, sort_#t~mem7, sort_~temp~0, sort_#t~post3, sort_#t~post2, sort_~x.base, sort_~x.offset, sort_~n, sort_~pass~0, sort_~i~0;sort_~x.base, sort_~x.offset := sort_#in~x.base, sort_#in~x.offset;sort_~n := sort_#in~n;havoc sort_~pass~0;havoc sort_~i~0;sort_~pass~0 := 1; 151#L515-3 [2021-08-27 17:38:09,765 INFO L793 eck$LassoCheckResult]: Loop: 151#L515-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 155#L516-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 156#L517 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem4;havoc sort_#t~mem5;call sort_#t~mem6 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);sort_~temp~0 := sort_#t~mem6;havoc sort_#t~mem6;call sort_#t~mem7 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4);call write~int(sort_#t~mem7, sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);havoc sort_#t~mem7;call write~int(sort_~temp~0, sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 158#L516-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 159#L516-3 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 157#L515-2 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 151#L515-3 [2021-08-27 17:38:09,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:38:09,766 INFO L82 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 2 times [2021-08-27 17:38:09,766 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:38:09,766 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059711283] [2021-08-27 17:38:09,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:38:09,766 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:38:09,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:38:09,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:38:09,800 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:38:09,800 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059711283] [2021-08-27 17:38:09,801 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059711283] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 17:38:09,801 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 17:38:09,801 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 17:38:09,801 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594767565] [2021-08-27 17:38:09,801 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 17:38:09,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:38:09,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1812321306, now seen corresponding path program 1 times [2021-08-27 17:38:09,802 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:38:09,802 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153065909] [2021-08-27 17:38:09,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:38:09,802 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:38:09,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:38:09,808 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:38:09,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:38:09,814 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:38:09,925 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:38:09,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 17:38:09,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-27 17:38:09,926 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. cyclomatic complexity: 7 Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:38:09,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:38:09,942 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2021-08-27 17:38:09,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 17:38:09,943 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 19 transitions. [2021-08-27 17:38:09,943 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2021-08-27 17:38:09,944 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 19 transitions. [2021-08-27 17:38:09,944 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2021-08-27 17:38:09,944 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2021-08-27 17:38:09,944 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2021-08-27 17:38:09,944 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:38:09,944 INFO L681 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2021-08-27 17:38:09,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2021-08-27 17:38:09,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2021-08-27 17:38:09,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:38:09,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2021-08-27 17:38:09,945 INFO L704 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2021-08-27 17:38:09,946 INFO L587 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2021-08-27 17:38:09,946 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-08-27 17:38:09,946 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 18 transitions. [2021-08-27 17:38:09,946 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2021-08-27 17:38:09,946 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:38:09,946 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:38:09,947 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 17:38:09,947 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2021-08-27 17:38:09,947 INFO L791 eck$LassoCheckResult]: Stem: 182#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 183#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 184#L523 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 185#L523-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~1 := 0; 188#L528-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 189#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 190#L528-3 assume !(main_~i~1 < main_~array_size~0); 186#L528-4 sort_#in~x.base, sort_#in~x.offset, sort_#in~n := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sort_#t~mem4, sort_#t~mem5, sort_#t~mem6, sort_#t~mem7, sort_~temp~0, sort_#t~post3, sort_#t~post2, sort_~x.base, sort_~x.offset, sort_~n, sort_~pass~0, sort_~i~0;sort_~x.base, sort_~x.offset := sort_#in~x.base, sort_#in~x.offset;sort_~n := sort_#in~n;havoc sort_~pass~0;havoc sort_~i~0;sort_~pass~0 := 1; 187#L515-3 [2021-08-27 17:38:09,947 INFO L793 eck$LassoCheckResult]: Loop: 187#L515-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 191#L516-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 192#L517 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem4;havoc sort_#t~mem5;call sort_#t~mem6 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);sort_~temp~0 := sort_#t~mem6;havoc sort_#t~mem6;call sort_#t~mem7 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4);call write~int(sort_#t~mem7, sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);havoc sort_#t~mem7;call write~int(sort_~temp~0, sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 194#L516-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 195#L516-3 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 193#L515-2 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 187#L515-3 [2021-08-27 17:38:09,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:38:09,947 INFO L82 PathProgramCache]: Analyzing trace with hash 176793839, now seen corresponding path program 1 times [2021-08-27 17:38:09,948 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:38:09,948 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871717407] [2021-08-27 17:38:09,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:38:09,948 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:38:09,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:38:09,955 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:38:09,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:38:09,968 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:38:09,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:38:09,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1812321306, now seen corresponding path program 2 times [2021-08-27 17:38:09,969 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:38:09,969 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023296022] [2021-08-27 17:38:09,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:38:09,969 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:38:09,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:38:09,975 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:38:09,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:38:09,980 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:38:09,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:38:09,981 INFO L82 PathProgramCache]: Analyzing trace with hash -256077176, now seen corresponding path program 1 times [2021-08-27 17:38:09,981 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:38:09,981 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572855003] [2021-08-27 17:38:09,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:38:09,981 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:38:09,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:38:10,079 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:38:10,079 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:38:10,080 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572855003] [2021-08-27 17:38:10,080 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572855003] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:38:10,080 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [239238942] [2021-08-27 17:38:10,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:38:10,080 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 17:38:10,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:38:10,081 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 17:38:10,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-08-27 17:38:10,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:38:10,188 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 7 conjunts are in the unsatisfiable core [2021-08-27 17:38:10,190 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:38:10,282 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 17:38:10,283 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [239238942] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:38:10,283 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 17:38:10,283 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2021-08-27 17:38:10,283 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121790348] [2021-08-27 17:38:10,396 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:38:10,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-27 17:38:10,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-08-27 17:38:10,397 INFO L87 Difference]: Start difference. First operand 14 states and 18 transitions. cyclomatic complexity: 6 Second operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:38:10,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:38:10,485 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2021-08-27 17:38:10,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 17:38:10,485 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 28 transitions. [2021-08-27 17:38:10,486 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2021-08-27 17:38:10,486 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 17 states and 20 transitions. [2021-08-27 17:38:10,486 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2021-08-27 17:38:10,486 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2021-08-27 17:38:10,487 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 20 transitions. [2021-08-27 17:38:10,487 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:38:10,487 INFO L681 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2021-08-27 17:38:10,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 20 transitions. [2021-08-27 17:38:10,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2021-08-27 17:38:10,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:38:10,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2021-08-27 17:38:10,488 INFO L704 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2021-08-27 17:38:10,488 INFO L587 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2021-08-27 17:38:10,488 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-08-27 17:38:10,488 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. [2021-08-27 17:38:10,489 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2021-08-27 17:38:10,489 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:38:10,489 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:38:10,489 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2021-08-27 17:38:10,489 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2021-08-27 17:38:10,489 INFO L791 eck$LassoCheckResult]: Stem: 280#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 281#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 284#L523 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 285#L523-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~1 := 0; 286#L528-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 287#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 288#L528-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 289#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 295#L528-3 assume !(main_~i~1 < main_~array_size~0); 282#L528-4 sort_#in~x.base, sort_#in~x.offset, sort_#in~n := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sort_#t~mem4, sort_#t~mem5, sort_#t~mem6, sort_#t~mem7, sort_~temp~0, sort_#t~post3, sort_#t~post2, sort_~x.base, sort_~x.offset, sort_~n, sort_~pass~0, sort_~i~0;sort_~x.base, sort_~x.offset := sort_#in~x.base, sort_#in~x.offset;sort_~n := sort_#in~n;havoc sort_~pass~0;havoc sort_~i~0;sort_~pass~0 := 1; 283#L515-3 [2021-08-27 17:38:10,490 INFO L793 eck$LassoCheckResult]: Loop: 283#L515-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 290#L516-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 291#L517 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem4;havoc sort_#t~mem5;call sort_#t~mem6 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);sort_~temp~0 := sort_#t~mem6;havoc sort_#t~mem6;call sort_#t~mem7 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4);call write~int(sort_#t~mem7, sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);havoc sort_#t~mem7;call write~int(sort_~temp~0, sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 293#L516-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 294#L516-3 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 292#L515-2 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 283#L515-3 [2021-08-27 17:38:10,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:38:10,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1899756335, now seen corresponding path program 2 times [2021-08-27 17:38:10,490 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:38:10,490 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416098240] [2021-08-27 17:38:10,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:38:10,490 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:38:10,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:38:10,497 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:38:10,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:38:10,505 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:38:10,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:38:10,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1812321306, now seen corresponding path program 3 times [2021-08-27 17:38:10,505 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:38:10,506 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818799146] [2021-08-27 17:38:10,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:38:10,506 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:38:10,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:38:10,510 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:38:10,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:38:10,514 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:38:10,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:38:10,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1808202986, now seen corresponding path program 2 times [2021-08-27 17:38:10,515 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:38:10,515 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390563518] [2021-08-27 17:38:10,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:38:10,515 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:38:10,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:38:10,525 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:38:10,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:38:10,537 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:38:10,944 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 17:38:10,945 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 17:38:10,945 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 17:38:10,945 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 17:38:10,945 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-27 17:38:10,945 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:38:10,945 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 17:38:10,945 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 17:38:10,945 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-1.i_Iteration5_Lasso [2021-08-27 17:38:10,945 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 17:38:10,945 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 17:38:10,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:38:10,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:38:10,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:38:10,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:38:11,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:38:11,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:38:11,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:38:11,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:38:11,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:38:11,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:38:11,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:38:11,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:38:11,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:38:11,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:38:11,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:38:11,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:38:11,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:38:11,467 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 17:38:11,467 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-27 17:38:11,467 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:38:11,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:38:11,469 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:38:11,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2021-08-27 17:38:11,498 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:38:11,505 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:38:11,505 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:38:11,505 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:38:11,505 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:38:11,505 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:38:11,506 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:38:11,506 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:38:11,514 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:38:11,530 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2021-08-27 17:38:11,531 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:38:11,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:38:11,531 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:38:11,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2021-08-27 17:38:11,534 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:38:11,540 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:38:11,540 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:38:11,540 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:38:11,540 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:38:11,542 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:38:11,542 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:38:11,559 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:38:11,577 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2021-08-27 17:38:11,578 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:38:11,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:38:11,579 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:38:11,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2021-08-27 17:38:11,581 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:38:11,588 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:38:11,588 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:38:11,588 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:38:11,588 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:38:11,588 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:38:11,589 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:38:11,589 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:38:11,610 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:38:11,626 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2021-08-27 17:38:11,626 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:38:11,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:38:11,636 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:38:11,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2021-08-27 17:38:11,640 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:38:11,646 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:38:11,646 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:38:11,646 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:38:11,646 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:38:11,646 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:38:11,647 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:38:11,647 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:38:11,662 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:38:11,678 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2021-08-27 17:38:11,679 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:38:11,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:38:11,679 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:38:11,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2021-08-27 17:38:11,682 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:38:11,688 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:38:11,688 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:38:11,688 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:38:11,688 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:38:11,688 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:38:11,689 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:38:11,689 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:38:11,703 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:38:11,719 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2021-08-27 17:38:11,720 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:38:11,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:38:11,721 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:38:11,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2021-08-27 17:38:11,723 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:38:11,729 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:38:11,729 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:38:11,729 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:38:11,729 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:38:11,729 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:38:11,730 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:38:11,730 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:38:11,745 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:38:11,763 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2021-08-27 17:38:11,763 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:38:11,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:38:11,764 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:38:11,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2021-08-27 17:38:11,767 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:38:11,774 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:38:11,774 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:38:11,774 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:38:11,774 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:38:11,785 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:38:11,785 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:38:11,810 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:38:11,853 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2021-08-27 17:38:11,853 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:38:11,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:38:11,857 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:38:11,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2021-08-27 17:38:11,860 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:38:11,867 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:38:11,867 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:38:11,867 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:38:11,867 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:38:11,887 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:38:11,888 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:38:11,907 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-27 17:38:11,953 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2021-08-27 17:38:11,953 INFO L444 ModelExtractionUtils]: 29 out of 40 variables were initially zero. Simplification set additionally 8 variables to zero. [2021-08-27 17:38:11,953 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:38:11,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:38:11,965 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:38:11,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2021-08-27 17:38:11,999 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-27 17:38:12,029 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-08-27 17:38:12,029 INFO L513 LassoAnalysis]: Proved termination. [2021-08-27 17:38:12,029 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sort_~pass~0, ULTIMATE.start_sort_~n) = -1*ULTIMATE.start_sort_~pass~0 + 1*ULTIMATE.start_sort_~n Supporting invariants [] [2021-08-27 17:38:12,047 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2021-08-27 17:38:12,062 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2021-08-27 17:38:12,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:38:12,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:38:12,085 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-27 17:38:12,086 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:38:12,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:38:12,117 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 17:38:12,118 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:38:12,163 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 17:38:12,164 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 [2021-08-27 17:38:12,164 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5 Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:38:12,172 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 22 states and 28 transitions. Complement of second has 4 states. [2021-08-27 17:38:12,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2021-08-27 17:38:12,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:38:12,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2021-08-27 17:38:12,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 10 letters. Loop has 6 letters. [2021-08-27 17:38:12,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 17:38:12,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 16 letters. Loop has 6 letters. [2021-08-27 17:38:12,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 17:38:12,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 10 letters. Loop has 12 letters. [2021-08-27 17:38:12,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 17:38:12,173 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 28 transitions. [2021-08-27 17:38:12,174 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-08-27 17:38:12,174 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 21 states and 27 transitions. [2021-08-27 17:38:12,174 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2021-08-27 17:38:12,174 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2021-08-27 17:38:12,174 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 27 transitions. [2021-08-27 17:38:12,174 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 17:38:12,174 INFO L681 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2021-08-27 17:38:12,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 27 transitions. [2021-08-27 17:38:12,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2021-08-27 17:38:12,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:38:12,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2021-08-27 17:38:12,175 INFO L704 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2021-08-27 17:38:12,175 INFO L587 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2021-08-27 17:38:12,175 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-08-27 17:38:12,175 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 26 transitions. [2021-08-27 17:38:12,176 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-08-27 17:38:12,176 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:38:12,176 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:38:12,176 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 17:38:12,176 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-27 17:38:12,176 INFO L791 eck$LassoCheckResult]: Stem: 410#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 411#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 414#L523 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 415#L523-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~1 := 0; 416#L528-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 417#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 418#L528-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 419#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 429#L528-3 assume !(main_~i~1 < main_~array_size~0); 412#L528-4 sort_#in~x.base, sort_#in~x.offset, sort_#in~n := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sort_#t~mem4, sort_#t~mem5, sort_#t~mem6, sort_#t~mem7, sort_~temp~0, sort_#t~post3, sort_#t~post2, sort_~x.base, sort_~x.offset, sort_~n, sort_~pass~0, sort_~i~0;sort_~x.base, sort_~x.offset := sort_#in~x.base, sort_#in~x.offset;sort_~n := sort_#in~n;havoc sort_~pass~0;havoc sort_~i~0;sort_~pass~0 := 1; 413#L515-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 420#L516-3 [2021-08-27 17:38:12,176 INFO L793 eck$LassoCheckResult]: Loop: 420#L516-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 421#L517 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem4;havoc sort_#t~mem5;call sort_#t~mem6 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);sort_~temp~0 := sort_#t~mem6;havoc sort_#t~mem6;call sort_#t~mem7 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4);call write~int(sort_#t~mem7, sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);havoc sort_#t~mem7;call write~int(sort_~temp~0, sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 426#L516-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 420#L516-3 [2021-08-27 17:38:12,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:38:12,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1237095790, now seen corresponding path program 1 times [2021-08-27 17:38:12,176 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:38:12,176 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284162071] [2021-08-27 17:38:12,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:38:12,177 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:38:12,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:38:12,183 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:38:12,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:38:12,190 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:38:12,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:38:12,190 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 1 times [2021-08-27 17:38:12,190 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:38:12,212 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879976533] [2021-08-27 17:38:12,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:38:12,212 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:38:12,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:38:12,215 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:38:12,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:38:12,217 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:38:12,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:38:12,218 INFO L82 PathProgramCache]: Analyzing trace with hash -793648259, now seen corresponding path program 1 times [2021-08-27 17:38:12,218 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:38:12,218 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641357119] [2021-08-27 17:38:12,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:38:12,218 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:38:12,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:38:12,225 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:38:12,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:38:12,234 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:38:12,261 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2021-08-27 17:38:12,617 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 17:38:12,617 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 17:38:12,617 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 17:38:12,617 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 17:38:12,617 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-27 17:38:12,617 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:38:12,617 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 17:38:12,617 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 17:38:12,617 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-1.i_Iteration6_Lasso [2021-08-27 17:38:12,617 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 17:38:12,617 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 17:38:12,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:38:12,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:38:12,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:38:12,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:38:12,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:38:12,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:38:12,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:38:12,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:38:12,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:38:12,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:38:12,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:38:12,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:38:12,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:38:12,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:38:12,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:38:12,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:38:13,112 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 17:38:13,112 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-27 17:38:13,112 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:38:13,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:38:13,121 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:38:13,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2021-08-27 17:38:13,123 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:38:13,129 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:38:13,129 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:38:13,129 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:38:13,129 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:38:13,129 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:38:13,130 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:38:13,130 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:38:13,144 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:38:13,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2021-08-27 17:38:13,160 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:38:13,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:38:13,160 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:38:13,163 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:38:13,169 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:38:13,169 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:38:13,169 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:38:13,169 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:38:13,170 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:38:13,170 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:38:13,170 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:38:13,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2021-08-27 17:38:13,180 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:38:13,196 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2021-08-27 17:38:13,196 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:38:13,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:38:13,197 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:38:13,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2021-08-27 17:38:13,204 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:38:13,210 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:38:13,210 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:38:13,210 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:38:13,210 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:38:13,213 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:38:13,213 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:38:13,246 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:38:13,285 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2021-08-27 17:38:13,285 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:38:13,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:38:13,292 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:38:13,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2021-08-27 17:38:13,297 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:38:13,304 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:38:13,304 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:38:13,304 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:38:13,304 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:38:13,307 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:38:13,307 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:38:13,325 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:38:13,341 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2021-08-27 17:38:13,342 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:38:13,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:38:13,343 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:38:13,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2021-08-27 17:38:13,345 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:38:13,351 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:38:13,351 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:38:13,351 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:38:13,352 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:38:13,354 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:38:13,354 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:38:13,358 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:38:13,374 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2021-08-27 17:38:13,374 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:38:13,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:38:13,375 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:38:13,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2021-08-27 17:38:13,377 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:38:13,384 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:38:13,384 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:38:13,384 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:38:13,384 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:38:13,384 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:38:13,385 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:38:13,385 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:38:13,386 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:38:13,402 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2021-08-27 17:38:13,402 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:38:13,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:38:13,403 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:38:13,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2021-08-27 17:38:13,405 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:38:13,412 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:38:13,412 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:38:13,412 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:38:13,412 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:38:13,431 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:38:13,444 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:38:13,456 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-27 17:38:13,487 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2021-08-27 17:38:13,487 INFO L444 ModelExtractionUtils]: 14 out of 43 variables were initially zero. Simplification set additionally 25 variables to zero. [2021-08-27 17:38:13,487 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:38:13,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:38:13,497 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:38:13,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2021-08-27 17:38:13,510 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-27 17:38:13,531 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-08-27 17:38:13,531 INFO L513 LassoAnalysis]: Proved termination. [2021-08-27 17:38:13,531 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sort_~x.offset, ULTIMATE.start_sort_~i~0, v_rep(select #length ULTIMATE.start_sort_~x.base)_2) = -1*ULTIMATE.start_sort_~x.offset - 4*ULTIMATE.start_sort_~i~0 + 2*v_rep(select #length ULTIMATE.start_sort_~x.base)_2 Supporting invariants [] [2021-08-27 17:38:13,549 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2021-08-27 17:38:13,559 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2021-08-27 17:38:13,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:38:13,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:38:13,586 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-27 17:38:13,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:38:13,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:38:13,621 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 5 conjunts are in the unsatisfiable core [2021-08-27 17:38:13,622 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:38:13,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:38:13,656 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 [2021-08-27 17:38:13,657 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 26 transitions. cyclomatic complexity: 9 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:38:13,670 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 26 transitions. cyclomatic complexity: 9. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 36 states and 50 transitions. Complement of second has 7 states. [2021-08-27 17:38:13,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2021-08-27 17:38:13,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:38:13,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2021-08-27 17:38:13,671 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 11 letters. Loop has 3 letters. [2021-08-27 17:38:13,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 17:38:13,671 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 14 letters. Loop has 3 letters. [2021-08-27 17:38:13,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 17:38:13,672 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 11 letters. Loop has 6 letters. [2021-08-27 17:38:13,672 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 17:38:13,672 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 50 transitions. [2021-08-27 17:38:13,674 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-08-27 17:38:13,675 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 26 states and 34 transitions. [2021-08-27 17:38:13,675 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2021-08-27 17:38:13,675 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2021-08-27 17:38:13,675 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 34 transitions. [2021-08-27 17:38:13,675 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 17:38:13,675 INFO L681 BuchiCegarLoop]: Abstraction has 26 states and 34 transitions. [2021-08-27 17:38:13,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 34 transitions. [2021-08-27 17:38:13,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 20. [2021-08-27 17:38:13,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.25) internal successors, (25), 19 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:38:13,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2021-08-27 17:38:13,677 INFO L704 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2021-08-27 17:38:13,677 INFO L587 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2021-08-27 17:38:13,677 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-08-27 17:38:13,677 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 25 transitions. [2021-08-27 17:38:13,679 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-08-27 17:38:13,679 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:38:13,679 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:38:13,681 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 17:38:13,681 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-27 17:38:13,681 INFO L791 eck$LassoCheckResult]: Stem: 556#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 557#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 560#L523 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 561#L523-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~1 := 0; 562#L528-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 563#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 564#L528-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 565#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 575#L528-3 assume !(main_~i~1 < main_~array_size~0); 558#L528-4 sort_#in~x.base, sort_#in~x.offset, sort_#in~n := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sort_#t~mem4, sort_#t~mem5, sort_#t~mem6, sort_#t~mem7, sort_~temp~0, sort_#t~post3, sort_#t~post2, sort_~x.base, sort_~x.offset, sort_~n, sort_~pass~0, sort_~i~0;sort_~x.base, sort_~x.offset := sort_#in~x.base, sort_#in~x.offset;sort_~n := sort_#in~n;havoc sort_~pass~0;havoc sort_~i~0;sort_~pass~0 := 1; 559#L515-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 568#L516-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 569#L517 assume !(sort_#t~mem4 > sort_#t~mem5);havoc sort_#t~mem4;havoc sort_#t~mem5; 573#L516-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 574#L516-3 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 571#L515-2 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 570#L515-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 566#L516-3 [2021-08-27 17:38:13,681 INFO L793 eck$LassoCheckResult]: Loop: 566#L516-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 567#L517 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem4;havoc sort_#t~mem5;call sort_#t~mem6 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);sort_~temp~0 := sort_#t~mem6;havoc sort_#t~mem6;call sort_#t~mem7 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4);call write~int(sort_#t~mem7, sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);havoc sort_#t~mem7;call write~int(sort_~temp~0, sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 572#L516-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 566#L516-3 [2021-08-27 17:38:13,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:38:13,682 INFO L82 PathProgramCache]: Analyzing trace with hash 221564791, now seen corresponding path program 1 times [2021-08-27 17:38:13,682 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:38:13,683 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68902552] [2021-08-27 17:38:13,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:38:13,683 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:38:13,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:38:13,750 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 17:38:13,750 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:38:13,750 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68902552] [2021-08-27 17:38:13,750 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68902552] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:38:13,750 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [915295220] [2021-08-27 17:38:13,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:38:13,750 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 17:38:13,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:38:13,751 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 17:38:13,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2021-08-27 17:38:13,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:38:13,818 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 9 conjunts are in the unsatisfiable core [2021-08-27 17:38:13,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:38:13,907 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 17:38:13,908 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [915295220] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:38:13,908 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 17:38:13,908 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-08-27 17:38:13,908 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276439715] [2021-08-27 17:38:13,908 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 17:38:13,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:38:13,909 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 2 times [2021-08-27 17:38:13,909 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:38:13,909 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002004630] [2021-08-27 17:38:13,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:38:13,909 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:38:13,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:38:13,912 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:38:13,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:38:13,914 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:38:13,945 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2021-08-27 17:38:14,028 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:38:14,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-27 17:38:14,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2021-08-27 17:38:14,029 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. cyclomatic complexity: 8 Second operand has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:38:14,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:38:14,100 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2021-08-27 17:38:14,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 17:38:14,100 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 38 transitions. [2021-08-27 17:38:14,101 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-08-27 17:38:14,101 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 23 states and 28 transitions. [2021-08-27 17:38:14,101 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2021-08-27 17:38:14,101 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2021-08-27 17:38:14,101 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 28 transitions. [2021-08-27 17:38:14,101 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 17:38:14,101 INFO L681 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2021-08-27 17:38:14,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 28 transitions. [2021-08-27 17:38:14,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2021-08-27 17:38:14,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 21 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:38:14,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2021-08-27 17:38:14,103 INFO L704 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2021-08-27 17:38:14,103 INFO L587 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2021-08-27 17:38:14,103 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-08-27 17:38:14,103 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. [2021-08-27 17:38:14,103 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-08-27 17:38:14,103 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:38:14,103 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:38:14,104 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 17:38:14,104 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-27 17:38:14,104 INFO L791 eck$LassoCheckResult]: Stem: 675#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 676#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 677#L523 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 678#L523-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~1 := 0; 681#L528-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 682#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 683#L528-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 684#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 694#L528-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 696#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 695#L528-3 assume !(main_~i~1 < main_~array_size~0); 679#L528-4 sort_#in~x.base, sort_#in~x.offset, sort_#in~n := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sort_#t~mem4, sort_#t~mem5, sort_#t~mem6, sort_#t~mem7, sort_~temp~0, sort_#t~post3, sort_#t~post2, sort_~x.base, sort_~x.offset, sort_~n, sort_~pass~0, sort_~i~0;sort_~x.base, sort_~x.offset := sort_#in~x.base, sort_#in~x.offset;sort_~n := sort_#in~n;havoc sort_~pass~0;havoc sort_~i~0;sort_~pass~0 := 1; 680#L515-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 687#L516-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 688#L517 assume !(sort_#t~mem4 > sort_#t~mem5);havoc sort_#t~mem4;havoc sort_#t~mem5; 692#L516-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 693#L516-3 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 690#L515-2 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 689#L515-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 685#L516-3 [2021-08-27 17:38:14,104 INFO L793 eck$LassoCheckResult]: Loop: 685#L516-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 686#L517 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem4;havoc sort_#t~mem5;call sort_#t~mem6 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);sort_~temp~0 := sort_#t~mem6;havoc sort_#t~mem6;call sort_#t~mem7 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4);call write~int(sort_#t~mem7, sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);havoc sort_#t~mem7;call write~int(sort_~temp~0, sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 691#L516-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 685#L516-3 [2021-08-27 17:38:14,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:38:14,104 INFO L82 PathProgramCache]: Analyzing trace with hash 1850126805, now seen corresponding path program 2 times [2021-08-27 17:38:14,105 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:38:14,105 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789015973] [2021-08-27 17:38:14,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:38:14,105 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:38:14,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:38:14,211 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:38:14,212 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:38:14,212 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789015973] [2021-08-27 17:38:14,212 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789015973] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:38:14,212 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1004523731] [2021-08-27 17:38:14,212 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-27 17:38:14,212 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 17:38:14,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:38:14,214 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 17:38:14,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2021-08-27 17:38:14,288 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-27 17:38:14,289 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 17:38:14,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 5 conjunts are in the unsatisfiable core [2021-08-27 17:38:14,290 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:38:14,362 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-08-27 17:38:14,362 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1004523731] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:38:14,362 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 17:38:14,362 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 13 [2021-08-27 17:38:14,362 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143641131] [2021-08-27 17:38:14,363 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 17:38:14,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:38:14,363 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 3 times [2021-08-27 17:38:14,363 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:38:14,363 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480449523] [2021-08-27 17:38:14,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:38:14,364 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:38:14,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:38:14,378 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:38:14,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:38:14,380 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:38:14,450 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:38:14,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-27 17:38:14,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-08-27 17:38:14,451 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. cyclomatic complexity: 8 Second operand has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:38:14,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:38:14,682 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2021-08-27 17:38:14,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-27 17:38:14,682 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 58 transitions. [2021-08-27 17:38:14,682 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-08-27 17:38:14,683 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 43 states and 56 transitions. [2021-08-27 17:38:14,683 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2021-08-27 17:38:14,683 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2021-08-27 17:38:14,683 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 56 transitions. [2021-08-27 17:38:14,683 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 17:38:14,683 INFO L681 BuchiCegarLoop]: Abstraction has 43 states and 56 transitions. [2021-08-27 17:38:14,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 56 transitions. [2021-08-27 17:38:14,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 25. [2021-08-27 17:38:14,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.24) internal successors, (31), 24 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:38:14,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2021-08-27 17:38:14,684 INFO L704 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2021-08-27 17:38:14,684 INFO L587 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2021-08-27 17:38:14,684 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-08-27 17:38:14,685 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 31 transitions. [2021-08-27 17:38:14,685 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-08-27 17:38:14,685 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:38:14,685 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:38:14,685 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 17:38:14,685 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-27 17:38:14,685 INFO L791 eck$LassoCheckResult]: Stem: 832#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 833#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 834#L523 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 835#L523-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~1 := 0; 838#L528-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 839#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 840#L528-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 841#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 851#L528-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 854#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 853#L528-3 assume !(main_~i~1 < main_~array_size~0); 836#L528-4 sort_#in~x.base, sort_#in~x.offset, sort_#in~n := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sort_#t~mem4, sort_#t~mem5, sort_#t~mem6, sort_#t~mem7, sort_~temp~0, sort_#t~post3, sort_#t~post2, sort_~x.base, sort_~x.offset, sort_~n, sort_~pass~0, sort_~i~0;sort_~x.base, sort_~x.offset := sort_#in~x.base, sort_#in~x.offset;sort_~n := sort_#in~n;havoc sort_~pass~0;havoc sort_~i~0;sort_~pass~0 := 1; 837#L515-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 846#L516-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 856#L517 assume !(sort_#t~mem4 > sort_#t~mem5);havoc sort_#t~mem4;havoc sort_#t~mem5; 850#L516-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 844#L516-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 845#L517 assume !(sort_#t~mem4 > sort_#t~mem5);havoc sort_#t~mem4;havoc sort_#t~mem5; 852#L516-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 855#L516-3 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 848#L515-2 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 847#L515-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 842#L516-3 [2021-08-27 17:38:14,685 INFO L793 eck$LassoCheckResult]: Loop: 842#L516-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 843#L517 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem4;havoc sort_#t~mem5;call sort_#t~mem6 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);sort_~temp~0 := sort_#t~mem6;havoc sort_#t~mem6;call sort_#t~mem7 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4);call write~int(sort_#t~mem7, sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);havoc sort_#t~mem7;call write~int(sort_~temp~0, sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 849#L516-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 842#L516-3 [2021-08-27 17:38:14,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:38:14,686 INFO L82 PathProgramCache]: Analyzing trace with hash -135460634, now seen corresponding path program 3 times [2021-08-27 17:38:14,686 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:38:14,686 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694362842] [2021-08-27 17:38:14,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:38:14,686 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:38:14,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:38:14,694 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:38:14,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:38:14,704 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:38:14,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:38:14,704 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 4 times [2021-08-27 17:38:14,704 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:38:14,705 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927179998] [2021-08-27 17:38:14,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:38:14,705 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:38:14,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:38:14,708 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:38:14,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:38:14,710 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:38:14,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:38:14,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1761549573, now seen corresponding path program 1 times [2021-08-27 17:38:14,710 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:38:14,710 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289817721] [2021-08-27 17:38:14,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:38:14,711 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:38:14,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:38:14,927 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 17:38:14,927 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:38:14,927 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289817721] [2021-08-27 17:38:14,927 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289817721] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:38:14,927 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [720899167] [2021-08-27 17:38:14,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:38:14,928 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 17:38:14,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:38:14,955 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 17:38:14,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2021-08-27 17:38:15,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:38:15,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 18 conjunts are in the unsatisfiable core [2021-08-27 17:38:15,061 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:38:15,388 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-08-27 17:38:15,388 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 10 [2021-08-27 17:38:15,404 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-08-27 17:38:15,405 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [720899167] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:38:15,405 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 17:38:15,405 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 19 [2021-08-27 17:38:15,405 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708205532] [2021-08-27 17:38:15,492 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:38:15,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-08-27 17:38:15,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2021-08-27 17:38:15,493 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. cyclomatic complexity: 9 Second operand has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 19 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:38:15,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:38:15,704 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2021-08-27 17:38:15,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-27 17:38:15,704 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 58 transitions. [2021-08-27 17:38:15,705 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2021-08-27 17:38:15,706 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 45 states and 58 transitions. [2021-08-27 17:38:15,706 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2021-08-27 17:38:15,706 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2021-08-27 17:38:15,707 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 58 transitions. [2021-08-27 17:38:15,707 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 17:38:15,707 INFO L681 BuchiCegarLoop]: Abstraction has 45 states and 58 transitions. [2021-08-27 17:38:15,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 58 transitions. [2021-08-27 17:38:15,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 34. [2021-08-27 17:38:15,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 33 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:38:15,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2021-08-27 17:38:15,709 INFO L704 BuchiCegarLoop]: Abstraction has 34 states and 43 transitions. [2021-08-27 17:38:15,709 INFO L587 BuchiCegarLoop]: Abstraction has 34 states and 43 transitions. [2021-08-27 17:38:15,709 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-08-27 17:38:15,709 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 43 transitions. [2021-08-27 17:38:15,710 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-08-27 17:38:15,710 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:38:15,710 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:38:15,710 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 17:38:15,710 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-27 17:38:15,710 INFO L791 eck$LassoCheckResult]: Stem: 1015#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1016#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 1019#L523 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 1020#L523-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~1 := 0; 1021#L528-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 1022#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1023#L528-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 1024#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1039#L528-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 1038#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1037#L528-3 assume !(main_~i~1 < main_~array_size~0); 1017#L528-4 sort_#in~x.base, sort_#in~x.offset, sort_#in~n := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sort_#t~mem4, sort_#t~mem5, sort_#t~mem6, sort_#t~mem7, sort_~temp~0, sort_#t~post3, sort_#t~post2, sort_~x.base, sort_~x.offset, sort_~n, sort_~pass~0, sort_~i~0;sort_~x.base, sort_~x.offset := sort_#in~x.base, sort_#in~x.offset;sort_~n := sort_#in~n;havoc sort_~pass~0;havoc sort_~i~0;sort_~pass~0 := 1; 1018#L515-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 1029#L516-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 1043#L517 assume !(sort_#t~mem4 > sort_#t~mem5);havoc sort_#t~mem4;havoc sort_#t~mem5; 1035#L516-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 1027#L516-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 1028#L517 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem4;havoc sort_#t~mem5;call sort_#t~mem6 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);sort_~temp~0 := sort_#t~mem6;havoc sort_#t~mem6;call sort_#t~mem7 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4);call write~int(sort_#t~mem7, sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);havoc sort_#t~mem7;call write~int(sort_~temp~0, sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 1042#L516-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 1046#L516-3 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 1045#L515-2 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 1044#L515-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 1034#L516-3 [2021-08-27 17:38:15,711 INFO L793 eck$LassoCheckResult]: Loop: 1034#L516-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 1048#L517 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem4;havoc sort_#t~mem5;call sort_#t~mem6 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);sort_~temp~0 := sort_#t~mem6;havoc sort_#t~mem6;call sort_#t~mem7 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4);call write~int(sort_#t~mem7, sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);havoc sort_#t~mem7;call write~int(sort_~temp~0, sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 1033#L516-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 1034#L516-3 [2021-08-27 17:38:15,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:38:15,711 INFO L82 PathProgramCache]: Analyzing trace with hash -137307676, now seen corresponding path program 2 times [2021-08-27 17:38:15,711 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:38:15,711 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650461193] [2021-08-27 17:38:15,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:38:15,712 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:38:15,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:38:15,720 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:38:15,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:38:15,729 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:38:15,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:38:15,729 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 5 times [2021-08-27 17:38:15,729 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:38:15,730 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827059962] [2021-08-27 17:38:15,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:38:15,730 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:38:15,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:38:15,733 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:38:15,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:38:15,735 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:38:15,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:38:15,735 INFO L82 PathProgramCache]: Analyzing trace with hash -1724071097, now seen corresponding path program 3 times [2021-08-27 17:38:15,736 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:38:15,736 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465691224] [2021-08-27 17:38:15,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:38:15,736 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:38:15,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:38:15,745 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:38:15,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:38:15,755 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:38:16,662 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 17:38:16,663 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 17:38:16,663 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 17:38:16,663 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 17:38:16,663 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-27 17:38:16,663 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:38:16,663 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 17:38:16,663 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 17:38:16,663 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-1.i_Iteration10_Lasso [2021-08-27 17:38:16,663 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 17:38:16,663 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 17:38:16,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:38:16,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:38:16,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:38:16,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:38:16,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:38:16,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:38:16,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:38:16,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:38:16,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:38:16,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:38:16,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:38:16,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:38:16,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:38:16,697 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:38:16,699 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:38:16,742 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:280) 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$LassoCheckResult.checkLassoTermination(LassoCheck.java:953) 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:252) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:457) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:398) 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:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-08-27 17:38:16,745 INFO L168 Benchmark]: Toolchain (without parser) took 9490.58 ms. Allocated memory was 58.7 MB in the beginning and 237.0 MB in the end (delta: 178.3 MB). Free memory was 35.6 MB in the beginning and 99.3 MB in the end (delta: -63.8 MB). Peak memory consumption was 141.4 MB. Max. memory is 16.1 GB. [2021-08-27 17:38:16,745 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 58.7 MB. Free memory was 40.0 MB in the beginning and 39.9 MB in the end (delta: 73.4 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 17:38:16,745 INFO L168 Benchmark]: CACSL2BoogieTranslator took 310.24 ms. Allocated memory is still 58.7 MB. Free memory was 35.4 MB in the beginning and 35.4 MB in the end (delta: 68.6 kB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-08-27 17:38:16,745 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.86 ms. Allocated memory is still 58.7 MB. Free memory was 35.2 MB in the beginning and 33.5 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 17:38:16,746 INFO L168 Benchmark]: Boogie Preprocessor took 40.25 ms. Allocated memory is still 58.7 MB. Free memory was 33.5 MB in the beginning and 32.2 MB in the end (delta: 1.2 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 17:38:16,746 INFO L168 Benchmark]: RCFGBuilder took 351.91 ms. Allocated memory was 58.7 MB in the beginning and 71.3 MB in the end (delta: 12.6 MB). Free memory was 32.0 MB in the beginning and 44.6 MB in the end (delta: -12.6 MB). Peak memory consumption was 12.1 MB. Max. memory is 16.1 GB. [2021-08-27 17:38:16,746 INFO L168 Benchmark]: BuchiAutomizer took 8729.92 ms. Allocated memory was 71.3 MB in the beginning and 237.0 MB in the end (delta: 165.7 MB). Free memory was 44.3 MB in the beginning and 99.3 MB in the end (delta: -55.0 MB). Peak memory consumption was 136.4 MB. Max. memory is 16.1 GB. [2021-08-27 17:38:16,747 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 58.7 MB. Free memory was 40.0 MB in the beginning and 39.9 MB in the end (delta: 73.4 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 310.24 ms. Allocated memory is still 58.7 MB. Free memory was 35.4 MB in the beginning and 35.4 MB in the end (delta: 68.6 kB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 54.86 ms. Allocated memory is still 58.7 MB. Free memory was 35.2 MB in the beginning and 33.5 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 40.25 ms. Allocated memory is still 58.7 MB. Free memory was 33.5 MB in the beginning and 32.2 MB in the end (delta: 1.2 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 351.91 ms. Allocated memory was 58.7 MB in the beginning and 71.3 MB in the end (delta: 12.6 MB). Free memory was 32.0 MB in the beginning and 44.6 MB in the end (delta: -12.6 MB). Peak memory consumption was 12.1 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 8729.92 ms. Allocated memory was 71.3 MB in the beginning and 237.0 MB in the end (delta: 165.7 MB). Free memory was 44.3 MB in the beginning and 99.3 MB in the end (delta: -55.0 MB). Peak memory consumption was 136.4 MB. Max. memory is 16.1 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. [2021-08-27 17:38:16,769 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2021-08-27 17:38:16,988 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2021-08-27 17:38:17,197 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2021-08-27 17:38:17,397 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2021-08-27 17:38:17,598 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...