./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-memsafety/selectionsort-alloca-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- 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/array-memsafety/selectionsort-alloca-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1c36df5364345a00481880384557a6da7ee9f3df41e2ea49d72bfaffe4fac7a5 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-19 20:29:33,569 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-19 20:29:33,583 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-19 20:29:33,630 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-19 20:29:33,631 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-19 20:29:33,635 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-19 20:29:33,636 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-19 20:29:33,639 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-19 20:29:33,641 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-19 20:29:33,647 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-19 20:29:33,647 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-19 20:29:33,649 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-19 20:29:33,649 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-19 20:29:33,651 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-19 20:29:33,653 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-19 20:29:33,657 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-19 20:29:33,658 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-19 20:29:33,659 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-19 20:29:33,660 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-19 20:29:33,662 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-19 20:29:33,666 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-19 20:29:33,667 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-19 20:29:33,668 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-19 20:29:33,669 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-19 20:29:33,673 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-19 20:29:33,673 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-19 20:29:33,673 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-19 20:29:33,674 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-19 20:29:33,675 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-19 20:29:33,675 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-19 20:29:33,676 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-19 20:29:33,677 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-19 20:29:33,678 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-19 20:29:33,679 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-19 20:29:33,680 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-19 20:29:33,680 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-19 20:29:33,681 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-19 20:29:33,681 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-19 20:29:33,681 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-19 20:29:33,682 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-19 20:29:33,682 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-19 20:29:33,683 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-12-19 20:29:33,720 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-19 20:29:33,720 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-19 20:29:33,720 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-19 20:29:33,721 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-19 20:29:33,722 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-19 20:29:33,722 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-19 20:29:33,722 INFO L138 SettingsManager]: * Use SBE=true [2021-12-19 20:29:33,722 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-19 20:29:33,722 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-19 20:29:33,723 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-19 20:29:33,723 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-19 20:29:33,724 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-19 20:29:33,724 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-19 20:29:33,724 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-19 20:29:33,724 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-19 20:29:33,724 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-19 20:29:33,724 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-19 20:29:33,725 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-19 20:29:33,725 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-19 20:29:33,725 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-19 20:29:33,725 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-19 20:29:33,725 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-19 20:29:33,725 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-19 20:29:33,726 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-19 20:29:33,727 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-19 20:29:33,727 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-19 20:29:33,727 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-19 20:29:33,727 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-19 20:29:33,727 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-19 20:29:33,728 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-19 20:29:33,728 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-19 20:29:33,728 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-19 20:29:33,729 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-19 20:29:33,729 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1c36df5364345a00481880384557a6da7ee9f3df41e2ea49d72bfaffe4fac7a5 [2021-12-19 20:29:33,978 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-19 20:29:34,002 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-19 20:29:34,004 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-19 20:29:34,005 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-19 20:29:34,006 INFO L275 PluginConnector]: CDTParser initialized [2021-12-19 20:29:34,006 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/selectionsort-alloca-1.i [2021-12-19 20:29:34,066 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c926d51a0/eab0bc4800f14207b72d32bf6c72ac12/FLAGf926bcb71 [2021-12-19 20:29:34,586 INFO L306 CDTParser]: Found 1 translation units. [2021-12-19 20:29:34,587 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/selectionsort-alloca-1.i [2021-12-19 20:29:34,595 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c926d51a0/eab0bc4800f14207b72d32bf6c72ac12/FLAGf926bcb71 [2021-12-19 20:29:35,084 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c926d51a0/eab0bc4800f14207b72d32bf6c72ac12 [2021-12-19 20:29:35,087 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-19 20:29:35,088 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-19 20:29:35,089 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-19 20:29:35,089 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-19 20:29:35,098 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-19 20:29:35,099 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 08:29:35" (1/1) ... [2021-12-19 20:29:35,100 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@433382aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 08:29:35, skipping insertion in model container [2021-12-19 20:29:35,100 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 08:29:35" (1/1) ... [2021-12-19 20:29:35,108 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-19 20:29:35,139 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-19 20:29:35,364 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-19 20:29:35,370 INFO L203 MainTranslator]: Completed pre-run [2021-12-19 20:29:35,410 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-19 20:29:35,438 INFO L208 MainTranslator]: Completed translation [2021-12-19 20:29:35,438 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 08:29:35 WrapperNode [2021-12-19 20:29:35,440 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-19 20:29:35,441 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-19 20:29:35,441 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-19 20:29:35,441 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-19 20:29:35,447 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 08:29:35" (1/1) ... [2021-12-19 20:29:35,466 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 08:29:35" (1/1) ... [2021-12-19 20:29:35,487 INFO L137 Inliner]: procedures = 116, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 66 [2021-12-19 20:29:35,488 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-19 20:29:35,489 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-19 20:29:35,489 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-19 20:29:35,489 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-19 20:29:35,495 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 08:29:35" (1/1) ... [2021-12-19 20:29:35,495 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 08:29:35" (1/1) ... [2021-12-19 20:29:35,507 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 08:29:35" (1/1) ... [2021-12-19 20:29:35,508 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 08:29:35" (1/1) ... [2021-12-19 20:29:35,515 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 08:29:35" (1/1) ... [2021-12-19 20:29:35,522 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 08:29:35" (1/1) ... [2021-12-19 20:29:35,524 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 08:29:35" (1/1) ... [2021-12-19 20:29:35,528 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-19 20:29:35,531 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-19 20:29:35,531 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-19 20:29:35,532 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-19 20:29:35,533 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 08:29:35" (1/1) ... [2021-12-19 20:29:35,540 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:29:35,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:29:35,559 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 20:29:35,572 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 20:29:35,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-19 20:29:35,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-19 20:29:35,601 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-19 20:29:35,601 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-19 20:29:35,602 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-19 20:29:35,602 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-19 20:29:35,690 INFO L236 CfgBuilder]: Building ICFG [2021-12-19 20:29:35,691 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-19 20:29:35,778 INFO L277 CfgBuilder]: Performing block encoding [2021-12-19 20:29:35,782 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-19 20:29:35,782 INFO L301 CfgBuilder]: Removed 3 assume(true) statements. [2021-12-19 20:29:35,784 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 08:29:35 BoogieIcfgContainer [2021-12-19 20:29:35,784 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-19 20:29:35,785 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-19 20:29:35,785 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-19 20:29:35,789 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-19 20:29:35,790 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-19 20:29:35,790 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.12 08:29:35" (1/3) ... [2021-12-19 20:29:35,791 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@74928c7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.12 08:29:35, skipping insertion in model container [2021-12-19 20:29:35,791 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-19 20:29:35,791 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 08:29:35" (2/3) ... [2021-12-19 20:29:35,791 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@74928c7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.12 08:29:35, skipping insertion in model container [2021-12-19 20:29:35,792 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-19 20:29:35,792 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 08:29:35" (3/3) ... [2021-12-19 20:29:35,793 INFO L388 chiAutomizerObserver]: Analyzing ICFG selectionsort-alloca-1.i [2021-12-19 20:29:35,860 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-19 20:29:35,860 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-19 20:29:35,860 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-19 20:29:35,860 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-19 20:29:35,860 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-19 20:29:35,861 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-19 20:29:35,861 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-19 20:29:35,861 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-19 20:29:35,872 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 17 states, 16 states have (on average 1.5) internal successors, (24), 16 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 20:29:35,886 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2021-12-19 20:29:35,886 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 20:29:35,887 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 20:29:35,891 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2021-12-19 20:29:35,891 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-19 20:29:35,892 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-19 20:29:35,892 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 17 states, 16 states have (on average 1.5) internal successors, (24), 16 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 20:29:35,893 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2021-12-19 20:29:35,893 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 20:29:35,894 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 20:29:35,894 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2021-12-19 20:29:35,894 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-19 20:29:35,899 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; 10#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_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, 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#L531true assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 15#L531-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;main_~i~1#1 := 0; 14#L536-3true [2021-12-19 20:29:35,899 INFO L793 eck$LassoCheckResult]: Loop: 14#L536-3true assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 5#L536-2true main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 14#L536-3true [2021-12-19 20:29:35,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:29:35,904 INFO L85 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2021-12-19 20:29:35,912 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:29:35,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255488632] [2021-12-19 20:29:35,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:29:35,913 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:29:36,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:29:36,033 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:29:36,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:29:36,076 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:29:36,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:29:36,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2021-12-19 20:29:36,079 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:29:36,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273741139] [2021-12-19 20:29:36,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:29:36,080 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:29:36,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:29:36,099 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:29:36,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:29:36,111 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:29:36,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:29:36,113 INFO L85 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2021-12-19 20:29:36,113 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:29:36,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544271336] [2021-12-19 20:29:36,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:29:36,114 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:29:36,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:29:36,142 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:29:36,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:29:36,155 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:29:36,464 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 20:29:36,465 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 20:29:36,465 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 20:29:36,465 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 20:29:36,465 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-19 20:29:36,466 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:29:36,466 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 20:29:36,466 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 20:29:36,466 INFO L133 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca-1.i_Iteration1_Lasso [2021-12-19 20:29:36,466 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 20:29:36,466 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 20:29:36,485 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 20:29:36,504 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 20:29:36,510 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 20:29:36,513 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 20:29:36,515 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 20:29:36,618 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 20:29:36,622 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 20:29:36,625 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 20:29:36,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:29:36,884 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 20:29:36,888 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-19 20:29:36,890 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:29:36,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:29:36,894 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 20:29:36,895 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 20:29:36,907 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 20:29:36,915 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:29:36,915 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:29:36,916 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:29:36,916 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:29:36,916 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:29:36,918 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:29:36,918 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:29:36,932 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:29:36,957 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 20:29:36,957 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:29:36,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:29:36,958 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 20:29:36,964 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 20:29:36,971 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:29:36,971 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:29:36,972 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:29:36,972 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:29:36,977 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:29:36,977 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:29:36,980 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 20:29:36,995 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:29:37,017 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 20:29:37,017 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:29:37,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:29:37,019 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 20:29:37,024 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 20:29:37,024 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:29:37,030 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:29:37,030 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:29:37,030 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:29:37,030 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:29:37,030 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:29:37,031 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:29:37,031 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:29:37,043 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:29:37,059 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 20:29:37,060 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:29:37,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:29:37,061 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 20:29:37,063 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 20:29:37,064 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 20:29:37,071 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:29:37,072 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:29:37,072 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:29:37,072 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:29:37,074 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:29:37,074 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:29:37,095 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:29:37,119 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 20:29:37,120 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:29:37,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:29:37,121 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 20:29:37,129 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 20:29:37,130 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 20:29:37,136 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:29:37,136 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:29:37,136 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:29:37,136 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:29:37,136 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:29:37,137 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:29:37,137 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:29:37,140 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:29:37,155 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 20:29:37,155 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:29:37,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:29:37,157 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 20:29:37,161 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 20:29:37,163 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:29:37,171 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:29:37,172 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:29:37,172 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:29:37,172 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:29:37,176 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:29:37,176 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:29:37,199 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:29:37,216 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 20:29:37,216 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:29:37,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:29:37,217 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 20:29:37,218 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 20:29:37,220 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 20:29:37,226 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:29:37,226 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:29:37,226 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:29:37,226 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:29:37,233 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:29:37,233 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:29:37,263 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:29:37,281 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 20:29:37,281 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:29:37,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:29:37,282 INFO L229 MonitoredProcess]: Starting monitored process 9 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 20:29:37,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2021-12-19 20:29:37,285 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 20:29:37,291 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:29:37,291 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:29:37,291 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:29:37,291 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:29:37,295 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:29:37,295 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:29:37,323 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:29:37,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2021-12-19 20:29:37,348 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:29:37,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:29:37,350 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 20:29:37,351 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 20:29:37,352 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 20:29:37,360 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:29:37,360 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:29:37,360 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:29:37,360 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:29:37,360 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:29:37,361 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:29:37,361 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:29:37,381 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:29:37,405 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 20:29:37,406 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:29:37,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:29:37,407 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 20:29:37,415 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 20:29:37,416 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 20:29:37,425 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:29:37,425 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:29:37,425 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:29:37,425 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:29:37,438 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:29:37,438 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:29:37,454 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-19 20:29:37,528 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2021-12-19 20:29:37,529 INFO L444 ModelExtractionUtils]: 9 out of 22 variables were initially zero. Simplification set additionally 8 variables to zero. [2021-12-19 20:29:37,530 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:29:37,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:29:37,559 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 20:29:37,599 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 20:29:37,600 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-19 20:29:37,612 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2021-12-19 20:29:37,612 INFO L513 LassoAnalysis]: Proved termination. [2021-12-19 20:29:37,613 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1#1, v_rep(select #length ULTIMATE.start_main_#t~malloc9#1.base)_1) = -2*ULTIMATE.start_main_~i~1#1 + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc9#1.base)_1 Supporting invariants [1*v_rep(select #length ULTIMATE.start_main_#t~malloc9#1.base)_1 - 2*ULTIMATE.start_main_~array_size~0#1 >= 0] [2021-12-19 20:29:37,628 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 20:29:37,637 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2021-12-19 20:29:37,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:29:37,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:29:37,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-19 20:29:37,686 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:29:37,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:29:37,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-19 20:29:37,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:29:37,766 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 20:29:37,766 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 20:29:37,790 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2021-12-19 20:29:37,791 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 17 states, 16 states have (on average 1.5) internal successors, (24), 16 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) Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:29:37,849 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 17 states, 16 states have (on average 1.5) internal successors, (24), 16 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). Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 38 states and 56 transitions. Complement of second has 9 states. [2021-12-19 20:29:37,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2021-12-19 20:29:37,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:29:37,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2021-12-19 20:29:37,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 36 transitions. Stem has 4 letters. Loop has 2 letters. [2021-12-19 20:29:37,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:29:37,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 36 transitions. Stem has 6 letters. Loop has 2 letters. [2021-12-19 20:29:37,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:29:37,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 36 transitions. Stem has 4 letters. Loop has 4 letters. [2021-12-19 20:29:37,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:29:37,858 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 56 transitions. [2021-12-19 20:29:37,860 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2021-12-19 20:29:37,863 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 14 states and 19 transitions. [2021-12-19 20:29:37,864 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2021-12-19 20:29:37,864 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2021-12-19 20:29:37,864 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2021-12-19 20:29:37,864 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-19 20:29:37,865 INFO L681 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2021-12-19 20:29:37,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2021-12-19 20:29:37,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2021-12-19 20:29:37,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:29:37,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2021-12-19 20:29:37,883 INFO L704 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2021-12-19 20:29:37,883 INFO L587 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2021-12-19 20:29:37,883 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-19 20:29:37,883 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2021-12-19 20:29:37,884 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2021-12-19 20:29:37,884 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 20:29:37,884 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 20:29:37,885 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-12-19 20:29:37,885 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-12-19 20:29:37,885 INFO L791 eck$LassoCheckResult]: Stem: 125#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 126#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_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, 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; 134#L531 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 135#L531-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;main_~i~1#1 := 0; 138#L536-3 assume !(main_~i~1#1 < main_~array_size~0#1); 129#L536-4 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; 130#L515-3 [2021-12-19 20:29:37,885 INFO L793 eck$LassoCheckResult]: Loop: 130#L515-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; 131#L519-3 assume !(SelectionSort_~j~0#1 < SelectionSort_~array_size#1); 136#L519-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); 132#L515-2 SelectionSort_#t~pre2#1 := 1 + SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~i~0#1;havoc SelectionSort_#t~pre2#1; 130#L515-3 [2021-12-19 20:29:37,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:29:37,886 INFO L85 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 1 times [2021-12-19 20:29:37,886 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:29:37,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471615387] [2021-12-19 20:29:37,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:29:37,887 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:29:37,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:29:37,928 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 20:29:37,928 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 20:29:37,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471615387] [2021-12-19 20:29:37,929 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471615387] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 20:29:37,929 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 20:29:37,929 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-19 20:29:37,930 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679391384] [2021-12-19 20:29:37,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 20:29:37,932 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-19 20:29:37,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:29:37,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1884201, now seen corresponding path program 1 times [2021-12-19 20:29:37,932 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:29:37,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803726087] [2021-12-19 20:29:37,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:29:37,933 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:29:37,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:29:37,949 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 20:29:37,949 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 20:29:37,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803726087] [2021-12-19 20:29:37,950 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803726087] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 20:29:37,950 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 20:29:37,950 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-19 20:29:37,950 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828492100] [2021-12-19 20:29:37,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 20:29:37,950 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-19 20:29:37,951 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 20:29:37,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-19 20:29:37,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-19 20:29:37,954 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. cyclomatic complexity: 7 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 20:29:37,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 20:29:37,966 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2021-12-19 20:29:37,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-19 20:29:37,967 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 20 transitions. [2021-12-19 20:29:37,968 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2021-12-19 20:29:37,968 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 20 transitions. [2021-12-19 20:29:37,968 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2021-12-19 20:29:37,968 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2021-12-19 20:29:37,969 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 20 transitions. [2021-12-19 20:29:37,969 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-19 20:29:37,969 INFO L681 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2021-12-19 20:29:37,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 20 transitions. [2021-12-19 20:29:37,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2021-12-19 20:29:37,970 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 20:29:37,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2021-12-19 20:29:37,971 INFO L704 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2021-12-19 20:29:37,971 INFO L587 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2021-12-19 20:29:37,971 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-19 20:29:37,971 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2021-12-19 20:29:37,971 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2021-12-19 20:29:37,971 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 20:29:37,972 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 20:29:37,972 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-12-19 20:29:37,972 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-19 20:29:37,972 INFO L791 eck$LassoCheckResult]: Stem: 162#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 163#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_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, 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; 172#L531 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 173#L531-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;main_~i~1#1 := 0; 175#L536-3 assume !(main_~i~1#1 < main_~array_size~0#1); 166#L536-4 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; 167#L515-3 [2021-12-19 20:29:37,972 INFO L793 eck$LassoCheckResult]: Loop: 167#L515-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; 169#L519-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); 174#L521 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; 170#L519-2 SelectionSort_#t~pre3#1 := 1 + SelectionSort_~j~0#1;SelectionSort_~j~0#1 := 1 + SelectionSort_~j~0#1;havoc SelectionSort_#t~pre3#1; 171#L519-3 assume !(SelectionSort_~j~0#1 < SelectionSort_~array_size#1); 176#L519-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); 168#L515-2 SelectionSort_#t~pre2#1 := 1 + SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~i~0#1;havoc SelectionSort_#t~pre2#1; 167#L515-3 [2021-12-19 20:29:37,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:29:37,973 INFO L85 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 2 times [2021-12-19 20:29:37,973 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:29:37,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127295631] [2021-12-19 20:29:37,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:29:37,974 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:29:37,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:29:38,002 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 20:29:38,003 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 20:29:38,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127295631] [2021-12-19 20:29:38,003 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127295631] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 20:29:38,003 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 20:29:38,003 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-19 20:29:38,004 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225014176] [2021-12-19 20:29:38,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 20:29:38,004 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-19 20:29:38,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:29:38,004 INFO L85 PathProgramCache]: Analyzing trace with hash 347385690, now seen corresponding path program 1 times [2021-12-19 20:29:38,005 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:29:38,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555203423] [2021-12-19 20:29:38,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:29:38,005 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:29:38,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:29:38,014 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:29:38,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:29:38,024 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:29:38,192 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 20:29:38,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-19 20:29:38,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-19 20:29:38,192 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. cyclomatic complexity: 7 Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:29:38,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 20:29:38,210 INFO L93 Difference]: Finished difference Result 16 states and 20 transitions. [2021-12-19 20:29:38,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-19 20:29:38,211 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 20 transitions. [2021-12-19 20:29:38,212 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2021-12-19 20:29:38,212 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 20 transitions. [2021-12-19 20:29:38,212 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2021-12-19 20:29:38,212 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2021-12-19 20:29:38,212 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 20 transitions. [2021-12-19 20:29:38,213 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-19 20:29:38,213 INFO L681 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2021-12-19 20:29:38,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 20 transitions. [2021-12-19 20:29:38,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2021-12-19 20:29:38,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 14 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 20:29:38,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2021-12-19 20:29:38,214 INFO L704 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2021-12-19 20:29:38,214 INFO L587 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2021-12-19 20:29:38,214 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-19 20:29:38,214 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2021-12-19 20:29:38,215 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2021-12-19 20:29:38,215 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 20:29:38,215 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 20:29:38,215 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 20:29:38,215 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-19 20:29:38,216 INFO L791 eck$LassoCheckResult]: Stem: 200#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 201#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_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, 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; 210#L531 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 211#L531-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;main_~i~1#1 := 0; 213#L536-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 202#L536-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 203#L536-3 assume !(main_~i~1#1 < main_~array_size~0#1); 204#L536-4 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; 205#L515-3 [2021-12-19 20:29:38,216 INFO L793 eck$LassoCheckResult]: Loop: 205#L515-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; 206#L519-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); 212#L521 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; 208#L519-2 SelectionSort_#t~pre3#1 := 1 + SelectionSort_~j~0#1;SelectionSort_~j~0#1 := 1 + SelectionSort_~j~0#1;havoc SelectionSort_#t~pre3#1; 209#L519-3 assume !(SelectionSort_~j~0#1 < SelectionSort_~array_size#1); 214#L519-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); 207#L515-2 SelectionSort_#t~pre2#1 := 1 + SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~i~0#1;havoc SelectionSort_#t~pre2#1; 205#L515-3 [2021-12-19 20:29:38,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:29:38,216 INFO L85 PathProgramCache]: Analyzing trace with hash 176793839, now seen corresponding path program 1 times [2021-12-19 20:29:38,216 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:29:38,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348727459] [2021-12-19 20:29:38,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:29:38,217 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:29:38,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:29:38,227 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:29:38,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:29:38,236 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:29:38,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:29:38,236 INFO L85 PathProgramCache]: Analyzing trace with hash 347385690, now seen corresponding path program 2 times [2021-12-19 20:29:38,237 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:29:38,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537442949] [2021-12-19 20:29:38,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:29:38,237 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:29:38,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:29:38,244 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:29:38,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:29:38,252 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:29:38,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:29:38,253 INFO L85 PathProgramCache]: Analyzing trace with hash 651542188, now seen corresponding path program 1 times [2021-12-19 20:29:38,253 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:29:38,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645153962] [2021-12-19 20:29:38,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:29:38,253 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:29:38,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:29:38,322 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-19 20:29:38,322 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 20:29:38,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645153962] [2021-12-19 20:29:38,322 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645153962] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 20:29:38,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2051237072] [2021-12-19 20:29:38,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:29:38,323 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 20:29:38,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:29:38,324 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-19 20:29:38,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-12-19 20:29:38,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:29:38,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-19 20:29:38,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:29:38,453 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-19 20:29:38,454 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 20:29:38,495 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-19 20:29:38,496 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2051237072] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 20:29:38,496 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-19 20:29:38,496 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2021-12-19 20:29:38,496 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858974830] [2021-12-19 20:29:38,497 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-19 20:29:38,648 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 20:29:38,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-19 20:29:38,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-19 20:29:38,649 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. cyclomatic complexity: 6 Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 20:29:38,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 20:29:38,721 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2021-12-19 20:29:38,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-19 20:29:38,722 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 30 transitions. [2021-12-19 20:29:38,723 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2021-12-19 20:29:38,724 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 18 states and 21 transitions. [2021-12-19 20:29:38,724 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2021-12-19 20:29:38,724 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2021-12-19 20:29:38,724 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 21 transitions. [2021-12-19 20:29:38,724 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-19 20:29:38,724 INFO L681 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2021-12-19 20:29:38,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 21 transitions. [2021-12-19 20:29:38,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2021-12-19 20:29:38,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 16 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 20:29:38,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2021-12-19 20:29:38,725 INFO L704 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2021-12-19 20:29:38,725 INFO L587 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2021-12-19 20:29:38,725 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-12-19 20:29:38,726 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2021-12-19 20:29:38,726 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2021-12-19 20:29:38,726 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 20:29:38,726 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 20:29:38,726 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2021-12-19 20:29:38,726 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-19 20:29:38,727 INFO L791 eck$LassoCheckResult]: Stem: 346#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 347#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_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, 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; 356#L531 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 357#L531-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;main_~i~1#1 := 0; 359#L536-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 360#L536-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 361#L536-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 348#L536-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 349#L536-3 assume !(main_~i~1#1 < main_~array_size~0#1); 350#L536-4 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; 351#L515-3 [2021-12-19 20:29:38,727 INFO L793 eck$LassoCheckResult]: Loop: 351#L515-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; 352#L519-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); 358#L521 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; 354#L519-2 SelectionSort_#t~pre3#1 := 1 + SelectionSort_~j~0#1;SelectionSort_~j~0#1 := 1 + SelectionSort_~j~0#1;havoc SelectionSort_#t~pre3#1; 355#L519-3 assume !(SelectionSort_~j~0#1 < SelectionSort_~array_size#1); 362#L519-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); 353#L515-2 SelectionSort_#t~pre2#1 := 1 + SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~i~0#1;havoc SelectionSort_#t~pre2#1; 351#L515-3 [2021-12-19 20:29:38,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:29:38,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1899756335, now seen corresponding path program 2 times [2021-12-19 20:29:38,727 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:29:38,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724113894] [2021-12-19 20:29:38,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:29:38,727 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:29:38,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:29:38,737 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:29:38,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:29:38,747 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:29:38,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:29:38,747 INFO L85 PathProgramCache]: Analyzing trace with hash 347385690, now seen corresponding path program 3 times [2021-12-19 20:29:38,747 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:29:38,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818689889] [2021-12-19 20:29:38,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:29:38,748 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:29:38,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:29:38,754 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:29:38,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:29:38,762 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:29:38,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:29:38,762 INFO L85 PathProgramCache]: Analyzing trace with hash 219717770, now seen corresponding path program 2 times [2021-12-19 20:29:38,762 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:29:38,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090332860] [2021-12-19 20:29:38,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:29:38,763 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:29:38,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:29:38,778 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:29:38,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:29:38,794 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:29:39,241 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 20:29:39,241 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 20:29:39,241 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 20:29:39,241 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 20:29:39,241 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-19 20:29:39,241 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:29:39,241 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 20:29:39,241 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 20:29:39,241 INFO L133 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca-1.i_Iteration5_Lasso [2021-12-19 20:29:39,241 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 20:29:39,241 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 20:29:39,245 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 20:29:39,247 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 20:29:39,249 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 20:29:39,251 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 20:29:39,496 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 20:29:39,500 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 20:29:39,503 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 20:29:39,505 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 20:29:39,507 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 20:29:39,508 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 20:29:39,510 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 20:29:39,512 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 20:29:39,514 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 20:29:39,516 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 20:29:39,518 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 20:29:39,520 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 20:29:39,877 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 20:29:39,877 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-19 20:29:39,877 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:29:39,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:29:39,880 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 20:29:39,920 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 20:29:39,921 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 20:29:39,930 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:29:39,930 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:29:39,931 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:29:39,931 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:29:39,931 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:29:39,931 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:29:39,931 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:29:39,937 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:29:39,952 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 20:29:39,952 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:29:39,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:29:39,953 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 20:29:39,953 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 20:29:39,955 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 20:29:39,961 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:29:39,961 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:29:39,961 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:29:39,961 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:29:39,963 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:29:39,963 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:29:39,983 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:29:39,999 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 20:29:40,000 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:29:40,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:29:40,000 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 20:29:40,001 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 20:29:40,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 20:29:40,008 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:29:40,008 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:29:40,009 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:29:40,009 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:29:40,009 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:29:40,011 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:29:40,011 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:29:40,012 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:29:40,026 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 20:29:40,027 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:29:40,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:29:40,028 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:29:40,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2021-12-19 20:29:40,030 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 20:29:40,037 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:29:40,037 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:29:40,037 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:29:40,037 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:29:40,041 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:29:40,041 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:29:40,075 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:29:40,100 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2021-12-19 20:29:40,100 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:29:40,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:29:40,101 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:29:40,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2021-12-19 20:29:40,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 20:29:40,109 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:29:40,109 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:29:40,109 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:29:40,109 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:29:40,113 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:29:40,113 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:29:40,115 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:29:40,132 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2021-12-19 20:29:40,132 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:29:40,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:29:40,133 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:29:40,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2021-12-19 20:29:40,135 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 20:29:40,143 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:29:40,143 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:29:40,143 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:29:40,143 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:29:40,149 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:29:40,149 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:29:40,163 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:29:40,180 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2021-12-19 20:29:40,180 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:29:40,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:29:40,181 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:29:40,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2021-12-19 20:29:40,184 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 20:29:40,190 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:29:40,190 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:29:40,190 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:29:40,190 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:29:40,199 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:29:40,199 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:29:40,227 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-19 20:29:40,275 INFO L443 ModelExtractionUtils]: Simplification made 22 calls to the SMT solver. [2021-12-19 20:29:40,276 INFO L444 ModelExtractionUtils]: 13 out of 46 variables were initially zero. Simplification set additionally 30 variables to zero. [2021-12-19 20:29:40,276 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:29:40,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:29:40,283 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:29:40,290 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-19 20:29:40,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2021-12-19 20:29:40,308 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-19 20:29:40,308 INFO L513 LassoAnalysis]: Proved termination. [2021-12-19 20:29:40,308 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_SelectionSort_~array_size#1, ULTIMATE.start_SelectionSort_~i~0#1) = 1*ULTIMATE.start_SelectionSort_~array_size#1 - 1*ULTIMATE.start_SelectionSort_~i~0#1 Supporting invariants [] [2021-12-19 20:29:40,331 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2021-12-19 20:29:40,343 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2021-12-19 20:29:40,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:29:40,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:29:40,369 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-19 20:29:40,370 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:29:40,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:29:40,400 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-19 20:29:40,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:29:40,438 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-19 20:29:40,439 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 20:29:40,439 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 20 transitions. cyclomatic complexity: 5 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 20:29:40,459 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 20 transitions. cyclomatic complexity: 5. 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 24 states and 30 transitions. Complement of second has 4 states. [2021-12-19 20:29:40,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2021-12-19 20:29:40,460 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 20:29:40,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2021-12-19 20:29:40,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 10 letters. Loop has 7 letters. [2021-12-19 20:29:40,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:29:40,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 17 letters. Loop has 7 letters. [2021-12-19 20:29:40,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:29:40,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 10 letters. Loop has 14 letters. [2021-12-19 20:29:40,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:29:40,462 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 30 transitions. [2021-12-19 20:29:40,462 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-19 20:29:40,463 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 22 states and 28 transitions. [2021-12-19 20:29:40,463 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2021-12-19 20:29:40,463 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2021-12-19 20:29:40,463 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 28 transitions. [2021-12-19 20:29:40,463 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 20:29:40,463 INFO L681 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2021-12-19 20:29:40,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 28 transitions. [2021-12-19 20:29:40,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2021-12-19 20:29:40,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:29:40,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2021-12-19 20:29:40,465 INFO L704 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2021-12-19 20:29:40,465 INFO L587 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2021-12-19 20:29:40,465 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-12-19 20:29:40,466 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 27 transitions. [2021-12-19 20:29:40,466 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-19 20:29:40,466 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 20:29:40,466 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 20:29:40,467 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 20:29:40,467 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-19 20:29:40,467 INFO L791 eck$LassoCheckResult]: Stem: 482#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 483#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_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, 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; 495#L531 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 496#L531-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;main_~i~1#1 := 0; 499#L536-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 484#L536-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 485#L536-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 500#L536-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 502#L536-3 assume !(main_~i~1#1 < main_~array_size~0#1); 486#L536-4 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; 487#L515-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; 489#L519-3 [2021-12-19 20:29:40,467 INFO L793 eck$LassoCheckResult]: Loop: 489#L519-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); 497#L521 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; 492#L519-2 SelectionSort_#t~pre3#1 := 1 + SelectionSort_~j~0#1;SelectionSort_~j~0#1 := 1 + SelectionSort_~j~0#1;havoc SelectionSort_#t~pre3#1; 489#L519-3 [2021-12-19 20:29:40,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:29:40,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1237095790, now seen corresponding path program 1 times [2021-12-19 20:29:40,468 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:29:40,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568886076] [2021-12-19 20:29:40,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:29:40,468 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:29:40,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:29:40,478 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:29:40,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:29:40,489 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:29:40,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:29:40,491 INFO L85 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 1 times [2021-12-19 20:29:40,491 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:29:40,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027175967] [2021-12-19 20:29:40,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:29:40,492 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:29:40,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:29:40,496 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:29:40,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:29:40,504 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:29:40,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:29:40,505 INFO L85 PathProgramCache]: Analyzing trace with hash -793648259, now seen corresponding path program 1 times [2021-12-19 20:29:40,506 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:29:40,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718568919] [2021-12-19 20:29:40,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:29:40,508 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:29:40,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:29:40,522 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:29:40,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:29:40,540 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:29:40,887 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 20:29:40,888 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 20:29:40,888 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 20:29:40,888 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 20:29:40,888 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-19 20:29:40,888 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:29:40,888 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 20:29:40,888 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 20:29:40,888 INFO L133 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca-1.i_Iteration6_Lasso [2021-12-19 20:29:40,888 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 20:29:40,888 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 20:29:40,891 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 20:29:41,071 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2021-12-19 20:29:41,104 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 20:29:41,106 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 20:29:41,108 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 20:29:41,109 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 20:29:41,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:29:41,112 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 20:29:41,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:29:41,115 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 20:29:41,117 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 20:29:41,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:29:41,120 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 20:29:41,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:29:41,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:29:41,126 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 20:29:41,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:29:41,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:29:41,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:29:41,421 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 20:29:41,422 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-19 20:29:41,422 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:29:41,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:29:41,425 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:29:41,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2021-12-19 20:29:41,430 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 20:29:41,436 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:29:41,436 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:29:41,436 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:29:41,436 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:29:41,440 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:29:41,440 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:29:41,460 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:29:41,481 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2021-12-19 20:29:41,482 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:29:41,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:29:41,483 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:29:41,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2021-12-19 20:29:41,485 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 20:29:41,491 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:29:41,492 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:29:41,492 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:29:41,492 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:29:41,495 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:29:41,495 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:29:41,499 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:29:41,514 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2021-12-19 20:29:41,514 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:29:41,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:29:41,516 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:29:41,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2021-12-19 20:29:41,517 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 20:29:41,524 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:29:41,525 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:29:41,525 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:29:41,525 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:29:41,533 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:29:41,533 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:29:41,581 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-19 20:29:41,608 INFO L443 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver. [2021-12-19 20:29:41,609 INFO L444 ModelExtractionUtils]: 20 out of 43 variables were initially zero. Simplification set additionally 19 variables to zero. [2021-12-19 20:29:41,609 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:29:41,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:29:41,610 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:29:41,618 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-19 20:29:41,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2021-12-19 20:29:41,640 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2021-12-19 20:29:41,640 INFO L513 LassoAnalysis]: Proved termination. [2021-12-19 20:29:41,641 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_SelectionSort_~j~0#1, v_rep(select #length ULTIMATE.start_main_#t~malloc9#1.base)_3) = -4*ULTIMATE.start_SelectionSort_~j~0#1 + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc9#1.base)_3 Supporting invariants [1*ULTIMATE.start_SelectionSort_~a#1.offset >= 0] [2021-12-19 20:29:41,664 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2021-12-19 20:29:41,680 INFO L297 tatePredicateManager]: 5 out of 8 supporting invariants were superfluous and have been removed [2021-12-19 20:29:41,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:29:41,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:29:41,722 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-19 20:29:41,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:29:41,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:29:41,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-19 20:29:41,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:29:41,866 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 20:29:41,866 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2021-12-19 20:29:41,867 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 27 transitions. cyclomatic complexity: 9 Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 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 20:29:41,917 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 27 transitions. cyclomatic complexity: 9. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 39 states and 53 transitions. Complement of second has 9 states. [2021-12-19 20:29:41,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2021-12-19 20:29:41,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 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 20:29:41,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 16 transitions. [2021-12-19 20:29:41,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 16 transitions. Stem has 11 letters. Loop has 3 letters. [2021-12-19 20:29:41,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:29:41,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 16 transitions. Stem has 14 letters. Loop has 3 letters. [2021-12-19 20:29:41,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:29:41,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 16 transitions. Stem has 11 letters. Loop has 6 letters. [2021-12-19 20:29:41,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:29:41,919 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 53 transitions. [2021-12-19 20:29:41,920 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-19 20:29:41,920 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 28 states and 36 transitions. [2021-12-19 20:29:41,920 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2021-12-19 20:29:41,920 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2021-12-19 20:29:41,920 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 36 transitions. [2021-12-19 20:29:41,920 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 20:29:41,920 INFO L681 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2021-12-19 20:29:41,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 36 transitions. [2021-12-19 20:29:41,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 21. [2021-12-19 20:29:41,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 20 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:29:41,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2021-12-19 20:29:41,922 INFO L704 BuchiCegarLoop]: Abstraction has 21 states and 26 transitions. [2021-12-19 20:29:41,922 INFO L587 BuchiCegarLoop]: Abstraction has 21 states and 26 transitions. [2021-12-19 20:29:41,922 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-12-19 20:29:41,922 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 26 transitions. [2021-12-19 20:29:41,922 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-19 20:29:41,922 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 20:29:41,922 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 20:29:41,923 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 20:29:41,923 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-19 20:29:41,923 INFO L791 eck$LassoCheckResult]: Stem: 651#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 652#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_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, 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; 664#L531 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 665#L531-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;main_~i~1#1 := 0; 668#L536-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 653#L536-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 654#L536-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 669#L536-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 671#L536-3 assume !(main_~i~1#1 < main_~array_size~0#1); 655#L536-4 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; 656#L515-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; 659#L519-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); 667#L521 assume !(SelectionSort_#t~mem4#1 < SelectionSort_#t~mem5#1);havoc SelectionSort_#t~mem4#1;havoc SelectionSort_#t~mem5#1; 662#L519-2 SelectionSort_#t~pre3#1 := 1 + SelectionSort_~j~0#1;SelectionSort_~j~0#1 := 1 + SelectionSort_~j~0#1;havoc SelectionSort_#t~pre3#1; 663#L519-3 assume !(SelectionSort_~j~0#1 < SelectionSort_~array_size#1); 670#L519-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); 657#L515-2 SelectionSort_#t~pre2#1 := 1 + SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~i~0#1;havoc SelectionSort_#t~pre2#1; 658#L515-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; 660#L519-3 [2021-12-19 20:29:41,923 INFO L793 eck$LassoCheckResult]: Loop: 660#L519-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); 666#L521 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; 661#L519-2 SelectionSort_#t~pre3#1 := 1 + SelectionSort_~j~0#1;SelectionSort_~j~0#1 := 1 + SelectionSort_~j~0#1;havoc SelectionSort_#t~pre3#1; 660#L519-3 [2021-12-19 20:29:41,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:29:41,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1721425389, now seen corresponding path program 1 times [2021-12-19 20:29:41,924 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:29:41,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998788168] [2021-12-19 20:29:41,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:29:41,924 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:29:41,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:29:41,990 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2021-12-19 20:29:41,994 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-19 20:29:41,994 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 20:29:41,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998788168] [2021-12-19 20:29:41,994 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998788168] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 20:29:41,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1922496548] [2021-12-19 20:29:41,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:29:41,994 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 20:29:41,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:29:41,995 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-19 20:29:41,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2021-12-19 20:29:42,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:29:42,037 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-19 20:29:42,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:29:42,135 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-19 20:29:42,135 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 20:29:42,182 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-19 20:29:42,183 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1922496548] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 20:29:42,183 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-19 20:29:42,183 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2021-12-19 20:29:42,183 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385109754] [2021-12-19 20:29:42,183 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-19 20:29:42,184 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-19 20:29:42,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:29:42,184 INFO L85 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 2 times [2021-12-19 20:29:42,184 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:29:42,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487225027] [2021-12-19 20:29:42,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:29:42,185 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:29:42,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:29:42,188 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:29:42,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:29:42,191 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:29:42,241 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 20:29:42,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-19 20:29:42,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2021-12-19 20:29:42,242 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. cyclomatic complexity: 8 Second operand has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 12 states have internal predecessors, (38), 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 20:29:42,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 20:29:42,321 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2021-12-19 20:29:42,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-19 20:29:42,321 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 40 transitions. [2021-12-19 20:29:42,322 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-19 20:29:42,322 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 24 states and 29 transitions. [2021-12-19 20:29:42,323 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2021-12-19 20:29:42,323 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2021-12-19 20:29:42,323 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 29 transitions. [2021-12-19 20:29:42,323 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 20:29:42,323 INFO L681 BuchiCegarLoop]: Abstraction has 24 states and 29 transitions. [2021-12-19 20:29:42,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 29 transitions. [2021-12-19 20:29:42,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2021-12-19 20:29:42,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 22 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:29:42,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2021-12-19 20:29:42,325 INFO L704 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2021-12-19 20:29:42,325 INFO L587 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2021-12-19 20:29:42,325 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-12-19 20:29:42,325 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 28 transitions. [2021-12-19 20:29:42,326 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-19 20:29:42,326 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 20:29:42,326 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 20:29:42,327 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 20:29:42,327 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-19 20:29:42,327 INFO L791 eck$LassoCheckResult]: Stem: 828#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 829#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_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, 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; 841#L531 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 842#L531-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;main_~i~1#1 := 0; 845#L536-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 846#L536-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 847#L536-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 830#L536-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 831#L536-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 850#L536-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 849#L536-3 assume !(main_~i~1#1 < main_~array_size~0#1); 832#L536-4 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; 833#L515-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; 834#L519-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); 844#L521 assume !(SelectionSort_#t~mem4#1 < SelectionSort_#t~mem5#1);havoc SelectionSort_#t~mem4#1;havoc SelectionSort_#t~mem5#1; 839#L519-2 SelectionSort_#t~pre3#1 := 1 + SelectionSort_~j~0#1;SelectionSort_~j~0#1 := 1 + SelectionSort_~j~0#1;havoc SelectionSort_#t~pre3#1; 840#L519-3 assume !(SelectionSort_~j~0#1 < SelectionSort_~array_size#1); 848#L519-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); 837#L515-2 SelectionSort_#t~pre2#1 := 1 + SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~i~0#1;havoc SelectionSort_#t~pre2#1; 835#L515-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; 836#L519-3 [2021-12-19 20:29:42,327 INFO L793 eck$LassoCheckResult]: Loop: 836#L519-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); 843#L521 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; 838#L519-2 SelectionSort_#t~pre3#1 := 1 + SelectionSort_~j~0#1;SelectionSort_~j~0#1 := 1 + SelectionSort_~j~0#1;havoc SelectionSort_#t~pre3#1; 836#L519-3 [2021-12-19 20:29:42,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:29:42,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1519356789, now seen corresponding path program 2 times [2021-12-19 20:29:42,328 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:29:42,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107564717] [2021-12-19 20:29:42,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:29:42,328 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:29:42,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:29:42,395 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:29:42,395 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 20:29:42,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107564717] [2021-12-19 20:29:42,395 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107564717] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 20:29:42,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2063764077] [2021-12-19 20:29:42,396 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-19 20:29:42,396 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 20:29:42,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:29:42,397 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-19 20:29:42,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2021-12-19 20:29:42,448 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-19 20:29:42,448 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-19 20:29:42,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-19 20:29:42,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:29:42,542 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:29:42,542 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 20:29:42,617 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:29:42,617 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2063764077] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 20:29:42,617 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-19 20:29:42,618 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2021-12-19 20:29:42,618 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066192825] [2021-12-19 20:29:42,618 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-19 20:29:42,618 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-19 20:29:42,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:29:42,619 INFO L85 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 3 times [2021-12-19 20:29:42,619 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:29:42,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314926626] [2021-12-19 20:29:42,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:29:42,619 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:29:42,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:29:42,623 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:29:42,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:29:42,626 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:29:42,683 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 20:29:42,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-19 20:29:42,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2021-12-19 20:29:42,684 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. cyclomatic complexity: 8 Second operand has 16 states, 16 states have (on average 2.1875) internal successors, (35), 16 states have internal predecessors, (35), 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 20:29:42,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 20:29:42,835 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2021-12-19 20:29:42,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-19 20:29:42,836 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 44 transitions. [2021-12-19 20:29:42,837 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-19 20:29:42,837 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 35 states and 44 transitions. [2021-12-19 20:29:42,837 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2021-12-19 20:29:42,837 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2021-12-19 20:29:42,837 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 44 transitions. [2021-12-19 20:29:42,838 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 20:29:42,838 INFO L681 BuchiCegarLoop]: Abstraction has 35 states and 44 transitions. [2021-12-19 20:29:42,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 44 transitions. [2021-12-19 20:29:42,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 26. [2021-12-19 20:29:42,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 25 states have internal predecessors, (32), 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 20:29:42,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2021-12-19 20:29:42,839 INFO L704 BuchiCegarLoop]: Abstraction has 26 states and 32 transitions. [2021-12-19 20:29:42,839 INFO L587 BuchiCegarLoop]: Abstraction has 26 states and 32 transitions. [2021-12-19 20:29:42,839 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-12-19 20:29:42,839 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 32 transitions. [2021-12-19 20:29:42,840 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-19 20:29:42,840 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 20:29:42,840 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 20:29:42,840 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 20:29:42,840 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-19 20:29:42,848 INFO L791 eck$LassoCheckResult]: Stem: 1031#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1032#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_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, 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; 1044#L531 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 1045#L531-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;main_~i~1#1 := 0; 1049#L536-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 1050#L536-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 1051#L536-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 1033#L536-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 1034#L536-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 1054#L536-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 1053#L536-3 assume !(main_~i~1#1 < main_~array_size~0#1); 1035#L536-4 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; 1036#L515-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; 1039#L519-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); 1056#L521 assume !(SelectionSort_#t~mem4#1 < SelectionSort_#t~mem5#1);havoc SelectionSort_#t~mem4#1;havoc SelectionSort_#t~mem5#1; 1043#L519-2 SelectionSort_#t~pre3#1 := 1 + SelectionSort_~j~0#1;SelectionSort_~j~0#1 := 1 + SelectionSort_~j~0#1;havoc SelectionSort_#t~pre3#1; 1040#L519-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); 1047#L521 assume !(SelectionSort_#t~mem4#1 < SelectionSort_#t~mem5#1);havoc SelectionSort_#t~mem4#1;havoc SelectionSort_#t~mem5#1; 1048#L519-2 SelectionSort_#t~pre3#1 := 1 + SelectionSort_~j~0#1;SelectionSort_~j~0#1 := 1 + SelectionSort_~j~0#1;havoc SelectionSort_#t~pre3#1; 1055#L519-3 assume !(SelectionSort_~j~0#1 < SelectionSort_~array_size#1); 1052#L519-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); 1037#L515-2 SelectionSort_#t~pre2#1 := 1 + SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~i~0#1;havoc SelectionSort_#t~pre2#1; 1038#L515-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; 1041#L519-3 [2021-12-19 20:29:42,849 INFO L793 eck$LassoCheckResult]: Loop: 1041#L519-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); 1046#L521 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; 1042#L519-2 SelectionSort_#t~pre3#1 := 1 + SelectionSort_~j~0#1;SelectionSort_~j~0#1 := 1 + SelectionSort_~j~0#1;havoc SelectionSort_#t~pre3#1; 1041#L519-3 [2021-12-19 20:29:42,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:29:42,849 INFO L85 PathProgramCache]: Analyzing trace with hash 95688324, now seen corresponding path program 3 times [2021-12-19 20:29:42,849 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:29:42,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185889164] [2021-12-19 20:29:42,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:29:42,850 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:29:42,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:29:42,866 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:29:42,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:29:42,882 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:29:42,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:29:42,882 INFO L85 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 4 times [2021-12-19 20:29:42,883 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:29:42,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013669178] [2021-12-19 20:29:42,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:29:42,883 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:29:42,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:29:42,886 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:29:42,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:29:42,888 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:29:42,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:29:42,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1207385433, now seen corresponding path program 1 times [2021-12-19 20:29:42,889 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:29:42,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992474960] [2021-12-19 20:29:42,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:29:42,889 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:29:42,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:29:42,905 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:29:42,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:29:42,922 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:29:43,894 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 20:29:43,894 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 20:29:43,894 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 20:29:43,894 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 20:29:43,894 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-19 20:29:43,894 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:29:43,894 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 20:29:43,894 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 20:29:43,894 INFO L133 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca-1.i_Iteration9_Lasso [2021-12-19 20:29:43,894 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 20:29:43,894 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 20:29:43,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 20:29:43,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 20:29:43,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 20:29:43,902 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 20:29:43,904 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 20:29:43,906 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 20:29:43,908 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 20:29:43,910 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 20:29:43,912 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 20:29:44,313 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 20:29:44,319 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 20:29:44,321 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 20:29:44,322 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 20:29:44,324 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 20:29:44,326 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 20:29:44,327 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 20:29:44,328 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 20:29:44,694 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 20:29:44,695 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-19 20:29:44,695 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:29:44,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:29:44,696 INFO L229 MonitoredProcess]: Starting monitored process 28 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 20:29:44,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2021-12-19 20:29:44,699 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 20:29:44,705 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:29:44,705 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:29:44,705 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:29:44,705 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:29:44,706 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:29:44,706 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:29:44,708 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:29:44,723 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2021-12-19 20:29:44,723 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:29:44,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:29:44,724 INFO L229 MonitoredProcess]: Starting monitored process 29 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 20:29:44,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2021-12-19 20:29:44,726 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 20:29:44,732 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:29:44,732 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:29:44,732 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:29:44,732 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:29:44,733 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:29:44,733 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:29:44,733 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:29:44,742 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:29:44,757 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2021-12-19 20:29:44,757 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:29:44,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:29:44,758 INFO L229 MonitoredProcess]: Starting monitored process 30 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 20:29:44,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2021-12-19 20:29:44,759 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 20:29:44,766 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:29:44,766 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:29:44,766 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:29:44,766 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:29:44,766 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:29:44,766 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:29:44,766 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:29:44,767 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:29:44,782 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2021-12-19 20:29:44,782 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:29:44,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:29:44,783 INFO L229 MonitoredProcess]: Starting monitored process 31 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 20:29:44,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2021-12-19 20:29:44,785 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 20:29:44,791 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:29:44,792 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:29:44,792 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:29:44,792 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:29:44,793 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:29:44,793 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:29:44,795 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:29:44,810 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2021-12-19 20:29:44,810 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:29:44,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:29:44,811 INFO L229 MonitoredProcess]: Starting monitored process 32 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 20:29:44,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2021-12-19 20:29:44,813 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 20:29:44,819 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:29:44,819 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:29:44,819 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:29:44,819 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:29:44,819 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:29:44,820 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:29:44,820 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:29:44,820 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:29:44,835 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2021-12-19 20:29:44,836 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:29:44,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:29:44,836 INFO L229 MonitoredProcess]: Starting monitored process 33 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 20:29:44,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2021-12-19 20:29:44,838 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 20:29:44,844 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:29:44,844 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:29:44,844 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:29:44,844 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:29:44,845 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:29:44,845 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:29:44,847 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:29:44,863 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2021-12-19 20:29:44,863 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:29:44,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:29:44,864 INFO L229 MonitoredProcess]: Starting monitored process 34 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 20:29:44,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2021-12-19 20:29:44,866 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 20:29:44,872 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:29:44,872 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:29:44,872 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:29:44,872 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:29:44,872 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:29:44,873 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:29:44,873 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:29:44,880 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:29:44,895 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2021-12-19 20:29:44,895 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:29:44,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:29:44,896 INFO L229 MonitoredProcess]: Starting monitored process 35 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 20:29:44,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2021-12-19 20:29:44,897 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 20:29:44,903 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:29:44,903 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:29:44,903 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:29:44,903 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:29:44,904 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:29:44,904 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:29:44,904 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:29:44,905 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:29:44,920 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2021-12-19 20:29:44,920 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:29:44,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:29:44,921 INFO L229 MonitoredProcess]: Starting monitored process 36 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 20:29:44,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2021-12-19 20:29:44,923 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 20:29:44,929 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:29:44,929 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:29:44,929 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:29:44,929 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:29:44,932 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:29:44,932 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:29:44,959 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:29:44,976 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2021-12-19 20:29:44,976 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:29:44,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:29:44,977 INFO L229 MonitoredProcess]: Starting monitored process 37 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 20:29:44,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2021-12-19 20:29:44,979 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:29:44,986 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:29:44,986 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:29:44,986 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:29:44,986 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:29:44,988 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:29:44,988 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:29:44,991 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:29:45,006 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2021-12-19 20:29:45,007 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:29:45,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:29:45,008 INFO L229 MonitoredProcess]: Starting monitored process 38 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 20:29:45,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2021-12-19 20:29:45,009 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 20:29:45,016 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:29:45,016 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:29:45,016 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:29:45,016 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:29:45,024 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:29:45,024 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:29:45,031 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:29:45,046 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2021-12-19 20:29:45,046 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:29:45,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:29:45,047 INFO L229 MonitoredProcess]: Starting monitored process 39 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 20:29:45,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2021-12-19 20:29:45,056 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 20:29:45,062 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:29:45,062 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:29:45,062 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:29:45,062 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:29:45,070 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:29:45,070 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:29:45,084 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-19 20:29:45,107 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2021-12-19 20:29:45,107 INFO L444 ModelExtractionUtils]: 14 out of 46 variables were initially zero. Simplification set additionally 29 variables to zero. [2021-12-19 20:29:45,107 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:29:45,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:29:45,115 INFO L229 MonitoredProcess]: Starting monitored process 40 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 20:29:45,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2021-12-19 20:29:45,117 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-19 20:29:45,124 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-19 20:29:45,124 INFO L513 LassoAnalysis]: Proved termination. [2021-12-19 20:29:45,125 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 20:29:45,142 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2021-12-19 20:29:45,195 INFO L297 tatePredicateManager]: 21 out of 21 supporting invariants were superfluous and have been removed [2021-12-19 20:29:45,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:29:45,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:29:45,225 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-19 20:29:45,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:29:45,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:29:45,273 INFO L263 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-19 20:29:45,274 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:29:45,292 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 20:29:45,293 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 20:29:45,293 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 32 transitions. cyclomatic complexity: 9 Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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 20:29:45,312 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 32 transitions. cyclomatic complexity: 9. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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) Result 40 states and 52 transitions. Complement of second has 7 states. [2021-12-19 20:29:45,312 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 20:29:45,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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 20:29:45,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2021-12-19 20:29:45,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 23 letters. Loop has 3 letters. [2021-12-19 20:29:45,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:29:45,315 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-19 20:29:45,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:29:45,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:29:45,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-19 20:29:45,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:29:45,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:29:45,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-19 20:29:45,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:29:45,401 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 20:29:45,402 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 20:29:45,402 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 32 transitions. cyclomatic complexity: 9 Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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 20:29:45,418 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 32 transitions. cyclomatic complexity: 9. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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) Result 40 states and 52 transitions. Complement of second has 7 states. [2021-12-19 20:29:45,418 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 20:29:45,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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 20:29:45,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2021-12-19 20:29:45,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 23 letters. Loop has 3 letters. [2021-12-19 20:29:45,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:29:45,419 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-19 20:29:45,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:29:45,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:29:45,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-19 20:29:45,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:29:45,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:29:45,488 INFO L263 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-19 20:29:45,488 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:29:45,505 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 20:29:45,505 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 20:29:45,505 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 32 transitions. cyclomatic complexity: 9 Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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 20:29:45,518 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 32 transitions. cyclomatic complexity: 9. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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) Result 36 states and 47 transitions. Complement of second has 6 states. [2021-12-19 20:29:45,518 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 20:29:45,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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 20:29:45,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2021-12-19 20:29:45,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 23 letters. Loop has 3 letters. [2021-12-19 20:29:45,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:29:45,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 26 letters. Loop has 3 letters. [2021-12-19 20:29:45,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:29:45,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 23 letters. Loop has 6 letters. [2021-12-19 20:29:45,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:29:45,520 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 47 transitions. [2021-12-19 20:29:45,521 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-12-19 20:29:45,521 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 0 states and 0 transitions. [2021-12-19 20:29:45,521 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2021-12-19 20:29:45,521 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2021-12-19 20:29:45,521 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2021-12-19 20:29:45,521 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-19 20:29:45,522 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-19 20:29:45,522 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-19 20:29:45,522 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-19 20:29:45,522 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-12-19 20:29:45,522 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2021-12-19 20:29:45,522 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-12-19 20:29:45,522 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2021-12-19 20:29:45,527 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 19.12 08:29:45 BoogieIcfgContainer [2021-12-19 20:29:45,528 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-12-19 20:29:45,528 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-19 20:29:45,528 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-19 20:29:45,528 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-19 20:29:45,529 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 08:29:35" (3/4) ... [2021-12-19 20:29:45,531 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-19 20:29:45,531 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-19 20:29:45,531 INFO L158 Benchmark]: Toolchain (without parser) took 10443.68ms. Allocated memory was 107.0MB in the beginning and 130.0MB in the end (delta: 23.1MB). Free memory was 72.0MB in the beginning and 31.7MB in the end (delta: 40.2MB). Peak memory consumption was 61.5MB. Max. memory is 16.1GB. [2021-12-19 20:29:45,532 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 79.7MB. Free memory was 52.8MB in the beginning and 52.8MB in the end (delta: 25.8kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-19 20:29:45,532 INFO L158 Benchmark]: CACSL2BoogieTranslator took 351.29ms. Allocated memory is still 107.0MB. Free memory was 72.0MB in the beginning and 76.9MB in the end (delta: -5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-19 20:29:45,532 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.47ms. Allocated memory is still 107.0MB. Free memory was 76.9MB in the beginning and 74.8MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-19 20:29:45,532 INFO L158 Benchmark]: Boogie Preprocessor took 41.99ms. Allocated memory is still 107.0MB. Free memory was 74.8MB in the beginning and 73.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-19 20:29:45,533 INFO L158 Benchmark]: RCFGBuilder took 252.79ms. Allocated memory is still 107.0MB. Free memory was 73.7MB in the beginning and 62.8MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-19 20:29:45,533 INFO L158 Benchmark]: BuchiAutomizer took 9742.78ms. Allocated memory was 107.0MB in the beginning and 130.0MB in the end (delta: 23.1MB). Free memory was 62.8MB in the beginning and 31.7MB in the end (delta: 31.0MB). Peak memory consumption was 55.7MB. Max. memory is 16.1GB. [2021-12-19 20:29:45,533 INFO L158 Benchmark]: Witness Printer took 2.84ms. Allocated memory is still 130.0MB. Free memory is still 31.7MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-19 20:29:45,534 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.17ms. Allocated memory is still 79.7MB. Free memory was 52.8MB in the beginning and 52.8MB in the end (delta: 25.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 351.29ms. Allocated memory is still 107.0MB. Free memory was 72.0MB in the beginning and 76.9MB in the end (delta: -5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.47ms. Allocated memory is still 107.0MB. Free memory was 76.9MB in the beginning and 74.8MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 41.99ms. Allocated memory is still 107.0MB. Free memory was 74.8MB in the beginning and 73.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 252.79ms. Allocated memory is still 107.0MB. Free memory was 73.7MB in the beginning and 62.8MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 9742.78ms. Allocated memory was 107.0MB in the beginning and 130.0MB in the end (delta: 23.1MB). Free memory was 62.8MB in the beginning and 31.7MB in the end (delta: 31.0MB). Peak memory consumption was 55.7MB. Max. memory is 16.1GB. * Witness Printer took 2.84ms. Allocated memory is still 130.0MB. Free memory is still 31.7MB. 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 9 terminating modules (5 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -2 * i + unknown-#length-unknown[__builtin_alloca (array_size * sizeof(int))] and consists of 6 locations. One deterministic module has affine ranking function array_size + -1 * i and consists of 3 locations. One deterministic module has affine ranking function -4 * j + unknown-#length-unknown[__builtin_alloca (array_size * sizeof(int))] and consists of 6 locations. One nondeterministic module has affine ranking function array_size + -1 * j and consists of 4 locations. 5 modules have a trivial ranking function, the largest among these consists of 16 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.6s and 10 iterations. TraceHistogramMax:3. Analysis of lassos took 8.3s. Construction of modules took 0.2s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 20 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 26 states and ocurred in iteration 8. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1/1 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 266 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 262 mSDsluCounter, 306 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 181 mSDsCounter, 66 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 321 IncrementalHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 66 mSolverCounterUnsat, 125 mSDtfsCounter, 321 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU3 SILI1 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital239 mio100 ax109 hnf99 lsp87 ukn79 mio100 lsp64 div117 bol100 ite100 ukn100 eq168 hnf86 smp90 dnf100 smp100 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 38ms VariablesStem: 1 VariablesLoop: 0 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 20:29:45,560 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2021-12-19 20:29:45,771 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2021-12-19 20:29:45,976 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2021-12-19 20:29:46,187 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2021-12-19 20:29:46,395 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