./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-recursive-malloc/selectionSort_recursive.i --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -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-dev-03d7b7b [2022-02-21 03:36:18,387 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:36:18,388 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:36:18,418 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:36:18,419 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:36:18,420 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:36:18,421 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:36:18,422 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:36:18,426 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:36:18,431 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:36:18,432 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:36:18,433 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:36:18,434 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:36:18,436 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:36:18,438 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:36:18,439 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:36:18,440 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:36:18,441 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:36:18,443 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:36:18,445 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:36:18,456 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:36:18,457 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:36:18,457 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:36:18,458 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:36:18,460 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:36:18,460 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:36:18,460 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:36:18,461 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:36:18,461 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:36:18,465 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:36:18,465 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:36:18,466 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:36:18,467 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:36:18,467 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:36:18,468 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:36:18,469 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:36:18,470 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:36:18,470 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:36:18,470 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:36:18,471 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:36:18,472 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:36:18,472 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-02-21 03:36:18,501 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:36:18,502 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:36:18,502 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:36:18,503 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:36:18,503 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:36:18,503 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:36:18,504 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:36:18,504 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:36:18,504 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:36:18,504 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:36:18,505 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:36:18,505 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:36:18,505 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:36:18,505 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:36:18,505 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:36:18,506 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:36:18,506 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:36:18,506 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:36:18,506 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:36:18,506 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:36:18,506 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:36:18,507 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:36:18,507 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:36:18,507 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:36:18,507 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:36:18,507 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:36:18,508 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:36:18,508 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:36:18,508 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:36:18,508 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-02-21 03:36:18,693 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:36:18,729 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:36:18,731 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:36:18,732 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:36:18,732 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:36:18,733 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-02-21 03:36:18,780 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f83879c5c/e3baf439abac4d3fa4c1a54ea82f1b65/FLAGaf54292b6 [2022-02-21 03:36:19,136 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:36:19,136 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-recursive-malloc/selectionSort_recursive.i [2022-02-21 03:36:19,141 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f83879c5c/e3baf439abac4d3fa4c1a54ea82f1b65/FLAGaf54292b6 [2022-02-21 03:36:19,151 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f83879c5c/e3baf439abac4d3fa4c1a54ea82f1b65 [2022-02-21 03:36:19,154 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:36:19,155 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:36:19,156 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:36:19,156 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:36:19,159 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:36:19,160 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:36:19" (1/1) ... [2022-02-21 03:36:19,161 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c4f8316 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:19, skipping insertion in model container [2022-02-21 03:36:19,161 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:36:19" (1/1) ... [2022-02-21 03:36:19,166 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:36:19,175 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:36:19,327 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:36:19,335 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:36:19,347 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:36:19,358 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:36:19,359 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:19 WrapperNode [2022-02-21 03:36:19,360 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:36:19,361 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:36:19,361 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:36:19,361 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:36:19,381 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:19" (1/1) ... [2022-02-21 03:36:19,391 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:19" (1/1) ... [2022-02-21 03:36:19,415 INFO L137 Inliner]: procedures = 11, calls = 13, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 27 [2022-02-21 03:36:19,415 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:36:19,416 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:36:19,417 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:36:19,417 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:36:19,423 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:19" (1/1) ... [2022-02-21 03:36:19,423 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:19" (1/1) ... [2022-02-21 03:36:19,435 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:19" (1/1) ... [2022-02-21 03:36:19,435 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:19" (1/1) ... [2022-02-21 03:36:19,447 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:19" (1/1) ... [2022-02-21 03:36:19,456 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:19" (1/1) ... [2022-02-21 03:36:19,458 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:19" (1/1) ... [2022-02-21 03:36:19,460 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:36:19,466 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:36:19,466 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:36:19,466 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:36:19,467 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:19" (1/1) ... [2022-02-21 03:36:19,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:19,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:19,505 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-02-21 03:36:19,522 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-02-21 03:36:19,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 03:36:19,545 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-21 03:36:19,545 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:36:19,545 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:36:19,546 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 03:36:19,546 INFO L130 BoogieDeclarations]: Found specification of procedure selectionSort [2022-02-21 03:36:19,546 INFO L138 BoogieDeclarations]: Found implementation of procedure selectionSort [2022-02-21 03:36:19,547 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 03:36:19,597 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:36:19,599 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:36:19,800 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:36:19,805 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:36:19,805 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-21 03:36:19,807 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:36:19 BoogieIcfgContainer [2022-02-21 03:36:19,807 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:36:19,808 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:36:19,808 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:36:19,813 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:36:19,813 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:36:19,813 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:36:19" (1/3) ... [2022-02-21 03:36:19,814 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@494940a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:36:19, skipping insertion in model container [2022-02-21 03:36:19,818 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:36:19,818 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:19" (2/3) ... [2022-02-21 03:36:19,818 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@494940a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:36:19, skipping insertion in model container [2022-02-21 03:36:19,818 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:36:19,819 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:36:19" (3/3) ... [2022-02-21 03:36:19,820 INFO L388 chiAutomizerObserver]: Analyzing ICFG selectionSort_recursive.i [2022-02-21 03:36:19,848 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:36:19,849 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:36:19,849 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:36:19,849 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:36:19,849 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:36:19,849 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:36:19,849 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:36:19,849 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:36:19,871 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-02-21 03:36:19,897 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-02-21 03:36:19,897 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:19,897 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:19,900 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-02-21 03:36:19,901 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:36:19,901 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:36:19,901 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-02-21 03:36:19,907 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-02-21 03:36:19,908 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:19,908 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:19,908 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-02-21 03:36:19,908 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:36:19,913 INFO L791 eck$LassoCheckResult]: Stem: 7#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 12#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; 10#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; 13#L36-3true [2022-02-21 03:36:19,913 INFO L793 eck$LassoCheckResult]: Loop: 13#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; 14#L36-2true main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 13#L36-3true [2022-02-21 03:36:19,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:19,921 INFO L85 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2022-02-21 03:36:19,927 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:19,928 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984323924] [2022-02-21 03:36:19,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:19,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:20,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:20,008 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:20,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:20,040 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:20,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:20,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1443, now seen corresponding path program 1 times [2022-02-21 03:36:20,043 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:20,043 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964977373] [2022-02-21 03:36:20,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:20,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:20,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:20,067 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:20,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:20,085 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:20,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:20,087 INFO L85 PathProgramCache]: Analyzing trace with hash 28695942, now seen corresponding path program 1 times [2022-02-21 03:36:20,087 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:20,087 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701917448] [2022-02-21 03:36:20,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:20,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:20,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:20,126 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:20,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:20,185 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:20,392 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:36:20,392 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:36:20,392 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:36:20,392 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:36:20,392 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:36:20,393 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:20,393 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:36:20,393 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:36:20,393 INFO L133 ssoRankerPreferences]: Filename of dumped script: selectionSort_recursive.i_Iteration1_Lasso [2022-02-21 03:36:20,393 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:36:20,393 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:36:20,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:20,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:20,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:20,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:20,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:20,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:20,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:20,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:20,701 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:36:20,704 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:36:20,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:20,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:20,713 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-02-21 03:36:20,714 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-02-21 03:36:20,716 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-02-21 03:36:20,722 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:20,722 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:20,723 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:20,723 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:20,727 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:20,727 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:20,743 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:20,763 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-02-21 03:36:20,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:20,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:20,776 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-02-21 03:36:20,777 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-02-21 03:36:20,778 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-02-21 03:36:20,784 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:20,784 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:20,785 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:20,785 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:20,785 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:20,785 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:20,786 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:20,794 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:20,810 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-02-21 03:36:20,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:20,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:20,817 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-02-21 03:36:20,832 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-02-21 03:36:20,838 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:20,839 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:20,839 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:20,839 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:20,839 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:20,839 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:20,839 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:20,843 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-02-21 03:36:20,855 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:20,875 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-02-21 03:36:20,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:20,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:20,877 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-02-21 03:36:20,883 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-02-21 03:36:20,883 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-02-21 03:36:20,893 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:20,894 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:20,894 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:20,894 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:20,894 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:20,894 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:20,894 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:20,911 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:20,929 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-02-21 03:36:20,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:20,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:20,931 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-02-21 03:36:20,932 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-02-21 03:36:20,934 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-02-21 03:36:20,940 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:20,940 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:20,940 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:20,940 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:20,940 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:20,941 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:20,941 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:20,954 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:20,979 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-02-21 03:36:20,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:20,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:20,983 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-02-21 03:36:20,984 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-02-21 03:36:20,985 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-02-21 03:36:20,992 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:20,992 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:20,993 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:20,993 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:20,995 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:20,995 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:21,009 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:21,028 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-02-21 03:36:21,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:21,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:21,030 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:21,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-02-21 03:36:21,032 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-02-21 03:36:21,038 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:21,039 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:21,039 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:21,039 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:21,039 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:21,039 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:21,039 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:21,055 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:21,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:21,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:21,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:21,079 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:21,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-02-21 03:36:21,082 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-02-21 03:36:21,089 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:21,090 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:21,090 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:21,090 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:21,095 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:21,095 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:21,111 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:36:21,139 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2022-02-21 03:36:21,139 INFO L444 ModelExtractionUtils]: 4 out of 16 variables were initially zero. Simplification set additionally 9 variables to zero. [2022-02-21 03:36:21,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:21,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:21,146 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:21,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-02-21 03:36:21,182 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:36:21,191 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:36:21,191 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:36:21,192 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-02-21 03:36:21,210 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2022-02-21 03:36:21,224 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2022-02-21 03:36:21,236 INFO L390 LassoCheck]: Loop: "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;" "main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1;" [2022-02-21 03:36:21,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:21,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:21,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:21,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:36:21,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:21,283 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:21,296 INFO L290 TraceCheckUtils]: 0: Hoare triple {29#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {29#unseeded} is VALID [2022-02-21 03:36:21,297 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#unseeded} 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; {29#unseeded} is VALID [2022-02-21 03:36:21,298 INFO L290 TraceCheckUtils]: 2: Hoare triple {29#unseeded} 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; {29#unseeded} is VALID [2022-02-21 03:36:21,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:21,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:36:21,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:21,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:21,341 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~n~0#1|))} 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; {58#(and (< |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~n~0#1|) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~n~0#1|)))} is VALID [2022-02-21 03:36:21,342 INFO L290 TraceCheckUtils]: 1: Hoare triple {58#(and (< |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~n~0#1|) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~n~0#1|)))} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {47#(or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~n~0#1|))) unseeded)} is VALID [2022-02-21 03:36:21,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:36:21,361 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 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-02-21 03:36:21,368 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:36:21,369 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 3 letters. Loop has 2 letters. [2022-02-21 03:36:21,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,374 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-02-21 03:36:21,376 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-02-21 03:36:21,426 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-02-21 03:36:21,426 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-02-21 03:36:21,426 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:36:21,427 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-02-21 03:36:21,429 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-02-21 03:36:21,429 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:21,429 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:21,429 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. 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-02-21 03:36:21,432 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 03:36:21,433 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:21,433 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:21,433 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 53 transitions. [2022-02-21 03:36:21,434 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-02-21 03:36:21,434 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:21,434 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:21,435 INFO L70 LassoExtractor]: Start lassoExtractor. 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-02-21 03:36:21,437 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-02-21 03:36:21,439 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 9 examples of accepted words. [2022-02-21 03:36:21,439 INFO L70 LassoExtractor]: Start lassoExtractor. 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-02-21 03:36:21,443 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 03:36:21,447 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:36:21,448 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 39 states and 53 transitions. cyclomatic complexity: 17 [2022-02-21 03:36:21,449 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 7 examples of accepted words. [2022-02-21 03:36:21,449 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 3 letters. Loop has 2 letters. [2022-02-21 03:36:21,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,449 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 3 letters. Loop has 2 letters. [2022-02-21 03:36:21,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 53 transitions. cyclomatic complexity: 17 Stem has 3 letters. Loop has 2 letters. [2022-02-21 03:36:21,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,450 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:36:21,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,450 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:36:21,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 53 transitions. cyclomatic complexity: 17 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:36:21,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,451 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:36:21,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,451 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:36:21,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 53 transitions. cyclomatic complexity: 17 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:36:21,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,452 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 39 letters. Loop has 39 letters. [2022-02-21 03:36:21,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,452 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 39 letters. Loop has 39 letters. [2022-02-21 03:36:21,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 53 transitions. cyclomatic complexity: 17 Stem has 39 letters. Loop has 39 letters. [2022-02-21 03:36:21,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,453 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 19 letters. Loop has 19 letters. [2022-02-21 03:36:21,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,453 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 19 letters. Loop has 19 letters. [2022-02-21 03:36:21,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 53 transitions. cyclomatic complexity: 17 Stem has 19 letters. Loop has 19 letters. [2022-02-21 03:36:21,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,454 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:36:21,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,454 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:36:21,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 53 transitions. cyclomatic complexity: 17 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:36:21,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,455 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:36:21,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,455 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:36:21,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 53 transitions. cyclomatic complexity: 17 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:36:21,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,456 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:36:21,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,456 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:36:21,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 53 transitions. cyclomatic complexity: 17 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:36:21,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,457 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:36:21,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,458 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:36:21,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 53 transitions. cyclomatic complexity: 17 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:36:21,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,458 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:36:21,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,459 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:36:21,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 53 transitions. cyclomatic complexity: 17 Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:36:21,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,460 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 9 letters. Loop has 5 letters. [2022-02-21 03:36:21,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,460 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 9 letters. Loop has 5 letters. [2022-02-21 03:36:21,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 53 transitions. cyclomatic complexity: 17 Stem has 9 letters. Loop has 5 letters. [2022-02-21 03:36:21,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,461 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 8 letters. Loop has 5 letters. [2022-02-21 03:36:21,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,461 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 8 letters. Loop has 5 letters. [2022-02-21 03:36:21,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 53 transitions. cyclomatic complexity: 17 Stem has 8 letters. Loop has 5 letters. [2022-02-21 03:36:21,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,462 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:36:21,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,463 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:36:21,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 53 transitions. cyclomatic complexity: 17 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:36:21,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,464 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:36:21,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,464 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:36:21,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 53 transitions. cyclomatic complexity: 17 Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:36:21,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,465 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 3 letters. Loop has 2 letters. [2022-02-21 03:36:21,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,465 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 3 letters. Loop has 2 letters. [2022-02-21 03:36:21,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 53 transitions. cyclomatic complexity: 17 Stem has 3 letters. Loop has 2 letters. [2022-02-21 03:36:21,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,466 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:36:21,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,466 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:36:21,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 53 transitions. cyclomatic complexity: 17 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:36:21,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,467 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 2 letters. Loop has 4 letters. [2022-02-21 03:36:21,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,467 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 2 letters. Loop has 4 letters. [2022-02-21 03:36:21,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 53 transitions. cyclomatic complexity: 17 Stem has 2 letters. Loop has 4 letters. [2022-02-21 03:36:21,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,468 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:36:21,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,468 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:36:21,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 53 transitions. cyclomatic complexity: 17 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:36:21,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,469 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 8 letters. Loop has 5 letters. [2022-02-21 03:36:21,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,470 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 8 letters. Loop has 5 letters. [2022-02-21 03:36:21,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 53 transitions. cyclomatic complexity: 17 Stem has 8 letters. Loop has 5 letters. [2022-02-21 03:36:21,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,470 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:36:21,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,471 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:36:21,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 53 transitions. cyclomatic complexity: 17 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:36:21,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,471 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:36:21,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,472 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:36:21,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 53 transitions. cyclomatic complexity: 17 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:36:21,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,472 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 9 letters. Loop has 5 letters. [2022-02-21 03:36:21,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,473 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 9 letters. Loop has 5 letters. [2022-02-21 03:36:21,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 53 transitions. cyclomatic complexity: 17 Stem has 9 letters. Loop has 5 letters. [2022-02-21 03:36:21,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,474 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:36:21,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,474 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:36:21,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 53 transitions. cyclomatic complexity: 17 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:36:21,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,475 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:36:21,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,475 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:36:21,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 53 transitions. cyclomatic complexity: 17 Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:36:21,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,476 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:36:21,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,476 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:36:21,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 53 transitions. cyclomatic complexity: 17 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:36:21,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,477 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:36:21,481 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-02-21 03:36:21,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2022-02-21 03:36:21,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 3 letters. Loop has 2 letters. [2022-02-21 03:36:21,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:36:21,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 3 letters. Loop has 4 letters. [2022-02-21 03:36:21,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,483 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 53 transitions. cyclomatic complexity: 17 [2022-02-21 03:36:21,487 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-02-21 03:36:21,490 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 14 states and 19 transitions. [2022-02-21 03:36:21,491 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2022-02-21 03:36:21,491 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2022-02-21 03:36:21,492 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2022-02-21 03:36:21,492 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:36:21,492 INFO L681 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2022-02-21 03:36:21,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2022-02-21 03:36:21,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-02-21 03:36:21,510 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:36:21,511 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states and 19 transitions. Second 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-02-21 03:36:21,511 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states and 19 transitions. Second 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-02-21 03:36:21,513 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. Second 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-02-21 03:36:21,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:21,515 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2022-02-21 03:36:21,515 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 19 transitions. [2022-02-21 03:36:21,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:21,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:21,516 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 14 states and 19 transitions. [2022-02-21 03:36:21,516 INFO L87 Difference]: Start difference. First 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) Second operand 14 states and 19 transitions. [2022-02-21 03:36:21,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:21,517 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2022-02-21 03:36:21,517 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 19 transitions. [2022-02-21 03:36:21,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:21,518 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:21,518 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:36:21,518 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:36:21,518 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-02-21 03:36:21,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2022-02-21 03:36:21,520 INFO L704 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2022-02-21 03:36:21,520 INFO L587 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2022-02-21 03:36:21,520 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:36:21,520 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2022-02-21 03:36:21,520 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-02-21 03:36:21,521 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:21,521 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:21,521 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 03:36:21,521 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-02-21 03:36:21,521 INFO L791 eck$LassoCheckResult]: Stem: 119#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 120#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; 123#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; 124#L36-3 assume !(main_~i~0#1 < main_~n~0#1); 114#L36-4 call selectionSort(main_~a~0#1.base, main_~a~0#1.offset, 0, main_~n~0#1);< 117#selectionSortENTRY [2022-02-21 03:36:21,521 INFO L793 eck$LassoCheckResult]: Loop: 117#selectionSortENTRY ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 118#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 116#L14-3 assume !(~index~0 < ~size); 121#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); 115#L22 call selectionSort(~array.base, ~array.offset, 1 + ~startIndex, ~size);< 117#selectionSortENTRY [2022-02-21 03:36:21,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:21,522 INFO L85 PathProgramCache]: Analyzing trace with hash 28695915, now seen corresponding path program 1 times [2022-02-21 03:36:21,522 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:21,522 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425486650] [2022-02-21 03:36:21,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:21,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:21,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:21,583 INFO L290 TraceCheckUtils]: 0: Hoare triple {158#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {158#true} is VALID [2022-02-21 03:36:21,583 INFO L290 TraceCheckUtils]: 1: Hoare triple {158#true} 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; {158#true} is VALID [2022-02-21 03:36:21,584 INFO L290 TraceCheckUtils]: 2: Hoare triple {158#true} 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; {160#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-21 03:36:21,585 INFO L290 TraceCheckUtils]: 3: Hoare triple {160#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~n~0#1|))} assume !(main_~i~0#1 < main_~n~0#1); {159#false} is VALID [2022-02-21 03:36:21,585 INFO L272 TraceCheckUtils]: 4: Hoare triple {159#false} call selectionSort(main_~a~0#1.base, main_~a~0#1.offset, 0, main_~n~0#1); {159#false} is VALID [2022-02-21 03:36:21,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:36:21,585 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:36:21,586 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425486650] [2022-02-21 03:36:21,586 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425486650] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:36:21,586 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:36:21,586 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:36:21,587 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134649446] [2022-02-21 03:36:21,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:36:21,588 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:36:21,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:21,589 INFO L85 PathProgramCache]: Analyzing trace with hash 53570596, now seen corresponding path program 1 times [2022-02-21 03:36:21,589 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:21,589 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676969298] [2022-02-21 03:36:21,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:21,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:21,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:21,619 INFO L290 TraceCheckUtils]: 0: Hoare triple {161#true} ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; {161#true} is VALID [2022-02-21 03:36:21,620 INFO L290 TraceCheckUtils]: 1: Hoare triple {161#true} assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; {163#(<= (+ selectionSort_~index~0 1) selectionSort_~size)} is VALID [2022-02-21 03:36:21,620 INFO L290 TraceCheckUtils]: 2: Hoare triple {163#(<= (+ selectionSort_~index~0 1) selectionSort_~size)} assume !(~index~0 < ~size); {162#false} is VALID [2022-02-21 03:36:21,621 INFO L290 TraceCheckUtils]: 3: Hoare triple {162#false} 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); {162#false} is VALID [2022-02-21 03:36:21,621 INFO L272 TraceCheckUtils]: 4: Hoare triple {162#false} call selectionSort(~array.base, ~array.offset, 1 + ~startIndex, ~size); {162#false} is VALID [2022-02-21 03:36:21,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:36:21,621 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:36:21,621 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676969298] [2022-02-21 03:36:21,621 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676969298] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:36:21,621 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:36:21,621 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:36:21,621 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327963819] [2022-02-21 03:36:21,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:36:21,622 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:36:21,622 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:36:21,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:36:21,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:36:21,624 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-02-21 03:36:21,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:21,648 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2022-02-21 03:36:21,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:36:21,648 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 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-02-21 03:36:21,682 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:36:21,682 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 19 transitions. [2022-02-21 03:36:21,683 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-02-21 03:36:21,684 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 19 transitions. [2022-02-21 03:36:21,684 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2022-02-21 03:36:21,684 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2022-02-21 03:36:21,684 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2022-02-21 03:36:21,684 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:36:21,684 INFO L681 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2022-02-21 03:36:21,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2022-02-21 03:36:21,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-02-21 03:36:21,685 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:36:21,685 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states and 19 transitions. Second 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-02-21 03:36:21,686 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states and 19 transitions. Second 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-02-21 03:36:21,686 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. Second 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-02-21 03:36:21,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:21,687 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2022-02-21 03:36:21,687 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 19 transitions. [2022-02-21 03:36:21,687 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:21,687 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:21,687 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 15 states and 19 transitions. [2022-02-21 03:36:21,687 INFO L87 Difference]: Start difference. First 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) Second operand 15 states and 19 transitions. [2022-02-21 03:36:21,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:21,689 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2022-02-21 03:36:21,689 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 19 transitions. [2022-02-21 03:36:21,689 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:21,689 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:21,689 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:36:21,690 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:36:21,690 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-02-21 03:36:21,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2022-02-21 03:36:21,690 INFO L704 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2022-02-21 03:36:21,691 INFO L587 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2022-02-21 03:36:21,691 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:36:21,691 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2022-02-21 03:36:21,691 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-02-21 03:36:21,691 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:21,691 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:21,692 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 03:36:21,692 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:36:21,692 INFO L791 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); 181#L36-4 call selectionSort(main_~a~0#1.base, main_~a~0#1.offset, 0, main_~n~0#1);< 179#selectionSortENTRY [2022-02-21 03:36:21,692 INFO L793 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-02-21 03:36:21,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:21,693 INFO L85 PathProgramCache]: Analyzing trace with hash 28695915, now seen corresponding path program 2 times [2022-02-21 03:36:21,693 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:21,693 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719232762] [2022-02-21 03:36:21,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:21,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:21,707 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:21,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:21,732 INFO L290 TraceCheckUtils]: 0: Hoare triple {227#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {227#true} is VALID [2022-02-21 03:36:21,732 INFO L290 TraceCheckUtils]: 1: Hoare triple {227#true} 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; {227#true} is VALID [2022-02-21 03:36:21,733 INFO L290 TraceCheckUtils]: 2: Hoare triple {227#true} 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; {229#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-21 03:36:21,733 INFO L290 TraceCheckUtils]: 3: Hoare triple {229#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~n~0#1|))} assume !(main_~i~0#1 < main_~n~0#1); {228#false} is VALID [2022-02-21 03:36:21,733 INFO L272 TraceCheckUtils]: 4: Hoare triple {228#false} call selectionSort(main_~a~0#1.base, main_~a~0#1.offset, 0, main_~n~0#1); {228#false} is VALID [2022-02-21 03:36:21,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:36:21,734 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:36:21,734 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719232762] [2022-02-21 03:36:21,734 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719232762] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:36:21,734 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:36:21,734 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:36:21,734 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865293860] [2022-02-21 03:36:21,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:36:21,735 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:36:21,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:21,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1756570492, now seen corresponding path program 1 times [2022-02-21 03:36:21,735 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:21,735 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671492803] [2022-02-21 03:36:21,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:21,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:21,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:21,768 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:21,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:21,780 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:22,476 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:36:22,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:36:22,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:36:22,480 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-02-21 03:36:22,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:22,502 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2022-02-21 03:36:22,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:36:22,502 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 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-02-21 03:36:22,506 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:36:22,506 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 19 transitions. [2022-02-21 03:36:22,507 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-02-21 03:36:22,508 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 19 transitions. [2022-02-21 03:36:22,508 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2022-02-21 03:36:22,508 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2022-02-21 03:36:22,508 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 19 transitions. [2022-02-21 03:36:22,508 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:36:22,508 INFO L681 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2022-02-21 03:36:22,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 19 transitions. [2022-02-21 03:36:22,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2022-02-21 03:36:22,509 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:36:22,509 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states and 19 transitions. Second 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-02-21 03:36:22,509 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states and 19 transitions. Second 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-02-21 03:36:22,509 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second 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-02-21 03:36:22,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:22,510 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2022-02-21 03:36:22,510 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2022-02-21 03:36:22,510 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:22,510 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:22,510 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 16 states and 19 transitions. [2022-02-21 03:36:22,510 INFO L87 Difference]: Start difference. First 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) Second operand 16 states and 19 transitions. [2022-02-21 03:36:22,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:22,511 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2022-02-21 03:36:22,511 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2022-02-21 03:36:22,511 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:22,511 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:22,511 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:36:22,511 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:36:22,511 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-02-21 03:36:22,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2022-02-21 03:36:22,512 INFO L704 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2022-02-21 03:36:22,512 INFO L587 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2022-02-21 03:36:22,512 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 03:36:22,512 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 18 transitions. [2022-02-21 03:36:22,512 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-02-21 03:36:22,512 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:22,512 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:22,512 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:36:22,512 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:36:22,513 INFO L791 eck$LassoCheckResult]: Stem: 254#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 255#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; 258#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; 259#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; 261#L36-2 main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 262#L36-3 assume !(main_~i~0#1 < main_~n~0#1); 250#L36-4 call selectionSort(main_~a~0#1.base, main_~a~0#1.offset, 0, main_~n~0#1);< 248#selectionSortENTRY [2022-02-21 03:36:22,515 INFO L793 eck$LassoCheckResult]: Loop: 248#selectionSortENTRY ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 251#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 256#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); 257#L16 assume #t~mem2 < #t~mem3;havoc #t~mem2;havoc #t~mem3;~minIndex~0 := ~index~0; 252#L14-2 #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; 253#L14-3 assume !(~index~0 < ~size); 260#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); 249#L22 call selectionSort(~array.base, ~array.offset, 1 + ~startIndex, ~size);< 248#selectionSortENTRY [2022-02-21 03:36:22,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:22,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1806996941, now seen corresponding path program 1 times [2022-02-21 03:36:22,515 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:22,515 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554381815] [2022-02-21 03:36:22,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:22,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:22,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:22,524 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:22,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:22,535 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:22,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:22,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1756570492, now seen corresponding path program 2 times [2022-02-21 03:36:22,536 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:22,536 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136081493] [2022-02-21 03:36:22,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:22,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:22,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:22,550 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:22,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:22,564 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:22,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:22,565 INFO L85 PathProgramCache]: Analyzing trace with hash 170190416, now seen corresponding path program 1 times [2022-02-21 03:36:22,565 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:22,565 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552468877] [2022-02-21 03:36:22,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:22,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:22,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:22,640 INFO L290 TraceCheckUtils]: 0: Hoare triple {302#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {302#true} is VALID [2022-02-21 03:36:22,640 INFO L290 TraceCheckUtils]: 1: Hoare triple {302#true} 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; {302#true} is VALID [2022-02-21 03:36:22,641 INFO L290 TraceCheckUtils]: 2: Hoare triple {302#true} 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; {304#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:22,641 INFO L290 TraceCheckUtils]: 3: Hoare triple {304#(= |ULTIMATE.start_main_~i~0#1| 0)} 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; {304#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:22,642 INFO L290 TraceCheckUtils]: 4: Hoare triple {304#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {305#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:36:22,642 INFO L290 TraceCheckUtils]: 5: Hoare triple {305#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~i~0#1 < main_~n~0#1); {306#(<= |ULTIMATE.start_main_~n~0#1| 1)} is VALID [2022-02-21 03:36:22,647 INFO L272 TraceCheckUtils]: 6: Hoare triple {306#(<= |ULTIMATE.start_main_~n~0#1| 1)} call selectionSort(main_~a~0#1.base, main_~a~0#1.offset, 0, main_~n~0#1); {307#(and (<= |selectionSort_#in~size| 1) (= |selectionSort_#in~startIndex| 0))} is VALID [2022-02-21 03:36:22,648 INFO L290 TraceCheckUtils]: 7: Hoare triple {307#(and (<= |selectionSort_#in~size| 1) (= |selectionSort_#in~startIndex| 0))} ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; {308#(and (<= selectionSort_~size 1) (= selectionSort_~startIndex 0))} is VALID [2022-02-21 03:36:22,648 INFO L290 TraceCheckUtils]: 8: Hoare triple {308#(and (<= selectionSort_~size 1) (= selectionSort_~startIndex 0))} assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; {303#false} is VALID [2022-02-21 03:36:22,648 INFO L290 TraceCheckUtils]: 9: Hoare triple {303#false} 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); {303#false} is VALID [2022-02-21 03:36:22,649 INFO L290 TraceCheckUtils]: 10: Hoare triple {303#false} assume #t~mem2 < #t~mem3;havoc #t~mem2;havoc #t~mem3;~minIndex~0 := ~index~0; {303#false} is VALID [2022-02-21 03:36:22,649 INFO L290 TraceCheckUtils]: 11: Hoare triple {303#false} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {303#false} is VALID [2022-02-21 03:36:22,649 INFO L290 TraceCheckUtils]: 12: Hoare triple {303#false} assume !(~index~0 < ~size); {303#false} is VALID [2022-02-21 03:36:22,649 INFO L290 TraceCheckUtils]: 13: Hoare triple {303#false} 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); {303#false} is VALID [2022-02-21 03:36:22,650 INFO L272 TraceCheckUtils]: 14: Hoare triple {303#false} call selectionSort(~array.base, ~array.offset, 1 + ~startIndex, ~size); {303#false} is VALID [2022-02-21 03:36:22,650 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 03:36:22,650 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:36:22,650 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552468877] [2022-02-21 03:36:22,650 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552468877] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:36:22,650 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [972822293] [2022-02-21 03:36:22,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:22,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:36:22,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:22,652 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:36:22,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-02-21 03:36:22,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:22,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 03:36:22,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:22,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:22,819 INFO L290 TraceCheckUtils]: 0: Hoare triple {302#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {302#true} is VALID [2022-02-21 03:36:22,819 INFO L290 TraceCheckUtils]: 1: Hoare triple {302#true} 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; {302#true} is VALID [2022-02-21 03:36:22,820 INFO L290 TraceCheckUtils]: 2: Hoare triple {302#true} 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; {318#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:22,820 INFO L290 TraceCheckUtils]: 3: Hoare triple {318#(<= |ULTIMATE.start_main_~i~0#1| 0)} 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; {318#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:22,821 INFO L290 TraceCheckUtils]: 4: Hoare triple {318#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {305#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:36:22,821 INFO L290 TraceCheckUtils]: 5: Hoare triple {305#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~i~0#1 < main_~n~0#1); {306#(<= |ULTIMATE.start_main_~n~0#1| 1)} is VALID [2022-02-21 03:36:22,822 INFO L272 TraceCheckUtils]: 6: Hoare triple {306#(<= |ULTIMATE.start_main_~n~0#1| 1)} call selectionSort(main_~a~0#1.base, main_~a~0#1.offset, 0, main_~n~0#1); {331#(and (<= |selectionSort_#in~size| 1) (<= 0 |selectionSort_#in~startIndex|))} is VALID [2022-02-21 03:36:22,822 INFO L290 TraceCheckUtils]: 7: Hoare triple {331#(and (<= |selectionSort_#in~size| 1) (<= 0 |selectionSort_#in~startIndex|))} ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; {335#(and (<= selectionSort_~size 1) (<= 0 selectionSort_~startIndex))} is VALID [2022-02-21 03:36:22,823 INFO L290 TraceCheckUtils]: 8: Hoare triple {335#(and (<= selectionSort_~size 1) (<= 0 selectionSort_~startIndex))} assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; {303#false} is VALID [2022-02-21 03:36:22,823 INFO L290 TraceCheckUtils]: 9: Hoare triple {303#false} 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); {303#false} is VALID [2022-02-21 03:36:22,823 INFO L290 TraceCheckUtils]: 10: Hoare triple {303#false} assume #t~mem2 < #t~mem3;havoc #t~mem2;havoc #t~mem3;~minIndex~0 := ~index~0; {303#false} is VALID [2022-02-21 03:36:22,823 INFO L290 TraceCheckUtils]: 11: Hoare triple {303#false} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {303#false} is VALID [2022-02-21 03:36:22,823 INFO L290 TraceCheckUtils]: 12: Hoare triple {303#false} assume !(~index~0 < ~size); {303#false} is VALID [2022-02-21 03:36:22,823 INFO L290 TraceCheckUtils]: 13: Hoare triple {303#false} 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); {303#false} is VALID [2022-02-21 03:36:22,823 INFO L272 TraceCheckUtils]: 14: Hoare triple {303#false} call selectionSort(~array.base, ~array.offset, 1 + ~startIndex, ~size); {303#false} is VALID [2022-02-21 03:36:22,824 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 03:36:22,824 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:36:22,933 INFO L272 TraceCheckUtils]: 14: Hoare triple {303#false} call selectionSort(~array.base, ~array.offset, 1 + ~startIndex, ~size); {303#false} is VALID [2022-02-21 03:36:22,933 INFO L290 TraceCheckUtils]: 13: Hoare triple {303#false} 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); {303#false} is VALID [2022-02-21 03:36:22,933 INFO L290 TraceCheckUtils]: 12: Hoare triple {303#false} assume !(~index~0 < ~size); {303#false} is VALID [2022-02-21 03:36:22,933 INFO L290 TraceCheckUtils]: 11: Hoare triple {303#false} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {303#false} is VALID [2022-02-21 03:36:22,934 INFO L290 TraceCheckUtils]: 10: Hoare triple {303#false} assume #t~mem2 < #t~mem3;havoc #t~mem2;havoc #t~mem3;~minIndex~0 := ~index~0; {303#false} is VALID [2022-02-21 03:36:22,934 INFO L290 TraceCheckUtils]: 9: Hoare triple {303#false} 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); {303#false} is VALID [2022-02-21 03:36:22,937 INFO L290 TraceCheckUtils]: 8: Hoare triple {375#(<= selectionSort_~size (+ selectionSort_~startIndex 1))} assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; {303#false} is VALID [2022-02-21 03:36:22,937 INFO L290 TraceCheckUtils]: 7: Hoare triple {379#(<= |selectionSort_#in~size| (+ |selectionSort_#in~startIndex| 1))} ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; {375#(<= selectionSort_~size (+ selectionSort_~startIndex 1))} is VALID [2022-02-21 03:36:22,938 INFO L272 TraceCheckUtils]: 6: Hoare triple {306#(<= |ULTIMATE.start_main_~n~0#1| 1)} call selectionSort(main_~a~0#1.base, main_~a~0#1.offset, 0, main_~n~0#1); {379#(<= |selectionSort_#in~size| (+ |selectionSort_#in~startIndex| 1))} is VALID [2022-02-21 03:36:22,939 INFO L290 TraceCheckUtils]: 5: Hoare triple {305#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~i~0#1 < main_~n~0#1); {306#(<= |ULTIMATE.start_main_~n~0#1| 1)} is VALID [2022-02-21 03:36:22,939 INFO L290 TraceCheckUtils]: 4: Hoare triple {318#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {305#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:36:22,940 INFO L290 TraceCheckUtils]: 3: Hoare triple {318#(<= |ULTIMATE.start_main_~i~0#1| 0)} 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; {318#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:22,940 INFO L290 TraceCheckUtils]: 2: Hoare triple {302#true} 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; {318#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:22,940 INFO L290 TraceCheckUtils]: 1: Hoare triple {302#true} 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; {302#true} is VALID [2022-02-21 03:36:22,940 INFO L290 TraceCheckUtils]: 0: Hoare triple {302#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {302#true} is VALID [2022-02-21 03:36:22,941 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 03:36:22,941 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [972822293] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:36:22,941 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:36:22,941 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2022-02-21 03:36:22,941 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942680199] [2022-02-21 03:36:22,941 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:36:23,502 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:36:23,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-21 03:36:23,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-02-21 03:36:23,503 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-02-21 03:36:23,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:23,658 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2022-02-21 03:36:23,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-21 03:36:23,659 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 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-02-21 03:36:23,673 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:36:23,674 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 24 transitions. [2022-02-21 03:36:23,675 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-02-21 03:36:23,675 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 18 states and 21 transitions. [2022-02-21 03:36:23,675 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2022-02-21 03:36:23,675 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2022-02-21 03:36:23,676 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 21 transitions. [2022-02-21 03:36:23,676 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:36:23,676 INFO L681 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2022-02-21 03:36:23,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 21 transitions. [2022-02-21 03:36:23,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2022-02-21 03:36:23,676 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:36:23,677 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states and 21 transitions. Second 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-02-21 03:36:23,677 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states and 21 transitions. Second 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-02-21 03:36:23,677 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second 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-02-21 03:36:23,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:23,677 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2022-02-21 03:36:23,677 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-02-21 03:36:23,677 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:23,678 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:23,678 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 18 states and 21 transitions. [2022-02-21 03:36:23,678 INFO L87 Difference]: Start difference. First 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) Second operand 18 states and 21 transitions. [2022-02-21 03:36:23,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:23,678 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2022-02-21 03:36:23,678 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-02-21 03:36:23,678 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:23,678 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:23,679 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:36:23,679 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:36:23,679 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-02-21 03:36:23,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2022-02-21 03:36:23,679 INFO L704 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2022-02-21 03:36:23,679 INFO L587 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2022-02-21 03:36:23,679 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 03:36:23,679 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2022-02-21 03:36:23,680 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-02-21 03:36:23,680 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:23,680 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:23,680 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2022-02-21 03:36:23,680 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:36:23,680 INFO L791 eck$LassoCheckResult]: Stem: 429#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 430#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; 434#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; 435#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; 436#L36-2 main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 437#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; 438#L36-2 main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 439#L36-3 assume !(main_~i~0#1 < main_~n~0#1); 424#L36-4 call selectionSort(main_~a~0#1.base, main_~a~0#1.offset, 0, main_~n~0#1);< 427#selectionSortENTRY [2022-02-21 03:36:23,680 INFO L793 eck$LassoCheckResult]: Loop: 427#selectionSortENTRY ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 428#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 431#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); 432#L16 assume #t~mem2 < #t~mem3;havoc #t~mem2;havoc #t~mem3;~minIndex~0 := ~index~0; 423#L14-2 #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; 426#L14-3 assume !(~index~0 < ~size); 433#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); 425#L22 call selectionSort(~array.base, ~array.offset, 1 + ~startIndex, ~size);< 427#selectionSortENTRY [2022-02-21 03:36:23,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:23,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1357299119, now seen corresponding path program 2 times [2022-02-21 03:36:23,680 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:23,681 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582265090] [2022-02-21 03:36:23,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:23,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:23,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:23,703 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:23,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:23,714 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:23,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:23,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1756570492, now seen corresponding path program 3 times [2022-02-21 03:36:23,715 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:23,715 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145764793] [2022-02-21 03:36:23,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:23,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:23,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:23,726 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:23,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:23,733 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:23,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:23,734 INFO L85 PathProgramCache]: Analyzing trace with hash -290845646, now seen corresponding path program 2 times [2022-02-21 03:36:23,734 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:23,734 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892408709] [2022-02-21 03:36:23,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:23,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:23,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:23,765 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:23,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:23,777 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:24,943 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:36:24,943 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:36:24,944 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:36:24,944 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:36:24,944 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:36:24,944 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:24,944 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:36:24,944 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:36:24,944 INFO L133 ssoRankerPreferences]: Filename of dumped script: selectionSort_recursive.i_Iteration5_Lasso [2022-02-21 03:36:24,944 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:36:24,944 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:36:24,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:24,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:24,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:24,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:24,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:24,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:24,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:24,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:24,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:24,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:24,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:24,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:24,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:24,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:24,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:24,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:24,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:24,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:24,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:24,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:24,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:24,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:24,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:24,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:24,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:24,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:24,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:24,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:24,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:25,173 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: v_rep(select (select old(#memory_int) selectionSort_#in~array.base) (+ selectionSort_#in~array.offset (* selectionSort_#in~startIndex 4)))_1 was not added to the transformula! at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminatorUtils.getReplacementVar(MapEliminatorUtils.java:260) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceMapReads(MapEliminator.java:509) 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:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:953) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:862) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:252) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:457) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:397) 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-02-21 03:36:25,176 INFO L158 Benchmark]: Toolchain (without parser) took 6021.09ms. Allocated memory was 88.1MB in the beginning and 182.5MB in the end (delta: 94.4MB). Free memory was 52.0MB in the beginning and 83.6MB in the end (delta: -31.6MB). Peak memory consumption was 74.3MB. Max. memory is 16.1GB. [2022-02-21 03:36:25,177 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 88.1MB. Free memory is still 68.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:36:25,177 INFO L158 Benchmark]: CACSL2BoogieTranslator took 203.98ms. Allocated memory was 88.1MB in the beginning and 119.5MB in the end (delta: 31.5MB). Free memory was 51.8MB in the beginning and 95.0MB in the end (delta: -43.1MB). Peak memory consumption was 5.9MB. Max. memory is 16.1GB. [2022-02-21 03:36:25,177 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.14ms. Allocated memory is still 119.5MB. Free memory was 95.0MB in the beginning and 93.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:36:25,178 INFO L158 Benchmark]: Boogie Preprocessor took 48.44ms. Allocated memory is still 119.5MB. Free memory was 93.5MB in the beginning and 92.3MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:36:25,178 INFO L158 Benchmark]: RCFGBuilder took 341.47ms. Allocated memory is still 119.5MB. Free memory was 92.3MB in the beginning and 79.4MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-21 03:36:25,178 INFO L158 Benchmark]: BuchiAutomizer took 5367.61ms. Allocated memory was 119.5MB in the beginning and 182.5MB in the end (delta: 62.9MB). Free memory was 79.4MB in the beginning and 83.6MB in the end (delta: -4.2MB). Peak memory consumption was 72.5MB. Max. memory is 16.1GB. [2022-02-21 03:36:25,180 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 88.1MB. Free memory is still 68.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 203.98ms. Allocated memory was 88.1MB in the beginning and 119.5MB in the end (delta: 31.5MB). Free memory was 51.8MB in the beginning and 95.0MB in the end (delta: -43.1MB). Peak memory consumption was 5.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.14ms. Allocated memory is still 119.5MB. Free memory was 95.0MB in the beginning and 93.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 48.44ms. Allocated memory is still 119.5MB. Free memory was 93.5MB in the beginning and 92.3MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 341.47ms. Allocated memory is still 119.5MB. Free memory was 92.3MB in the beginning and 79.4MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 5367.61ms. Allocated memory was 119.5MB in the beginning and 182.5MB in the end (delta: 62.9MB). Free memory was 79.4MB in the beginning and 83.6MB in the end (delta: -4.2MB). Peak memory consumption was 72.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: v_rep(select (select old(#memory_int) selectionSort_#in~array.base) (+ selectionSort_#in~array.offset (* selectionSort_#in~startIndex 4)))_1 was not added to the transformula! de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: v_rep(select (select old(#memory_int) selectionSort_#in~array.base) (+ selectionSort_#in~array.offset (* selectionSort_#in~startIndex 4)))_1 was not added to the transformula!: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminatorUtils.getReplacementVar(MapEliminatorUtils.java:260) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-21 03:36:25,207 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:25,416 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally 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: AssertionError: v_rep(select (select old(#memory_int) selectionSort_#in~array.base) (+ selectionSort_#in~array.offset (* selectionSort_#in~startIndex 4)))_1 was not added to the transformula!