./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 6c24879c 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-?-6c24879 [2022-07-13 03:24:52,524 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 03:24:52,527 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 03:24:52,549 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 03:24:52,549 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 03:24:52,550 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 03:24:52,551 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 03:24:52,553 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 03:24:52,554 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 03:24:52,554 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 03:24:52,555 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 03:24:52,556 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 03:24:52,556 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 03:24:52,556 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 03:24:52,557 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 03:24:52,558 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 03:24:52,558 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 03:24:52,559 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 03:24:52,560 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 03:24:52,561 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 03:24:52,562 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 03:24:52,563 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 03:24:52,564 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 03:24:52,565 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 03:24:52,566 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 03:24:52,568 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 03:24:52,568 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 03:24:52,568 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 03:24:52,569 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 03:24:52,569 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 03:24:52,570 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 03:24:52,570 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 03:24:52,571 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 03:24:52,576 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 03:24:52,577 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 03:24:52,579 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 03:24:52,582 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 03:24:52,583 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 03:24:52,583 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 03:24:52,583 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 03:24:52,584 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 03:24:52,585 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 03:24:52,586 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-07-13 03:24:52,604 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 03:24:52,605 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 03:24:52,605 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 03:24:52,605 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 03:24:52,607 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 03:24:52,607 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 03:24:52,607 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 03:24:52,608 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-13 03:24:52,608 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-13 03:24:52,608 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-13 03:24:52,609 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-13 03:24:52,609 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-13 03:24:52,609 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-13 03:24:52,609 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 03:24:52,609 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-13 03:24:52,610 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 03:24:52,610 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 03:24:52,610 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-13 03:24:52,610 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-13 03:24:52,611 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-13 03:24:52,611 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 03:24:52,611 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-13 03:24:52,611 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 03:24:52,611 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-13 03:24:52,611 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 03:24:52,612 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 03:24:52,612 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 03:24:52,612 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 03:24:52,613 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-13 03:24:52,613 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 [2022-07-13 03:24:52,814 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 03:24:52,834 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 03:24:52,836 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 03:24:52,837 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 03:24:52,837 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 03:24:52,838 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 [2022-07-13 03:24:52,884 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81f6b48a8/992d88ed401d45d9867e4de121247a03/FLAG509b97c0a [2022-07-13 03:24:53,196 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 03:24:53,197 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-recursive-malloc/insertionSort_recursive.i [2022-07-13 03:24:53,201 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81f6b48a8/992d88ed401d45d9867e4de121247a03/FLAG509b97c0a [2022-07-13 03:24:53,630 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81f6b48a8/992d88ed401d45d9867e4de121247a03 [2022-07-13 03:24:53,632 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 03:24:53,634 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 03:24:53,635 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 03:24:53,635 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 03:24:53,641 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 03:24:53,642 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:24:53" (1/1) ... [2022-07-13 03:24:53,643 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@474407c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:24:53, skipping insertion in model container [2022-07-13 03:24:53,643 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:24:53" (1/1) ... [2022-07-13 03:24:53,650 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 03:24:53,661 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 03:24:53,848 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 03:24:53,856 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 03:24:53,880 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 03:24:53,894 INFO L208 MainTranslator]: Completed translation [2022-07-13 03:24:53,899 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:24:53 WrapperNode [2022-07-13 03:24:53,899 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 03:24:53,900 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 03:24:53,900 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 03:24:53,900 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 03:24:53,909 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:24:53" (1/1) ... [2022-07-13 03:24:53,916 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:24:53" (1/1) ... [2022-07-13 03:24:53,930 INFO L137 Inliner]: procedures = 11, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 25 [2022-07-13 03:24:53,931 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 03:24:53,932 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 03:24:53,932 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 03:24:53,932 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 03:24:53,938 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:24:53" (1/1) ... [2022-07-13 03:24:53,938 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:24:53" (1/1) ... [2022-07-13 03:24:53,949 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:24:53" (1/1) ... [2022-07-13 03:24:53,949 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:24:53" (1/1) ... [2022-07-13 03:24:53,958 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:24:53" (1/1) ... [2022-07-13 03:24:53,961 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:24:53" (1/1) ... [2022-07-13 03:24:53,962 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:24:53" (1/1) ... [2022-07-13 03:24:53,963 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 03:24:53,965 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 03:24:53,966 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 03:24:53,967 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 03:24:53,968 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:24:53" (1/1) ... [2022-07-13 03:24:53,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:24:53,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:24:54,030 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:24:54,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-07-13 03:24:54,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 03:24:54,078 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 03:24:54,078 INFO L130 BoogieDeclarations]: Found specification of procedure insertionSort [2022-07-13 03:24:54,079 INFO L138 BoogieDeclarations]: Found implementation of procedure insertionSort [2022-07-13 03:24:54,079 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 03:24:54,079 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 03:24:54,079 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 03:24:54,079 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 03:24:54,142 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 03:24:54,144 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 03:24:54,295 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 03:24:54,299 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 03:24:54,303 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-13 03:24:54,305 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:24:54 BoogieIcfgContainer [2022-07-13 03:24:54,306 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 03:24:54,307 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-13 03:24:54,308 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-13 03:24:54,310 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-13 03:24:54,311 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 03:24:54,311 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.07 03:24:53" (1/3) ... [2022-07-13 03:24:54,312 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@17c4ae41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.07 03:24:54, skipping insertion in model container [2022-07-13 03:24:54,313 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 03:24:54,313 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:24:53" (2/3) ... [2022-07-13 03:24:54,314 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@17c4ae41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.07 03:24:54, skipping insertion in model container [2022-07-13 03:24:54,314 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 03:24:54,314 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:24:54" (3/3) ... [2022-07-13 03:24:54,315 INFO L354 chiAutomizerObserver]: Analyzing ICFG insertionSort_recursive.i [2022-07-13 03:24:54,413 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-13 03:24:54,413 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-13 03:24:54,417 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-13 03:24:54,417 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-13 03:24:54,417 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-13 03:24:54,418 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-13 03:24:54,418 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-13 03:24:54,418 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-13 03:24:54,421 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) [2022-07-13 03:24:54,444 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2022-07-13 03:24:54,444 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:24:54,444 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:24:54,448 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-07-13 03:24:54,448 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-13 03:24:54,448 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-13 03:24:54,448 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) [2022-07-13 03:24:54,452 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2022-07-13 03:24:54,452 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:24:54,452 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:24:54,452 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-07-13 03:24:54,453 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-13 03:24:54,458 INFO L752 eck$LassoCheckResult]: Stem: 3#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 8#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; 17#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; 19#L33-3true [2022-07-13 03:24:54,458 INFO L754 eck$LassoCheckResult]: Loop: 19#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; 7#L33-2true main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 19#L33-3true [2022-07-13 03:24:54,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:24:54,467 INFO L85 PathProgramCache]: Analyzing trace with hash 60643, now seen corresponding path program 1 times [2022-07-13 03:24:54,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:24:54,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926501982] [2022-07-13 03:24:54,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:24:54,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:24:54,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:24:54,536 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:24:54,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:24:54,553 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:24:54,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:24:54,558 INFO L85 PathProgramCache]: Analyzing trace with hash 2435, now seen corresponding path program 1 times [2022-07-13 03:24:54,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:24:54,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660460488] [2022-07-13 03:24:54,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:24:54,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:24:54,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:24:54,584 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:24:54,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:24:54,599 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:24:54,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:24:54,601 INFO L85 PathProgramCache]: Analyzing trace with hash 58279397, now seen corresponding path program 1 times [2022-07-13 03:24:54,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:24:54,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321340701] [2022-07-13 03:24:54,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:24:54,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:24:54,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:24:54,616 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:24:54,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:24:54,639 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:24:54,856 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 03:24:54,857 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 03:24:54,857 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 03:24:54,857 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 03:24:54,857 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-13 03:24:54,857 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:24:54,858 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 03:24:54,858 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 03:24:54,858 INFO L133 ssoRankerPreferences]: Filename of dumped script: insertionSort_recursive.i_Iteration1_Lasso [2022-07-13 03:24:54,858 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 03:24:54,859 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 03:24:54,876 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:24:54,880 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:24:54,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:24:54,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:24:54,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:24:54,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:24:54,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:24:54,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:24:55,143 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 03:24:55,148 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-13 03:24:55,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:24:55,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:24:55,152 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:24:55,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-07-13 03:24:55,158 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:24:55,166 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:24:55,166 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:24:55,167 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:24:55,167 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:24:55,167 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:24:55,169 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:24:55,169 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:24:55,188 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:24:55,216 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-07-13 03:24:55,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:24:55,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:24:55,218 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:24:55,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-07-13 03:24:55,233 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:24:55,239 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:24:55,240 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:24:55,240 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:24:55,240 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:24:55,240 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:24:55,240 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:24:55,240 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:24:55,249 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:24:55,265 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-07-13 03:24:55,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:24:55,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:24:55,266 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:24:55,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-07-13 03:24:55,270 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:24:55,276 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:24:55,276 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:24:55,276 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:24:55,276 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:24:55,279 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:24:55,279 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:24:55,307 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:24:55,325 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-07-13 03:24:55,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:24:55,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:24:55,327 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:24:55,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-07-13 03:24:55,329 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:24:55,335 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:24:55,335 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:24:55,336 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:24:55,336 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:24:55,336 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:24:55,336 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:24:55,336 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:24:55,351 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:24:55,383 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-07-13 03:24:55,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:24:55,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:24:55,385 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:24:55,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-07-13 03:24:55,387 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:24:55,393 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:24:55,393 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:24:55,393 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:24:55,394 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:24:55,398 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:24:55,398 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:24:55,410 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-13 03:24:55,426 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2022-07-13 03:24:55,426 INFO L444 ModelExtractionUtils]: 4 out of 16 variables were initially zero. Simplification set additionally 9 variables to zero. [2022-07-13 03:24:55,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:24:55,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:24:55,429 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:24:55,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-07-13 03:24:55,468 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-13 03:24:55,482 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-13 03:24:55,483 INFO L513 LassoAnalysis]: Proved termination. [2022-07-13 03:24:55,483 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0#1, ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~n~0#1 - 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2022-07-13 03:24:55,504 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-07-13 03:24:55,508 INFO L293 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2022-07-13 03:24:55,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:24:55,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:24:55,540 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 03:24:55,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:24:55,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:24:55,554 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 03:24:55,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:24:55,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:24:55,596 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-13 03:24:55,597 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) [2022-07-13 03:24:55,643 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. [2022-07-13 03:24:55,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-13 03:24:55,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:24:55,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2022-07-13 03:24:55,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 3 letters. Loop has 2 letters. [2022-07-13 03:24:55,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:24:55,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 5 letters. Loop has 2 letters. [2022-07-13 03:24:55,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:24:55,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 3 letters. Loop has 4 letters. [2022-07-13 03:24:55,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:24:55,653 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 57 transitions. [2022-07-13 03:24:55,658 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-07-13 03:24:55,661 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 15 states and 20 transitions. [2022-07-13 03:24:55,662 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2022-07-13 03:24:55,662 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2022-07-13 03:24:55,662 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 20 transitions. [2022-07-13 03:24:55,663 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:24:55,663 INFO L369 hiAutomatonCegarLoop]: Abstraction has 15 states and 20 transitions. [2022-07-13 03:24:55,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 20 transitions. [2022-07-13 03:24:55,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-07-13 03:24:55,678 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) [2022-07-13 03:24:55,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2022-07-13 03:24:55,680 INFO L392 hiAutomatonCegarLoop]: Abstraction has 15 states and 20 transitions. [2022-07-13 03:24:55,680 INFO L374 stractBuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2022-07-13 03:24:55,680 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-13 03:24:55,680 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2022-07-13 03:24:55,680 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-07-13 03:24:55,680 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:24:55,681 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:24:55,681 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-13 03:24:55,681 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-07-13 03:24:55,681 INFO L752 eck$LassoCheckResult]: Stem: 112#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 113#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~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 [2022-07-13 03:24:55,682 INFO L754 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 [2022-07-13 03:24:55,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:24:55,682 INFO L85 PathProgramCache]: Analyzing trace with hash 58279346, now seen corresponding path program 1 times [2022-07-13 03:24:55,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:24:55,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158422708] [2022-07-13 03:24:55,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:24:55,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:24:55,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:24:55,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:24:55,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:24:55,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158422708] [2022-07-13 03:24:55,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158422708] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:24:55,718 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:24:55,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 03:24:55,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852259471] [2022-07-13 03:24:55,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:24:55,720 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-13 03:24:55,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:24:55,721 INFO L85 PathProgramCache]: Analyzing trace with hash 28740467, now seen corresponding path program 1 times [2022-07-13 03:24:55,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:24:55,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135190402] [2022-07-13 03:24:55,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:24:55,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:24:55,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:24:55,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:24:55,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:24:55,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135190402] [2022-07-13 03:24:55,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135190402] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:24:55,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:24:55,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 03:24:55,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772292433] [2022-07-13 03:24:55,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:24:55,730 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:24:55,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:24:55,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-13 03:24:55,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 03:24:55,733 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) [2022-07-13 03:24:55,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:24:55,737 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2022-07-13 03:24:55,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-13 03:24:55,751 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 19 transitions. [2022-07-13 03:24:55,751 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-07-13 03:24:55,752 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 19 transitions. [2022-07-13 03:24:55,752 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2022-07-13 03:24:55,752 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2022-07-13 03:24:55,752 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2022-07-13 03:24:55,752 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:24:55,753 INFO L369 hiAutomatonCegarLoop]: Abstraction has 15 states and 19 transitions. [2022-07-13 03:24:55,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2022-07-13 03:24:55,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-07-13 03:24:55,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:24:55,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2022-07-13 03:24:55,754 INFO L392 hiAutomatonCegarLoop]: Abstraction has 15 states and 19 transitions. [2022-07-13 03:24:55,754 INFO L374 stractBuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2022-07-13 03:24:55,754 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-13 03:24:55,754 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2022-07-13 03:24:55,755 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-07-13 03:24:55,755 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:24:55,755 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:24:55,755 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-13 03:24:55,755 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:24:55,756 INFO L752 eck$LassoCheckResult]: Stem: 148#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 149#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~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 [2022-07-13 03:24:55,756 INFO L754 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 [2022-07-13 03:24:55,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:24:55,758 INFO L85 PathProgramCache]: Analyzing trace with hash 58279346, now seen corresponding path program 2 times [2022-07-13 03:24:55,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:24:55,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562680442] [2022-07-13 03:24:55,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:24:55,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:24:55,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:24:55,775 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-07-13 03:24:55,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:24:55,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:24:55,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562680442] [2022-07-13 03:24:55,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562680442] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:24:55,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:24:55,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 03:24:55,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377584473] [2022-07-13 03:24:55,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:24:55,786 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-13 03:24:55,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:24:55,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1835476522, now seen corresponding path program 1 times [2022-07-13 03:24:55,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:24:55,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973840365] [2022-07-13 03:24:55,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:24:55,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:24:55,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:24:55,807 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:24:55,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:24:55,823 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:24:56,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:24:56,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 03:24:56,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 03:24:56,169 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. cyclomatic complexity: 6 Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:24:56,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:24:56,176 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2022-07-13 03:24:56,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 03:24:56,177 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 19 transitions. [2022-07-13 03:24:56,178 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-07-13 03:24:56,178 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 19 transitions. [2022-07-13 03:24:56,178 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2022-07-13 03:24:56,178 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2022-07-13 03:24:56,178 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 19 transitions. [2022-07-13 03:24:56,178 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:24:56,178 INFO L369 hiAutomatonCegarLoop]: Abstraction has 16 states and 19 transitions. [2022-07-13 03:24:56,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 19 transitions. [2022-07-13 03:24:56,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2022-07-13 03:24:56,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:24:56,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2022-07-13 03:24:56,180 INFO L392 hiAutomatonCegarLoop]: Abstraction has 15 states and 18 transitions. [2022-07-13 03:24:56,180 INFO L374 stractBuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2022-07-13 03:24:56,180 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-13 03:24:56,180 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 18 transitions. [2022-07-13 03:24:56,180 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-07-13 03:24:56,180 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:24:56,180 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:24:56,181 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:24:56,181 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:24:56,181 INFO L752 eck$LassoCheckResult]: Stem: 185#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 186#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~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 [2022-07-13 03:24:56,181 INFO L754 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 [2022-07-13 03:24:56,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:24:56,181 INFO L85 PathProgramCache]: Analyzing trace with hash 171927092, now seen corresponding path program 1 times [2022-07-13 03:24:56,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:24:56,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731797665] [2022-07-13 03:24:56,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:24:56,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:24:56,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:24:56,190 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:24:56,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:24:56,199 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:24:56,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:24:56,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1835476522, now seen corresponding path program 2 times [2022-07-13 03:24:56,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:24:56,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554281546] [2022-07-13 03:24:56,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:24:56,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:24:56,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:24:56,209 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:24:56,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:24:56,233 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:24:56,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:24:56,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1744506729, now seen corresponding path program 1 times [2022-07-13 03:24:56,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:24:56,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730727181] [2022-07-13 03:24:56,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:24:56,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:24:56,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:24:56,321 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 03:24:56,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:24:56,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730727181] [2022-07-13 03:24:56,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730727181] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:24:56,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:24:56,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 03:24:56,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136196401] [2022-07-13 03:24:56,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:24:56,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:24:56,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 03:24:56,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 03:24:56,587 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) [2022-07-13 03:24:56,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:24:56,645 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2022-07-13 03:24:56,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 03:24:56,648 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 25 transitions. [2022-07-13 03:24:56,648 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-07-13 03:24:56,649 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 25 transitions. [2022-07-13 03:24:56,649 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2022-07-13 03:24:56,649 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2022-07-13 03:24:56,649 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 25 transitions. [2022-07-13 03:24:56,649 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:24:56,649 INFO L369 hiAutomatonCegarLoop]: Abstraction has 22 states and 25 transitions. [2022-07-13 03:24:56,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 25 transitions. [2022-07-13 03:24:56,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2022-07-13 03:24:56,650 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) [2022-07-13 03:24:56,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2022-07-13 03:24:56,651 INFO L392 hiAutomatonCegarLoop]: Abstraction has 20 states and 23 transitions. [2022-07-13 03:24:56,651 INFO L374 stractBuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2022-07-13 03:24:56,651 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-13 03:24:56,651 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 23 transitions. [2022-07-13 03:24:56,651 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-07-13 03:24:56,651 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:24:56,651 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:24:56,652 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:24:56,652 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:24:56,652 INFO L752 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 [2022-07-13 03:24:56,652 INFO L754 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 [2022-07-13 03:24:56,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:24:56,652 INFO L85 PathProgramCache]: Analyzing trace with hash -332541132, now seen corresponding path program 1 times [2022-07-13 03:24:56,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:24:56,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918096801] [2022-07-13 03:24:56,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:24:56,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:24:56,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:24:56,667 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:24:56,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:24:56,678 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:24:56,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:24:56,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1094947064, now seen corresponding path program 3 times [2022-07-13 03:24:56,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:24:56,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908906076] [2022-07-13 03:24:56,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:24:56,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:24:56,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:24:56,699 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:24:56,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:24:56,718 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:24:56,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:24:56,719 INFO L85 PathProgramCache]: Analyzing trace with hash 2143759477, now seen corresponding path program 1 times [2022-07-13 03:24:56,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:24:56,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426376969] [2022-07-13 03:24:56,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:24:56,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:24:56,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:24:56,787 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:24:56,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:24:56,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426376969] [2022-07-13 03:24:56,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426376969] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 03:24:56,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [340862095] [2022-07-13 03:24:56,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:24:56,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 03:24:56,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:24:56,796 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 03:24:56,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-13 03:24:56,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:24:56,839 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-13 03:24:56,840 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:24:56,960 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:24:56,960 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 03:24:57,007 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:24:57,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [340862095] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 03:24:57,008 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 03:24:57,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 18 [2022-07-13 03:24:57,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972547834] [2022-07-13 03:24:57,009 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 03:24:57,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:24:57,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-13 03:24:57,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2022-07-13 03:24:57,427 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) [2022-07-13 03:24:57,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:24:57,540 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2022-07-13 03:24:57,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 03:24:57,542 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 36 transitions. [2022-07-13 03:24:57,543 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-07-13 03:24:57,543 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 23 states and 26 transitions. [2022-07-13 03:24:57,543 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2022-07-13 03:24:57,544 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2022-07-13 03:24:57,544 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 26 transitions. [2022-07-13 03:24:57,544 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:24:57,544 INFO L369 hiAutomatonCegarLoop]: Abstraction has 23 states and 26 transitions. [2022-07-13 03:24:57,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 26 transitions. [2022-07-13 03:24:57,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2022-07-13 03:24:57,545 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) [2022-07-13 03:24:57,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2022-07-13 03:24:57,545 INFO L392 hiAutomatonCegarLoop]: Abstraction has 22 states and 25 transitions. [2022-07-13 03:24:57,545 INFO L374 stractBuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2022-07-13 03:24:57,545 INFO L287 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-13 03:24:57,545 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 25 transitions. [2022-07-13 03:24:57,546 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-07-13 03:24:57,546 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:24:57,546 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:24:57,546 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:24:57,546 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:24:57,546 INFO L752 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 [2022-07-13 03:24:57,546 INFO L754 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 [2022-07-13 03:24:57,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:24:57,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1063486350, now seen corresponding path program 2 times [2022-07-13 03:24:57,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:24:57,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285852143] [2022-07-13 03:24:57,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:24:57,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:24:57,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:24:57,562 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:24:57,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:24:57,571 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:24:57,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:24:57,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1094947064, now seen corresponding path program 4 times [2022-07-13 03:24:57,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:24:57,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787081439] [2022-07-13 03:24:57,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:24:57,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:24:57,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:24:57,577 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:24:57,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:24:57,592 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:24:57,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:24:57,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1119961463, now seen corresponding path program 2 times [2022-07-13 03:24:57,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:24:57,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517843868] [2022-07-13 03:24:57,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:24:57,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:24:57,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:24:57,612 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:24:57,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:24:57,635 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:24:58,462 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 03:24:58,462 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 03:24:58,462 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 03:24:58,462 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 03:24:58,462 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-13 03:24:58,462 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:24:58,462 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 03:24:58,462 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 03:24:58,462 INFO L133 ssoRankerPreferences]: Filename of dumped script: insertionSort_recursive.i_Iteration6_Lasso [2022-07-13 03:24:58,462 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 03:24:58,462 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 03:24:58,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:24:58,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:24:58,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:24:58,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:24:58,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:24:58,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:24:58,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:24:58,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:24:58,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:24:58,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:24:58,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:24:58,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:24:58,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:24:58,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:24:58,543 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:601) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:914) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:823) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:247) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.cegar.AbstractBuchiCegarLoop.runCegarLoop(AbstractBuchiCegarLoop.java:310) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:146) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:363) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-13 03:24:58,549 INFO L158 Benchmark]: Toolchain (without parser) took 4914.75ms. Allocated memory was 109.1MB in the beginning and 163.6MB in the end (delta: 54.5MB). Free memory was 80.4MB in the beginning and 90.8MB in the end (delta: -10.5MB). Peak memory consumption was 86.2MB. Max. memory is 16.1GB. [2022-07-13 03:24:58,549 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 109.1MB. Free memory is still 65.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 03:24:58,550 INFO L158 Benchmark]: CACSL2BoogieTranslator took 264.34ms. Allocated memory was 109.1MB in the beginning and 136.3MB in the end (delta: 27.3MB). Free memory was 80.1MB in the beginning and 111.0MB in the end (delta: -30.9MB). Peak memory consumption was 9.0MB. Max. memory is 16.1GB. [2022-07-13 03:24:58,554 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.54ms. Allocated memory is still 136.3MB. Free memory was 111.0MB in the beginning and 109.8MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 03:24:58,556 INFO L158 Benchmark]: Boogie Preprocessor took 32.49ms. Allocated memory is still 136.3MB. Free memory was 109.8MB in the beginning and 108.6MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 03:24:58,556 INFO L158 Benchmark]: RCFGBuilder took 341.11ms. Allocated memory is still 136.3MB. Free memory was 108.6MB in the beginning and 98.2MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-13 03:24:58,556 INFO L158 Benchmark]: BuchiAutomizer took 4240.80ms. Allocated memory was 136.3MB in the beginning and 163.6MB in the end (delta: 27.3MB). Free memory was 97.9MB in the beginning and 90.8MB in the end (delta: 7.1MB). Peak memory consumption was 77.2MB. Max. memory is 16.1GB. [2022-07-13 03:24:58,558 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 109.1MB. Free memory is still 65.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 264.34ms. Allocated memory was 109.1MB in the beginning and 136.3MB in the end (delta: 27.3MB). Free memory was 80.1MB in the beginning and 111.0MB in the end (delta: -30.9MB). Peak memory consumption was 9.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.54ms. Allocated memory is still 136.3MB. Free memory was 111.0MB in the beginning and 109.8MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.49ms. Allocated memory is still 136.3MB. Free memory was 109.8MB in the beginning and 108.6MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 341.11ms. Allocated memory is still 136.3MB. Free memory was 108.6MB in the beginning and 98.2MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 4240.80ms. Allocated memory was 136.3MB in the beginning and 163.6MB in the end (delta: 27.3MB). Free memory was 97.9MB in the beginning and 90.8MB in the end (delta: 7.1MB). Peak memory consumption was 77.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: IllegalArgumentException: null de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: IllegalArgumentException: null: de.uni_freiburg.informatik.ultimate.util.datastructures.ScopedHashMap.put(ScopedHashMap.java:331) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-13 03:24:58,588 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-13 03:24:58,798 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