./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-recursive-malloc/insertionSort_recursive.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version e19ca921 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-recursive-malloc/insertionSort_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 1ae4a3f744c0a8577333c2c3dfb4ecaabbd2cf6e1675b06577194a98b8d1aee1 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-e19ca92 [2021-12-22 19:56:08,127 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-22 19:56:08,129 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-22 19:56:08,178 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-22 19:56:08,178 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-22 19:56:08,179 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-22 19:56:08,198 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-22 19:56:08,200 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-22 19:56:08,202 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-22 19:56:08,205 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-22 19:56:08,206 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-22 19:56:08,207 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-22 19:56:08,207 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-22 19:56:08,223 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-22 19:56:08,226 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-22 19:56:08,227 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-22 19:56:08,228 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-22 19:56:08,228 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-22 19:56:08,232 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-22 19:56:08,236 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-22 19:56:08,237 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-22 19:56:08,238 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-22 19:56:08,240 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-22 19:56:08,240 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-22 19:56:08,245 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-22 19:56:08,245 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-22 19:56:08,245 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-22 19:56:08,246 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-22 19:56:08,246 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-22 19:56:08,247 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-22 19:56:08,247 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-22 19:56:08,248 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-22 19:56:08,249 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-22 19:56:08,250 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-22 19:56:08,251 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-22 19:56:08,251 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-22 19:56:08,251 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-22 19:56:08,252 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-22 19:56:08,252 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-22 19:56:08,253 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-22 19:56:08,253 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-22 19:56:08,254 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2021-12-22 19:56:08,280 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-22 19:56:08,281 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-22 19:56:08,281 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-22 19:56:08,281 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-22 19:56:08,282 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-22 19:56:08,283 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-22 19:56:08,283 INFO L138 SettingsManager]: * Use SBE=true [2021-12-22 19:56:08,283 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-22 19:56:08,283 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-22 19:56:08,283 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-22 19:56:08,284 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-22 19:56:08,284 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-22 19:56:08,284 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-22 19:56:08,285 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-22 19:56:08,285 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-22 19:56:08,285 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-22 19:56:08,285 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-22 19:56:08,285 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-22 19:56:08,285 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-22 19:56:08,285 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-22 19:56:08,286 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-22 19:56:08,286 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-22 19:56:08,286 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-22 19:56:08,286 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-22 19:56:08,287 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-22 19:56:08,287 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-22 19:56:08,288 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-22 19:56:08,288 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-22 19:56:08,288 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-22 19:56:08,289 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-22 19:56:08,289 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 -> 1ae4a3f744c0a8577333c2c3dfb4ecaabbd2cf6e1675b06577194a98b8d1aee1 [2021-12-22 19:56:08,457 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-22 19:56:08,473 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-22 19:56:08,475 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-22 19:56:08,476 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-22 19:56:08,477 INFO L275 PluginConnector]: CDTParser initialized [2021-12-22 19:56:08,478 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-recursive-malloc/insertionSort_recursive.i [2021-12-22 19:56:08,534 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0182a6f3/2d5e0ba7c92f4949bd46ca5c151dd962/FLAG2adffe236 [2021-12-22 19:56:08,863 INFO L306 CDTParser]: Found 1 translation units. [2021-12-22 19:56:08,863 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-recursive-malloc/insertionSort_recursive.i [2021-12-22 19:56:08,867 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0182a6f3/2d5e0ba7c92f4949bd46ca5c151dd962/FLAG2adffe236 [2021-12-22 19:56:09,313 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0182a6f3/2d5e0ba7c92f4949bd46ca5c151dd962 [2021-12-22 19:56:09,315 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-22 19:56:09,318 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-22 19:56:09,327 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-22 19:56:09,327 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-22 19:56:09,330 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-22 19:56:09,330 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 07:56:09" (1/1) ... [2021-12-22 19:56:09,331 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d0c442 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:56:09, skipping insertion in model container [2021-12-22 19:56:09,331 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 07:56:09" (1/1) ... [2021-12-22 19:56:09,335 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-22 19:56:09,343 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-22 19:56:09,489 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 19:56:09,494 INFO L203 MainTranslator]: Completed pre-run [2021-12-22 19:56:09,504 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 19:56:09,512 INFO L208 MainTranslator]: Completed translation [2021-12-22 19:56:09,513 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:56:09 WrapperNode [2021-12-22 19:56:09,513 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-22 19:56:09,514 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-22 19:56:09,514 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-22 19:56:09,514 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-22 19:56:09,519 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:56:09" (1/1) ... [2021-12-22 19:56:09,523 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:56:09" (1/1) ... [2021-12-22 19:56:09,536 INFO L137 Inliner]: procedures = 11, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 25 [2021-12-22 19:56:09,537 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-22 19:56:09,537 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-22 19:56:09,537 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-22 19:56:09,538 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-22 19:56:09,544 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:56:09" (1/1) ... [2021-12-22 19:56:09,544 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:56:09" (1/1) ... [2021-12-22 19:56:09,546 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:56:09" (1/1) ... [2021-12-22 19:56:09,546 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:56:09" (1/1) ... [2021-12-22 19:56:09,549 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:56:09" (1/1) ... [2021-12-22 19:56:09,551 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:56:09" (1/1) ... [2021-12-22 19:56:09,552 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:56:09" (1/1) ... [2021-12-22 19:56:09,553 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-22 19:56:09,554 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-22 19:56:09,554 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-22 19:56:09,554 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-22 19:56:09,555 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:56:09" (1/1) ... [2021-12-22 19:56:09,560 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 19:56:09,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 19:56:09,599 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-22 19:56:09,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-22 19:56:09,642 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-22 19:56:09,642 INFO L130 BoogieDeclarations]: Found specification of procedure insertionSort [2021-12-22 19:56:09,642 INFO L138 BoogieDeclarations]: Found implementation of procedure insertionSort [2021-12-22 19:56:09,643 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-22 19:56:09,643 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-22 19:56:09,643 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-22 19:56:09,643 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-22 19:56:09,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-12-22 19:56:09,691 INFO L234 CfgBuilder]: Building ICFG [2021-12-22 19:56:09,692 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-22 19:56:09,887 INFO L275 CfgBuilder]: Performing block encoding [2021-12-22 19:56:09,890 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-22 19:56:09,890 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-22 19:56:09,892 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 07:56:09 BoogieIcfgContainer [2021-12-22 19:56:09,892 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-22 19:56:09,892 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-22 19:56:09,893 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-22 19:56:09,896 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-22 19:56:09,901 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-22 19:56:09,901 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.12 07:56:09" (1/3) ... [2021-12-22 19:56:09,902 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@79935ada and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.12 07:56:09, skipping insertion in model container [2021-12-22 19:56:09,902 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-22 19:56:09,903 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:56:09" (2/3) ... [2021-12-22 19:56:09,903 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@79935ada and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.12 07:56:09, skipping insertion in model container [2021-12-22 19:56:09,903 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-22 19:56:09,903 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 07:56:09" (3/3) ... [2021-12-22 19:56:09,904 INFO L388 chiAutomizerObserver]: Analyzing ICFG insertionSort_recursive.i [2021-12-22 19:56:09,943 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-22 19:56:09,944 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-22 19:56:09,944 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-22 19:56:09,944 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-22 19:56:09,944 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-22 19:56:09,944 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-22 19:56:09,944 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-22 19:56:09,944 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-22 19:56:09,959 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 21 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 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) [2021-12-22 19:56:10,003 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2021-12-22 19:56:10,004 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-22 19:56:10,004 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-22 19:56:10,008 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2021-12-22 19:56:10,008 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-22 19:56:10,008 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-22 19:56:10,009 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 21 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 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) [2021-12-22 19:56:10,010 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2021-12-22 19:56:10,010 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-22 19:56:10,010 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-22 19:56:10,011 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2021-12-22 19:56:10,011 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-22 19:56:10,016 INFO L791 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#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~nondet7#1;havoc main_#t~nondet7#1; 18#L28true assume !(main_~n~0#1 < 1);call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~0#1 := 0; 20#L33-3true [2021-12-22 19:56:10,016 INFO L793 eck$LassoCheckResult]: Loop: 20#L33-3true assume !!(main_~i~0#1 < main_~n~0#1);call write~int(main_#t~nondet10#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet10#1; 8#L33-2true main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 20#L33-3true [2021-12-22 19:56:10,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 19:56:10,036 INFO L85 PathProgramCache]: Analyzing trace with hash 60643, now seen corresponding path program 1 times [2021-12-22 19:56:10,042 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 19:56:10,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411084946] [2021-12-22 19:56:10,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 19:56:10,044 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 19:56:10,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 19:56:10,132 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 19:56:10,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 19:56:10,154 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 19:56:10,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 19:56:10,158 INFO L85 PathProgramCache]: Analyzing trace with hash 2435, now seen corresponding path program 1 times [2021-12-22 19:56:10,158 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 19:56:10,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620745810] [2021-12-22 19:56:10,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 19:56:10,158 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 19:56:10,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 19:56:10,182 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 19:56:10,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 19:56:10,191 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 19:56:10,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 19:56:10,192 INFO L85 PathProgramCache]: Analyzing trace with hash 58279397, now seen corresponding path program 1 times [2021-12-22 19:56:10,192 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 19:56:10,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283618898] [2021-12-22 19:56:10,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 19:56:10,193 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 19:56:10,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 19:56:10,208 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 19:56:10,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 19:56:10,217 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 19:56:10,390 INFO L210 LassoAnalysis]: Preferences: [2021-12-22 19:56:10,391 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-22 19:56:10,391 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-22 19:56:10,391 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-22 19:56:10,391 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-22 19:56:10,391 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 19:56:10,391 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-22 19:56:10,391 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-22 19:56:10,392 INFO L133 ssoRankerPreferences]: Filename of dumped script: insertionSort_recursive.i_Iteration1_Lasso [2021-12-22 19:56:10,392 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-22 19:56:10,392 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-22 19:56:10,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 19:56:10,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 19:56:10,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 19:56:10,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 19:56:10,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 19:56:10,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 19:56:10,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 19:56:10,524 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 19:56:10,634 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-22 19:56:10,637 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-22 19:56:10,639 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 19:56:10,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 19:56:10,671 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-22 19:56:10,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2021-12-22 19:56:10,673 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-22 19:56:10,681 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 19:56:10,681 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-22 19:56:10,681 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 19:56:10,682 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 19:56:10,682 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 19:56:10,683 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-22 19:56:10,683 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-22 19:56:10,693 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 19:56:10,710 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2021-12-22 19:56:10,711 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 19:56:10,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 19:56:10,720 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-22 19:56:10,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2021-12-22 19:56:10,722 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-22 19:56:10,730 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 19:56:10,730 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-22 19:56:10,730 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 19:56:10,730 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 19:56:10,730 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 19:56:10,733 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-22 19:56:10,733 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-22 19:56:10,745 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 19:56:10,761 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2021-12-22 19:56:10,762 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 19:56:10,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 19:56:10,764 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-22 19:56:10,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2021-12-22 19:56:10,775 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-22 19:56:10,781 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 19:56:10,782 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 19:56:10,782 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 19:56:10,782 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 19:56:10,785 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-22 19:56:10,785 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-22 19:56:10,803 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 19:56:10,822 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2021-12-22 19:56:10,822 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 19:56:10,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 19:56:10,823 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-22 19:56:10,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2021-12-22 19:56:10,826 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-22 19:56:10,831 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 19:56:10,832 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-22 19:56:10,832 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 19:56:10,832 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 19:56:10,832 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 19:56:10,833 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-22 19:56:10,833 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-22 19:56:10,845 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 19:56:10,863 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2021-12-22 19:56:10,863 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 19:56:10,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 19:56:10,864 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-22 19:56:10,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2021-12-22 19:56:10,866 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-22 19:56:10,872 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 19:56:10,873 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 19:56:10,873 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 19:56:10,873 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 19:56:10,893 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-22 19:56:10,893 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-22 19:56:10,901 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-22 19:56:10,927 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2021-12-22 19:56:10,928 INFO L444 ModelExtractionUtils]: 4 out of 16 variables were initially zero. Simplification set additionally 9 variables to zero. [2021-12-22 19:56:10,929 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 19:56:10,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 19:56:10,956 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-22 19:56:10,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2021-12-22 19:56:10,959 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-22 19:56:10,974 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-22 19:56:10,974 INFO L513 LassoAnalysis]: Proved termination. [2021-12-22 19:56:10,975 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 [] [2021-12-22 19:56:10,992 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2021-12-22 19:56:10,997 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2021-12-22 19:56:11,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 19:56:11,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 19:56:11,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-22 19:56:11,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 19:56:11,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 19:56:11,052 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-22 19:56:11,052 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 19:56:11,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 19:56:11,100 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2021-12-22 19:56:11,101 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 21 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 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) [2021-12-22 19:56:11,149 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 21 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 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 43 states and 57 transitions. Complement of second has 9 states. [2021-12-22 19:56:11,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2021-12-22 19:56:11,153 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) [2021-12-22 19:56:11,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2021-12-22 19:56:11,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 3 letters. Loop has 2 letters. [2021-12-22 19:56:11,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-22 19:56:11,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 5 letters. Loop has 2 letters. [2021-12-22 19:56:11,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-22 19:56:11,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 3 letters. Loop has 4 letters. [2021-12-22 19:56:11,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-22 19:56:11,156 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 57 transitions. [2021-12-22 19:56:11,158 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2021-12-22 19:56:11,161 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 15 states and 20 transitions. [2021-12-22 19:56:11,161 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2021-12-22 19:56:11,161 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2021-12-22 19:56:11,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 20 transitions. [2021-12-22 19:56:11,162 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 19:56:11,162 INFO L681 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2021-12-22 19:56:11,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 20 transitions. [2021-12-22 19:56:11,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2021-12-22 19:56:11,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 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) [2021-12-22 19:56:11,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2021-12-22 19:56:11,179 INFO L704 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2021-12-22 19:56:11,179 INFO L587 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2021-12-22 19:56:11,179 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-22 19:56:11,180 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2021-12-22 19:56:11,180 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2021-12-22 19:56:11,180 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-22 19:56:11,180 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-22 19:56:11,180 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2021-12-22 19:56:11,180 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2021-12-22 19:56:11,181 INFO L791 eck$LassoCheckResult]: Stem: 112#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 113#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#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~nondet7#1;havoc main_#t~nondet7#1; 121#L28 assume !(main_~n~0#1 < 1);call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~0#1 := 0; 126#L33-3 assume !(main_~i~0#1 < main_~n~0#1); 114#L33-4 call insertionSort(0, main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 115#insertionSortENTRY [2021-12-22 19:56:11,181 INFO L793 eck$LassoCheckResult]: Loop: 115#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 122#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 118#L15-6 assume !true; 123#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 117#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 115#insertionSortENTRY [2021-12-22 19:56:11,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 19:56:11,181 INFO L85 PathProgramCache]: Analyzing trace with hash 58279346, now seen corresponding path program 1 times [2021-12-22 19:56:11,181 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 19:56:11,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772127592] [2021-12-22 19:56:11,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 19:56:11,182 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 19:56:11,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 19:56:11,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 19:56:11,228 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 19:56:11,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772127592] [2021-12-22 19:56:11,229 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772127592] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 19:56:11,229 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 19:56:11,229 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-22 19:56:11,229 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703142069] [2021-12-22 19:56:11,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 19:56:11,230 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-22 19:56:11,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 19:56:11,231 INFO L85 PathProgramCache]: Analyzing trace with hash 28740467, now seen corresponding path program 1 times [2021-12-22 19:56:11,231 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 19:56:11,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706449327] [2021-12-22 19:56:11,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 19:56:11,231 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 19:56:11,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 19:56:11,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 19:56:11,252 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 19:56:11,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706449327] [2021-12-22 19:56:11,253 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706449327] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 19:56:11,253 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 19:56:11,253 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-22 19:56:11,253 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425070543] [2021-12-22 19:56:11,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 19:56:11,253 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-22 19:56:11,253 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 19:56:11,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-22 19:56:11,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-22 19:56:11,256 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. cyclomatic complexity: 7 Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 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) [2021-12-22 19:56:11,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 19:56:11,259 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2021-12-22 19:56:11,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-22 19:56:11,259 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 19 transitions. [2021-12-22 19:56:11,260 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2021-12-22 19:56:11,260 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 19 transitions. [2021-12-22 19:56:11,260 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2021-12-22 19:56:11,260 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2021-12-22 19:56:11,260 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2021-12-22 19:56:11,260 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 19:56:11,260 INFO L681 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2021-12-22 19:56:11,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2021-12-22 19:56:11,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2021-12-22 19:56:11,261 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) [2021-12-22 19:56:11,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2021-12-22 19:56:11,262 INFO L704 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2021-12-22 19:56:11,262 INFO L587 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2021-12-22 19:56:11,262 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-22 19:56:11,262 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2021-12-22 19:56:11,262 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2021-12-22 19:56:11,262 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-22 19:56:11,262 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-22 19:56:11,262 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2021-12-22 19:56:11,262 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-22 19:56:11,263 INFO L791 eck$LassoCheckResult]: Stem: 148#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 149#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#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~nondet7#1;havoc main_#t~nondet7#1; 157#L28 assume !(main_~n~0#1 < 1);call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~0#1 := 0; 162#L33-3 assume !(main_~i~0#1 < main_~n~0#1); 150#L33-4 call insertionSort(0, main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 151#insertionSortENTRY [2021-12-22 19:56:11,263 INFO L793 eck$LassoCheckResult]: Loop: 151#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 158#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 154#L15-6 #t~short4 := ~j~0 > 0; 159#L15-1 assume #t~short4;call #t~mem3 := read~int(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short4 := #t~mem3 > ~temp~0; 160#L15-3 assume !#t~short4;havoc #t~mem3;havoc #t~short4; 161#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 153#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 151#insertionSortENTRY [2021-12-22 19:56:11,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 19:56:11,266 INFO L85 PathProgramCache]: Analyzing trace with hash 58279346, now seen corresponding path program 2 times [2021-12-22 19:56:11,266 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 19:56:11,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74969639] [2021-12-22 19:56:11,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 19:56:11,268 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 19:56:11,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 19:56:11,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 19:56:11,301 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 19:56:11,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74969639] [2021-12-22 19:56:11,302 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74969639] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 19:56:11,302 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 19:56:11,302 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-22 19:56:11,302 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244501057] [2021-12-22 19:56:11,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 19:56:11,303 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-22 19:56:11,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 19:56:11,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1835476522, now seen corresponding path program 1 times [2021-12-22 19:56:11,303 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 19:56:11,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920617394] [2021-12-22 19:56:11,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 19:56:11,304 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 19:56:11,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 19:56:11,323 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 19:56:11,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 19:56:11,344 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 19:56:11,436 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2021-12-22 19:56:11,701 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 19:56:11,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 19:56:11,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 19:56:11,702 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) [2021-12-22 19:56:11,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 19:56:11,708 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2021-12-22 19:56:11,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 19:56:11,709 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 19 transitions. [2021-12-22 19:56:11,710 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2021-12-22 19:56:11,710 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 19 transitions. [2021-12-22 19:56:11,710 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2021-12-22 19:56:11,710 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2021-12-22 19:56:11,710 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 19 transitions. [2021-12-22 19:56:11,711 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 19:56:11,711 INFO L681 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2021-12-22 19:56:11,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 19 transitions. [2021-12-22 19:56:11,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2021-12-22 19:56:11,711 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) [2021-12-22 19:56:11,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2021-12-22 19:56:11,712 INFO L704 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2021-12-22 19:56:11,712 INFO L587 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2021-12-22 19:56:11,712 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-22 19:56:11,712 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 18 transitions. [2021-12-22 19:56:11,712 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2021-12-22 19:56:11,712 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-22 19:56:11,712 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-22 19:56:11,713 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-22 19:56:11,713 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-22 19:56:11,713 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~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#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~nondet7#1;havoc main_#t~nondet7#1; 194#L28 assume !(main_~n~0#1 < 1);call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~0#1 := 0; 199#L33-3 assume !!(main_~i~0#1 < main_~n~0#1);call write~int(main_#t~nondet10#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet10#1; 192#L33-2 main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 193#L33-3 assume !(main_~i~0#1 < main_~n~0#1); 187#L33-4 call insertionSort(0, main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 188#insertionSortENTRY [2021-12-22 19:56:11,713 INFO L793 eck$LassoCheckResult]: Loop: 188#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 195#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 191#L15-6 #t~short4 := ~j~0 > 0; 196#L15-1 assume #t~short4;call #t~mem3 := read~int(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short4 := #t~mem3 > ~temp~0; 197#L15-3 assume !#t~short4;havoc #t~mem3;havoc #t~short4; 198#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 190#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 188#insertionSortENTRY [2021-12-22 19:56:11,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 19:56:11,713 INFO L85 PathProgramCache]: Analyzing trace with hash 171927092, now seen corresponding path program 1 times [2021-12-22 19:56:11,713 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 19:56:11,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598323656] [2021-12-22 19:56:11,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 19:56:11,714 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 19:56:11,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 19:56:11,735 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 19:56:11,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 19:56:11,742 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 19:56:11,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 19:56:11,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1835476522, now seen corresponding path program 2 times [2021-12-22 19:56:11,743 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 19:56:11,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967596371] [2021-12-22 19:56:11,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 19:56:11,744 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 19:56:11,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 19:56:11,761 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 19:56:11,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 19:56:11,781 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 19:56:11,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 19:56:11,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1744506729, now seen corresponding path program 1 times [2021-12-22 19:56:11,782 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 19:56:11,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813493012] [2021-12-22 19:56:11,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 19:56:11,782 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 19:56:11,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 19:56:11,841 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-22 19:56:11,841 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 19:56:11,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813493012] [2021-12-22 19:56:11,841 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813493012] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 19:56:11,841 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 19:56:11,841 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-22 19:56:11,842 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54114368] [2021-12-22 19:56:11,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 19:56:12,156 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 19:56:12,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 19:56:12,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-22 19:56:12,157 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. cyclomatic complexity: 5 Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 19:56:12,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 19:56:12,201 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2021-12-22 19:56:12,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-22 19:56:12,201 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 25 transitions. [2021-12-22 19:56:12,202 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2021-12-22 19:56:12,203 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 25 transitions. [2021-12-22 19:56:12,203 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2021-12-22 19:56:12,203 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2021-12-22 19:56:12,203 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 25 transitions. [2021-12-22 19:56:12,203 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 19:56:12,203 INFO L681 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2021-12-22 19:56:12,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 25 transitions. [2021-12-22 19:56:12,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2021-12-22 19:56:12,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 19:56:12,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2021-12-22 19:56:12,205 INFO L704 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2021-12-22 19:56:12,205 INFO L587 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2021-12-22 19:56:12,205 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-12-22 19:56:12,205 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 23 transitions. [2021-12-22 19:56:12,206 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2021-12-22 19:56:12,206 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-22 19:56:12,206 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-22 19:56:12,206 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 19:56:12,206 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-22 19:56:12,207 INFO L791 eck$LassoCheckResult]: Stem: 239#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 240#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#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~nondet7#1;havoc main_#t~nondet7#1; 248#L28 assume !(main_~n~0#1 < 1);call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~0#1 := 0; 254#L33-3 assume !!(main_~i~0#1 < main_~n~0#1);call write~int(main_#t~nondet10#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet10#1; 246#L33-2 main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 247#L33-3 assume !(main_~i~0#1 < main_~n~0#1); 241#L33-4 call insertionSort(0, main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 242#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 255#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 256#L15-6 #t~short4 := ~j~0 > 0; 249#L15-1 assume !#t~short4; 250#L15-3 assume !#t~short4;havoc #t~mem3;havoc #t~short4; 251#L15-7 [2021-12-22 19:56:12,207 INFO L793 eck$LassoCheckResult]: Loop: 251#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 244#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 252#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 253#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 245#L15-6 #t~short4 := ~j~0 > 0; 258#L15-1 assume #t~short4;call #t~mem3 := read~int(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short4 := #t~mem3 > ~temp~0; 257#L15-3 assume !#t~short4;havoc #t~mem3;havoc #t~short4; 251#L15-7 [2021-12-22 19:56:12,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 19:56:12,207 INFO L85 PathProgramCache]: Analyzing trace with hash -332541132, now seen corresponding path program 1 times [2021-12-22 19:56:12,207 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 19:56:12,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795117024] [2021-12-22 19:56:12,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 19:56:12,208 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 19:56:12,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 19:56:12,215 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 19:56:12,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 19:56:12,222 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 19:56:12,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 19:56:12,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1094947064, now seen corresponding path program 3 times [2021-12-22 19:56:12,223 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 19:56:12,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634326546] [2021-12-22 19:56:12,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 19:56:12,224 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 19:56:12,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 19:56:12,229 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 19:56:12,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 19:56:12,234 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 19:56:12,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 19:56:12,234 INFO L85 PathProgramCache]: Analyzing trace with hash 2143759477, now seen corresponding path program 1 times [2021-12-22 19:56:12,234 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 19:56:12,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95195682] [2021-12-22 19:56:12,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 19:56:12,235 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 19:56:12,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 19:56:12,297 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 19:56:12,298 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 19:56:12,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95195682] [2021-12-22 19:56:12,298 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95195682] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 19:56:12,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [239525916] [2021-12-22 19:56:12,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 19:56:12,298 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 19:56:12,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 19:56:12,310 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-22 19:56:12,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-22 19:56:12,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 19:56:12,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-22 19:56:12,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 19:56:12,471 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 19:56:12,472 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 19:56:12,536 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 19:56:12,537 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [239525916] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 19:56:12,537 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 19:56:12,537 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 18 [2021-12-22 19:56:12,537 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205073442] [2021-12-22 19:56:12,537 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 19:56:12,957 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 19:56:12,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-12-22 19:56:12,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2021-12-22 19:56:12,958 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. cyclomatic complexity: 5 Second operand has 18 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 13 states have internal predecessors, (34), 3 states have call successors, (5), 5 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 19:56:13,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 19:56:13,056 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2021-12-22 19:56:13,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-22 19:56:13,057 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 36 transitions. [2021-12-22 19:56:13,057 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2021-12-22 19:56:13,058 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 23 states and 26 transitions. [2021-12-22 19:56:13,058 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2021-12-22 19:56:13,058 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2021-12-22 19:56:13,058 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 26 transitions. [2021-12-22 19:56:13,058 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 19:56:13,058 INFO L681 BuchiCegarLoop]: Abstraction has 23 states and 26 transitions. [2021-12-22 19:56:13,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 26 transitions. [2021-12-22 19:56:13,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2021-12-22 19:56:13,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 20 states have (on average 1.15) internal successors, (23), 19 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 19:56:13,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2021-12-22 19:56:13,060 INFO L704 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2021-12-22 19:56:13,060 INFO L587 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2021-12-22 19:56:13,060 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-12-22 19:56:13,060 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 25 transitions. [2021-12-22 19:56:13,060 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2021-12-22 19:56:13,060 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-22 19:56:13,060 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-22 19:56:13,061 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 19:56:13,061 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-22 19:56:13,061 INFO L791 eck$LassoCheckResult]: Stem: 431#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 432#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#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~nondet7#1;havoc main_#t~nondet7#1; 440#L28 assume !(main_~n~0#1 < 1);call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~0#1 := 0; 446#L33-3 assume !!(main_~i~0#1 < main_~n~0#1);call write~int(main_#t~nondet10#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet10#1; 438#L33-2 main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 439#L33-3 assume !!(main_~i~0#1 < main_~n~0#1);call write~int(main_#t~nondet10#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet10#1; 447#L33-2 main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 449#L33-3 assume !(main_~i~0#1 < main_~n~0#1); 433#L33-4 call insertionSort(0, main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 434#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 443#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 448#L15-6 #t~short4 := ~j~0 > 0; 444#L15-1 assume !#t~short4; 445#L15-3 assume !#t~short4;havoc #t~mem3;havoc #t~short4; 441#L15-7 [2021-12-22 19:56:13,061 INFO L793 eck$LassoCheckResult]: Loop: 441#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 436#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 442#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 452#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 437#L15-6 #t~short4 := ~j~0 > 0; 451#L15-1 assume #t~short4;call #t~mem3 := read~int(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short4 := #t~mem3 > ~temp~0; 450#L15-3 assume !#t~short4;havoc #t~mem3;havoc #t~short4; 441#L15-7 [2021-12-22 19:56:13,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 19:56:13,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1063486350, now seen corresponding path program 2 times [2021-12-22 19:56:13,062 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 19:56:13,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084924933] [2021-12-22 19:56:13,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 19:56:13,062 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 19:56:13,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 19:56:13,072 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 19:56:13,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 19:56:13,079 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 19:56:13,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 19:56:13,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1094947064, now seen corresponding path program 4 times [2021-12-22 19:56:13,079 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 19:56:13,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321302491] [2021-12-22 19:56:13,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 19:56:13,080 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 19:56:13,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 19:56:13,085 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 19:56:13,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 19:56:13,089 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 19:56:13,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 19:56:13,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1119961463, now seen corresponding path program 2 times [2021-12-22 19:56:13,090 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 19:56:13,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998145784] [2021-12-22 19:56:13,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 19:56:13,091 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 19:56:13,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 19:56:13,102 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 19:56:13,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 19:56:13,114 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 19:56:14,002 INFO L210 LassoAnalysis]: Preferences: [2021-12-22 19:56:14,003 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-22 19:56:14,003 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-22 19:56:14,003 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-22 19:56:14,003 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-22 19:56:14,003 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 19:56:14,003 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-22 19:56:14,003 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-22 19:56:14,003 INFO L133 ssoRankerPreferences]: Filename of dumped script: insertionSort_recursive.i_Iteration6_Lasso [2021-12-22 19:56:14,003 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-22 19:56:14,004 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-22 19:56:14,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 19:56:14,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 19:56:14,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 19:56:14,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 19:56:14,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 19:56:14,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 19:56:14,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 19:56:14,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 19:56:14,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 19:56:14,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 19:56:14,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 19:56:14,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 19:56:14,081 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.IllegalArgumentException at de.uni_freiburg.informatik.ultimate.util.datastructures.ScopedHashMap.put(ScopedHashMap.java:331) at java.base/java.util.AbstractMap.putAll(AbstractMap.java:281) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.PureSubstitution.(PureSubstitution.java:81) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.Substitution.(Substitution.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.Substitution.apply(Substitution.java:59) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceMapReads(MapEliminator.java:518) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:342) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:109) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:280) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:953) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:862) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:252) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:457) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java: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) [2021-12-22 19:56:14,085 INFO L158 Benchmark]: Toolchain (without parser) took 4766.58ms. Allocated memory was 109.1MB in the beginning and 172.0MB in the end (delta: 62.9MB). Free memory was 82.6MB in the beginning and 121.9MB in the end (delta: -39.3MB). Peak memory consumption was 98.6MB. Max. memory is 16.1GB. [2021-12-22 19:56:14,085 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 109.1MB. Free memory is still 66.4MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-22 19:56:14,086 INFO L158 Benchmark]: CACSL2BoogieTranslator took 186.46ms. Allocated memory was 109.1MB in the beginning and 134.2MB in the end (delta: 25.2MB). Free memory was 82.4MB in the beginning and 110.8MB in the end (delta: -28.5MB). Peak memory consumption was 8.8MB. Max. memory is 16.1GB. [2021-12-22 19:56:14,086 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.10ms. Allocated memory is still 134.2MB. Free memory was 110.8MB in the beginning and 109.5MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-22 19:56:14,093 INFO L158 Benchmark]: Boogie Preprocessor took 15.75ms. Allocated memory is still 134.2MB. Free memory was 109.5MB in the beginning and 108.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-22 19:56:14,093 INFO L158 Benchmark]: RCFGBuilder took 338.11ms. Allocated memory is still 134.2MB. Free memory was 108.1MB in the beginning and 97.7MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-22 19:56:14,094 INFO L158 Benchmark]: BuchiAutomizer took 4191.34ms. Allocated memory was 134.2MB in the beginning and 172.0MB in the end (delta: 37.7MB). Free memory was 97.5MB in the beginning and 121.9MB in the end (delta: -24.5MB). Peak memory consumption was 89.8MB. Max. memory is 16.1GB. [2021-12-22 19:56:14,099 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 109.1MB. Free memory is still 66.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 186.46ms. Allocated memory was 109.1MB in the beginning and 134.2MB in the end (delta: 25.2MB). Free memory was 82.4MB in the beginning and 110.8MB in the end (delta: -28.5MB). Peak memory consumption was 8.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.10ms. Allocated memory is still 134.2MB. Free memory was 110.8MB in the beginning and 109.5MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 15.75ms. Allocated memory is still 134.2MB. Free memory was 109.5MB in the beginning and 108.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 338.11ms. Allocated memory is still 134.2MB. Free memory was 108.1MB in the beginning and 97.7MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 4191.34ms. Allocated memory was 134.2MB in the beginning and 172.0MB in the end (delta: 37.7MB). Free memory was 97.5MB in the beginning and 121.9MB in the end (delta: -24.5MB). Peak memory consumption was 89.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: IllegalArgumentException: null de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: IllegalArgumentException: null: de.uni_freiburg.informatik.ultimate.util.datastructures.ScopedHashMap.put(ScopedHashMap.java:331) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-12-22 19:56:14,125 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-22 19:56:14,342 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: IllegalArgumentException: null