./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/insertionsort-alloca-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version c3fed411 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-memory-alloca/insertionsort-alloca-2.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 de7da20d4eaaa585438f85709f7fd309a77ec10ab7307dad72c7fb2392cc347c --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-16 09:28:13,545 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-16 09:28:13,555 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-16 09:28:13,593 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-16 09:28:13,593 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-16 09:28:13,596 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-16 09:28:13,597 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-16 09:28:13,600 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-16 09:28:13,602 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-16 09:28:13,606 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-16 09:28:13,606 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-16 09:28:13,608 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-16 09:28:13,608 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-16 09:28:13,610 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-16 09:28:13,612 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-16 09:28:13,617 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-16 09:28:13,618 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-16 09:28:13,619 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-16 09:28:13,621 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-16 09:28:13,626 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-16 09:28:13,628 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-16 09:28:13,629 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-16 09:28:13,630 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-16 09:28:13,631 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-16 09:28:13,637 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-16 09:28:13,637 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-16 09:28:13,638 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-16 09:28:13,639 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-16 09:28:13,640 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-16 09:28:13,640 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-16 09:28:13,641 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-16 09:28:13,642 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-16 09:28:13,643 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-16 09:28:13,644 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-16 09:28:13,645 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-16 09:28:13,645 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-16 09:28:13,646 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-16 09:28:13,646 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-16 09:28:13,646 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-16 09:28:13,648 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-16 09:28:13,648 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-16 09:28:13,649 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2021-12-16 09:28:13,684 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-16 09:28:13,686 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-16 09:28:13,686 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-16 09:28:13,686 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-16 09:28:13,687 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-16 09:28:13,688 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-16 09:28:13,688 INFO L138 SettingsManager]: * Use SBE=true [2021-12-16 09:28:13,688 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-16 09:28:13,688 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-16 09:28:13,688 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-16 09:28:13,689 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-16 09:28:13,689 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-16 09:28:13,689 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-16 09:28:13,690 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-16 09:28:13,690 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-16 09:28:13,690 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-16 09:28:13,690 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-16 09:28:13,690 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-16 09:28:13,690 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-16 09:28:13,691 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-16 09:28:13,691 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-16 09:28:13,691 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-16 09:28:13,691 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-16 09:28:13,691 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-16 09:28:13,692 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-16 09:28:13,692 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-16 09:28:13,692 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-16 09:28:13,692 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-16 09:28:13,692 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-16 09:28:13,693 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-16 09:28:13,693 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 -> de7da20d4eaaa585438f85709f7fd309a77ec10ab7307dad72c7fb2392cc347c [2021-12-16 09:28:13,935 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-16 09:28:13,960 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-16 09:28:13,963 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-16 09:28:13,964 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-16 09:28:13,964 INFO L275 PluginConnector]: CDTParser initialized [2021-12-16 09:28:13,966 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/insertionsort-alloca-2.i [2021-12-16 09:28:14,037 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/025efc3b6/902f0e9e274c443fbb9c6e3dd608d4dc/FLAG99c324c31 [2021-12-16 09:28:14,439 INFO L306 CDTParser]: Found 1 translation units. [2021-12-16 09:28:14,440 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/insertionsort-alloca-2.i [2021-12-16 09:28:14,454 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/025efc3b6/902f0e9e274c443fbb9c6e3dd608d4dc/FLAG99c324c31 [2021-12-16 09:28:14,824 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/025efc3b6/902f0e9e274c443fbb9c6e3dd608d4dc [2021-12-16 09:28:14,826 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-16 09:28:14,827 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-16 09:28:14,828 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-16 09:28:14,828 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-16 09:28:14,831 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-16 09:28:14,831 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 09:28:14" (1/1) ... [2021-12-16 09:28:14,832 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d3e56f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:28:14, skipping insertion in model container [2021-12-16 09:28:14,833 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 09:28:14" (1/1) ... [2021-12-16 09:28:14,839 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-16 09:28:14,877 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-16 09:28:15,095 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 09:28:15,101 INFO L203 MainTranslator]: Completed pre-run [2021-12-16 09:28:15,152 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 09:28:15,180 INFO L208 MainTranslator]: Completed translation [2021-12-16 09:28:15,180 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:28:15 WrapperNode [2021-12-16 09:28:15,181 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-16 09:28:15,182 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-16 09:28:15,182 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-16 09:28:15,182 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-16 09:28:15,190 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:28:15" (1/1) ... [2021-12-16 09:28:15,201 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:28:15" (1/1) ... [2021-12-16 09:28:15,216 INFO L137 Inliner]: procedures = 111, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 54 [2021-12-16 09:28:15,217 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-16 09:28:15,218 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-16 09:28:15,218 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-16 09:28:15,218 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-16 09:28:15,223 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:28:15" (1/1) ... [2021-12-16 09:28:15,223 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:28:15" (1/1) ... [2021-12-16 09:28:15,225 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:28:15" (1/1) ... [2021-12-16 09:28:15,226 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:28:15" (1/1) ... [2021-12-16 09:28:15,230 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:28:15" (1/1) ... [2021-12-16 09:28:15,233 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:28:15" (1/1) ... [2021-12-16 09:28:15,234 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:28:15" (1/1) ... [2021-12-16 09:28:15,236 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-16 09:28:15,236 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-16 09:28:15,237 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-16 09:28:15,237 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-16 09:28:15,238 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:28:15" (1/1) ... [2021-12-16 09:28:15,249 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:28:15,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:28:15,269 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:28:15,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-12-16 09:28:15,304 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-16 09:28:15,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-16 09:28:15,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-16 09:28:15,305 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-16 09:28:15,305 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-16 09:28:15,306 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-16 09:28:15,376 INFO L236 CfgBuilder]: Building ICFG [2021-12-16 09:28:15,378 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-16 09:28:15,481 INFO L277 CfgBuilder]: Performing block encoding [2021-12-16 09:28:15,485 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-16 09:28:15,486 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-16 09:28:15,487 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 09:28:15 BoogieIcfgContainer [2021-12-16 09:28:15,487 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-16 09:28:15,488 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-16 09:28:15,488 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-16 09:28:15,491 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-16 09:28:15,492 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-16 09:28:15,492 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 16.12 09:28:14" (1/3) ... [2021-12-16 09:28:15,493 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3efd589c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.12 09:28:15, skipping insertion in model container [2021-12-16 09:28:15,494 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-16 09:28:15,494 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:28:15" (2/3) ... [2021-12-16 09:28:15,494 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3efd589c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.12 09:28:15, skipping insertion in model container [2021-12-16 09:28:15,494 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-16 09:28:15,494 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 09:28:15" (3/3) ... [2021-12-16 09:28:15,496 INFO L388 chiAutomizerObserver]: Analyzing ICFG insertionsort-alloca-2.i [2021-12-16 09:28:15,532 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-16 09:28:15,532 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-16 09:28:15,532 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-16 09:28:15,532 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-16 09:28:15,533 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-16 09:28:15,533 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-16 09:28:15,533 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-16 09:28:15,533 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-16 09:28:15,560 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:28:15,576 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2021-12-16 09:28:15,576 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:28:15,576 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:28:15,581 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2021-12-16 09:28:15,581 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-12-16 09:28:15,581 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-16 09:28:15,581 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:28:15,583 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2021-12-16 09:28:15,583 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:28:15,583 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:28:15,584 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2021-12-16 09:28:15,584 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-12-16 09:28:15,610 INFO L791 eck$LassoCheckResult]: Stem: 6#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 11#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_~array_size~0#1, main_~a~0#1.base, main_~a~0#1.offset;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 9#L560true assume !(main_~array_size~0#1 < 1); 15#L560-2true call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;assume { :begin_inline_insertionSort } true;insertionSort_#in~a#1.base, insertionSort_#in~a#1.offset, insertionSort_#in~array_size#1 := main_~a~0#1.base, main_~a~0#1.offset, main_~array_size~0#1;havoc insertionSort_#t~mem3#1, insertionSort_#t~mem7#1, insertionSort_#t~post4#1, insertionSort_#t~mem5#1, insertionSort_#t~short6#1, insertionSort_#t~pre2#1, insertionSort_~a#1.base, insertionSort_~a#1.offset, insertionSort_~array_size#1, insertionSort_~i~0#1, insertionSort_~j~0#1, insertionSort_~index~0#1;insertionSort_~a#1.base, insertionSort_~a#1.offset := insertionSort_#in~a#1.base, insertionSort_#in~a#1.offset;insertionSort_~array_size#1 := insertionSort_#in~array_size#1;havoc insertionSort_~i~0#1;havoc insertionSort_~j~0#1;havoc insertionSort_~index~0#1;insertionSort_~i~0#1 := 1; 10#L550-3true [2021-12-16 09:28:15,611 INFO L793 eck$LassoCheckResult]: Loop: 10#L550-3true assume !!(insertionSort_~i~0#1 < insertionSort_~array_size#1);call insertionSort_#t~mem3#1 := read~int(insertionSort_~a#1.base, insertionSort_~a#1.offset + 4 * insertionSort_~i~0#1, 4);insertionSort_~index~0#1 := insertionSort_#t~mem3#1;havoc insertionSort_#t~mem3#1;insertionSort_~j~0#1 := insertionSort_~i~0#1; 3#L553-6true assume !true; 14#L553-7true call write~int(insertionSort_~index~0#1, insertionSort_~a#1.base, insertionSort_~a#1.offset + 4 * insertionSort_~j~0#1, 4); 16#L550-2true insertionSort_#t~pre2#1 := 1 + insertionSort_~i~0#1;insertionSort_~i~0#1 := 1 + insertionSort_~i~0#1;havoc insertionSort_#t~pre2#1; 10#L550-3true [2021-12-16 09:28:15,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:28:15,619 INFO L85 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2021-12-16 09:28:15,627 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:28:15,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118910070] [2021-12-16 09:28:15,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:28:15,628 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:28:15,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:28:15,752 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:28:15,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:28:15,798 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:28:15,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:28:15,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1465782, now seen corresponding path program 1 times [2021-12-16 09:28:15,803 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:28:15,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594623080] [2021-12-16 09:28:15,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:28:15,804 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:28:15,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:28:15,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:28:15,871 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:28:15,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594623080] [2021-12-16 09:28:15,872 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594623080] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 09:28:15,872 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 09:28:15,872 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-16 09:28:15,873 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476782807] [2021-12-16 09:28:15,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 09:28:15,877 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-16 09:28:15,878 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:28:15,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-16 09:28:15,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-16 09:28:15,914 INFO L87 Difference]: Start difference. First operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:28:15,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:28:15,919 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2021-12-16 09:28:15,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-16 09:28:15,926 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 18 transitions. [2021-12-16 09:28:15,931 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2021-12-16 09:28:15,934 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 11 states and 14 transitions. [2021-12-16 09:28:15,935 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2021-12-16 09:28:15,935 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2021-12-16 09:28:15,936 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2021-12-16 09:28:15,937 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 09:28:15,937 INFO L681 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2021-12-16 09:28:15,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2021-12-16 09:28:15,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2021-12-16 09:28:15,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:28:15,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2021-12-16 09:28:15,958 INFO L704 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2021-12-16 09:28:15,958 INFO L587 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2021-12-16 09:28:15,958 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-16 09:28:15,959 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2021-12-16 09:28:15,960 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2021-12-16 09:28:15,960 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:28:15,960 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:28:15,961 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2021-12-16 09:28:15,961 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2021-12-16 09:28:15,961 INFO L791 eck$LassoCheckResult]: Stem: 42#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 43#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_~array_size~0#1, main_~a~0#1.base, main_~a~0#1.offset;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 46#L560 assume !(main_~array_size~0#1 < 1); 47#L560-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;assume { :begin_inline_insertionSort } true;insertionSort_#in~a#1.base, insertionSort_#in~a#1.offset, insertionSort_#in~array_size#1 := main_~a~0#1.base, main_~a~0#1.offset, main_~array_size~0#1;havoc insertionSort_#t~mem3#1, insertionSort_#t~mem7#1, insertionSort_#t~post4#1, insertionSort_#t~mem5#1, insertionSort_#t~short6#1, insertionSort_#t~pre2#1, insertionSort_~a#1.base, insertionSort_~a#1.offset, insertionSort_~array_size#1, insertionSort_~i~0#1, insertionSort_~j~0#1, insertionSort_~index~0#1;insertionSort_~a#1.base, insertionSort_~a#1.offset := insertionSort_#in~a#1.base, insertionSort_#in~a#1.offset;insertionSort_~array_size#1 := insertionSort_#in~array_size#1;havoc insertionSort_~i~0#1;havoc insertionSort_~j~0#1;havoc insertionSort_~index~0#1;insertionSort_~i~0#1 := 1; 48#L550-3 [2021-12-16 09:28:15,962 INFO L793 eck$LassoCheckResult]: Loop: 48#L550-3 assume !!(insertionSort_~i~0#1 < insertionSort_~array_size#1);call insertionSort_#t~mem3#1 := read~int(insertionSort_~a#1.base, insertionSort_~a#1.offset + 4 * insertionSort_~i~0#1, 4);insertionSort_~index~0#1 := insertionSort_#t~mem3#1;havoc insertionSort_#t~mem3#1;insertionSort_~j~0#1 := insertionSort_~i~0#1; 38#L553-6 insertionSort_#t~short6#1 := insertionSort_~j~0#1 > 0; 39#L553-1 assume insertionSort_#t~short6#1;call insertionSort_#t~mem5#1 := read~int(insertionSort_~a#1.base, insertionSort_~a#1.offset + 4 * (insertionSort_~j~0#1 - 1), 4);insertionSort_#t~short6#1 := insertionSort_#t~mem5#1 > insertionSort_~index~0#1; 44#L553-3 assume !insertionSort_#t~short6#1;havoc insertionSort_#t~mem5#1;havoc insertionSort_#t~short6#1; 40#L553-7 call write~int(insertionSort_~index~0#1, insertionSort_~a#1.base, insertionSort_~a#1.offset + 4 * insertionSort_~j~0#1, 4); 41#L550-2 insertionSort_#t~pre2#1 := 1 + insertionSort_~i~0#1;insertionSort_~i~0#1 := 1 + insertionSort_~i~0#1;havoc insertionSort_#t~pre2#1; 48#L550-3 [2021-12-16 09:28:15,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:28:15,963 INFO L85 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2021-12-16 09:28:15,963 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:28:15,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833865072] [2021-12-16 09:28:15,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:28:15,964 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:28:15,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:28:15,990 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:28:16,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:28:16,007 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:28:16,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:28:16,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1394338221, now seen corresponding path program 1 times [2021-12-16 09:28:16,009 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:28:16,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056042742] [2021-12-16 09:28:16,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:28:16,010 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:28:16,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:28:16,049 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:28:16,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:28:16,062 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:28:16,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:28:16,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1897689455, now seen corresponding path program 1 times [2021-12-16 09:28:16,065 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:28:16,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123329091] [2021-12-16 09:28:16,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:28:16,067 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:28:16,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:28:16,107 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:28:16,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:28:16,143 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:28:16,565 INFO L210 LassoAnalysis]: Preferences: [2021-12-16 09:28:16,566 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-16 09:28:16,566 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-16 09:28:16,566 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-16 09:28:16,566 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-16 09:28:16,566 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:28:16,566 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-16 09:28:16,567 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-16 09:28:16,567 INFO L133 ssoRankerPreferences]: Filename of dumped script: insertionsort-alloca-2.i_Iteration2_Lasso [2021-12-16 09:28:16,567 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-16 09:28:16,567 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-16 09:28:16,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:28:16,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:28:16,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:28:16,617 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:28:16,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:28:16,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:28:16,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:28:16,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:28:16,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:28:16,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:28:16,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:28:16,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:28:16,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:28:16,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:28:17,107 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-16 09:28:17,112 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-16 09:28:17,114 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:28:17,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:28:17,119 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:28:17,129 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:28:17,137 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:28:17,137 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:28:17,138 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:28:17,138 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:28:17,138 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:28:17,139 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:28:17,140 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:28:17,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2021-12-16 09:28:17,152 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:28:17,173 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2021-12-16 09:28:17,173 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:28:17,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:28:17,175 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:28:17,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2021-12-16 09:28:17,177 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:28:17,184 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:28:17,184 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:28:17,184 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:28:17,184 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:28:17,189 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:28:17,189 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:28:17,195 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:28:17,211 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2021-12-16 09:28:17,212 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:28:17,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:28:17,213 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:28:17,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2021-12-16 09:28:17,218 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:28:17,226 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:28:17,226 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:28:17,226 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:28:17,227 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:28:17,236 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:28:17,236 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:28:17,252 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:28:17,278 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2021-12-16 09:28:17,279 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:28:17,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:28:17,280 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:28:17,286 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:28:17,294 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:28:17,294 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:28:17,295 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:28:17,295 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:28:17,295 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:28:17,296 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:28:17,296 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:28:17,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2021-12-16 09:28:17,306 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:28:17,331 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2021-12-16 09:28:17,332 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:28:17,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:28:17,333 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:28:17,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2021-12-16 09:28:17,339 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:28:17,346 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:28:17,346 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:28:17,347 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:28:17,347 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:28:17,349 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:28:17,349 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:28:17,355 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:28:17,371 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2021-12-16 09:28:17,372 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:28:17,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:28:17,372 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:28:17,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2021-12-16 09:28:17,374 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:28:17,381 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:28:17,381 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:28:17,381 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:28:17,381 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:28:17,381 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:28:17,382 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:28:17,382 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:28:17,383 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:28:17,398 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2021-12-16 09:28:17,399 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:28:17,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:28:17,399 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:28:17,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2021-12-16 09:28:17,401 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:28:17,407 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:28:17,407 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:28:17,408 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:28:17,408 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:28:17,408 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:28:17,409 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:28:17,409 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:28:17,435 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:28:17,459 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2021-12-16 09:28:17,459 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:28:17,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:28:17,461 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:28:17,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2021-12-16 09:28:17,467 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:28:17,476 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:28:17,477 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:28:17,477 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:28:17,477 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:28:17,492 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:28:17,492 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:28:17,506 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:28:17,524 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2021-12-16 09:28:17,524 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:28:17,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:28:17,525 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:28:17,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2021-12-16 09:28:17,528 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:28:17,534 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:28:17,534 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:28:17,534 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:28:17,534 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:28:17,537 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:28:17,537 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:28:17,548 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:28:17,574 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2021-12-16 09:28:17,574 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:28:17,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:28:17,575 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:28:17,589 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:28:17,597 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:28:17,598 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:28:17,598 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:28:17,598 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:28:17,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2021-12-16 09:28:17,607 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:28:17,607 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:28:17,627 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-16 09:28:17,684 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2021-12-16 09:28:17,684 INFO L444 ModelExtractionUtils]: 22 out of 37 variables were initially zero. Simplification set additionally 11 variables to zero. [2021-12-16 09:28:17,686 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:28:17,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:28:17,711 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:28:17,726 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-16 09:28:17,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2021-12-16 09:28:17,748 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2021-12-16 09:28:17,748 INFO L513 LassoAnalysis]: Proved termination. [2021-12-16 09:28:17,749 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_insertionSort_~i~0#1, v_rep(select #length ULTIMATE.start_main_#t~malloc9#1.base)_1) = -2*ULTIMATE.start_insertionSort_~i~0#1 + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc9#1.base)_1 Supporting invariants [1*ULTIMATE.start_insertionSort_~a#1.offset >= 0] [2021-12-16 09:28:17,775 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2021-12-16 09:28:17,787 INFO L297 tatePredicateManager]: 3 out of 5 supporting invariants were superfluous and have been removed [2021-12-16 09:28:17,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:28:17,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:28:17,843 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-16 09:28:17,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:28:17,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:28:17,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-16 09:28:17,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:28:18,022 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2021-12-16 09:28:18,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:28:18,115 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2021-12-16 09:28:18,116 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 4 Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:28:18,258 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 4. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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 31 states and 41 transitions. Complement of second has 10 states. [2021-12-16 09:28:18,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2021-12-16 09:28:18,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:28:18,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2021-12-16 09:28:18,261 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 4 letters. Loop has 6 letters. [2021-12-16 09:28:18,262 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:28:18,262 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 10 letters. Loop has 6 letters. [2021-12-16 09:28:18,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:28:18,263 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 4 letters. Loop has 12 letters. [2021-12-16 09:28:18,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:28:18,263 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 41 transitions. [2021-12-16 09:28:18,265 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2021-12-16 09:28:18,265 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 29 states and 39 transitions. [2021-12-16 09:28:18,266 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2021-12-16 09:28:18,266 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2021-12-16 09:28:18,266 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 39 transitions. [2021-12-16 09:28:18,266 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-16 09:28:18,266 INFO L681 BuchiCegarLoop]: Abstraction has 29 states and 39 transitions. [2021-12-16 09:28:18,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 39 transitions. [2021-12-16 09:28:18,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2021-12-16 09:28:18,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 27 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:28:18,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2021-12-16 09:28:18,269 INFO L704 BuchiCegarLoop]: Abstraction has 28 states and 38 transitions. [2021-12-16 09:28:18,269 INFO L587 BuchiCegarLoop]: Abstraction has 28 states and 38 transitions. [2021-12-16 09:28:18,270 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-16 09:28:18,270 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 38 transitions. [2021-12-16 09:28:18,270 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2021-12-16 09:28:18,270 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:28:18,271 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:28:18,271 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2021-12-16 09:28:18,271 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2021-12-16 09:28:18,271 INFO L791 eck$LassoCheckResult]: Stem: 176#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 177#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_~array_size~0#1, main_~a~0#1.base, main_~a~0#1.offset;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 182#L560 assume !(main_~array_size~0#1 < 1); 183#L560-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;assume { :begin_inline_insertionSort } true;insertionSort_#in~a#1.base, insertionSort_#in~a#1.offset, insertionSort_#in~array_size#1 := main_~a~0#1.base, main_~a~0#1.offset, main_~array_size~0#1;havoc insertionSort_#t~mem3#1, insertionSort_#t~mem7#1, insertionSort_#t~post4#1, insertionSort_#t~mem5#1, insertionSort_#t~short6#1, insertionSort_#t~pre2#1, insertionSort_~a#1.base, insertionSort_~a#1.offset, insertionSort_~array_size#1, insertionSort_~i~0#1, insertionSort_~j~0#1, insertionSort_~index~0#1;insertionSort_~a#1.base, insertionSort_~a#1.offset := insertionSort_#in~a#1.base, insertionSort_#in~a#1.offset;insertionSort_~array_size#1 := insertionSort_#in~array_size#1;havoc insertionSort_~i~0#1;havoc insertionSort_~j~0#1;havoc insertionSort_~index~0#1;insertionSort_~i~0#1 := 1; 184#L550-3 assume !!(insertionSort_~i~0#1 < insertionSort_~array_size#1);call insertionSort_#t~mem3#1 := read~int(insertionSort_~a#1.base, insertionSort_~a#1.offset + 4 * insertionSort_~i~0#1, 4);insertionSort_~index~0#1 := insertionSort_#t~mem3#1;havoc insertionSort_#t~mem3#1;insertionSort_~j~0#1 := insertionSort_~i~0#1; 186#L553-6 [2021-12-16 09:28:18,271 INFO L793 eck$LassoCheckResult]: Loop: 186#L553-6 insertionSort_#t~short6#1 := insertionSort_~j~0#1 > 0; 191#L553-1 assume !insertionSort_#t~short6#1; 190#L553-3 assume !insertionSort_#t~short6#1;havoc insertionSort_#t~mem5#1;havoc insertionSort_#t~short6#1; 172#L553-7 call write~int(insertionSort_~index~0#1, insertionSort_~a#1.base, insertionSort_~a#1.offset + 4 * insertionSort_~j~0#1, 4); 173#L550-2 insertionSort_#t~pre2#1 := 1 + insertionSort_~i~0#1;insertionSort_~i~0#1 := 1 + insertionSort_~i~0#1;havoc insertionSort_#t~pre2#1; 185#L550-3 assume !!(insertionSort_~i~0#1 < insertionSort_~array_size#1);call insertionSort_#t~mem3#1 := read~int(insertionSort_~a#1.base, insertionSort_~a#1.offset + 4 * insertionSort_~i~0#1, 4);insertionSort_~index~0#1 := insertionSort_#t~mem3#1;havoc insertionSort_#t~mem3#1;insertionSort_~j~0#1 := insertionSort_~i~0#1; 186#L553-6 [2021-12-16 09:28:18,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:28:18,272 INFO L85 PathProgramCache]: Analyzing trace with hash 28695756, now seen corresponding path program 1 times [2021-12-16 09:28:18,272 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:28:18,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780025779] [2021-12-16 09:28:18,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:28:18,273 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:28:18,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:28:18,282 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:28:18,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:28:18,291 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:28:18,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:28:18,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1513658903, now seen corresponding path program 1 times [2021-12-16 09:28:18,291 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:28:18,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626507277] [2021-12-16 09:28:18,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:28:18,292 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:28:18,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:28:18,298 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:28:18,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:28:18,304 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:28:18,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:28:18,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1303016098, now seen corresponding path program 1 times [2021-12-16 09:28:18,309 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:28:18,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265265485] [2021-12-16 09:28:18,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:28:18,309 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:28:18,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:28:18,356 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:28:18,356 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:28:18,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265265485] [2021-12-16 09:28:18,356 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265265485] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 09:28:18,357 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 09:28:18,357 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-16 09:28:18,357 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237104684] [2021-12-16 09:28:18,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 09:28:18,463 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:28:18,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 09:28:18,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-16 09:28:18,464 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. cyclomatic complexity: 13 Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:28:18,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:28:18,503 INFO L93 Difference]: Finished difference Result 27 states and 35 transitions. [2021-12-16 09:28:18,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-16 09:28:18,504 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 35 transitions. [2021-12-16 09:28:18,505 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-12-16 09:28:18,506 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 35 transitions. [2021-12-16 09:28:18,506 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2021-12-16 09:28:18,506 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2021-12-16 09:28:18,506 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 35 transitions. [2021-12-16 09:28:18,506 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-16 09:28:18,506 INFO L681 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2021-12-16 09:28:18,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 35 transitions. [2021-12-16 09:28:18,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 20. [2021-12-16 09:28:18,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:28:18,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2021-12-16 09:28:18,509 INFO L704 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2021-12-16 09:28:18,509 INFO L587 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2021-12-16 09:28:18,509 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-16 09:28:18,509 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 26 transitions. [2021-12-16 09:28:18,509 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-12-16 09:28:18,509 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:28:18,510 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:28:18,510 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:28:18,510 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-12-16 09:28:18,510 INFO L791 eck$LassoCheckResult]: Stem: 241#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 242#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_~array_size~0#1, main_~a~0#1.base, main_~a~0#1.offset;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 249#L560 assume !(main_~array_size~0#1 < 1); 250#L560-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;assume { :begin_inline_insertionSort } true;insertionSort_#in~a#1.base, insertionSort_#in~a#1.offset, insertionSort_#in~array_size#1 := main_~a~0#1.base, main_~a~0#1.offset, main_~array_size~0#1;havoc insertionSort_#t~mem3#1, insertionSort_#t~mem7#1, insertionSort_#t~post4#1, insertionSort_#t~mem5#1, insertionSort_#t~short6#1, insertionSort_#t~pre2#1, insertionSort_~a#1.base, insertionSort_~a#1.offset, insertionSort_~array_size#1, insertionSort_~i~0#1, insertionSort_~j~0#1, insertionSort_~index~0#1;insertionSort_~a#1.base, insertionSort_~a#1.offset := insertionSort_#in~a#1.base, insertionSort_#in~a#1.offset;insertionSort_~array_size#1 := insertionSort_#in~array_size#1;havoc insertionSort_~i~0#1;havoc insertionSort_~j~0#1;havoc insertionSort_~index~0#1;insertionSort_~i~0#1 := 1; 251#L550-3 assume !!(insertionSort_~i~0#1 < insertionSort_~array_size#1);call insertionSort_#t~mem3#1 := read~int(insertionSort_~a#1.base, insertionSort_~a#1.offset + 4 * insertionSort_~i~0#1, 4);insertionSort_~index~0#1 := insertionSort_#t~mem3#1;havoc insertionSort_#t~mem3#1;insertionSort_~j~0#1 := insertionSort_~i~0#1; 252#L553-6 insertionSort_#t~short6#1 := insertionSort_~j~0#1 > 0; 254#L553-1 assume insertionSort_#t~short6#1;call insertionSort_#t~mem5#1 := read~int(insertionSort_~a#1.base, insertionSort_~a#1.offset + 4 * (insertionSort_~j~0#1 - 1), 4);insertionSort_#t~short6#1 := insertionSort_#t~mem5#1 > insertionSort_~index~0#1; 245#L553-3 [2021-12-16 09:28:18,510 INFO L793 eck$LassoCheckResult]: Loop: 245#L553-3 assume !!insertionSort_#t~short6#1;havoc insertionSort_#t~mem5#1;havoc insertionSort_#t~short6#1;call insertionSort_#t~mem7#1 := read~int(insertionSort_~a#1.base, insertionSort_~a#1.offset + 4 * (insertionSort_~j~0#1 - 1), 4);call write~int(insertionSort_#t~mem7#1, insertionSort_~a#1.base, insertionSort_~a#1.offset + 4 * insertionSort_~j~0#1, 4);havoc insertionSort_#t~mem7#1; 246#L553-5 insertionSort_#t~post4#1 := insertionSort_~j~0#1;insertionSort_~j~0#1 := insertionSort_#t~post4#1 - 1;havoc insertionSort_#t~post4#1; 237#L553-6 insertionSort_#t~short6#1 := insertionSort_~j~0#1 > 0; 238#L553-1 assume insertionSort_#t~short6#1;call insertionSort_#t~mem5#1 := read~int(insertionSort_~a#1.base, insertionSort_~a#1.offset + 4 * (insertionSort_~j~0#1 - 1), 4);insertionSort_#t~short6#1 := insertionSort_#t~mem5#1 > insertionSort_~index~0#1; 245#L553-3 [2021-12-16 09:28:18,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:28:18,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1806818415, now seen corresponding path program 1 times [2021-12-16 09:28:18,511 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:28:18,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700116979] [2021-12-16 09:28:18,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:28:18,512 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:28:18,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:28:18,521 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:28:18,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:28:18,529 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:28:18,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:28:18,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1910182, now seen corresponding path program 1 times [2021-12-16 09:28:18,530 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:28:18,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383304584] [2021-12-16 09:28:18,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:28:18,531 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:28:18,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:28:18,536 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:28:18,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:28:18,540 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:28:18,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:28:18,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1301224212, now seen corresponding path program 1 times [2021-12-16 09:28:18,541 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:28:18,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724380360] [2021-12-16 09:28:18,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:28:18,542 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:28:18,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:28:18,576 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:28:18,576 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:28:18,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724380360] [2021-12-16 09:28:18,577 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724380360] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 09:28:18,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [675309694] [2021-12-16 09:28:18,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:28:18,577 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 09:28:18,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:28:18,578 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 09:28:18,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-12-16 09:28:18,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:28:18,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-16 09:28:18,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:28:18,665 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:28:18,665 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 09:28:18,686 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:28:18,686 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [675309694] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 09:28:18,687 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 09:28:18,687 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2021-12-16 09:28:18,687 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293726515] [2021-12-16 09:28:18,687 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 09:28:18,845 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:28:18,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 09:28:18,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-16 09:28:18,848 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. cyclomatic complexity: 8 Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:28:18,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:28:18,917 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2021-12-16 09:28:18,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-16 09:28:18,917 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 49 transitions. [2021-12-16 09:28:18,922 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-12-16 09:28:18,922 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 34 states and 41 transitions. [2021-12-16 09:28:18,922 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2021-12-16 09:28:18,922 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2021-12-16 09:28:18,922 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 41 transitions. [2021-12-16 09:28:18,922 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-16 09:28:18,922 INFO L681 BuchiCegarLoop]: Abstraction has 34 states and 41 transitions. [2021-12-16 09:28:18,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 41 transitions. [2021-12-16 09:28:18,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 25. [2021-12-16 09:28:18,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.2) internal successors, (30), 24 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:28:18,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2021-12-16 09:28:18,925 INFO L704 BuchiCegarLoop]: Abstraction has 25 states and 30 transitions. [2021-12-16 09:28:18,925 INFO L587 BuchiCegarLoop]: Abstraction has 25 states and 30 transitions. [2021-12-16 09:28:18,925 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-12-16 09:28:18,925 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 30 transitions. [2021-12-16 09:28:18,925 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-12-16 09:28:18,926 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:28:18,926 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:28:18,926 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:28:18,926 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-12-16 09:28:18,926 INFO L791 eck$LassoCheckResult]: Stem: 380#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 381#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_~array_size~0#1, main_~a~0#1.base, main_~a~0#1.offset;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 387#L560 assume !(main_~array_size~0#1 < 1); 388#L560-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;assume { :begin_inline_insertionSort } true;insertionSort_#in~a#1.base, insertionSort_#in~a#1.offset, insertionSort_#in~array_size#1 := main_~a~0#1.base, main_~a~0#1.offset, main_~array_size~0#1;havoc insertionSort_#t~mem3#1, insertionSort_#t~mem7#1, insertionSort_#t~post4#1, insertionSort_#t~mem5#1, insertionSort_#t~short6#1, insertionSort_#t~pre2#1, insertionSort_~a#1.base, insertionSort_~a#1.offset, insertionSort_~array_size#1, insertionSort_~i~0#1, insertionSort_~j~0#1, insertionSort_~index~0#1;insertionSort_~a#1.base, insertionSort_~a#1.offset := insertionSort_#in~a#1.base, insertionSort_#in~a#1.offset;insertionSort_~array_size#1 := insertionSort_#in~array_size#1;havoc insertionSort_~i~0#1;havoc insertionSort_~j~0#1;havoc insertionSort_~index~0#1;insertionSort_~i~0#1 := 1; 389#L550-3 assume !!(insertionSort_~i~0#1 < insertionSort_~array_size#1);call insertionSort_#t~mem3#1 := read~int(insertionSort_~a#1.base, insertionSort_~a#1.offset + 4 * insertionSort_~i~0#1, 4);insertionSort_~index~0#1 := insertionSort_#t~mem3#1;havoc insertionSort_#t~mem3#1;insertionSort_~j~0#1 := insertionSort_~i~0#1; 378#L553-6 insertionSort_#t~short6#1 := insertionSort_~j~0#1 > 0; 379#L553-1 assume insertionSort_#t~short6#1;call insertionSort_#t~mem5#1 := read~int(insertionSort_~a#1.base, insertionSort_~a#1.offset + 4 * (insertionSort_~j~0#1 - 1), 4);insertionSort_#t~short6#1 := insertionSort_#t~mem5#1 > insertionSort_~index~0#1; 400#L553-3 assume !insertionSort_#t~short6#1;havoc insertionSort_#t~mem5#1;havoc insertionSort_#t~short6#1; 382#L553-7 call write~int(insertionSort_~index~0#1, insertionSort_~a#1.base, insertionSort_~a#1.offset + 4 * insertionSort_~j~0#1, 4); 383#L550-2 insertionSort_#t~pre2#1 := 1 + insertionSort_~i~0#1;insertionSort_~i~0#1 := 1 + insertionSort_~i~0#1;havoc insertionSort_#t~pre2#1; 390#L550-3 assume !!(insertionSort_~i~0#1 < insertionSort_~array_size#1);call insertionSort_#t~mem3#1 := read~int(insertionSort_~a#1.base, insertionSort_~a#1.offset + 4 * insertionSort_~i~0#1, 4);insertionSort_~index~0#1 := insertionSort_#t~mem3#1;havoc insertionSort_#t~mem3#1;insertionSort_~j~0#1 := insertionSort_~i~0#1; 376#L553-6 [2021-12-16 09:28:18,926 INFO L793 eck$LassoCheckResult]: Loop: 376#L553-6 insertionSort_#t~short6#1 := insertionSort_~j~0#1 > 0; 377#L553-1 assume insertionSort_#t~short6#1;call insertionSort_#t~mem5#1 := read~int(insertionSort_~a#1.base, insertionSort_~a#1.offset + 4 * (insertionSort_~j~0#1 - 1), 4);insertionSort_#t~short6#1 := insertionSort_#t~mem5#1 > insertionSort_~index~0#1; 384#L553-3 assume !!insertionSort_#t~short6#1;havoc insertionSort_#t~mem5#1;havoc insertionSort_#t~short6#1;call insertionSort_#t~mem7#1 := read~int(insertionSort_~a#1.base, insertionSort_~a#1.offset + 4 * (insertionSort_~j~0#1 - 1), 4);call write~int(insertionSort_#t~mem7#1, insertionSort_~a#1.base, insertionSort_~a#1.offset + 4 * insertionSort_~j~0#1, 4);havoc insertionSort_#t~mem7#1; 385#L553-5 insertionSort_#t~post4#1 := insertionSort_~j~0#1;insertionSort_~j~0#1 := insertionSort_#t~post4#1 - 1;havoc insertionSort_#t~post4#1; 376#L553-6 [2021-12-16 09:28:18,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:28:18,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1301169056, now seen corresponding path program 2 times [2021-12-16 09:28:18,927 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:28:18,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367943641] [2021-12-16 09:28:18,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:28:18,928 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:28:18,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:28:18,951 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:28:18,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:28:18,977 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:28:18,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:28:18,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1573222, now seen corresponding path program 2 times [2021-12-16 09:28:18,979 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:28:18,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814331179] [2021-12-16 09:28:18,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:28:18,980 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:28:18,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:28:18,988 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:28:18,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:28:18,994 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:28:18,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:28:18,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1886560891, now seen corresponding path program 1 times [2021-12-16 09:28:18,996 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:28:18,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980840651] [2021-12-16 09:28:18,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:28:18,999 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:28:19,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:28:19,020 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:28:19,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:28:19,041 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:28:19,470 INFO L210 LassoAnalysis]: Preferences: [2021-12-16 09:28:19,471 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-16 09:28:19,471 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-16 09:28:19,471 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-16 09:28:19,471 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-16 09:28:19,471 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:28:19,471 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-16 09:28:19,471 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-16 09:28:19,471 INFO L133 ssoRankerPreferences]: Filename of dumped script: insertionsort-alloca-2.i_Iteration5_Lasso [2021-12-16 09:28:19,472 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-16 09:28:19,472 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-16 09:28:19,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:28:19,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:28:19,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:28:19,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:28:19,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:28:19,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:28:19,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:28:19,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:28:19,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:28:19,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:28:19,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:28:19,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:28:19,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:28:19,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:28:19,929 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-16 09:28:19,929 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-16 09:28:19,929 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:28:19,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:28:19,931 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:28:19,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2021-12-16 09:28:19,985 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:28:19,994 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:28:19,994 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:28:19,994 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:28:19,994 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:28:19,998 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:28:19,998 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:28:20,011 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:28:20,037 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2021-12-16 09:28:20,038 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:28:20,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:28:20,039 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:28:20,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2021-12-16 09:28:20,042 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:28:20,049 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:28:20,049 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:28:20,049 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:28:20,049 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:28:20,050 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:28:20,050 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:28:20,050 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:28:20,071 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:28:20,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2021-12-16 09:28:20,097 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:28:20,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:28:20,098 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:28:20,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2021-12-16 09:28:20,101 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:28:20,108 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:28:20,108 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:28:20,108 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:28:20,108 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:28:20,111 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:28:20,111 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:28:20,131 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:28:20,154 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2021-12-16 09:28:20,154 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:28:20,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:28:20,155 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:28:20,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2021-12-16 09:28:20,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 [2021-12-16 09:28:20,165 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:28:20,165 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:28:20,165 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:28:20,165 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:28:20,167 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:28:20,167 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:28:20,195 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:28:20,217 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2021-12-16 09:28:20,218 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:28:20,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:28:20,219 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:28:20,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2021-12-16 09:28:20,221 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:28:20,227 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:28:20,228 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:28:20,228 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:28:20,228 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:28:20,230 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:28:20,230 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:28:20,251 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:28:20,279 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2021-12-16 09:28:20,279 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:28:20,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:28:20,281 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:28:20,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2021-12-16 09:28:20,286 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:28:20,293 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:28:20,293 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:28:20,293 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:28:20,293 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:28:20,300 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:28:20,300 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:28:20,316 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-16 09:28:20,331 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2021-12-16 09:28:20,331 INFO L444 ModelExtractionUtils]: 9 out of 37 variables were initially zero. Simplification set additionally 26 variables to zero. [2021-12-16 09:28:20,331 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:28:20,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:28:20,332 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:28:20,342 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-16 09:28:20,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2021-12-16 09:28:20,372 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-16 09:28:20,372 INFO L513 LassoAnalysis]: Proved termination. [2021-12-16 09:28:20,372 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_insertionSort_~j~0#1) = 1*ULTIMATE.start_insertionSort_~j~0#1 Supporting invariants [] [2021-12-16 09:28:20,388 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2021-12-16 09:28:20,400 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2021-12-16 09:28:20,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:28:20,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:28:20,426 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-16 09:28:20,426 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:28:20,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:28:20,455 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-16 09:28:20,455 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:28:20,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:28:20,500 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2021-12-16 09:28:20,500 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 30 transitions. cyclomatic complexity: 7 Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:28:20,526 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 30 transitions. cyclomatic complexity: 7. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 43 states and 50 transitions. Complement of second has 9 states. [2021-12-16 09:28:20,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2021-12-16 09:28:20,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:28:20,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 17 transitions. [2021-12-16 09:28:20,528 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 11 letters. Loop has 4 letters. [2021-12-16 09:28:20,528 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:28:20,528 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-16 09:28:20,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:28:20,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:28:20,551 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-16 09:28:20,551 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:28:20,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:28:20,576 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-16 09:28:20,577 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:28:20,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:28:20,628 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2021-12-16 09:28:20,628 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 30 transitions. cyclomatic complexity: 7 Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:28:20,650 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 30 transitions. cyclomatic complexity: 7. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 43 states and 50 transitions. Complement of second has 9 states. [2021-12-16 09:28:20,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2021-12-16 09:28:20,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:28:20,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 17 transitions. [2021-12-16 09:28:20,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 11 letters. Loop has 4 letters. [2021-12-16 09:28:20,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:28:20,652 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-16 09:28:20,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:28:20,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:28:20,676 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-16 09:28:20,677 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:28:20,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:28:20,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-16 09:28:20,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:28:20,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:28:20,740 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2021-12-16 09:28:20,741 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 30 transitions. cyclomatic complexity: 7 Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:28:20,770 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 30 transitions. cyclomatic complexity: 7. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 47 states and 57 transitions. Complement of second has 8 states. [2021-12-16 09:28:20,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2021-12-16 09:28:20,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:28:20,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2021-12-16 09:28:20,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 11 letters. Loop has 4 letters. [2021-12-16 09:28:20,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:28:20,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 15 letters. Loop has 4 letters. [2021-12-16 09:28:20,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:28:20,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 11 letters. Loop has 8 letters. [2021-12-16 09:28:20,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:28:20,773 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 57 transitions. [2021-12-16 09:28:20,774 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-12-16 09:28:20,774 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 0 states and 0 transitions. [2021-12-16 09:28:20,774 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2021-12-16 09:28:20,774 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2021-12-16 09:28:20,774 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2021-12-16 09:28:20,774 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 09:28:20,774 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-16 09:28:20,774 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-16 09:28:20,775 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-16 09:28:20,775 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-12-16 09:28:20,775 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2021-12-16 09:28:20,775 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-12-16 09:28:20,775 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2021-12-16 09:28:20,781 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 16.12 09:28:20 BoogieIcfgContainer [2021-12-16 09:28:20,781 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-12-16 09:28:20,782 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-16 09:28:20,782 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-16 09:28:20,782 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-16 09:28:20,782 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 09:28:15" (3/4) ... [2021-12-16 09:28:20,784 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-16 09:28:20,785 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-16 09:28:20,785 INFO L158 Benchmark]: Toolchain (without parser) took 5958.46ms. Allocated memory was 107.0MB in the beginning and 130.0MB in the end (delta: 23.1MB). Free memory was 71.1MB in the beginning and 34.3MB in the end (delta: 36.9MB). Peak memory consumption was 58.1MB. Max. memory is 16.1GB. [2021-12-16 09:28:20,786 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 75.5MB. Free memory was 47.1MB in the beginning and 47.0MB in the end (delta: 27.9kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-16 09:28:20,786 INFO L158 Benchmark]: CACSL2BoogieTranslator took 352.88ms. Allocated memory is still 107.0MB. Free memory was 70.9MB in the beginning and 76.2MB in the end (delta: -5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-12-16 09:28:20,786 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.15ms. Allocated memory is still 107.0MB. Free memory was 76.2MB in the beginning and 74.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-16 09:28:20,787 INFO L158 Benchmark]: Boogie Preprocessor took 18.23ms. Allocated memory is still 107.0MB. Free memory was 74.7MB in the beginning and 73.6MB in the end (delta: 1.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-16 09:28:20,787 INFO L158 Benchmark]: RCFGBuilder took 251.07ms. Allocated memory is still 107.0MB. Free memory was 73.1MB in the beginning and 63.1MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-16 09:28:20,787 INFO L158 Benchmark]: BuchiAutomizer took 5292.78ms. Allocated memory was 107.0MB in the beginning and 130.0MB in the end (delta: 23.1MB). Free memory was 63.1MB in the beginning and 34.3MB in the end (delta: 28.9MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. [2021-12-16 09:28:20,788 INFO L158 Benchmark]: Witness Printer took 3.11ms. Allocated memory is still 130.0MB. Free memory is still 34.3MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-16 09:28:20,828 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.20ms. Allocated memory is still 75.5MB. Free memory was 47.1MB in the beginning and 47.0MB in the end (delta: 27.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 352.88ms. Allocated memory is still 107.0MB. Free memory was 70.9MB in the beginning and 76.2MB in the end (delta: -5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.15ms. Allocated memory is still 107.0MB. Free memory was 76.2MB in the beginning and 74.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 18.23ms. Allocated memory is still 107.0MB. Free memory was 74.7MB in the beginning and 73.6MB in the end (delta: 1.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 251.07ms. Allocated memory is still 107.0MB. Free memory was 73.1MB in the beginning and 63.1MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 5292.78ms. Allocated memory was 107.0MB in the beginning and 130.0MB in the end (delta: 23.1MB). Free memory was 63.1MB in the beginning and 34.3MB in the end (delta: 28.9MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. * Witness Printer took 3.11ms. Allocated memory is still 130.0MB. Free memory is still 34.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (3 trivial, 1 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -2 * i + unknown-#length-unknown[__builtin_alloca (array_size * sizeof(int))] and consists of 6 locations. One nondeterministic module has affine ranking function j and consists of 5 locations. 3 modules have a trivial ranking function, the largest among these consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.2s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 4.1s. Construction of modules took 0.1s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 17 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 28 states and ocurred in iteration 2. Nontrivial modules had stage [1, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 102 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 99 mSDsluCounter, 126 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 51 mSDsCounter, 40 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 169 IncrementalHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 40 mSolverCounterUnsat, 75 mSDtfsCounter, 169 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital175 mio100 ax110 hnf99 lsp87 ukn68 mio100 lsp59 div100 bol100 ite100 ukn100 eq177 hnf89 smp100 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 21ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2021-12-16 09:28:20,851 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2021-12-16 09:28:21,059 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-12-16 09:28:21,259 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE