./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/selectionsort-alloca-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version c3fed411 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/termination-memory-alloca/selectionsort-alloca-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-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 64bit --witnessprinter.graph.data.programhash ffc745103ed55cbf924659873c1ffa566d33874f07e41d755dd0e85e8b4a5c0d --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-19 17:38:37,374 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-19 17:38:37,376 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-19 17:38:37,430 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-19 17:38:37,432 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-19 17:38:37,436 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-19 17:38:37,437 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-19 17:38:37,440 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-19 17:38:37,442 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-19 17:38:37,443 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-19 17:38:37,444 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-19 17:38:37,446 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-19 17:38:37,447 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-19 17:38:37,453 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-19 17:38:37,454 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-19 17:38:37,456 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-19 17:38:37,459 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-19 17:38:37,461 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-19 17:38:37,462 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-19 17:38:37,467 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-19 17:38:37,468 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-19 17:38:37,469 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-19 17:38:37,470 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-19 17:38:37,471 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-19 17:38:37,473 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-19 17:38:37,473 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-19 17:38:37,474 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-19 17:38:37,474 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-19 17:38:37,475 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-19 17:38:37,475 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-19 17:38:37,476 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-19 17:38:37,476 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-19 17:38:37,477 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-19 17:38:37,478 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-19 17:38:37,478 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-19 17:38:37,479 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-19 17:38:37,479 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-19 17:38:37,480 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-19 17:38:37,480 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-19 17:38:37,481 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-19 17:38:37,481 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-19 17:38:37,482 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2021-12-19 17:38:37,505 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-19 17:38:37,508 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-19 17:38:37,508 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-19 17:38:37,509 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-19 17:38:37,510 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-19 17:38:37,510 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-19 17:38:37,510 INFO L138 SettingsManager]: * Use SBE=true [2021-12-19 17:38:37,510 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-19 17:38:37,510 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-19 17:38:37,510 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-19 17:38:37,510 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-19 17:38:37,510 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-19 17:38:37,511 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-19 17:38:37,511 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-19 17:38:37,511 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-19 17:38:37,511 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-19 17:38:37,512 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-19 17:38:37,512 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-19 17:38:37,512 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-19 17:38:37,512 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-19 17:38:37,512 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-19 17:38:37,513 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-19 17:38:37,513 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-19 17:38:37,513 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-19 17:38:37,513 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-19 17:38:37,513 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-19 17:38:37,514 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-19 17:38:37,514 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-19 17:38:37,514 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-19 17:38:37,515 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-19 17:38:37,515 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ffc745103ed55cbf924659873c1ffa566d33874f07e41d755dd0e85e8b4a5c0d [2021-12-19 17:38:37,733 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-19 17:38:37,750 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-19 17:38:37,752 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-19 17:38:37,753 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-19 17:38:37,754 INFO L275 PluginConnector]: CDTParser initialized [2021-12-19 17:38:37,755 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/selectionsort-alloca-2.i [2021-12-19 17:38:37,814 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1d848f15/3d9dbecc8d434e649ae0d36001148af6/FLAG23c014063 [2021-12-19 17:38:38,228 INFO L306 CDTParser]: Found 1 translation units. [2021-12-19 17:38:38,228 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/selectionsort-alloca-2.i [2021-12-19 17:38:38,239 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1d848f15/3d9dbecc8d434e649ae0d36001148af6/FLAG23c014063 [2021-12-19 17:38:38,253 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1d848f15/3d9dbecc8d434e649ae0d36001148af6 [2021-12-19 17:38:38,255 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-19 17:38:38,256 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-19 17:38:38,257 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-19 17:38:38,258 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-19 17:38:38,260 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-19 17:38:38,261 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 05:38:38" (1/1) ... [2021-12-19 17:38:38,262 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28f22455 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:38:38, skipping insertion in model container [2021-12-19 17:38:38,262 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 05:38:38" (1/1) ... [2021-12-19 17:38:38,268 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-19 17:38:38,294 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-19 17:38:38,530 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-19 17:38:38,539 INFO L203 MainTranslator]: Completed pre-run [2021-12-19 17:38:38,571 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-19 17:38:38,592 INFO L208 MainTranslator]: Completed translation [2021-12-19 17:38:38,593 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:38:38 WrapperNode [2021-12-19 17:38:38,593 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-19 17:38:38,594 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-19 17:38:38,594 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-19 17:38:38,594 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-19 17:38:38,601 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:38:38" (1/1) ... [2021-12-19 17:38:38,611 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:38:38" (1/1) ... [2021-12-19 17:38:38,633 INFO L137 Inliner]: procedures = 111, calls = 12, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 56 [2021-12-19 17:38:38,634 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-19 17:38:38,635 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-19 17:38:38,636 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-19 17:38:38,636 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-19 17:38:38,642 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:38:38" (1/1) ... [2021-12-19 17:38:38,643 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:38:38" (1/1) ... [2021-12-19 17:38:38,660 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:38:38" (1/1) ... [2021-12-19 17:38:38,661 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:38:38" (1/1) ... [2021-12-19 17:38:38,665 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:38:38" (1/1) ... [2021-12-19 17:38:38,673 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:38:38" (1/1) ... [2021-12-19 17:38:38,675 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:38:38" (1/1) ... [2021-12-19 17:38:38,680 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-19 17:38:38,685 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-19 17:38:38,686 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-19 17:38:38,686 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-19 17:38:38,687 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:38:38" (1/1) ... [2021-12-19 17:38:38,694 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:38:38,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:38:38,718 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-12-19 17:38:38,734 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-12-19 17:38:38,764 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-19 17:38:38,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-19 17:38:38,765 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-19 17:38:38,766 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-19 17:38:38,767 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-19 17:38:38,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-19 17:38:38,864 INFO L236 CfgBuilder]: Building ICFG [2021-12-19 17:38:38,866 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-19 17:38:38,950 INFO L277 CfgBuilder]: Performing block encoding [2021-12-19 17:38:38,962 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-19 17:38:38,963 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-19 17:38:38,964 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 05:38:38 BoogieIcfgContainer [2021-12-19 17:38:38,964 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-19 17:38:38,965 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-19 17:38:38,965 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-19 17:38:38,982 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-19 17:38:38,983 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-19 17:38:38,983 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.12 05:38:38" (1/3) ... [2021-12-19 17:38:38,984 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@56858ecc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.12 05:38:38, skipping insertion in model container [2021-12-19 17:38:38,984 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-19 17:38:38,984 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:38:38" (2/3) ... [2021-12-19 17:38:38,984 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@56858ecc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.12 05:38:38, skipping insertion in model container [2021-12-19 17:38:38,984 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-19 17:38:38,984 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 05:38:38" (3/3) ... [2021-12-19 17:38:38,985 INFO L388 chiAutomizerObserver]: Analyzing ICFG selectionsort-alloca-2.i [2021-12-19 17:38:39,064 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-19 17:38:39,065 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-19 17:38:39,065 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-19 17:38:39,065 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-19 17:38:39,065 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-19 17:38:39,065 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-19 17:38:39,065 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-19 17:38:39,065 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-19 17:38:39,088 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 14 states, 13 states have (on average 1.4615384615384615) 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-12-19 17:38:39,102 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2021-12-19 17:38:39,102 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:38:39,102 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:38:39,107 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2021-12-19 17:38:39,107 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-12-19 17:38:39,107 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-19 17:38:39,107 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 14 states, 13 states have (on average 1.4615384615384615) 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-12-19 17:38:39,109 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2021-12-19 17:38:39,109 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:38:39,109 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:38:39,109 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2021-12-19 17:38:39,110 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-12-19 17:38:39,115 INFO L791 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 11#L566true assume !(main_~array_size~0#1 < 1); 13#L566-2true call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;assume { :begin_inline_SelectionSort } true;SelectionSort_#in~a#1.base, SelectionSort_#in~a#1.offset, SelectionSort_#in~array_size#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc SelectionSort_#t~mem4#1, SelectionSort_#t~mem5#1, SelectionSort_#t~pre3#1, SelectionSort_#t~mem6#1, SelectionSort_#t~mem7#1, SelectionSort_#t~pre2#1, SelectionSort_~j~0#1, SelectionSort_~min~0#1, SelectionSort_~temp~0#1, SelectionSort_~a#1.base, SelectionSort_~a#1.offset, SelectionSort_~array_size#1, SelectionSort_~i~0#1;SelectionSort_~a#1.base, SelectionSort_~a#1.offset := SelectionSort_#in~a#1.base, SelectionSort_#in~a#1.offset;SelectionSort_~array_size#1 := SelectionSort_#in~array_size#1;havoc SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 0; 8#L550-3true [2021-12-19 17:38:39,115 INFO L793 eck$LassoCheckResult]: Loop: 8#L550-3true assume !!(SelectionSort_~i~0#1 < SelectionSort_~array_size#1 - 1);havoc SelectionSort_~j~0#1;havoc SelectionSort_~min~0#1;havoc SelectionSort_~temp~0#1;SelectionSort_~min~0#1 := SelectionSort_~i~0#1;SelectionSort_~j~0#1 := 1 + SelectionSort_~i~0#1; 14#L554-3true assume !true; 10#L554-4true call SelectionSort_#t~mem6#1 := read~int(SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~i~0#1, 4);SelectionSort_~temp~0#1 := SelectionSort_#t~mem6#1;havoc SelectionSort_#t~mem6#1;call SelectionSort_#t~mem7#1 := read~int(SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~min~0#1, 4);call write~int(SelectionSort_#t~mem7#1, SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~i~0#1, 4);havoc SelectionSort_#t~mem7#1;call write~int(SelectionSort_~temp~0#1, SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~min~0#1, 4); 15#L550-2true SelectionSort_#t~pre2#1 := 1 + SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~i~0#1;havoc SelectionSort_#t~pre2#1; 8#L550-3true [2021-12-19 17:38:39,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:38:39,120 INFO L85 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2021-12-19 17:38:39,128 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:38:39,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072707418] [2021-12-19 17:38:39,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:38:39,129 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:38:39,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:38:39,248 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:38:39,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:38:39,299 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:38:39,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:38:39,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1463796, now seen corresponding path program 1 times [2021-12-19 17:38:39,303 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:38:39,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302170996] [2021-12-19 17:38:39,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:38:39,305 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:38:39,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:38:39,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:38:39,368 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 17:38:39,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302170996] [2021-12-19 17:38:39,368 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302170996] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 17:38:39,369 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 17:38:39,369 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-19 17:38:39,369 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432969610] [2021-12-19 17:38:39,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 17:38:39,374 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-19 17:38:39,374 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 17:38:39,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-19 17:38:39,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-19 17:38:39,408 INFO L87 Difference]: Start difference. First operand has 14 states, 13 states have (on average 1.4615384615384615) 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) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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-12-19 17:38:39,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 17:38:39,414 INFO L93 Difference]: Finished difference Result 14 states and 17 transitions. [2021-12-19 17:38:39,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-19 17:38:39,421 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 17 transitions. [2021-12-19 17:38:39,424 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2021-12-19 17:38:39,427 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 10 states and 13 transitions. [2021-12-19 17:38:39,428 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2021-12-19 17:38:39,428 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2021-12-19 17:38:39,429 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2021-12-19 17:38:39,429 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-19 17:38:39,430 INFO L681 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2021-12-19 17:38:39,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2021-12-19 17:38:39,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2021-12-19 17:38:39,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 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-12-19 17:38:39,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2021-12-19 17:38:39,452 INFO L704 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2021-12-19 17:38:39,452 INFO L587 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2021-12-19 17:38:39,452 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-19 17:38:39,452 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2021-12-19 17:38:39,453 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2021-12-19 17:38:39,453 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:38:39,453 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:38:39,454 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2021-12-19 17:38:39,454 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-12-19 17:38:39,454 INFO L791 eck$LassoCheckResult]: Stem: 36#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 37#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 44#L566 assume !(main_~array_size~0#1 < 1); 41#L566-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;assume { :begin_inline_SelectionSort } true;SelectionSort_#in~a#1.base, SelectionSort_#in~a#1.offset, SelectionSort_#in~array_size#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc SelectionSort_#t~mem4#1, SelectionSort_#t~mem5#1, SelectionSort_#t~pre3#1, SelectionSort_#t~mem6#1, SelectionSort_#t~mem7#1, SelectionSort_#t~pre2#1, SelectionSort_~j~0#1, SelectionSort_~min~0#1, SelectionSort_~temp~0#1, SelectionSort_~a#1.base, SelectionSort_~a#1.offset, SelectionSort_~array_size#1, SelectionSort_~i~0#1;SelectionSort_~a#1.base, SelectionSort_~a#1.offset := SelectionSort_#in~a#1.base, SelectionSort_#in~a#1.offset;SelectionSort_~array_size#1 := SelectionSort_#in~array_size#1;havoc SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 0; 42#L550-3 [2021-12-19 17:38:39,455 INFO L793 eck$LassoCheckResult]: Loop: 42#L550-3 assume !!(SelectionSort_~i~0#1 < SelectionSort_~array_size#1 - 1);havoc SelectionSort_~j~0#1;havoc SelectionSort_~min~0#1;havoc SelectionSort_~temp~0#1;SelectionSort_~min~0#1 := SelectionSort_~i~0#1;SelectionSort_~j~0#1 := 1 + SelectionSort_~i~0#1; 40#L554-3 assume !(SelectionSort_~j~0#1 < SelectionSort_~array_size#1); 43#L554-4 call SelectionSort_#t~mem6#1 := read~int(SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~i~0#1, 4);SelectionSort_~temp~0#1 := SelectionSort_#t~mem6#1;havoc SelectionSort_#t~mem6#1;call SelectionSort_#t~mem7#1 := read~int(SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~min~0#1, 4);call write~int(SelectionSort_#t~mem7#1, SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~i~0#1, 4);havoc SelectionSort_#t~mem7#1;call write~int(SelectionSort_~temp~0#1, SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~min~0#1, 4); 45#L550-2 SelectionSort_#t~pre2#1 := 1 + SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~i~0#1;havoc SelectionSort_#t~pre2#1; 42#L550-3 [2021-12-19 17:38:39,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:38:39,455 INFO L85 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2021-12-19 17:38:39,456 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:38:39,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687359382] [2021-12-19 17:38:39,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:38:39,456 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:38:39,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:38:39,485 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:38:39,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:38:39,508 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:38:39,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:38:39,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1453225, now seen corresponding path program 1 times [2021-12-19 17:38:39,510 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:38:39,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848421035] [2021-12-19 17:38:39,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:38:39,511 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:38:39,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:38:39,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:38:39,544 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 17:38:39,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848421035] [2021-12-19 17:38:39,544 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848421035] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 17:38:39,545 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 17:38:39,545 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-19 17:38:39,545 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400772394] [2021-12-19 17:38:39,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 17:38:39,545 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-19 17:38:39,546 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 17:38:39,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-19 17:38:39,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-19 17:38:39,547 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. cyclomatic complexity: 4 Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 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-12-19 17:38:39,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 17:38:39,561 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2021-12-19 17:38:39,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-19 17:38:39,562 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 14 transitions. [2021-12-19 17:38:39,562 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2021-12-19 17:38:39,563 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 14 transitions. [2021-12-19 17:38:39,563 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2021-12-19 17:38:39,563 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2021-12-19 17:38:39,563 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2021-12-19 17:38:39,563 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-19 17:38:39,564 INFO L681 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2021-12-19 17:38:39,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2021-12-19 17:38:39,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2021-12-19 17:38:39,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 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-12-19 17:38:39,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2021-12-19 17:38:39,565 INFO L704 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2021-12-19 17:38:39,565 INFO L587 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2021-12-19 17:38:39,566 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-19 17:38:39,566 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2021-12-19 17:38:39,566 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2021-12-19 17:38:39,566 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:38:39,566 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:38:39,567 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2021-12-19 17:38:39,567 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-19 17:38:39,567 INFO L791 eck$LassoCheckResult]: Stem: 63#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 64#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 71#L566 assume !(main_~array_size~0#1 < 1); 68#L566-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;assume { :begin_inline_SelectionSort } true;SelectionSort_#in~a#1.base, SelectionSort_#in~a#1.offset, SelectionSort_#in~array_size#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc SelectionSort_#t~mem4#1, SelectionSort_#t~mem5#1, SelectionSort_#t~pre3#1, SelectionSort_#t~mem6#1, SelectionSort_#t~mem7#1, SelectionSort_#t~pre2#1, SelectionSort_~j~0#1, SelectionSort_~min~0#1, SelectionSort_~temp~0#1, SelectionSort_~a#1.base, SelectionSort_~a#1.offset, SelectionSort_~array_size#1, SelectionSort_~i~0#1;SelectionSort_~a#1.base, SelectionSort_~a#1.offset := SelectionSort_#in~a#1.base, SelectionSort_#in~a#1.offset;SelectionSort_~array_size#1 := SelectionSort_#in~array_size#1;havoc SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 0; 69#L550-3 [2021-12-19 17:38:39,567 INFO L793 eck$LassoCheckResult]: Loop: 69#L550-3 assume !!(SelectionSort_~i~0#1 < SelectionSort_~array_size#1 - 1);havoc SelectionSort_~j~0#1;havoc SelectionSort_~min~0#1;havoc SelectionSort_~temp~0#1;SelectionSort_~min~0#1 := SelectionSort_~i~0#1;SelectionSort_~j~0#1 := 1 + SelectionSort_~i~0#1; 70#L554-3 assume !!(SelectionSort_~j~0#1 < SelectionSort_~array_size#1);call SelectionSort_#t~mem4#1 := read~int(SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~j~0#1, 4);call SelectionSort_#t~mem5#1 := read~int(SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~min~0#1, 4); 65#L556 assume SelectionSort_#t~mem4#1 < SelectionSort_#t~mem5#1;havoc SelectionSort_#t~mem4#1;havoc SelectionSort_#t~mem5#1;SelectionSort_~min~0#1 := SelectionSort_~j~0#1; 66#L554-2 SelectionSort_#t~pre3#1 := 1 + SelectionSort_~j~0#1;SelectionSort_~j~0#1 := 1 + SelectionSort_~j~0#1;havoc SelectionSort_#t~pre3#1; 67#L554-3 assume !(SelectionSort_~j~0#1 < SelectionSort_~array_size#1); 72#L554-4 call SelectionSort_#t~mem6#1 := read~int(SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~i~0#1, 4);SelectionSort_~temp~0#1 := SelectionSort_#t~mem6#1;havoc SelectionSort_#t~mem6#1;call SelectionSort_#t~mem7#1 := read~int(SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~min~0#1, 4);call write~int(SelectionSort_#t~mem7#1, SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~i~0#1, 4);havoc SelectionSort_#t~mem7#1;call write~int(SelectionSort_~temp~0#1, SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~min~0#1, 4); 73#L550-2 SelectionSort_#t~pre2#1 := 1 + SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~i~0#1;havoc SelectionSort_#t~pre2#1; 69#L550-3 [2021-12-19 17:38:39,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:38:39,568 INFO L85 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 3 times [2021-12-19 17:38:39,568 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:38:39,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989018184] [2021-12-19 17:38:39,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:38:39,569 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:38:39,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:38:39,576 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:38:39,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:38:39,583 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:38:39,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:38:39,584 INFO L85 PathProgramCache]: Analyzing trace with hash 393067660, now seen corresponding path program 1 times [2021-12-19 17:38:39,584 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:38:39,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284137006] [2021-12-19 17:38:39,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:38:39,585 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:38:39,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:38:39,598 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:38:39,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:38:39,610 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:38:39,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:38:39,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1419424808, now seen corresponding path program 1 times [2021-12-19 17:38:39,611 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:38:39,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554168329] [2021-12-19 17:38:39,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:38:39,612 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:38:39,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:38:39,630 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:38:39,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:38:39,646 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:38:40,072 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 17:38:40,072 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 17:38:40,073 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 17:38:40,073 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 17:38:40,073 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-19 17:38:40,073 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:38:40,073 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 17:38:40,073 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 17:38:40,073 INFO L133 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca-2.i_Iteration3_Lasso [2021-12-19 17:38:40,073 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 17:38:40,074 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 17:38:40,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:38:40,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:38:40,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:38:40,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:38:40,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:38:40,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:38:40,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:38:40,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:38:40,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:38:40,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:38:40,311 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:38:40,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:38:40,317 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:38:40,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:38:40,640 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 17:38:40,643 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-19 17:38:40,645 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:38:40,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:38:40,646 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-12-19 17:38:40,662 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-12-19 17:38:40,670 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:38:40,670 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:38:40,671 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:38:40,671 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:38:40,677 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 17:38:40,677 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 17:38:40,678 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-12-19 17:38:40,685 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:38:40,701 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-12-19 17:38:40,702 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:38:40,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:38:40,703 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-12-19 17:38:40,712 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-12-19 17:38:40,720 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:38:40,721 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:38:40,721 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:38:40,721 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:38:40,728 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-12-19 17:38:40,743 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 17:38:40,743 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 17:38:40,775 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-19 17:38:40,857 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2021-12-19 17:38:40,858 INFO L444 ModelExtractionUtils]: 12 out of 40 variables were initially zero. Simplification set additionally 24 variables to zero. [2021-12-19 17:38:40,859 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:38:40,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:38:40,868 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-12-19 17:38:40,924 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-19 17:38:40,940 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-12-19 17:38:40,942 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2021-12-19 17:38:40,942 INFO L513 LassoAnalysis]: Proved termination. [2021-12-19 17:38:40,942 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_SelectionSort_~i~0#1, v_rep(select #length ULTIMATE.start_main_#t~malloc9#1.base)_1) = -4*ULTIMATE.start_SelectionSort_~i~0#1 + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc9#1.base)_1 Supporting invariants [1*ULTIMATE.start_SelectionSort_~a#1.offset >= 0] [2021-12-19 17:38:40,968 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-12-19 17:38:40,979 INFO L297 tatePredicateManager]: 2 out of 4 supporting invariants were superfluous and have been removed [2021-12-19 17:38:41,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:38:41,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:38:41,032 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-19 17:38:41,033 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:38:41,076 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-12-19 17:38:41,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:38:41,095 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-19 17:38:41,095 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:38:41,234 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:38:41,238 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2021-12-19 17:38:41,238 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 4 Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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-12-19 17:38:41,324 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 4. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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 18 states and 24 transitions. Complement of second has 6 states. [2021-12-19 17:38:41,324 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-12-19 17:38:41,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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-12-19 17:38:41,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2021-12-19 17:38:41,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 4 letters. Loop has 7 letters. [2021-12-19 17:38:41,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:38:41,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 11 letters. Loop has 7 letters. [2021-12-19 17:38:41,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:38:41,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 4 letters. Loop has 14 letters. [2021-12-19 17:38:41,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:38:41,330 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 24 transitions. [2021-12-19 17:38:41,333 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-19 17:38:41,336 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 16 states and 22 transitions. [2021-12-19 17:38:41,336 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2021-12-19 17:38:41,336 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2021-12-19 17:38:41,336 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 22 transitions. [2021-12-19 17:38:41,337 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 17:38:41,337 INFO L681 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2021-12-19 17:38:41,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 22 transitions. [2021-12-19 17:38:41,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2021-12-19 17:38:41,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 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-12-19 17:38:41,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 21 transitions. [2021-12-19 17:38:41,340 INFO L704 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2021-12-19 17:38:41,340 INFO L587 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2021-12-19 17:38:41,340 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-19 17:38:41,340 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 21 transitions. [2021-12-19 17:38:41,342 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-19 17:38:41,342 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:38:41,342 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:38:41,342 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2021-12-19 17:38:41,342 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-19 17:38:41,343 INFO L791 eck$LassoCheckResult]: Stem: 171#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 172#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 185#L566 assume !(main_~array_size~0#1 < 1); 180#L566-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;assume { :begin_inline_SelectionSort } true;SelectionSort_#in~a#1.base, SelectionSort_#in~a#1.offset, SelectionSort_#in~array_size#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc SelectionSort_#t~mem4#1, SelectionSort_#t~mem5#1, SelectionSort_#t~pre3#1, SelectionSort_#t~mem6#1, SelectionSort_#t~mem7#1, SelectionSort_#t~pre2#1, SelectionSort_~j~0#1, SelectionSort_~min~0#1, SelectionSort_~temp~0#1, SelectionSort_~a#1.base, SelectionSort_~a#1.offset, SelectionSort_~array_size#1, SelectionSort_~i~0#1;SelectionSort_~a#1.base, SelectionSort_~a#1.offset := SelectionSort_#in~a#1.base, SelectionSort_#in~a#1.offset;SelectionSort_~array_size#1 := SelectionSort_#in~array_size#1;havoc SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 0; 181#L550-3 assume !!(SelectionSort_~i~0#1 < SelectionSort_~array_size#1 - 1);havoc SelectionSort_~j~0#1;havoc SelectionSort_~min~0#1;havoc SelectionSort_~temp~0#1;SelectionSort_~min~0#1 := SelectionSort_~i~0#1;SelectionSort_~j~0#1 := 1 + SelectionSort_~i~0#1; 177#L554-3 [2021-12-19 17:38:41,343 INFO L793 eck$LassoCheckResult]: Loop: 177#L554-3 assume !!(SelectionSort_~j~0#1 < SelectionSort_~array_size#1);call SelectionSort_#t~mem4#1 := read~int(SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~j~0#1, 4);call SelectionSort_#t~mem5#1 := read~int(SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~min~0#1, 4); 173#L556 assume SelectionSort_#t~mem4#1 < SelectionSort_#t~mem5#1;havoc SelectionSort_#t~mem4#1;havoc SelectionSort_#t~mem5#1;SelectionSort_~min~0#1 := SelectionSort_~j~0#1; 174#L554-2 SelectionSort_#t~pre3#1 := 1 + SelectionSort_~j~0#1;SelectionSort_~j~0#1 := 1 + SelectionSort_~j~0#1;havoc SelectionSort_#t~pre3#1; 177#L554-3 [2021-12-19 17:38:41,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:38:41,344 INFO L85 PathProgramCache]: Analyzing trace with hash 28695756, now seen corresponding path program 1 times [2021-12-19 17:38:41,344 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:38:41,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336647150] [2021-12-19 17:38:41,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:38:41,345 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:38:41,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:38:41,367 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:38:41,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:38:41,379 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:38:41,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:38:41,380 INFO L85 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 1 times [2021-12-19 17:38:41,380 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:38:41,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057241624] [2021-12-19 17:38:41,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:38:41,382 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:38:41,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:38:41,404 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:38:41,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:38:41,416 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:38:41,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:38:41,418 INFO L85 PathProgramCache]: Analyzing trace with hash 176800017, now seen corresponding path program 1 times [2021-12-19 17:38:41,418 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:38:41,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246320448] [2021-12-19 17:38:41,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:38:41,419 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:38:41,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:38:41,436 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:38:41,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:38:41,451 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:38:41,706 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 17:38:41,706 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 17:38:41,707 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 17:38:41,707 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 17:38:41,707 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-19 17:38:41,707 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:38:41,707 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 17:38:41,707 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 17:38:41,707 INFO L133 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca-2.i_Iteration4_Lasso [2021-12-19 17:38:41,707 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 17:38:41,707 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 17:38:41,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:38:41,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:38:41,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:38:41,877 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:38:41,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:38:41,881 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:38:41,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:38:41,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:38:41,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:38:41,895 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:38:41,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:38:41,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:38:41,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:38:41,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:38:41,905 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:38:42,159 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 17:38:42,159 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-19 17:38:42,159 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:38:42,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:38:42,162 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-12-19 17:38:42,163 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-12-19 17:38:42,165 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-12-19 17:38:42,171 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:38:42,171 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:38:42,172 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:38:42,172 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:38:42,175 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 17:38:42,175 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 17:38:42,191 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:38:42,217 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-12-19 17:38:42,217 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:38:42,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:38:42,219 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-12-19 17:38:42,224 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-12-19 17:38:42,231 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:38:42,231 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:38:42,231 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:38:42,231 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:38:42,236 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 17:38:42,236 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 17:38:42,244 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-12-19 17:38:42,251 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:38:42,278 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-12-19 17:38:42,278 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:38:42,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:38:42,279 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-12-19 17:38:42,281 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-12-19 17:38:42,283 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-12-19 17:38:42,293 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:38:42,293 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:38:42,293 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:38:42,293 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:38:42,303 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 17:38:42,303 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 17:38:42,320 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-19 17:38:42,355 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2021-12-19 17:38:42,355 INFO L444 ModelExtractionUtils]: 9 out of 40 variables were initially zero. Simplification set additionally 27 variables to zero. [2021-12-19 17:38:42,356 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:38:42,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:38:42,357 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-12-19 17:38:42,358 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-12-19 17:38:42,360 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-19 17:38:42,382 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-19 17:38:42,383 INFO L513 LassoAnalysis]: Proved termination. [2021-12-19 17:38:42,383 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_SelectionSort_~a#1.base)_2, ULTIMATE.start_SelectionSort_~a#1.offset, ULTIMATE.start_SelectionSort_~j~0#1) = 1*v_rep(select #length ULTIMATE.start_SelectionSort_~a#1.base)_2 - 1*ULTIMATE.start_SelectionSort_~a#1.offset - 4*ULTIMATE.start_SelectionSort_~j~0#1 Supporting invariants [] [2021-12-19 17:38:42,406 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-12-19 17:38:42,413 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2021-12-19 17:38:42,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:38:42,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:38:42,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-19 17:38:42,437 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:38:42,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:38:42,452 INFO L263 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-19 17:38:42,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:38:42,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:38:42,474 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-12-19 17:38:42,474 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 21 transitions. cyclomatic complexity: 8 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-12-19 17:38:42,495 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 21 transitions. cyclomatic complexity: 8. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 33 states and 47 transitions. Complement of second has 7 states. [2021-12-19 17:38:42,496 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-12-19 17:38:42,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-12-19 17:38:42,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2021-12-19 17:38:42,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 5 letters. Loop has 3 letters. [2021-12-19 17:38:42,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:38:42,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 8 letters. Loop has 3 letters. [2021-12-19 17:38:42,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:38:42,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 5 letters. Loop has 6 letters. [2021-12-19 17:38:42,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:38:42,498 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 47 transitions. [2021-12-19 17:38:42,505 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-19 17:38:42,506 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 22 states and 30 transitions. [2021-12-19 17:38:42,506 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2021-12-19 17:38:42,506 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2021-12-19 17:38:42,506 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 30 transitions. [2021-12-19 17:38:42,506 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 17:38:42,506 INFO L681 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2021-12-19 17:38:42,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 30 transitions. [2021-12-19 17:38:42,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 15. [2021-12-19 17:38:42,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 14 states have internal predecessors, (20), 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-12-19 17:38:42,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2021-12-19 17:38:42,510 INFO L704 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2021-12-19 17:38:42,510 INFO L587 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2021-12-19 17:38:42,510 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-12-19 17:38:42,510 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2021-12-19 17:38:42,512 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-19 17:38:42,512 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:38:42,512 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:38:42,513 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 17:38:42,513 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-19 17:38:42,513 INFO L791 eck$LassoCheckResult]: Stem: 283#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 284#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 297#L566 assume !(main_~array_size~0#1 < 1); 292#L566-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;assume { :begin_inline_SelectionSort } true;SelectionSort_#in~a#1.base, SelectionSort_#in~a#1.offset, SelectionSort_#in~array_size#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc SelectionSort_#t~mem4#1, SelectionSort_#t~mem5#1, SelectionSort_#t~pre3#1, SelectionSort_#t~mem6#1, SelectionSort_#t~mem7#1, SelectionSort_#t~pre2#1, SelectionSort_~j~0#1, SelectionSort_~min~0#1, SelectionSort_~temp~0#1, SelectionSort_~a#1.base, SelectionSort_~a#1.offset, SelectionSort_~array_size#1, SelectionSort_~i~0#1;SelectionSort_~a#1.base, SelectionSort_~a#1.offset := SelectionSort_#in~a#1.base, SelectionSort_#in~a#1.offset;SelectionSort_~array_size#1 := SelectionSort_#in~array_size#1;havoc SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 0; 293#L550-3 assume !!(SelectionSort_~i~0#1 < SelectionSort_~array_size#1 - 1);havoc SelectionSort_~j~0#1;havoc SelectionSort_~min~0#1;havoc SelectionSort_~temp~0#1;SelectionSort_~min~0#1 := SelectionSort_~i~0#1;SelectionSort_~j~0#1 := 1 + SelectionSort_~i~0#1; 291#L554-3 assume !!(SelectionSort_~j~0#1 < SelectionSort_~array_size#1);call SelectionSort_#t~mem4#1 := read~int(SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~j~0#1, 4);call SelectionSort_#t~mem5#1 := read~int(SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~min~0#1, 4); 287#L556 assume !(SelectionSort_#t~mem4#1 < SelectionSort_#t~mem5#1);havoc SelectionSort_#t~mem4#1;havoc SelectionSort_#t~mem5#1; 288#L554-2 SelectionSort_#t~pre3#1 := 1 + SelectionSort_~j~0#1;SelectionSort_~j~0#1 := 1 + SelectionSort_~j~0#1;havoc SelectionSort_#t~pre3#1; 290#L554-3 assume !(SelectionSort_~j~0#1 < SelectionSort_~array_size#1); 295#L554-4 call SelectionSort_#t~mem6#1 := read~int(SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~i~0#1, 4);SelectionSort_~temp~0#1 := SelectionSort_#t~mem6#1;havoc SelectionSort_#t~mem6#1;call SelectionSort_#t~mem7#1 := read~int(SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~min~0#1, 4);call write~int(SelectionSort_#t~mem7#1, SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~i~0#1, 4);havoc SelectionSort_#t~mem7#1;call write~int(SelectionSort_~temp~0#1, SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~min~0#1, 4); 296#L550-2 SelectionSort_#t~pre2#1 := 1 + SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~i~0#1;havoc SelectionSort_#t~pre2#1; 294#L550-3 assume !!(SelectionSort_~i~0#1 < SelectionSort_~array_size#1 - 1);havoc SelectionSort_~j~0#1;havoc SelectionSort_~min~0#1;havoc SelectionSort_~temp~0#1;SelectionSort_~min~0#1 := SelectionSort_~i~0#1;SelectionSort_~j~0#1 := 1 + SelectionSort_~i~0#1; 289#L554-3 [2021-12-19 17:38:42,513 INFO L793 eck$LassoCheckResult]: Loop: 289#L554-3 assume !!(SelectionSort_~j~0#1 < SelectionSort_~array_size#1);call SelectionSort_#t~mem4#1 := read~int(SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~j~0#1, 4);call SelectionSort_#t~mem5#1 := read~int(SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~min~0#1, 4); 285#L556 assume SelectionSort_#t~mem4#1 < SelectionSort_#t~mem5#1;havoc SelectionSort_#t~mem4#1;havoc SelectionSort_#t~mem5#1;SelectionSort_~min~0#1 := SelectionSort_~j~0#1; 286#L554-2 SelectionSort_#t~pre3#1 := 1 + SelectionSort_~j~0#1;SelectionSort_~j~0#1 := 1 + SelectionSort_~j~0#1;havoc SelectionSort_#t~pre3#1; 289#L554-3 [2021-12-19 17:38:42,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:38:42,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1109754407, now seen corresponding path program 1 times [2021-12-19 17:38:42,516 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:38:42,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933100143] [2021-12-19 17:38:42,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:38:42,517 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:38:42,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:38:42,576 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:38:42,576 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 17:38:42,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933100143] [2021-12-19 17:38:42,576 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933100143] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 17:38:42,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1155140386] [2021-12-19 17:38:42,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:38:42,577 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 17:38:42,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:38:42,580 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-12-19 17:38:42,588 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-12-19 17:38:42,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:38:42,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-19 17:38:42,670 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:38:42,702 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:38:42,703 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 17:38:42,728 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:38:42,729 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1155140386] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 17:38:42,729 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-19 17:38:42,729 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2021-12-19 17:38:42,729 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152706406] [2021-12-19 17:38:42,729 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-19 17:38:42,730 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-19 17:38:42,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:38:42,730 INFO L85 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 2 times [2021-12-19 17:38:42,730 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:38:42,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094949214] [2021-12-19 17:38:42,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:38:42,730 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:38:42,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:38:42,737 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:38:42,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:38:42,741 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:38:42,800 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 17:38:42,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-19 17:38:42,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-19 17:38:42,801 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. cyclomatic complexity: 7 Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 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-12-19 17:38:42,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 17:38:42,844 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2021-12-19 17:38:42,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-19 17:38:42,844 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 38 transitions. [2021-12-19 17:38:42,845 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-19 17:38:42,845 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 26 states and 35 transitions. [2021-12-19 17:38:42,846 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2021-12-19 17:38:42,846 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2021-12-19 17:38:42,846 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 35 transitions. [2021-12-19 17:38:42,846 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 17:38:42,846 INFO L681 BuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2021-12-19 17:38:42,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 35 transitions. [2021-12-19 17:38:42,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 18. [2021-12-19 17:38:42,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 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-12-19 17:38:42,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2021-12-19 17:38:42,848 INFO L704 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2021-12-19 17:38:42,848 INFO L587 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2021-12-19 17:38:42,848 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-12-19 17:38:42,849 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 24 transitions. [2021-12-19 17:38:42,849 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-19 17:38:42,849 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:38:42,849 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:38:42,850 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 17:38:42,850 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-19 17:38:42,850 INFO L791 eck$LassoCheckResult]: Stem: 406#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 407#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 421#L566 assume !(main_~array_size~0#1 < 1); 415#L566-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;assume { :begin_inline_SelectionSort } true;SelectionSort_#in~a#1.base, SelectionSort_#in~a#1.offset, SelectionSort_#in~array_size#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc SelectionSort_#t~mem4#1, SelectionSort_#t~mem5#1, SelectionSort_#t~pre3#1, SelectionSort_#t~mem6#1, SelectionSort_#t~mem7#1, SelectionSort_#t~pre2#1, SelectionSort_~j~0#1, SelectionSort_~min~0#1, SelectionSort_~temp~0#1, SelectionSort_~a#1.base, SelectionSort_~a#1.offset, SelectionSort_~array_size#1, SelectionSort_~i~0#1;SelectionSort_~a#1.base, SelectionSort_~a#1.offset := SelectionSort_#in~a#1.base, SelectionSort_#in~a#1.offset;SelectionSort_~array_size#1 := SelectionSort_#in~array_size#1;havoc SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 0; 416#L550-3 assume !!(SelectionSort_~i~0#1 < SelectionSort_~array_size#1 - 1);havoc SelectionSort_~j~0#1;havoc SelectionSort_~min~0#1;havoc SelectionSort_~temp~0#1;SelectionSort_~min~0#1 := SelectionSort_~i~0#1;SelectionSort_~j~0#1 := 1 + SelectionSort_~i~0#1; 417#L554-3 assume !!(SelectionSort_~j~0#1 < SelectionSort_~array_size#1);call SelectionSort_#t~mem4#1 := read~int(SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~j~0#1, 4);call SelectionSort_#t~mem5#1 := read~int(SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~min~0#1, 4); 423#L556 assume !(SelectionSort_#t~mem4#1 < SelectionSort_#t~mem5#1);havoc SelectionSort_#t~mem4#1;havoc SelectionSort_#t~mem5#1; 413#L554-2 SelectionSort_#t~pre3#1 := 1 + SelectionSort_~j~0#1;SelectionSort_~j~0#1 := 1 + SelectionSort_~j~0#1;havoc SelectionSort_#t~pre3#1; 414#L554-3 assume !!(SelectionSort_~j~0#1 < SelectionSort_~array_size#1);call SelectionSort_#t~mem4#1 := read~int(SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~j~0#1, 4);call SelectionSort_#t~mem5#1 := read~int(SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~min~0#1, 4); 410#L556 assume !(SelectionSort_#t~mem4#1 < SelectionSort_#t~mem5#1);havoc SelectionSort_#t~mem4#1;havoc SelectionSort_#t~mem5#1; 411#L554-2 SelectionSort_#t~pre3#1 := 1 + SelectionSort_~j~0#1;SelectionSort_~j~0#1 := 1 + SelectionSort_~j~0#1;havoc SelectionSort_#t~pre3#1; 422#L554-3 assume !(SelectionSort_~j~0#1 < SelectionSort_~array_size#1); 419#L554-4 call SelectionSort_#t~mem6#1 := read~int(SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~i~0#1, 4);SelectionSort_~temp~0#1 := SelectionSort_#t~mem6#1;havoc SelectionSort_#t~mem6#1;call SelectionSort_#t~mem7#1 := read~int(SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~min~0#1, 4);call write~int(SelectionSort_#t~mem7#1, SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~i~0#1, 4);havoc SelectionSort_#t~mem7#1;call write~int(SelectionSort_~temp~0#1, SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~min~0#1, 4); 420#L550-2 SelectionSort_#t~pre2#1 := 1 + SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~i~0#1;havoc SelectionSort_#t~pre2#1; 418#L550-3 assume !!(SelectionSort_~i~0#1 < SelectionSort_~array_size#1 - 1);havoc SelectionSort_~j~0#1;havoc SelectionSort_~min~0#1;havoc SelectionSort_~temp~0#1;SelectionSort_~min~0#1 := SelectionSort_~i~0#1;SelectionSort_~j~0#1 := 1 + SelectionSort_~i~0#1; 412#L554-3 [2021-12-19 17:38:42,850 INFO L793 eck$LassoCheckResult]: Loop: 412#L554-3 assume !!(SelectionSort_~j~0#1 < SelectionSort_~array_size#1);call SelectionSort_#t~mem4#1 := read~int(SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~j~0#1, 4);call SelectionSort_#t~mem5#1 := read~int(SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~min~0#1, 4); 408#L556 assume SelectionSort_#t~mem4#1 < SelectionSort_#t~mem5#1;havoc SelectionSort_#t~mem4#1;havoc SelectionSort_#t~mem5#1;SelectionSort_~min~0#1 := SelectionSort_~j~0#1; 409#L554-2 SelectionSort_#t~pre3#1 := 1 + SelectionSort_~j~0#1;SelectionSort_~j~0#1 := 1 + SelectionSort_~j~0#1;havoc SelectionSort_#t~pre3#1; 412#L554-3 [2021-12-19 17:38:42,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:38:42,851 INFO L85 PathProgramCache]: Analyzing trace with hash -366799804, now seen corresponding path program 2 times [2021-12-19 17:38:42,851 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:38:42,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643538521] [2021-12-19 17:38:42,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:38:42,851 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:38:42,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:38:42,902 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:38:42,911 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-12-19 17:38:42,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:38:42,919 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:38:42,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:38:42,921 INFO L85 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 3 times [2021-12-19 17:38:42,921 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:38:42,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582010446] [2021-12-19 17:38:42,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:38:42,922 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:38:42,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:38:42,935 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:38:42,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:38:42,941 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:38:42,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:38:42,941 INFO L85 PathProgramCache]: Analyzing trace with hash -936135015, now seen corresponding path program 1 times [2021-12-19 17:38:42,942 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:38:42,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944212922] [2021-12-19 17:38:42,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:38:42,942 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:38:42,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:38:42,957 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:38:42,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:38:42,970 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:38:43,443 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 17:38:43,443 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 17:38:43,443 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 17:38:43,443 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 17:38:43,443 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-19 17:38:43,443 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:38:43,443 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 17:38:43,443 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 17:38:43,443 INFO L133 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca-2.i_Iteration6_Lasso [2021-12-19 17:38:43,443 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 17:38:43,443 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 17:38:43,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:38:43,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:38:43,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:38:43,661 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:38:43,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:38:43,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:38:43,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-12-19 17:38:43,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:38:43,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-12-19 17:38:43,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:38:43,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-12-19 17:38:43,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:38:43,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-12-19 17:38:43,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-12-19 17:38:43,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-12-19 17:38:43,933 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 17:38:43,933 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-19 17:38:43,933 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:38:43,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:38:43,935 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-12-19 17:38:43,942 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-12-19 17:38:43,945 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-12-19 17:38:43,949 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:38:43,949 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:38:43,950 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:38:43,950 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:38:43,950 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:38:43,950 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:38:43,950 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:38:43,951 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:38:43,966 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-12-19 17:38:43,967 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:38:43,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:38:43,968 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-12-19 17:38:43,968 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-12-19 17:38:43,970 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-12-19 17:38:43,976 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:38:43,976 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:38:43,976 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:38:43,976 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:38:43,978 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 17:38:43,978 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 17:38:43,980 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:38:43,998 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2021-12-19 17:38:43,998 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:38:43,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:38:43,999 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-12-19 17:38:44,002 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-12-19 17:38:44,002 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-12-19 17:38:44,009 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:38:44,009 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:38:44,009 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:38:44,009 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:38:44,012 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 17:38:44,012 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 17:38:44,022 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:38:44,038 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-12-19 17:38:44,038 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:38:44,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:38:44,039 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-12-19 17:38:44,040 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-12-19 17:38:44,041 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-12-19 17:38:44,047 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:38:44,048 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:38:44,048 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:38:44,048 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:38:44,058 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 17:38:44,058 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 17:38:44,071 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:38:44,098 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-12-19 17:38:44,098 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:38:44,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:38:44,100 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-12-19 17:38:44,101 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-12-19 17:38:44,103 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-12-19 17:38:44,110 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:38:44,110 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:38:44,110 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:38:44,110 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:38:44,111 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:38:44,111 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:38:44,111 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:38:44,127 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:38:44,155 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-12-19 17:38:44,155 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:38:44,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:38:44,156 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-12-19 17:38:44,157 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-12-19 17:38:44,159 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-12-19 17:38:44,166 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:38:44,166 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:38:44,166 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:38:44,166 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:38:44,174 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 17:38:44,175 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 17:38:44,190 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-19 17:38:44,225 INFO L443 ModelExtractionUtils]: Simplification made 22 calls to the SMT solver. [2021-12-19 17:38:44,226 INFO L444 ModelExtractionUtils]: 9 out of 40 variables were initially zero. Simplification set additionally 28 variables to zero. [2021-12-19 17:38:44,226 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:38:44,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:38:44,235 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-12-19 17:38:44,236 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-12-19 17:38:44,267 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-19 17:38:44,284 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-19 17:38:44,284 INFO L513 LassoAnalysis]: Proved termination. [2021-12-19 17:38:44,284 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_SelectionSort_~array_size#1, ULTIMATE.start_SelectionSort_~j~0#1) = 1*ULTIMATE.start_SelectionSort_~array_size#1 - 1*ULTIMATE.start_SelectionSort_~j~0#1 Supporting invariants [] [2021-12-19 17:38:44,302 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-12-19 17:38:44,315 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2021-12-19 17:38:44,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:38:44,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:38:44,343 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-19 17:38:44,343 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:38:44,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:38:44,392 INFO L263 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-19 17:38:44,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:38:44,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:38:44,411 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-12-19 17:38:44,411 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8 Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-12-19 17:38:44,426 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 35 states and 48 transitions. Complement of second has 7 states. [2021-12-19 17:38:44,426 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-12-19 17:38:44,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-12-19 17:38:44,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2021-12-19 17:38:44,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 15 letters. Loop has 3 letters. [2021-12-19 17:38:44,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:38:44,427 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-19 17:38:44,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:38:44,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:38:44,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-19 17:38:44,457 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:38:44,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:38:44,493 INFO L263 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-19 17:38:44,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:38:44,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:38:44,514 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2021-12-19 17:38:44,514 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8 Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-12-19 17:38:44,526 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 35 states and 48 transitions. Complement of second has 7 states. [2021-12-19 17:38:44,527 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-12-19 17:38:44,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-12-19 17:38:44,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2021-12-19 17:38:44,528 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 15 letters. Loop has 3 letters. [2021-12-19 17:38:44,528 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:38:44,528 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-19 17:38:44,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:38:44,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:38:44,552 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-19 17:38:44,552 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:38:44,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:38:44,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-19 17:38:44,600 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:38:44,606 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-12-19 17:38:44,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:38:44,625 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2021-12-19 17:38:44,626 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8 Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-12-19 17:38:44,643 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 28 states and 39 transitions. Complement of second has 6 states. [2021-12-19 17:38:44,644 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-12-19 17:38:44,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-12-19 17:38:44,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2021-12-19 17:38:44,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 15 letters. Loop has 3 letters. [2021-12-19 17:38:44,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:38:44,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 18 letters. Loop has 3 letters. [2021-12-19 17:38:44,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:38:44,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 15 letters. Loop has 6 letters. [2021-12-19 17:38:44,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:38:44,646 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 39 transitions. [2021-12-19 17:38:44,646 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-12-19 17:38:44,646 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 0 states and 0 transitions. [2021-12-19 17:38:44,647 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2021-12-19 17:38:44,647 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2021-12-19 17:38:44,647 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2021-12-19 17:38:44,647 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-19 17:38:44,647 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-19 17:38:44,647 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-19 17:38:44,647 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-19 17:38:44,647 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-12-19 17:38:44,647 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2021-12-19 17:38:44,647 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-12-19 17:38:44,647 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2021-12-19 17:38:44,653 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 19.12 05:38:44 BoogieIcfgContainer [2021-12-19 17:38:44,653 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-12-19 17:38:44,654 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-19 17:38:44,654 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-19 17:38:44,654 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-19 17:38:44,654 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 05:38:38" (3/4) ... [2021-12-19 17:38:44,657 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-19 17:38:44,657 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-19 17:38:44,657 INFO L158 Benchmark]: Toolchain (without parser) took 6400.94ms. Allocated memory was 86.0MB in the beginning and 155.2MB in the end (delta: 69.2MB). Free memory was 52.7MB in the beginning and 121.3MB in the end (delta: -68.6MB). Peak memory consumption was 570.3kB. Max. memory is 16.1GB. [2021-12-19 17:38:44,658 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 86.0MB. Free memory was 42.7MB in the beginning and 42.7MB in the end (delta: 34.3kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-19 17:38:44,658 INFO L158 Benchmark]: CACSL2BoogieTranslator took 335.76ms. Allocated memory was 86.0MB in the beginning and 104.9MB in the end (delta: 18.9MB). Free memory was 52.6MB in the beginning and 76.0MB in the end (delta: -23.5MB). Peak memory consumption was 7.7MB. Max. memory is 16.1GB. [2021-12-19 17:38:44,658 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.99ms. Allocated memory is still 104.9MB. Free memory was 76.0MB in the beginning and 74.3MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-19 17:38:44,659 INFO L158 Benchmark]: Boogie Preprocessor took 49.12ms. Allocated memory is still 104.9MB. Free memory was 74.3MB in the beginning and 73.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-19 17:38:44,659 INFO L158 Benchmark]: RCFGBuilder took 279.26ms. Allocated memory is still 104.9MB. Free memory was 73.0MB in the beginning and 63.2MB in the end (delta: 9.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-19 17:38:44,659 INFO L158 Benchmark]: BuchiAutomizer took 5687.94ms. Allocated memory was 104.9MB in the beginning and 155.2MB in the end (delta: 50.3MB). Free memory was 62.8MB in the beginning and 122.3MB in the end (delta: -59.5MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-19 17:38:44,660 INFO L158 Benchmark]: Witness Printer took 3.09ms. Allocated memory is still 155.2MB. Free memory was 122.3MB in the beginning and 121.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-19 17:38:44,662 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.22ms. Allocated memory is still 86.0MB. Free memory was 42.7MB in the beginning and 42.7MB in the end (delta: 34.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 335.76ms. Allocated memory was 86.0MB in the beginning and 104.9MB in the end (delta: 18.9MB). Free memory was 52.6MB in the beginning and 76.0MB in the end (delta: -23.5MB). Peak memory consumption was 7.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.99ms. Allocated memory is still 104.9MB. Free memory was 76.0MB in the beginning and 74.3MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 49.12ms. Allocated memory is still 104.9MB. Free memory was 74.3MB in the beginning and 73.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 279.26ms. Allocated memory is still 104.9MB. Free memory was 73.0MB in the beginning and 63.2MB in the end (delta: 9.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 5687.94ms. Allocated memory was 104.9MB in the beginning and 155.2MB in the end (delta: 50.3MB). Free memory was 62.8MB in the beginning and 122.3MB in the end (delta: -59.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.09ms. Allocated memory is still 155.2MB. Free memory was 122.3MB in the beginning and 121.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (3 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -4 * i + unknown-#length-unknown[__builtin_alloca (array_size * sizeof(int))] and consists of 4 locations. One deterministic module has affine ranking function unknown-#length-unknown[a] + -1 * a + -4 * j and consists of 4 locations. One nondeterministic module has affine ranking function array_size + -1 * j and consists of 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.6s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 4.5s. Construction of modules took 0.0s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 16 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 18 states and ocurred in iteration 5. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/1 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 77 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 73 mSDsluCounter, 116 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 33 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 96 IncrementalHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 83 mSDtfsCounter, 96 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital182 mio100 ax110 hnf99 lsp87 ukn78 mio100 lsp66 div100 bol100 ite100 ukn100 eq174 hnf91 smp98 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 40ms VariablesStem: 5 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2021-12-19 17:38:44,695 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-12-19 17:38:44,900 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... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE