./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-recursive-malloc/selectionSort_recursive.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-recursive-malloc/selectionSort_recursive.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash ff7f98b41a2da3578e790df894a867e943a0857e97661a8032b524a76ca3b438 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 15:06:54,058 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 15:06:54,059 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 15:06:54,089 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 15:06:54,090 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 15:06:54,091 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 15:06:54,092 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 15:06:54,093 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 15:06:54,094 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 15:06:54,095 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 15:06:54,095 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 15:06:54,097 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 15:06:54,098 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 15:06:54,100 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 15:06:54,101 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 15:06:54,103 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 15:06:54,104 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 15:06:54,108 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 15:06:54,109 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 15:06:54,110 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 15:06:54,111 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 15:06:54,115 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 15:06:54,116 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 15:06:54,116 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 15:06:54,117 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 15:06:54,119 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 15:06:54,122 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 15:06:54,122 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 15:06:54,123 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 15:06:54,123 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 15:06:54,124 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 15:06:54,124 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 15:06:54,124 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 15:06:54,125 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 15:06:54,125 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 15:06:54,126 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 15:06:54,126 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 15:06:54,127 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 15:06:54,127 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 15:06:54,127 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 15:06:54,128 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 15:06:54,129 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 15:06:54,130 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-07-14 15:06:54,148 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 15:06:54,148 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 15:06:54,148 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 15:06:54,148 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 15:06:54,149 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 15:06:54,149 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 15:06:54,149 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 15:06:54,150 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-14 15:06:54,150 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-14 15:06:54,150 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-14 15:06:54,150 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-14 15:06:54,150 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-14 15:06:54,150 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-14 15:06:54,151 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 15:06:54,151 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 15:06:54,151 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 15:06:54,151 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 15:06:54,151 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-14 15:06:54,151 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-14 15:06:54,151 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-14 15:06:54,152 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-14 15:06:54,152 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-14 15:06:54,152 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 15:06:54,152 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-14 15:06:54,152 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 15:06:54,152 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 15:06:54,153 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 15:06:54,153 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 15:06:54,153 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-14 15:06:54,153 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ff7f98b41a2da3578e790df894a867e943a0857e97661a8032b524a76ca3b438 [2022-07-14 15:06:54,310 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 15:06:54,328 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 15:06:54,329 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 15:06:54,330 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 15:06:54,332 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 15:06:54,333 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-recursive-malloc/selectionSort_recursive.i [2022-07-14 15:06:54,387 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/641b80a26/0448ef14ed50494bb91e9ed15d42362d/FLAG58d7efee7 [2022-07-14 15:06:54,766 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 15:06:54,766 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-recursive-malloc/selectionSort_recursive.i [2022-07-14 15:06:54,769 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/641b80a26/0448ef14ed50494bb91e9ed15d42362d/FLAG58d7efee7 [2022-07-14 15:06:54,777 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/641b80a26/0448ef14ed50494bb91e9ed15d42362d [2022-07-14 15:06:54,779 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 15:06:54,780 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 15:06:54,781 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 15:06:54,781 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 15:06:54,783 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 15:06:54,783 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 03:06:54" (1/1) ... [2022-07-14 15:06:54,784 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@464eeb3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:06:54, skipping insertion in model container [2022-07-14 15:06:54,784 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 03:06:54" (1/1) ... [2022-07-14 15:06:54,788 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 15:06:54,796 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 15:06:54,901 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 15:06:54,906 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 15:06:54,917 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 15:06:54,926 INFO L208 MainTranslator]: Completed translation [2022-07-14 15:06:54,926 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:06:54 WrapperNode [2022-07-14 15:06:54,927 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 15:06:54,927 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 15:06:54,928 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 15:06:54,928 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 15:06:54,933 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:06:54" (1/1) ... [2022-07-14 15:06:54,940 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:06:54" (1/1) ... [2022-07-14 15:06:54,958 INFO L137 Inliner]: procedures = 11, calls = 13, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 27 [2022-07-14 15:06:54,958 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 15:06:54,959 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 15:06:54,959 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 15:06:54,959 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 15:06:54,964 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:06:54" (1/1) ... [2022-07-14 15:06:54,964 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:06:54" (1/1) ... [2022-07-14 15:06:54,974 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:06:54" (1/1) ... [2022-07-14 15:06:54,974 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:06:54" (1/1) ... [2022-07-14 15:06:54,982 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:06:54" (1/1) ... [2022-07-14 15:06:54,986 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:06:54" (1/1) ... [2022-07-14 15:06:54,987 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:06:54" (1/1) ... [2022-07-14 15:06:54,988 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 15:06:54,989 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 15:06:54,989 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 15:06:54,989 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 15:06:54,991 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:06:54" (1/1) ... [2022-07-14 15:06:54,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:06:55,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:06:55,016 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) [2022-07-14 15:06:55,018 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 [2022-07-14 15:06:55,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-14 15:06:55,048 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-14 15:06:55,049 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 15:06:55,050 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 15:06:55,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-14 15:06:55,050 INFO L130 BoogieDeclarations]: Found specification of procedure selectionSort [2022-07-14 15:06:55,051 INFO L138 BoogieDeclarations]: Found implementation of procedure selectionSort [2022-07-14 15:06:55,051 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 15:06:55,102 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 15:06:55,103 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 15:06:55,215 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 15:06:55,218 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 15:06:55,219 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-14 15:06:55,220 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 03:06:55 BoogieIcfgContainer [2022-07-14 15:06:55,220 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 15:06:55,221 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-14 15:06:55,221 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-14 15:06:55,223 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-14 15:06:55,226 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 15:06:55,226 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.07 03:06:54" (1/3) ... [2022-07-14 15:06:55,227 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5966dd44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.07 03:06:55, skipping insertion in model container [2022-07-14 15:06:55,227 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 15:06:55,227 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:06:54" (2/3) ... [2022-07-14 15:06:55,227 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5966dd44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.07 03:06:55, skipping insertion in model container [2022-07-14 15:06:55,227 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 15:06:55,227 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 03:06:55" (3/3) ... [2022-07-14 15:06:55,228 INFO L354 chiAutomizerObserver]: Analyzing ICFG selectionSort_recursive.i [2022-07-14 15:06:55,283 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-14 15:06:55,283 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-14 15:06:55,283 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-14 15:06:55,283 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-14 15:06:55,283 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-14 15:06:55,283 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-14 15:06:55,283 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-14 15:06:55,283 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-14 15:06:55,286 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 19 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 16 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 15:06:55,298 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-07-14 15:06:55,298 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:06:55,298 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:06:55,302 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-07-14 15:06:55,302 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-14 15:06:55,302 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-14 15:06:55,302 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 19 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 16 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 15:06:55,304 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-07-14 15:06:55,304 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:06:55,304 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:06:55,304 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-07-14 15:06:55,304 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-14 15:06:55,308 INFO L752 eck$LassoCheckResult]: Stem: 6#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 11#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~nondet9#1, main_#t~post8#1, main_~i~0#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;main_~n~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; 9#L31true assume !(main_~n~0#1 < 1);call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;main_~i~0#1 := 0; 12#L36-3true [2022-07-14 15:06:55,308 INFO L754 eck$LassoCheckResult]: Loop: 12#L36-3true assume !!(main_~i~0#1 < main_~n~0#1);call write~int(main_#t~nondet9#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet9#1; 13#L36-2true main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 12#L36-3true [2022-07-14 15:06:55,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:06:55,312 INFO L85 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2022-07-14 15:06:55,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:06:55,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568839534] [2022-07-14 15:06:55,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:06:55,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:06:55,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:06:55,370 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:06:55,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:06:55,386 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:06:55,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:06:55,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1443, now seen corresponding path program 1 times [2022-07-14 15:06:55,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:06:55,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214806030] [2022-07-14 15:06:55,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:06:55,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:06:55,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:06:55,398 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:06:55,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:06:55,404 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:06:55,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:06:55,405 INFO L85 PathProgramCache]: Analyzing trace with hash 28695942, now seen corresponding path program 1 times [2022-07-14 15:06:55,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:06:55,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749859796] [2022-07-14 15:06:55,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:06:55,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:06:55,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:06:55,425 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:06:55,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:06:55,435 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:06:55,605 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 15:06:55,610 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 15:06:55,610 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 15:06:55,610 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 15:06:55,610 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-14 15:06:55,611 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:06:55,611 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 15:06:55,611 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 15:06:55,611 INFO L133 ssoRankerPreferences]: Filename of dumped script: selectionSort_recursive.i_Iteration1_Lasso [2022-07-14 15:06:55,611 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 15:06:55,611 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 15:06:55,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:55,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:55,632 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:55,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:55,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:55,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:55,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:55,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:55,880 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 15:06:55,882 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-14 15:06:55,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:06:55,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:06:55,885 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) [2022-07-14 15:06:55,890 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 [2022-07-14 15:06:55,897 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:06:55,897 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:06:55,897 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:06:55,897 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:06:55,902 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:06:55,902 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:06:55,905 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 [2022-07-14 15:06:55,907 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:06:55,924 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 [2022-07-14 15:06:55,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:06:55,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:06:55,926 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) [2022-07-14 15:06:55,927 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 [2022-07-14 15:06:55,929 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 [2022-07-14 15:06:55,935 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:06:55,936 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:06:55,936 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:06:55,936 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:06:55,936 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:06:55,938 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:06:55,938 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:06:55,952 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:06:55,971 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 [2022-07-14 15:06:55,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:06:55,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:06:55,973 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) [2022-07-14 15:06:55,975 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 [2022-07-14 15:06:55,976 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 [2022-07-14 15:06:55,982 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:06:55,983 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:06:55,983 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:06:55,983 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:06:55,983 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:06:55,983 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:06:55,983 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:06:55,995 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:06:56,010 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 [2022-07-14 15:06:56,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:06:56,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:06:56,012 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) [2022-07-14 15:06:56,012 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 [2022-07-14 15:06:56,014 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 [2022-07-14 15:06:56,020 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:06:56,020 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:06:56,020 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:06:56,020 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:06:56,020 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:06:56,020 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:06:56,021 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:06:56,035 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:06:56,055 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 [2022-07-14 15:06:56,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:06:56,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:06:56,072 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) [2022-07-14 15:06:56,073 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 [2022-07-14 15:06:56,074 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 [2022-07-14 15:06:56,081 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:06:56,081 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:06:56,081 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:06:56,082 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:06:56,087 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:06:56,087 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:06:56,107 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-14 15:06:56,123 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2022-07-14 15:06:56,123 INFO L444 ModelExtractionUtils]: 4 out of 16 variables were initially zero. Simplification set additionally 9 variables to zero. [2022-07-14 15:06:56,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:06:56,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:06:56,127 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) [2022-07-14 15:06:56,128 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 [2022-07-14 15:06:56,160 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-14 15:06:56,188 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-14 15:06:56,188 INFO L513 LassoAnalysis]: Proved termination. [2022-07-14 15:06:56,189 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0#1, ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~n~0#1 - 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2022-07-14 15:06:56,207 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 [2022-07-14 15:06:56,212 INFO L293 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2022-07-14 15:06:56,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:06:56,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:06:56,250 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 15:06:56,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:06:56,273 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 [2022-07-14 15:06:56,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:06:56,288 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 15:06:56,288 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:06:56,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:06:56,333 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 [2022-07-14 15:06:56,334 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 19 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 16 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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) [2022-07-14 15:06:56,367 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 19 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 16 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2). Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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. [2022-07-14 15:06:56,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-14 15:06:56,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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) [2022-07-14 15:06:56,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2022-07-14 15:06:56,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 3 letters. Loop has 2 letters. [2022-07-14 15:06:56,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:06:56,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 5 letters. Loop has 2 letters. [2022-07-14 15:06:56,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:06:56,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 3 letters. Loop has 4 letters. [2022-07-14 15:06:56,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:06:56,374 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 53 transitions. [2022-07-14 15:06:56,376 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-07-14 15:06:56,379 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 14 states and 19 transitions. [2022-07-14 15:06:56,380 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2022-07-14 15:06:56,380 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2022-07-14 15:06:56,380 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2022-07-14 15:06:56,380 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:06:56,380 INFO L369 hiAutomatonCegarLoop]: Abstraction has 14 states and 19 transitions. [2022-07-14 15:06:56,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2022-07-14 15:06:56,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-07-14 15:06:56,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:06:56,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2022-07-14 15:06:56,397 INFO L392 hiAutomatonCegarLoop]: Abstraction has 14 states and 19 transitions. [2022-07-14 15:06:56,397 INFO L374 stractBuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2022-07-14 15:06:56,397 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-14 15:06:56,398 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2022-07-14 15:06:56,398 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-07-14 15:06:56,398 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:06:56,398 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:06:56,399 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-14 15:06:56,399 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-07-14 15:06:56,400 INFO L752 eck$LassoCheckResult]: Stem: 112#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 113#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~nondet9#1, main_#t~post8#1, main_~i~0#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;main_~n~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; 116#L31 assume !(main_~n~0#1 < 1);call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;main_~i~0#1 := 0; 117#L36-3 assume !(main_~i~0#1 < main_~n~0#1); 107#L36-4 call selectionSort(main_~a~0#1.base, main_~a~0#1.offset, 0, main_~n~0#1);< 110#selectionSortENTRY [2022-07-14 15:06:56,400 INFO L754 eck$LassoCheckResult]: Loop: 110#selectionSortENTRY ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 111#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 109#L14-3 assume !(~index~0 < ~size); 114#L14-4 call #t~mem4 := read~int(~array.base, ~array.offset + 4 * ~startIndex, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4);call write~int(#t~mem5, ~array.base, ~array.offset + 4 * ~startIndex, 4);havoc #t~mem5;call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~minIndex~0, 4); 108#L22 call selectionSort(~array.base, ~array.offset, 1 + ~startIndex, ~size);< 110#selectionSortENTRY [2022-07-14 15:06:56,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:06:56,400 INFO L85 PathProgramCache]: Analyzing trace with hash 28695915, now seen corresponding path program 1 times [2022-07-14 15:06:56,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:06:56,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808862123] [2022-07-14 15:06:56,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:06:56,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:06:56,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:06:56,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:06:56,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:06:56,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808862123] [2022-07-14 15:06:56,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808862123] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 15:06:56,439 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 15:06:56,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 15:06:56,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256148810] [2022-07-14 15:06:56,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 15:06:56,441 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 15:06:56,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:06:56,442 INFO L85 PathProgramCache]: Analyzing trace with hash 53570596, now seen corresponding path program 1 times [2022-07-14 15:06:56,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:06:56,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123374473] [2022-07-14 15:06:56,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:06:56,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:06:56,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:06:56,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:06:56,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:06:56,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123374473] [2022-07-14 15:06:56,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123374473] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 15:06:56,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 15:06:56,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 15:06:56,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863188537] [2022-07-14 15:06:56,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 15:06:56,457 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 15:06:56,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:06:56,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 15:06:56,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 15:06:56,459 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), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:06:56,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:06:56,475 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2022-07-14 15:06:56,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 15:06:56,476 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 19 transitions. [2022-07-14 15:06:56,477 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-07-14 15:06:56,478 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 19 transitions. [2022-07-14 15:06:56,479 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2022-07-14 15:06:56,479 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2022-07-14 15:06:56,480 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2022-07-14 15:06:56,480 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:06:56,480 INFO L369 hiAutomatonCegarLoop]: Abstraction has 15 states and 19 transitions. [2022-07-14 15:06:56,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2022-07-14 15:06:56,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-07-14 15:06:56,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:06:56,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2022-07-14 15:06:56,483 INFO L392 hiAutomatonCegarLoop]: Abstraction has 15 states and 19 transitions. [2022-07-14 15:06:56,483 INFO L374 stractBuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2022-07-14 15:06:56,484 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-14 15:06:56,484 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2022-07-14 15:06:56,484 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-07-14 15:06:56,485 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:06:56,485 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:06:56,485 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-14 15:06:56,486 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:06:56,486 INFO L752 eck$LassoCheckResult]: Stem: 148#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 149#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~nondet9#1, main_#t~post8#1, main_~i~0#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;main_~n~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; 152#L31 assume !(main_~n~0#1 < 1);call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;main_~i~0#1 := 0; 153#L36-3 assume !(main_~i~0#1 < main_~n~0#1); 143#L36-4 call selectionSort(main_~a~0#1.base, main_~a~0#1.offset, 0, main_~n~0#1);< 142#selectionSortENTRY [2022-07-14 15:06:56,486 INFO L754 eck$LassoCheckResult]: Loop: 142#selectionSortENTRY ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 145#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 150#L14-3 assume !!(~index~0 < ~size);call #t~mem2 := read~int(~array.base, ~array.offset + 4 * ~index~0, 4);call #t~mem3 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4); 151#L16 assume #t~mem2 < #t~mem3;havoc #t~mem2;havoc #t~mem3;~minIndex~0 := ~index~0; 146#L14-2 #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; 147#L14-3 assume !(~index~0 < ~size); 154#L14-4 call #t~mem4 := read~int(~array.base, ~array.offset + 4 * ~startIndex, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4);call write~int(#t~mem5, ~array.base, ~array.offset + 4 * ~startIndex, 4);havoc #t~mem5;call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~minIndex~0, 4); 144#L22 call selectionSort(~array.base, ~array.offset, 1 + ~startIndex, ~size);< 142#selectionSortENTRY [2022-07-14 15:06:56,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:06:56,487 INFO L85 PathProgramCache]: Analyzing trace with hash 28695915, now seen corresponding path program 2 times [2022-07-14 15:06:56,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:06:56,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593959361] [2022-07-14 15:06:56,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:06:56,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:06:56,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:06:56,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:06:56,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:06:56,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593959361] [2022-07-14 15:06:56,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593959361] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 15:06:56,514 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 15:06:56,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 15:06:56,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186548883] [2022-07-14 15:06:56,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 15:06:56,515 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 15:06:56,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:06:56,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1756570492, now seen corresponding path program 1 times [2022-07-14 15:06:56,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:06:56,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602620996] [2022-07-14 15:06:56,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:06:56,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:06:56,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:06:56,537 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:06:56,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:06:56,550 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:06:56,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:06:56,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 15:06:56,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 15:06:56,858 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. cyclomatic complexity: 6 Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:06:56,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:06:56,866 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2022-07-14 15:06:56,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 15:06:56,867 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 19 transitions. [2022-07-14 15:06:56,868 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-07-14 15:06:56,868 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 19 transitions. [2022-07-14 15:06:56,868 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2022-07-14 15:06:56,868 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2022-07-14 15:06:56,868 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 19 transitions. [2022-07-14 15:06:56,868 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:06:56,869 INFO L369 hiAutomatonCegarLoop]: Abstraction has 16 states and 19 transitions. [2022-07-14 15:06:56,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 19 transitions. [2022-07-14 15:06:56,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2022-07-14 15:06:56,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:06:56,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2022-07-14 15:06:56,870 INFO L392 hiAutomatonCegarLoop]: Abstraction has 15 states and 18 transitions. [2022-07-14 15:06:56,870 INFO L374 stractBuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2022-07-14 15:06:56,870 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-14 15:06:56,870 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 18 transitions. [2022-07-14 15:06:56,870 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-07-14 15:06:56,870 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:06:56,870 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:06:56,871 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:06:56,871 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:06:56,871 INFO L752 eck$LassoCheckResult]: Stem: 185#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 186#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~nondet9#1, main_#t~post8#1, main_~i~0#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;main_~n~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; 189#L31 assume !(main_~n~0#1 < 1);call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;main_~i~0#1 := 0; 190#L36-3 assume !!(main_~i~0#1 < main_~n~0#1);call write~int(main_#t~nondet9#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet9#1; 192#L36-2 main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 193#L36-3 assume !(main_~i~0#1 < main_~n~0#1); 181#L36-4 call selectionSort(main_~a~0#1.base, main_~a~0#1.offset, 0, main_~n~0#1);< 179#selectionSortENTRY [2022-07-14 15:06:56,871 INFO L754 eck$LassoCheckResult]: Loop: 179#selectionSortENTRY ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 182#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 187#L14-3 assume !!(~index~0 < ~size);call #t~mem2 := read~int(~array.base, ~array.offset + 4 * ~index~0, 4);call #t~mem3 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4); 188#L16 assume #t~mem2 < #t~mem3;havoc #t~mem2;havoc #t~mem3;~minIndex~0 := ~index~0; 183#L14-2 #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; 184#L14-3 assume !(~index~0 < ~size); 191#L14-4 call #t~mem4 := read~int(~array.base, ~array.offset + 4 * ~startIndex, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4);call write~int(#t~mem5, ~array.base, ~array.offset + 4 * ~startIndex, 4);havoc #t~mem5;call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~minIndex~0, 4); 180#L22 call selectionSort(~array.base, ~array.offset, 1 + ~startIndex, ~size);< 179#selectionSortENTRY [2022-07-14 15:06:56,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:06:56,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1806996941, now seen corresponding path program 1 times [2022-07-14 15:06:56,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:06:56,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455033406] [2022-07-14 15:06:56,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:06:56,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:06:56,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:06:56,898 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:06:56,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:06:56,905 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:06:56,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:06:56,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1756570492, now seen corresponding path program 2 times [2022-07-14 15:06:56,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:06:56,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016105168] [2022-07-14 15:06:56,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:06:56,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:06:56,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:06:56,918 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:06:56,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:06:56,929 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:06:56,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:06:56,930 INFO L85 PathProgramCache]: Analyzing trace with hash 170190416, now seen corresponding path program 1 times [2022-07-14 15:06:56,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:06:56,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506314444] [2022-07-14 15:06:56,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:06:56,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:06:56,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:06:56,982 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 15:06:56,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:06:56,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506314444] [2022-07-14 15:06:56,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506314444] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 15:06:56,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [205389911] [2022-07-14 15:06:56,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:06:56,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 15:06:56,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:06:56,984 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 15:06:56,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-14 15:06:57,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:06:57,037 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-14 15:06:57,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:06:57,080 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 15:06:57,080 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 15:06:57,104 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 15:06:57,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [205389911] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 15:06:57,104 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 15:06:57,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2022-07-14 15:06:57,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102155620] [2022-07-14 15:06:57,105 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 15:06:57,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:06:57,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-14 15:06:57,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-07-14 15:06:57,367 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. cyclomatic complexity: 5 Second operand has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 9 states have internal predecessors, (20), 2 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:06:57,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:06:57,423 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2022-07-14 15:06:57,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 15:06:57,424 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 24 transitions. [2022-07-14 15:06:57,425 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-07-14 15:06:57,426 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 18 states and 21 transitions. [2022-07-14 15:06:57,427 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2022-07-14 15:06:57,428 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2022-07-14 15:06:57,428 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 21 transitions. [2022-07-14 15:06:57,428 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:06:57,428 INFO L369 hiAutomatonCegarLoop]: Abstraction has 18 states and 21 transitions. [2022-07-14 15:06:57,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 21 transitions. [2022-07-14 15:06:57,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2022-07-14 15:06:57,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:06:57,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2022-07-14 15:06:57,431 INFO L392 hiAutomatonCegarLoop]: Abstraction has 17 states and 20 transitions. [2022-07-14 15:06:57,431 INFO L374 stractBuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2022-07-14 15:06:57,432 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-14 15:06:57,432 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2022-07-14 15:06:57,433 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-07-14 15:06:57,433 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:06:57,433 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:06:57,433 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2022-07-14 15:06:57,435 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:06:57,435 INFO L752 eck$LassoCheckResult]: Stem: 326#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 327#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~nondet9#1, main_#t~post8#1, main_~i~0#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;main_~n~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; 330#L31 assume !(main_~n~0#1 < 1);call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;main_~i~0#1 := 0; 331#L36-3 assume !!(main_~i~0#1 < main_~n~0#1);call write~int(main_#t~nondet9#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet9#1; 333#L36-2 main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 334#L36-3 assume !!(main_~i~0#1 < main_~n~0#1);call write~int(main_#t~nondet9#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet9#1; 335#L36-2 main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 336#L36-3 assume !(main_~i~0#1 < main_~n~0#1); 321#L36-4 call selectionSort(main_~a~0#1.base, main_~a~0#1.offset, 0, main_~n~0#1);< 320#selectionSortENTRY [2022-07-14 15:06:57,436 INFO L754 eck$LassoCheckResult]: Loop: 320#selectionSortENTRY ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 323#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 328#L14-3 assume !!(~index~0 < ~size);call #t~mem2 := read~int(~array.base, ~array.offset + 4 * ~index~0, 4);call #t~mem3 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4); 329#L16 assume #t~mem2 < #t~mem3;havoc #t~mem2;havoc #t~mem3;~minIndex~0 := ~index~0; 324#L14-2 #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; 325#L14-3 assume !(~index~0 < ~size); 332#L14-4 call #t~mem4 := read~int(~array.base, ~array.offset + 4 * ~startIndex, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4);call write~int(#t~mem5, ~array.base, ~array.offset + 4 * ~startIndex, 4);havoc #t~mem5;call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~minIndex~0, 4); 322#L22 call selectionSort(~array.base, ~array.offset, 1 + ~startIndex, ~size);< 320#selectionSortENTRY [2022-07-14 15:06:57,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:06:57,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1357299119, now seen corresponding path program 2 times [2022-07-14 15:06:57,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:06:57,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91875312] [2022-07-14 15:06:57,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:06:57,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:06:57,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:06:57,453 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:06:57,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:06:57,462 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:06:57,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:06:57,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1756570492, now seen corresponding path program 3 times [2022-07-14 15:06:57,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:06:57,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955262395] [2022-07-14 15:06:57,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:06:57,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:06:57,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:06:57,478 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:06:57,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:06:57,485 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:06:57,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:06:57,485 INFO L85 PathProgramCache]: Analyzing trace with hash -290845646, now seen corresponding path program 2 times [2022-07-14 15:06:57,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:06:57,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161596740] [2022-07-14 15:06:57,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:06:57,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:06:57,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:06:57,501 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:06:57,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:06:57,514 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:06:58,048 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 15:06:58,049 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 15:06:58,049 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 15:06:58,049 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 15:06:58,049 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-14 15:06:58,049 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:06:58,049 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 15:06:58,049 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 15:06:58,049 INFO L133 ssoRankerPreferences]: Filename of dumped script: selectionSort_recursive.i_Iteration5_Lasso [2022-07-14 15:06:58,049 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 15:06:58,049 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 15:06:58,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:58,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:58,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:58,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:58,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:58,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:58,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:58,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:58,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:58,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:58,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:58,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:58,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:58,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:58,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:58,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:58,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:58,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:58,073 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:58,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:58,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:58,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:58,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:58,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:58,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:58,081 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:58,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:06:58,181 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.IllegalArgumentException at de.uni_freiburg.informatik.ultimate.util.datastructures.ScopedHashMap.put(ScopedHashMap.java:331) at java.base/java.util.AbstractMap.putAll(AbstractMap.java:281) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.PureSubstitution.(PureSubstitution.java:81) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.Substitution.(Substitution.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.Substitution.apply(Substitution.java:59) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceMapReads(MapEliminator.java:518) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:342) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:111) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:280) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:601) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:914) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:823) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:247) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.cegar.AbstractBuchiCegarLoop.runCegarLoop(AbstractBuchiCegarLoop.java:310) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:146) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:363) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-14 15:06:58,184 INFO L158 Benchmark]: Toolchain (without parser) took 3403.51ms. Allocated memory was 86.0MB in the beginning and 125.8MB in the end (delta: 39.8MB). Free memory was 53.9MB in the beginning and 67.5MB in the end (delta: -13.6MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. [2022-07-14 15:06:58,184 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 86.0MB. Free memory is still 43.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 15:06:58,184 INFO L158 Benchmark]: CACSL2BoogieTranslator took 145.82ms. Allocated memory is still 86.0MB. Free memory was 53.8MB in the beginning and 62.9MB in the end (delta: -9.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-14 15:06:58,185 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.06ms. Allocated memory is still 86.0MB. Free memory was 62.9MB in the beginning and 61.5MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 15:06:58,185 INFO L158 Benchmark]: Boogie Preprocessor took 28.96ms. Allocated memory is still 86.0MB. Free memory was 61.5MB in the beginning and 60.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 15:06:58,185 INFO L158 Benchmark]: RCFGBuilder took 231.53ms. Allocated memory is still 86.0MB. Free memory was 60.1MB in the beginning and 50.0MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-14 15:06:58,185 INFO L158 Benchmark]: BuchiAutomizer took 2962.27ms. Allocated memory was 86.0MB in the beginning and 125.8MB in the end (delta: 39.8MB). Free memory was 49.7MB in the beginning and 67.5MB in the end (delta: -17.8MB). Peak memory consumption was 42.9MB. Max. memory is 16.1GB. [2022-07-14 15:06:58,187 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 86.0MB. Free memory is still 43.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 145.82ms. Allocated memory is still 86.0MB. Free memory was 53.8MB in the beginning and 62.9MB in the end (delta: -9.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.06ms. Allocated memory is still 86.0MB. Free memory was 62.9MB in the beginning and 61.5MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.96ms. Allocated memory is still 86.0MB. Free memory was 61.5MB in the beginning and 60.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 231.53ms. Allocated memory is still 86.0MB. Free memory was 60.1MB in the beginning and 50.0MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 2962.27ms. Allocated memory was 86.0MB in the beginning and 125.8MB in the end (delta: 39.8MB). Free memory was 49.7MB in the beginning and 67.5MB in the end (delta: -17.8MB). Peak memory consumption was 42.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: IllegalArgumentException: null de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: IllegalArgumentException: null: de.uni_freiburg.informatik.ultimate.util.datastructures.ScopedHashMap.put(ScopedHashMap.java:331) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-14 15:06:58,215 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-14 15:06:58,420 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*64bit*_Bitvector*.epf No suitable settings file found using Termination*64bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: IllegalArgumentException: null