./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 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-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-?-6c24879 [2022-07-13 03:20:29,797 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 03:20:29,799 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 03:20:29,834 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 03:20:29,834 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 03:20:29,837 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 03:20:29,840 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 03:20:29,844 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 03:20:29,845 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 03:20:29,848 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 03:20:29,849 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 03:20:29,850 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 03:20:29,850 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 03:20:29,852 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 03:20:29,853 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 03:20:29,855 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 03:20:29,855 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 03:20:29,856 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 03:20:29,859 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 03:20:29,862 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 03:20:29,864 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 03:20:29,864 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 03:20:29,865 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 03:20:29,866 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 03:20:29,867 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 03:20:29,871 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 03:20:29,872 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 03:20:29,872 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 03:20:29,873 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 03:20:29,873 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 03:20:29,874 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 03:20:29,874 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 03:20:29,875 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 03:20:29,875 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 03:20:29,876 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 03:20:29,876 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 03:20:29,877 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 03:20:29,878 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 03:20:29,878 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 03:20:29,878 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 03:20:29,878 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 03:20:29,880 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 03:20:29,880 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-07-13 03:20:29,903 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 03:20:29,903 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 03:20:29,903 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 03:20:29,903 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 03:20:29,904 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 03:20:29,905 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 03:20:29,905 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 03:20:29,905 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-13 03:20:29,905 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-13 03:20:29,906 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-13 03:20:29,906 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-13 03:20:29,906 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-13 03:20:29,906 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-13 03:20:29,906 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 03:20:29,906 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-13 03:20:29,907 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 03:20:29,907 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 03:20:29,908 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-13 03:20:29,908 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-13 03:20:29,908 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-13 03:20:29,908 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 03:20:29,908 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-13 03:20:29,908 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 03:20:29,908 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-13 03:20:29,909 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 03:20:29,909 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 03:20:29,909 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 03:20:29,909 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 03:20:29,910 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-13 03:20:29,910 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 [2022-07-13 03:20:30,070 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 03:20:30,088 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 03:20:30,090 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 03:20:30,091 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 03:20:30,091 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 03:20:30,092 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 [2022-07-13 03:20:30,130 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5f6ef72b/f7a8a1b466d345cd95442046903cef80/FLAGef5cb4894 [2022-07-13 03:20:30,528 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 03:20:30,528 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/insertionsort-alloca-2.i [2022-07-13 03:20:30,539 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5f6ef72b/f7a8a1b466d345cd95442046903cef80/FLAGef5cb4894 [2022-07-13 03:20:30,548 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5f6ef72b/f7a8a1b466d345cd95442046903cef80 [2022-07-13 03:20:30,550 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 03:20:30,550 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 03:20:30,552 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 03:20:30,553 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 03:20:30,557 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 03:20:30,557 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:20:30" (1/1) ... [2022-07-13 03:20:30,558 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b0c489c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:20:30, skipping insertion in model container [2022-07-13 03:20:30,558 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:20:30" (1/1) ... [2022-07-13 03:20:30,562 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 03:20:30,582 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 03:20:30,768 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 03:20:30,774 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 03:20:30,802 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 03:20:30,828 INFO L208 MainTranslator]: Completed translation [2022-07-13 03:20:30,829 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:20:30 WrapperNode [2022-07-13 03:20:30,829 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 03:20:30,830 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 03:20:30,830 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 03:20:30,830 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 03:20:30,835 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:20:30" (1/1) ... [2022-07-13 03:20:30,849 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:20:30" (1/1) ... [2022-07-13 03:20:30,865 INFO L137 Inliner]: procedures = 111, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 54 [2022-07-13 03:20:30,866 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 03:20:30,867 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 03:20:30,867 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 03:20:30,867 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 03:20:30,872 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:20:30" (1/1) ... [2022-07-13 03:20:30,873 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:20:30" (1/1) ... [2022-07-13 03:20:30,883 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:20:30" (1/1) ... [2022-07-13 03:20:30,883 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:20:30" (1/1) ... [2022-07-13 03:20:30,897 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:20:30" (1/1) ... [2022-07-13 03:20:30,900 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:20:30" (1/1) ... [2022-07-13 03:20:30,901 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:20:30" (1/1) ... [2022-07-13 03:20:30,902 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 03:20:30,904 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 03:20:30,905 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 03:20:30,905 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 03:20:30,905 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:20:30" (1/1) ... [2022-07-13 03:20:30,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:20:30,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:20:30,924 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:20:30,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-07-13 03:20:30,949 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 03:20:30,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 03:20:30,949 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 03:20:30,949 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 03:20:30,950 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 03:20:30,950 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 03:20:31,002 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 03:20:31,003 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 03:20:31,083 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 03:20:31,087 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 03:20:31,087 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-13 03:20:31,088 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:20:31 BoogieIcfgContainer [2022-07-13 03:20:31,088 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 03:20:31,089 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-13 03:20:31,089 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-13 03:20:31,091 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-13 03:20:31,092 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 03:20:31,092 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.07 03:20:30" (1/3) ... [2022-07-13 03:20:31,092 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6403e8e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.07 03:20:31, skipping insertion in model container [2022-07-13 03:20:31,093 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 03:20:31,093 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:20:30" (2/3) ... [2022-07-13 03:20:31,093 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6403e8e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.07 03:20:31, skipping insertion in model container [2022-07-13 03:20:31,093 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 03:20:31,093 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:20:31" (3/3) ... [2022-07-13 03:20:31,094 INFO L354 chiAutomizerObserver]: Analyzing ICFG insertionsort-alloca-2.i [2022-07-13 03:20:31,126 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-13 03:20:31,127 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-13 03:20:31,127 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-13 03:20:31,127 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-13 03:20:31,127 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-13 03:20:31,127 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-13 03:20:31,127 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-13 03:20:31,128 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-13 03:20:31,130 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) [2022-07-13 03:20:31,147 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-07-13 03:20:31,148 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:20:31,148 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:20:31,152 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-13 03:20:31,152 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-07-13 03:20:31,152 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-13 03:20:31,152 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) [2022-07-13 03:20:31,153 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-07-13 03:20:31,154 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:20:31,154 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:20:31,154 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-13 03:20:31,154 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-07-13 03:20:31,158 INFO L752 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 10#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; 8#L560true assume !(main_~array_size~0#1 < 1); 14#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; 9#L550-3true [2022-07-13 03:20:31,159 INFO L754 eck$LassoCheckResult]: Loop: 9#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; 2#L553-6true assume !true; 13#L553-7true call write~int(insertionSort_~index~0#1, insertionSort_~a#1.base, insertionSort_~a#1.offset + 4 * insertionSort_~j~0#1, 4); 15#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; 9#L550-3true [2022-07-13 03:20:31,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:20:31,166 INFO L85 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2022-07-13 03:20:31,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:20:31,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613317960] [2022-07-13 03:20:31,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:20:31,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:20:31,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:20:31,266 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:20:31,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:20:31,313 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:20:31,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:20:31,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1465782, now seen corresponding path program 1 times [2022-07-13 03:20:31,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:20:31,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059754945] [2022-07-13 03:20:31,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:20:31,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:20:31,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:20:31,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:20:31,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:20:31,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059754945] [2022-07-13 03:20:31,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059754945] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:20:31,358 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:20:31,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 03:20:31,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198860347] [2022-07-13 03:20:31,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:20:31,364 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:20:31,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:20:31,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-13 03:20:31,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 03:20:31,394 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) [2022-07-13 03:20:31,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:20:31,399 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2022-07-13 03:20:31,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-13 03:20:31,404 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 18 transitions. [2022-07-13 03:20:31,407 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-07-13 03:20:31,409 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 11 states and 14 transitions. [2022-07-13 03:20:31,410 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2022-07-13 03:20:31,410 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2022-07-13 03:20:31,411 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2022-07-13 03:20:31,411 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:20:31,411 INFO L369 hiAutomatonCegarLoop]: Abstraction has 11 states and 14 transitions. [2022-07-13 03:20:31,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2022-07-13 03:20:31,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2022-07-13 03:20:31,427 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) [2022-07-13 03:20:31,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2022-07-13 03:20:31,430 INFO L392 hiAutomatonCegarLoop]: Abstraction has 11 states and 14 transitions. [2022-07-13 03:20:31,431 INFO L374 stractBuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2022-07-13 03:20:31,431 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-13 03:20:31,431 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2022-07-13 03:20:31,432 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-07-13 03:20:31,432 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:20:31,432 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:20:31,432 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-13 03:20:31,433 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-07-13 03:20:31,433 INFO L752 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 [2022-07-13 03:20:31,433 INFO L754 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 [2022-07-13 03:20:31,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:20:31,434 INFO L85 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2022-07-13 03:20:31,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:20:31,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281346340] [2022-07-13 03:20:31,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:20:31,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:20:31,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:20:31,463 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:20:31,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:20:31,479 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:20:31,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:20:31,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1394338221, now seen corresponding path program 1 times [2022-07-13 03:20:31,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:20:31,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333258769] [2022-07-13 03:20:31,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:20:31,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:20:31,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:20:31,513 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:20:31,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:20:31,532 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:20:31,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:20:31,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1897689455, now seen corresponding path program 1 times [2022-07-13 03:20:31,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:20:31,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266253864] [2022-07-13 03:20:31,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:20:31,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:20:31,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:20:31,553 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:20:31,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:20:31,568 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:20:31,876 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 03:20:31,877 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 03:20:31,877 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 03:20:31,877 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 03:20:31,877 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-13 03:20:31,877 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:20:31,877 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 03:20:31,877 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 03:20:31,878 INFO L133 ssoRankerPreferences]: Filename of dumped script: insertionsort-alloca-2.i_Iteration2_Lasso [2022-07-13 03:20:31,878 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 03:20:31,878 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 03:20:31,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:20:31,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:20:31,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:20:31,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:20:31,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:20:31,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:20:32,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:20:32,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:20:32,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:20:32,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:20:32,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:20:32,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:20:32,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:20:32,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:20:32,384 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 03:20:32,387 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-13 03:20:32,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:20:32,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:20:32,390 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:20:32,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-07-13 03:20:32,393 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:20:32,399 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:20:32,400 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:20:32,400 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:20:32,400 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:20:32,400 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:20:32,401 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:20:32,401 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:20:32,417 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:20:32,432 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2022-07-13 03:20:32,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:20:32,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:20:32,434 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:20:32,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-07-13 03:20:32,436 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:20:32,443 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:20:32,443 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:20:32,443 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:20:32,443 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:20:32,446 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:20:32,446 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:20:32,459 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:20:32,481 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 [2022-07-13 03:20:32,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:20:32,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:20:32,483 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:20:32,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-07-13 03:20:32,485 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:20:32,491 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:20:32,491 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:20:32,491 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:20:32,491 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:20:32,494 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:20:32,494 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:20:32,513 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:20:32,530 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2022-07-13 03:20:32,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:20:32,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:20:32,532 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:20:32,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-07-13 03:20:32,534 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:20:32,539 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:20:32,539 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:20:32,539 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:20:32,539 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:20:32,539 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:20:32,540 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:20:32,540 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:20:32,551 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:20:32,566 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2022-07-13 03:20:32,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:20:32,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:20:32,567 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:20:32,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-07-13 03:20:32,569 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:20:32,575 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:20:32,575 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:20:32,576 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:20:32,576 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:20:32,577 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:20:32,577 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:20:32,592 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:20:32,609 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2022-07-13 03:20:32,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:20:32,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:20:32,611 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:20:32,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-07-13 03:20:32,613 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:20:32,620 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:20:32,620 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:20:32,620 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:20:32,620 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:20:32,625 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:20:32,625 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:20:32,647 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:20:32,671 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-07-13 03:20:32,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:20:32,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:20:32,673 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:20:32,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-07-13 03:20:32,683 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:20:32,690 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:20:32,691 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:20:32,691 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:20:32,691 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:20:32,696 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:20:32,696 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:20:32,708 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:20:32,723 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-07-13 03:20:32,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:20:32,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:20:32,725 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:20:32,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-07-13 03:20:32,727 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:20:32,735 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:20:32,735 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:20:32,735 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:20:32,735 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:20:32,736 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:20:32,738 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:20:32,738 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:20:32,759 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:20:32,796 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 [2022-07-13 03:20:32,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:20:32,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:20:32,803 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:20:32,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-07-13 03:20:32,805 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:20:32,812 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:20:32,813 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:20:32,813 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:20:32,813 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:20:32,821 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:20:32,821 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:20:32,836 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-13 03:20:32,875 INFO L443 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver. [2022-07-13 03:20:32,876 INFO L444 ModelExtractionUtils]: 24 out of 37 variables were initially zero. Simplification set additionally 9 variables to zero. [2022-07-13 03:20:32,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:20:32,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:20:32,919 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) [2022-07-13 03:20:32,938 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 [2022-07-13 03:20:32,939 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-13 03:20:32,963 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2022-07-13 03:20:32,963 INFO L513 LassoAnalysis]: Proved termination. [2022-07-13 03:20:32,964 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_insertionSort_~a#1.base)_1, ULTIMATE.start_insertionSort_~i~0#1) = 1*v_rep(select #length ULTIMATE.start_insertionSort_~a#1.base)_1 - 2*ULTIMATE.start_insertionSort_~i~0#1 Supporting invariants [1*ULTIMATE.start_insertionSort_~a#1.offset >= 0] [2022-07-13 03:20:32,994 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-07-13 03:20:33,017 INFO L293 tatePredicateManager]: 4 out of 5 supporting invariants were superfluous and have been removed [2022-07-13 03:20:33,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:20:33,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:20:33,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 03:20:33,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:20:33,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:20:33,089 INFO L263 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-13 03:20:33,090 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:20:33,170 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 [2022-07-13 03:20:33,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:20:33,239 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 [2022-07-13 03:20:33,239 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) [2022-07-13 03:20:33,345 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. [2022-07-13 03:20:33,346 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 [2022-07-13 03:20:33,347 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) [2022-07-13 03:20:33,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2022-07-13 03:20:33,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 4 letters. Loop has 6 letters. [2022-07-13 03:20:33,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:20:33,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 10 letters. Loop has 6 letters. [2022-07-13 03:20:33,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:20:33,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 4 letters. Loop has 12 letters. [2022-07-13 03:20:33,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:20:33,351 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 41 transitions. [2022-07-13 03:20:33,353 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2022-07-13 03:20:33,354 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 29 states and 39 transitions. [2022-07-13 03:20:33,355 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2022-07-13 03:20:33,355 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2022-07-13 03:20:33,355 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 39 transitions. [2022-07-13 03:20:33,356 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-13 03:20:33,356 INFO L369 hiAutomatonCegarLoop]: Abstraction has 29 states and 39 transitions. [2022-07-13 03:20:33,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 39 transitions. [2022-07-13 03:20:33,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2022-07-13 03:20:33,359 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) [2022-07-13 03:20:33,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2022-07-13 03:20:33,361 INFO L392 hiAutomatonCegarLoop]: Abstraction has 28 states and 38 transitions. [2022-07-13 03:20:33,361 INFO L374 stractBuchiCegarLoop]: Abstraction has 28 states and 38 transitions. [2022-07-13 03:20:33,361 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-13 03:20:33,362 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 38 transitions. [2022-07-13 03:20:33,363 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2022-07-13 03:20:33,363 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:20:33,363 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:20:33,363 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-13 03:20:33,364 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-07-13 03:20:33,364 INFO L752 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 [2022-07-13 03:20:33,364 INFO L754 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 [2022-07-13 03:20:33,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:20:33,364 INFO L85 PathProgramCache]: Analyzing trace with hash 28695756, now seen corresponding path program 1 times [2022-07-13 03:20:33,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:20:33,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8093829] [2022-07-13 03:20:33,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:20:33,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:20:33,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:20:33,385 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:20:33,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:20:33,402 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:20:33,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:20:33,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1513658903, now seen corresponding path program 1 times [2022-07-13 03:20:33,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:20:33,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604495833] [2022-07-13 03:20:33,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:20:33,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:20:33,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:20:33,423 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:20:33,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:20:33,427 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:20:33,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:20:33,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1303016098, now seen corresponding path program 1 times [2022-07-13 03:20:33,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:20:33,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426201514] [2022-07-13 03:20:33,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:20:33,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:20:33,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:20:33,455 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:20:33,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:20:33,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426201514] [2022-07-13 03:20:33,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426201514] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:20:33,459 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:20:33,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 03:20:33,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419786383] [2022-07-13 03:20:33,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:20:33,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:20:33,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 03:20:33,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 03:20:33,538 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) [2022-07-13 03:20:33,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:20:33,570 INFO L93 Difference]: Finished difference Result 27 states and 35 transitions. [2022-07-13 03:20:33,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 03:20:33,571 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 35 transitions. [2022-07-13 03:20:33,571 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-07-13 03:20:33,572 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 35 transitions. [2022-07-13 03:20:33,572 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2022-07-13 03:20:33,572 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2022-07-13 03:20:33,572 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 35 transitions. [2022-07-13 03:20:33,572 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-13 03:20:33,573 INFO L369 hiAutomatonCegarLoop]: Abstraction has 27 states and 35 transitions. [2022-07-13 03:20:33,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 35 transitions. [2022-07-13 03:20:33,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 20. [2022-07-13 03:20:33,576 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) [2022-07-13 03:20:33,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2022-07-13 03:20:33,576 INFO L392 hiAutomatonCegarLoop]: Abstraction has 20 states and 26 transitions. [2022-07-13 03:20:33,576 INFO L374 stractBuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2022-07-13 03:20:33,577 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-13 03:20:33,577 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 26 transitions. [2022-07-13 03:20:33,579 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-07-13 03:20:33,579 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:20:33,579 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:20:33,580 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:20:33,580 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-07-13 03:20:33,580 INFO L752 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 [2022-07-13 03:20:33,580 INFO L754 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 [2022-07-13 03:20:33,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:20:33,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1806818415, now seen corresponding path program 1 times [2022-07-13 03:20:33,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:20:33,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896086082] [2022-07-13 03:20:33,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:20:33,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:20:33,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:20:33,599 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:20:33,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:20:33,613 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:20:33,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:20:33,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1910182, now seen corresponding path program 1 times [2022-07-13 03:20:33,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:20:33,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639063180] [2022-07-13 03:20:33,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:20:33,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:20:33,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:20:33,623 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:20:33,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:20:33,634 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:20:33,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:20:33,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1301224212, now seen corresponding path program 1 times [2022-07-13 03:20:33,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:20:33,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853445781] [2022-07-13 03:20:33,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:20:33,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:20:33,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:20:33,665 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:20:33,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:20:33,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853445781] [2022-07-13 03:20:33,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853445781] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 03:20:33,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [584162541] [2022-07-13 03:20:33,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:20:33,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 03:20:33,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:20:33,667 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 03:20:33,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-13 03:20:33,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:20:33,703 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-13 03:20:33,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:20:33,714 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:20:33,714 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 03:20:33,729 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:20:33,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [584162541] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 03:20:33,729 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 03:20:33,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2022-07-13 03:20:33,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999513843] [2022-07-13 03:20:33,730 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 03:20:33,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:20:33,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 03:20:33,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-13 03:20:33,866 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) [2022-07-13 03:20:33,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:20:33,927 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2022-07-13 03:20:33,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 03:20:33,927 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 49 transitions. [2022-07-13 03:20:33,928 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-07-13 03:20:33,929 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 34 states and 41 transitions. [2022-07-13 03:20:33,929 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2022-07-13 03:20:33,929 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2022-07-13 03:20:33,929 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 41 transitions. [2022-07-13 03:20:33,929 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-13 03:20:33,929 INFO L369 hiAutomatonCegarLoop]: Abstraction has 34 states and 41 transitions. [2022-07-13 03:20:33,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 41 transitions. [2022-07-13 03:20:33,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 25. [2022-07-13 03:20:33,931 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) [2022-07-13 03:20:33,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2022-07-13 03:20:33,931 INFO L392 hiAutomatonCegarLoop]: Abstraction has 25 states and 30 transitions. [2022-07-13 03:20:33,931 INFO L374 stractBuchiCegarLoop]: Abstraction has 25 states and 30 transitions. [2022-07-13 03:20:33,931 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-13 03:20:33,932 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 30 transitions. [2022-07-13 03:20:33,932 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-07-13 03:20:33,932 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:20:33,932 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:20:33,932 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:20:33,933 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-07-13 03:20:33,933 INFO L752 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 [2022-07-13 03:20:33,933 INFO L754 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 [2022-07-13 03:20:33,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:20:33,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1301169056, now seen corresponding path program 2 times [2022-07-13 03:20:33,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:20:33,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950530006] [2022-07-13 03:20:33,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:20:33,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:20:33,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:20:33,944 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:20:33,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:20:33,953 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:20:33,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:20:33,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1573222, now seen corresponding path program 2 times [2022-07-13 03:20:33,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:20:33,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807799837] [2022-07-13 03:20:33,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:20:33,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:20:33,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:20:33,959 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:20:33,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:20:33,963 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:20:33,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:20:33,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1886560891, now seen corresponding path program 1 times [2022-07-13 03:20:33,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:20:33,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092516394] [2022-07-13 03:20:33,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:20:33,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:20:33,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:20:33,976 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:20:33,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:20:33,989 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:20:34,319 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 03:20:34,320 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 03:20:34,320 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 03:20:34,320 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 03:20:34,320 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-13 03:20:34,320 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:20:34,320 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 03:20:34,320 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 03:20:34,320 INFO L133 ssoRankerPreferences]: Filename of dumped script: insertionsort-alloca-2.i_Iteration5_Lasso [2022-07-13 03:20:34,320 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 03:20:34,320 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 03:20:34,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:20:34,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:20:34,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:20:34,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:20:34,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:20:34,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:20:34,536 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:20:34,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:20:34,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:20:34,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:20:34,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:20:34,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:20:34,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:20:34,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:20:34,739 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 03:20:34,739 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-13 03:20:34,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:20:34,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:20:34,741 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:20:34,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-07-13 03:20:34,743 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:20:34,748 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:20:34,748 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:20:34,748 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:20:34,749 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:20:34,751 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:20:34,751 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:20:34,766 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:20:34,785 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-07-13 03:20:34,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:20:34,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:20:34,786 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) [2022-07-13 03:20:34,787 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 [2022-07-13 03:20:34,788 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:20:34,794 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:20:34,794 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:20:34,794 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:20:34,794 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:20:34,794 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:20:34,794 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:20:34,794 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:20:34,809 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:20:34,826 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 [2022-07-13 03:20:34,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:20:34,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:20:34,836 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) [2022-07-13 03:20:34,837 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 [2022-07-13 03:20:34,838 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:20:34,844 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:20:34,844 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:20:34,844 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:20:34,844 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:20:34,846 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:20:34,846 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:20:34,867 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:20:34,882 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 [2022-07-13 03:20:34,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:20:34,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:20:34,883 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) [2022-07-13 03:20:34,884 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 [2022-07-13 03:20:34,885 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:20:34,891 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:20:34,891 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:20:34,891 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:20:34,891 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:20:34,893 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:20:34,893 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:20:34,908 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:20:34,925 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 [2022-07-13 03:20:34,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:20:34,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:20:34,926 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) [2022-07-13 03:20:34,928 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 [2022-07-13 03:20:34,929 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:20:34,934 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:20:34,934 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:20:34,935 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:20:34,935 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:20:34,937 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:20:34,937 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:20:34,959 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:20:34,980 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 [2022-07-13 03:20:34,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:20:34,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:20:34,982 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) [2022-07-13 03:20:34,982 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 [2022-07-13 03:20:34,984 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:20:34,990 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:20:34,990 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:20:34,990 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:20:34,990 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:20:35,002 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:20:35,002 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:20:35,023 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-13 03:20:35,044 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2022-07-13 03:20:35,044 INFO L444 ModelExtractionUtils]: 21 out of 37 variables were initially zero. Simplification set additionally 14 variables to zero. [2022-07-13 03:20:35,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:20:35,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:20:35,076 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) [2022-07-13 03:20:35,077 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 [2022-07-13 03:20:35,077 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-13 03:20:35,083 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-13 03:20:35,084 INFO L513 LassoAnalysis]: Proved termination. [2022-07-13 03:20:35,084 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 [] [2022-07-13 03:20:35,101 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 [2022-07-13 03:20:35,118 INFO L293 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2022-07-13 03:20:35,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:20:35,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:20:35,145 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 03:20:35,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:20:35,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:20:35,167 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-13 03:20:35,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:20:35,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:20:35,198 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 [2022-07-13 03:20:35,199 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) [2022-07-13 03:20:35,222 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. [2022-07-13 03:20:35,223 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 [2022-07-13 03:20:35,223 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) [2022-07-13 03:20:35,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 17 transitions. [2022-07-13 03:20:35,224 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 11 letters. Loop has 4 letters. [2022-07-13 03:20:35,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:20:35,224 INFO L577 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-07-13 03:20:35,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:20:35,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:20:35,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 03:20:35,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:20:35,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:20:35,259 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-13 03:20:35,260 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:20:35,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:20:35,289 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 [2022-07-13 03:20:35,289 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) [2022-07-13 03:20:35,308 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. [2022-07-13 03:20:35,308 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 [2022-07-13 03:20:35,309 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) [2022-07-13 03:20:35,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 17 transitions. [2022-07-13 03:20:35,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 11 letters. Loop has 4 letters. [2022-07-13 03:20:35,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:20:35,309 INFO L577 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-07-13 03:20:35,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:20:35,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:20:35,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 03:20:35,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:20:35,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:20:35,365 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-13 03:20:35,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:20:35,378 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 [2022-07-13 03:20:35,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:20:35,395 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 [2022-07-13 03:20:35,395 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) [2022-07-13 03:20:35,417 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. [2022-07-13 03:20:35,417 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 [2022-07-13 03:20:35,417 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) [2022-07-13 03:20:35,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2022-07-13 03:20:35,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 11 letters. Loop has 4 letters. [2022-07-13 03:20:35,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:20:35,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 15 letters. Loop has 4 letters. [2022-07-13 03:20:35,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:20:35,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 11 letters. Loop has 8 letters. [2022-07-13 03:20:35,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:20:35,419 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 57 transitions. [2022-07-13 03:20:35,419 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-13 03:20:35,420 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 0 states and 0 transitions. [2022-07-13 03:20:35,420 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-07-13 03:20:35,420 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-07-13 03:20:35,420 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-07-13 03:20:35,420 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:20:35,420 INFO L369 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-13 03:20:35,420 INFO L392 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-13 03:20:35,420 INFO L374 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-13 03:20:35,420 INFO L287 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-13 03:20:35,420 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-07-13 03:20:35,421 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-13 03:20:35,421 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-07-13 03:20:35,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 13.07 03:20:35 BoogieIcfgContainer [2022-07-13 03:20:35,425 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-13 03:20:35,425 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 03:20:35,426 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 03:20:35,426 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 03:20:35,426 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:20:31" (3/4) ... [2022-07-13 03:20:35,428 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-13 03:20:35,428 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 03:20:35,428 INFO L158 Benchmark]: Toolchain (without parser) took 4877.59ms. Allocated memory was 96.5MB in the beginning and 148.9MB in the end (delta: 52.4MB). Free memory was 67.5MB in the beginning and 112.5MB in the end (delta: -45.0MB). Peak memory consumption was 7.2MB. Max. memory is 16.1GB. [2022-07-13 03:20:35,428 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 96.5MB. Free memory was 52.8MB in the beginning and 52.8MB in the end (delta: 42.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 03:20:35,429 INFO L158 Benchmark]: CACSL2BoogieTranslator took 276.94ms. Allocated memory is still 96.5MB. Free memory was 67.3MB in the beginning and 65.9MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-13 03:20:35,429 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.77ms. Allocated memory is still 96.5MB. Free memory was 65.9MB in the beginning and 64.0MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 03:20:35,429 INFO L158 Benchmark]: Boogie Preprocessor took 37.39ms. Allocated memory is still 96.5MB. Free memory was 64.0MB in the beginning and 62.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 03:20:35,429 INFO L158 Benchmark]: RCFGBuilder took 183.87ms. Allocated memory is still 96.5MB. Free memory was 62.9MB in the beginning and 52.8MB in the end (delta: 10.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-13 03:20:35,430 INFO L158 Benchmark]: BuchiAutomizer took 4336.29ms. Allocated memory was 96.5MB in the beginning and 148.9MB in the end (delta: 52.4MB). Free memory was 52.8MB in the beginning and 112.5MB in the end (delta: -59.7MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 03:20:35,430 INFO L158 Benchmark]: Witness Printer took 2.27ms. Allocated memory is still 148.9MB. Free memory is still 112.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 03:20:35,431 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.16ms. Allocated memory is still 96.5MB. Free memory was 52.8MB in the beginning and 52.8MB in the end (delta: 42.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 276.94ms. Allocated memory is still 96.5MB. Free memory was 67.3MB in the beginning and 65.9MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.77ms. Allocated memory is still 96.5MB. Free memory was 65.9MB in the beginning and 64.0MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.39ms. Allocated memory is still 96.5MB. Free memory was 64.0MB in the beginning and 62.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 183.87ms. Allocated memory is still 96.5MB. Free memory was 62.9MB in the beginning and 52.8MB in the end (delta: 10.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 4336.29ms. Allocated memory was 96.5MB in the beginning and 148.9MB in the end (delta: 52.4MB). Free memory was 52.8MB in the beginning and 112.5MB in the end (delta: -59.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.27ms. Allocated memory is still 148.9MB. Free memory is still 112.5MB. 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 unknown-#length-unknown[a] + -2 * i 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 4.3s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 3.4s. Construction of modules took 0.1s. Büchi inclusion checks took 0.6s. 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 -1 states and ocurred in iteration -1. Nontrivial modules had stage [1, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 102 SdHoareTripleChecker+Valid, 0.1s 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: inital176 mio100 ax110 hnf100 lsp87 ukn69 mio100 lsp61 div100 bol100 ite100 ukn100 eq179 hnf90 smp100 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 26ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-07-13 03:20:35,451 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-13 03:20:35,668 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