./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 f4b24e32 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-?-f4b24e3 [2022-07-14 15:01:19,739 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 15:01:19,741 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 15:01:19,797 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 15:01:19,798 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 15:01:19,798 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 15:01:19,802 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 15:01:19,804 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 15:01:19,805 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 15:01:19,807 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 15:01:19,808 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 15:01:19,810 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 15:01:19,810 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 15:01:19,814 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 15:01:19,814 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 15:01:19,816 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 15:01:19,818 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 15:01:19,819 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 15:01:19,820 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 15:01:19,821 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 15:01:19,824 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 15:01:19,826 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 15:01:19,826 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 15:01:19,827 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 15:01:19,827 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 15:01:19,830 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 15:01:19,831 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 15:01:19,831 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 15:01:19,832 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 15:01:19,832 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 15:01:19,833 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 15:01:19,833 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 15:01:19,835 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 15:01:19,835 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 15:01:19,836 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 15:01:19,836 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 15:01:19,837 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 15:01:19,837 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 15:01:19,837 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 15:01:19,837 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 15:01:19,838 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 15:01:19,839 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 15:01:19,841 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-07-14 15:01:19,862 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 15:01:19,864 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 15:01:19,864 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 15:01:19,864 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 15:01:19,865 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 15:01:19,865 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 15:01:19,866 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 15:01:19,866 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-14 15:01:19,866 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-14 15:01:19,866 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-14 15:01:19,867 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-14 15:01:19,867 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-14 15:01:19,867 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-14 15:01:19,867 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 15:01:19,867 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 15:01:19,868 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 15:01:19,868 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 15:01:19,868 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-14 15:01:19,869 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-14 15:01:19,869 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-14 15:01:19,869 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-14 15:01:19,869 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-14 15:01:19,869 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 15:01:19,869 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-14 15:01:19,870 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 15:01:19,870 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 15:01:19,870 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 15:01:19,870 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 15:01:19,871 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-14 15:01:19,871 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-14 15:01:20,026 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 15:01:20,049 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 15:01:20,050 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 15:01:20,051 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 15:01:20,051 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 15:01:20,052 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-14 15:01:20,100 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bd7ffac7/ed634e89e21b48da9f006a6ff543f4e4/FLAG8f6373bf8 [2022-07-14 15:01:20,479 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 15:01:20,487 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/insertionsort-alloca-2.i [2022-07-14 15:01:20,495 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bd7ffac7/ed634e89e21b48da9f006a6ff543f4e4/FLAG8f6373bf8 [2022-07-14 15:01:20,504 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bd7ffac7/ed634e89e21b48da9f006a6ff543f4e4 [2022-07-14 15:01:20,506 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 15:01:20,507 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 15:01:20,511 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 15:01:20,511 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 15:01:20,513 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 15:01:20,513 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 03:01:20" (1/1) ... [2022-07-14 15:01:20,514 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34d58aaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:01:20, skipping insertion in model container [2022-07-14 15:01:20,515 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 03:01:20" (1/1) ... [2022-07-14 15:01:20,519 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 15:01:20,542 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 15:01:20,725 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 15:01:20,730 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 15:01:20,774 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 15:01:20,791 INFO L208 MainTranslator]: Completed translation [2022-07-14 15:01:20,795 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:01:20 WrapperNode [2022-07-14 15:01:20,795 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 15:01:20,796 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 15:01:20,797 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 15:01:20,797 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 15:01:20,802 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:01:20" (1/1) ... [2022-07-14 15:01:20,813 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:01:20" (1/1) ... [2022-07-14 15:01:20,835 INFO L137 Inliner]: procedures = 111, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 54 [2022-07-14 15:01:20,836 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 15:01:20,836 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 15:01:20,836 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 15:01:20,837 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 15:01:20,842 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:01:20" (1/1) ... [2022-07-14 15:01:20,842 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:01:20" (1/1) ... [2022-07-14 15:01:20,849 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:01:20" (1/1) ... [2022-07-14 15:01:20,857 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:01:20" (1/1) ... [2022-07-14 15:01:20,860 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:01:20" (1/1) ... [2022-07-14 15:01:20,871 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:01:20" (1/1) ... [2022-07-14 15:01:20,872 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:01:20" (1/1) ... [2022-07-14 15:01:20,873 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 15:01:20,874 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 15:01:20,874 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 15:01:20,874 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 15:01:20,875 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:01:20" (1/1) ... [2022-07-14 15:01:20,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:01:20,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:01:20,898 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-14 15:01:20,916 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-14 15:01:20,929 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-14 15:01:20,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-14 15:01:20,929 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-14 15:01:20,930 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 15:01:20,930 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 15:01:20,930 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 15:01:21,028 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 15:01:21,030 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 15:01:21,113 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 15:01:21,118 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 15:01:21,118 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-14 15:01:21,119 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 03:01:21 BoogieIcfgContainer [2022-07-14 15:01:21,119 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 15:01:21,120 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-14 15:01:21,120 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-14 15:01:21,132 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-14 15:01:21,133 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 15:01:21,133 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.07 03:01:20" (1/3) ... [2022-07-14 15:01:21,134 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7ec62752 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.07 03:01:21, skipping insertion in model container [2022-07-14 15:01:21,134 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 15:01:21,135 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:01:20" (2/3) ... [2022-07-14 15:01:21,135 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7ec62752 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.07 03:01:21, skipping insertion in model container [2022-07-14 15:01:21,135 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 15:01:21,135 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 03:01:21" (3/3) ... [2022-07-14 15:01:21,136 INFO L354 chiAutomizerObserver]: Analyzing ICFG insertionsort-alloca-2.i [2022-07-14 15:01:21,198 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-14 15:01:21,199 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-14 15:01:21,199 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-14 15:01:21,199 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-14 15:01:21,199 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-14 15:01:21,199 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-14 15:01:21,199 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-14 15:01:21,199 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-14 15:01:21,212 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-14 15:01:21,249 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-07-14 15:01:21,249 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:01:21,249 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:01:21,253 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-14 15:01:21,253 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-07-14 15:01:21,254 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-14 15:01:21,254 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-14 15:01:21,255 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-07-14 15:01:21,255 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:01:21,255 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:01:21,255 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-14 15:01:21,255 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-07-14 15:01:21,260 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-14 15:01:21,261 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-14 15:01:21,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:01:21,275 INFO L85 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2022-07-14 15:01:21,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:01:21,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014914429] [2022-07-14 15:01:21,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:01:21,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:01:21,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:01:21,378 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:01:21,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:01:21,420 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:01:21,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:01:21,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1465782, now seen corresponding path program 1 times [2022-07-14 15:01:21,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:01:21,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947871836] [2022-07-14 15:01:21,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:01:21,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:01:21,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:01:21,468 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-14 15:01:21,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:01:21,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947871836] [2022-07-14 15:01:21,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947871836] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 15:01:21,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 15:01:21,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 15:01:21,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150028071] [2022-07-14 15:01:21,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 15:01:21,473 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 15:01:21,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:01:21,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-14 15:01:21,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-14 15:01:21,500 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-14 15:01:21,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:01:21,505 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2022-07-14 15:01:21,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-14 15:01:21,509 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 18 transitions. [2022-07-14 15:01:21,512 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-07-14 15:01:21,514 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 11 states and 14 transitions. [2022-07-14 15:01:21,515 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2022-07-14 15:01:21,515 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2022-07-14 15:01:21,515 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2022-07-14 15:01:21,516 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:01:21,516 INFO L369 hiAutomatonCegarLoop]: Abstraction has 11 states and 14 transitions. [2022-07-14 15:01:21,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2022-07-14 15:01:21,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2022-07-14 15:01:21,531 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-14 15:01:21,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2022-07-14 15:01:21,535 INFO L392 hiAutomatonCegarLoop]: Abstraction has 11 states and 14 transitions. [2022-07-14 15:01:21,535 INFO L374 stractBuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2022-07-14 15:01:21,535 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-14 15:01:21,535 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2022-07-14 15:01:21,536 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-07-14 15:01:21,536 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:01:21,536 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:01:21,537 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-14 15:01:21,537 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-07-14 15:01:21,537 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-14 15:01:21,537 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-14 15:01:21,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:01:21,538 INFO L85 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2022-07-14 15:01:21,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:01:21,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174759934] [2022-07-14 15:01:21,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:01:21,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:01:21,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:01:21,555 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:01:21,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:01:21,566 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:01:21,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:01:21,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1394338221, now seen corresponding path program 1 times [2022-07-14 15:01:21,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:01:21,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289503802] [2022-07-14 15:01:21,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:01:21,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:01:21,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:01:21,587 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:01:21,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:01:21,599 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:01:21,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:01:21,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1897689455, now seen corresponding path program 1 times [2022-07-14 15:01:21,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:01:21,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436865289] [2022-07-14 15:01:21,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:01:21,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:01:21,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:01:21,630 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:01:21,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:01:21,656 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:01:22,016 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 15:01:22,017 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 15:01:22,017 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 15:01:22,017 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 15:01:22,017 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-14 15:01:22,018 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:01:22,018 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 15:01:22,018 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 15:01:22,018 INFO L133 ssoRankerPreferences]: Filename of dumped script: insertionsort-alloca-2.i_Iteration2_Lasso [2022-07-14 15:01:22,018 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 15:01:22,018 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 15:01:22,033 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-14 15:01:22,039 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-14 15:01:22,045 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-14 15:01:22,048 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-14 15:01:22,050 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-14 15:01:22,053 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-14 15:01:22,252 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-14 15:01:22,254 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-14 15:01:22,255 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-14 15:01:22,257 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-14 15:01:22,259 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-14 15:01:22,261 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-14 15:01:22,263 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-14 15:01:22,264 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-14 15:01:22,477 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 15:01:22,480 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-14 15:01:22,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:01:22,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:01:22,482 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-14 15:01:22,484 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-14 15:01:22,491 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:01:22,491 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:01:22,491 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:01:22,491 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:01:22,491 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:01:22,492 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-14 15:01:22,498 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:01:22,498 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:01:22,514 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:01:22,531 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-07-14 15:01:22,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:01:22,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:01:22,533 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-14 15:01:22,534 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-14 15:01:22,535 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-14 15:01:22,541 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:01:22,542 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:01:22,542 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:01:22,542 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:01:22,545 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:01:22,545 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:01:22,551 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:01:22,568 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-07-14 15:01:22,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:01:22,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:01:22,574 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-14 15:01:22,575 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-14 15:01:22,576 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-14 15:01:22,582 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:01:22,582 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:01:22,582 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:01:22,582 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:01:22,585 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:01:22,585 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:01:22,597 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:01:22,613 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-07-14 15:01:22,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:01:22,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:01:22,614 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-14 15:01:22,615 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-14 15:01:22,616 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-14 15:01:22,622 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:01:22,622 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:01:22,622 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:01:22,622 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:01:22,622 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:01:22,623 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:01:22,623 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:01:22,624 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:01:22,638 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-07-14 15:01:22,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:01:22,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:01:22,640 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-14 15:01:22,640 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-14 15:01:22,645 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-14 15:01:22,651 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:01:22,651 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:01:22,651 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:01:22,651 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:01:22,656 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:01:22,656 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:01:22,668 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:01:22,684 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-14 15:01:22,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:01:22,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:01:22,687 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-14 15:01:22,688 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-14 15:01:22,690 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-14 15:01:22,696 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:01:22,696 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:01:22,696 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:01:22,696 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:01:22,699 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:01:22,700 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:01:22,710 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:01:22,728 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-14 15:01:22,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:01:22,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:01:22,729 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-14 15:01:22,730 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-14 15:01:22,732 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-14 15:01:22,738 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:01:22,738 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:01:22,739 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:01:22,739 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:01:22,741 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:01:22,742 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:01:22,764 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:01:22,780 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-14 15:01:22,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:01:22,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:01:22,781 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-14 15:01:22,781 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-14 15:01:22,783 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-14 15:01:22,789 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:01:22,789 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:01:22,789 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:01:22,789 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:01:22,789 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:01:22,790 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:01:22,790 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:01:22,799 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:01:22,815 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2022-07-14 15:01:22,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:01:22,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:01:22,817 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-14 15:01:22,818 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-14 15:01:22,819 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-14 15:01:22,825 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:01:22,825 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:01:22,825 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:01:22,825 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:01:22,833 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:01:22,833 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:01:22,849 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-14 15:01:22,887 INFO L443 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver. [2022-07-14 15:01:22,887 INFO L444 ModelExtractionUtils]: 24 out of 37 variables were initially zero. Simplification set additionally 9 variables to zero. [2022-07-14 15:01:22,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:01:22,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:01:22,890 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-14 15:01:22,891 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-14 15:01:22,892 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-14 15:01:22,919 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2022-07-14 15:01:22,920 INFO L513 LassoAnalysis]: Proved termination. [2022-07-14 15:01:22,920 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-14 15:01:22,938 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-14 15:01:22,960 INFO L293 tatePredicateManager]: 4 out of 5 supporting invariants were superfluous and have been removed [2022-07-14 15:01:22,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:01:23,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:01:23,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-14 15:01:23,016 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:01:23,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:01:23,038 INFO L263 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-14 15:01:23,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:01:23,151 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-14 15:01:23,153 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-14 15:01:23,154 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-14 15:01:23,258 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 4. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 31 states and 41 transitions. Complement of second has 10 states. [2022-07-14 15:01:23,258 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-14 15:01:23,259 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-14 15:01:23,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2022-07-14 15:01:23,260 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 4 letters. Loop has 6 letters. [2022-07-14 15:01:23,261 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:01:23,261 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 10 letters. Loop has 6 letters. [2022-07-14 15:01:23,261 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:01:23,261 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 4 letters. Loop has 12 letters. [2022-07-14 15:01:23,262 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:01:23,262 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 41 transitions. [2022-07-14 15:01:23,263 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2022-07-14 15:01:23,263 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 29 states and 39 transitions. [2022-07-14 15:01:23,263 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2022-07-14 15:01:23,263 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2022-07-14 15:01:23,263 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 39 transitions. [2022-07-14 15:01:23,264 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 15:01:23,264 INFO L369 hiAutomatonCegarLoop]: Abstraction has 29 states and 39 transitions. [2022-07-14 15:01:23,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 39 transitions. [2022-07-14 15:01:23,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2022-07-14 15:01:23,265 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-14 15:01:23,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2022-07-14 15:01:23,266 INFO L392 hiAutomatonCegarLoop]: Abstraction has 28 states and 38 transitions. [2022-07-14 15:01:23,266 INFO L374 stractBuchiCegarLoop]: Abstraction has 28 states and 38 transitions. [2022-07-14 15:01:23,266 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-14 15:01:23,266 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 38 transitions. [2022-07-14 15:01:23,267 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2022-07-14 15:01:23,267 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:01:23,267 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:01:23,267 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-14 15:01:23,267 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-07-14 15:01:23,267 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-14 15:01:23,267 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-14 15:01:23,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:01:23,268 INFO L85 PathProgramCache]: Analyzing trace with hash 28695756, now seen corresponding path program 1 times [2022-07-14 15:01:23,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:01:23,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818222650] [2022-07-14 15:01:23,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:01:23,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:01:23,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:01:23,289 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:01:23,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:01:23,299 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:01:23,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:01:23,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1513658903, now seen corresponding path program 1 times [2022-07-14 15:01:23,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:01:23,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574765944] [2022-07-14 15:01:23,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:01:23,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:01:23,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:01:23,312 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:01:23,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:01:23,319 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:01:23,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:01:23,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1303016098, now seen corresponding path program 1 times [2022-07-14 15:01:23,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:01:23,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823000017] [2022-07-14 15:01:23,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:01:23,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:01:23,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:01:23,360 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-14 15:01:23,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:01:23,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823000017] [2022-07-14 15:01:23,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823000017] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 15:01:23,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 15:01:23,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 15:01:23,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657049852] [2022-07-14 15:01:23,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 15:01:23,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:01:23,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 15:01:23,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 15:01:23,453 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-14 15:01:23,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:01:23,493 INFO L93 Difference]: Finished difference Result 27 states and 35 transitions. [2022-07-14 15:01:23,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 15:01:23,495 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 35 transitions. [2022-07-14 15:01:23,501 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-07-14 15:01:23,502 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 35 transitions. [2022-07-14 15:01:23,502 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2022-07-14 15:01:23,503 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2022-07-14 15:01:23,503 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 35 transitions. [2022-07-14 15:01:23,503 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 15:01:23,503 INFO L369 hiAutomatonCegarLoop]: Abstraction has 27 states and 35 transitions. [2022-07-14 15:01:23,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 35 transitions. [2022-07-14 15:01:23,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 20. [2022-07-14 15:01:23,507 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-14 15:01:23,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2022-07-14 15:01:23,507 INFO L392 hiAutomatonCegarLoop]: Abstraction has 20 states and 26 transitions. [2022-07-14 15:01:23,507 INFO L374 stractBuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2022-07-14 15:01:23,508 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-14 15:01:23,508 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 26 transitions. [2022-07-14 15:01:23,510 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-07-14 15:01:23,510 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:01:23,511 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:01:23,511 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:01:23,511 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-07-14 15:01:23,511 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-14 15:01:23,511 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-14 15:01:23,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:01:23,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1806818415, now seen corresponding path program 1 times [2022-07-14 15:01:23,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:01:23,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554046028] [2022-07-14 15:01:23,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:01:23,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:01:23,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:01:23,532 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:01:23,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:01:23,544 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:01:23,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:01:23,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1910182, now seen corresponding path program 1 times [2022-07-14 15:01:23,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:01:23,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355565063] [2022-07-14 15:01:23,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:01:23,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:01:23,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:01:23,559 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:01:23,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:01:23,569 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:01:23,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:01:23,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1301224212, now seen corresponding path program 1 times [2022-07-14 15:01:23,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:01:23,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792258104] [2022-07-14 15:01:23,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:01:23,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:01:23,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:01:23,636 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-14 15:01:23,640 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-14 15:01:23,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:01:23,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792258104] [2022-07-14 15:01:23,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792258104] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 15:01:23,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [566289158] [2022-07-14 15:01:23,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:01:23,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 15:01:23,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:01:23,641 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-14 15:01:23,642 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-14 15:01:23,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:01:23,688 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-14 15:01:23,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:01:23,701 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-14 15:01:23,701 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 15:01:23,719 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-14 15:01:23,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [566289158] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 15:01:23,719 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 15:01:23,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2022-07-14 15:01:23,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073949832] [2022-07-14 15:01:23,720 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 15:01:23,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:01:23,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 15:01:23,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-14 15:01:23,833 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-14 15:01:23,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:01:23,913 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2022-07-14 15:01:23,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 15:01:23,913 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 49 transitions. [2022-07-14 15:01:23,916 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-07-14 15:01:23,917 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 34 states and 41 transitions. [2022-07-14 15:01:23,917 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2022-07-14 15:01:23,917 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2022-07-14 15:01:23,917 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 41 transitions. [2022-07-14 15:01:23,919 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 15:01:23,919 INFO L369 hiAutomatonCegarLoop]: Abstraction has 34 states and 41 transitions. [2022-07-14 15:01:23,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 41 transitions. [2022-07-14 15:01:23,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 25. [2022-07-14 15:01:23,922 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-14 15:01:23,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2022-07-14 15:01:23,923 INFO L392 hiAutomatonCegarLoop]: Abstraction has 25 states and 30 transitions. [2022-07-14 15:01:23,923 INFO L374 stractBuchiCegarLoop]: Abstraction has 25 states and 30 transitions. [2022-07-14 15:01:23,923 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-14 15:01:23,923 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 30 transitions. [2022-07-14 15:01:23,924 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-07-14 15:01:23,924 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:01:23,924 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:01:23,924 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:01:23,924 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-07-14 15:01:23,925 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-14 15:01:23,925 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-14 15:01:23,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:01:23,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1301169056, now seen corresponding path program 2 times [2022-07-14 15:01:23,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:01:23,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436903686] [2022-07-14 15:01:23,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:01:23,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:01:23,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:01:23,953 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:01:23,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:01:23,961 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:01:23,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:01:23,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1573222, now seen corresponding path program 2 times [2022-07-14 15:01:23,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:01:23,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262028864] [2022-07-14 15:01:23,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:01:23,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:01:23,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:01:23,967 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:01:23,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:01:23,969 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:01:23,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:01:23,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1886560891, now seen corresponding path program 1 times [2022-07-14 15:01:23,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:01:23,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845578049] [2022-07-14 15:01:23,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:01:23,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:01:23,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:01:23,980 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:01:23,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:01:24,000 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:01:24,316 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 15:01:24,316 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 15:01:24,317 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 15:01:24,317 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 15:01:24,317 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-14 15:01:24,317 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:01:24,317 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 15:01:24,317 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 15:01:24,317 INFO L133 ssoRankerPreferences]: Filename of dumped script: insertionsort-alloca-2.i_Iteration5_Lasso [2022-07-14 15:01:24,317 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 15:01:24,317 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 15:01:24,319 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-14 15:01:24,520 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-14 15:01:24,522 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-14 15:01:24,523 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-14 15:01:24,525 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-14 15:01:24,526 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-14 15:01:24,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-14 15:01:24,529 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-14 15:01:24,531 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-14 15:01:24,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-14 15:01:24,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-14 15:01:24,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-14 15:01:24,537 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-14 15:01:24,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-14 15:01:24,739 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 15:01:24,740 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-14 15:01:24,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:01:24,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:01:24,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-14 15:01:24,742 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-14 15:01:24,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-14 15:01:24,749 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:01:24,749 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:01:24,749 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:01:24,749 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:01:24,751 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:01:24,751 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:01:24,767 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:01:24,782 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-14 15:01:24,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:01:24,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:01:24,784 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-14 15:01:24,785 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-14 15:01:24,786 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-14 15:01:24,791 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:01:24,791 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:01:24,792 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:01:24,792 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:01:24,792 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:01:24,792 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:01:24,792 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:01:24,807 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:01:24,827 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-14 15:01:24,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:01:24,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:01:24,828 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-14 15:01:24,829 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-14 15:01:24,860 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-14 15:01:24,865 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:01:24,865 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:01:24,865 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:01:24,865 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:01:24,869 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:01:24,869 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:01:24,882 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:01:24,897 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-14 15:01:24,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:01:24,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:01:24,898 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-14 15:01:24,899 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-14 15:01:24,900 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-14 15:01:24,906 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:01:24,906 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:01:24,906 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:01:24,906 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:01:24,907 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:01:24,907 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:01:24,915 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:01:24,929 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-14 15:01:24,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:01:24,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:01:24,930 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-14 15:01:24,931 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-14 15:01:24,932 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-14 15:01:24,938 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:01:24,938 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:01:24,938 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:01:24,938 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:01:24,941 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:01:24,941 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:01:24,953 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:01:24,970 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-14 15:01:24,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:01:24,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:01:24,972 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-14 15:01:24,973 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-14 15:01:24,975 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-14 15:01:24,980 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:01:24,981 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:01:24,981 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:01:24,981 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:01:24,987 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:01:24,987 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:01:25,003 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-14 15:01:25,027 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2022-07-14 15:01:25,027 INFO L444 ModelExtractionUtils]: 21 out of 37 variables were initially zero. Simplification set additionally 14 variables to zero. [2022-07-14 15:01:25,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:01:25,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:01:25,029 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-14 15:01:25,030 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-14 15:01:25,031 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-14 15:01:25,052 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-14 15:01:25,052 INFO L513 LassoAnalysis]: Proved termination. [2022-07-14 15:01:25,052 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-14 15:01:25,073 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-14 15:01:25,084 INFO L293 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2022-07-14 15:01:25,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:01:25,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:01:25,101 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 15:01:25,101 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:01:25,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:01:25,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-14 15:01:25,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:01:25,146 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-14 15:01:25,147 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-14 15:01:25,147 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-14 15:01:25,180 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-14 15:01:25,181 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-14 15:01:25,182 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-14 15:01:25,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 17 transitions. [2022-07-14 15:01:25,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 11 letters. Loop has 4 letters. [2022-07-14 15:01:25,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:01:25,183 INFO L577 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-07-14 15:01:25,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:01:25,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:01:25,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 15:01:25,203 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:01:25,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:01:25,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-14 15:01:25,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:01:25,246 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-14 15:01:25,247 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-14 15:01:25,247 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-14 15:01:25,267 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-14 15:01:25,267 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-14 15:01:25,268 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-14 15:01:25,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 17 transitions. [2022-07-14 15:01:25,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 11 letters. Loop has 4 letters. [2022-07-14 15:01:25,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:01:25,268 INFO L577 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-07-14 15:01:25,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:01:25,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:01:25,286 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 15:01:25,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:01:25,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:01:25,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-14 15:01:25,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:01:25,330 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-14 15:01:25,331 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-14 15:01:25,331 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-14 15:01:25,350 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-14 15:01:25,355 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-14 15:01:25,357 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-14 15:01:25,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2022-07-14 15:01:25,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 11 letters. Loop has 4 letters. [2022-07-14 15:01:25,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:01:25,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 15 letters. Loop has 4 letters. [2022-07-14 15:01:25,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:01:25,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 11 letters. Loop has 8 letters. [2022-07-14 15:01:25,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:01:25,360 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 57 transitions. [2022-07-14 15:01:25,364 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-14 15:01:25,364 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 0 states and 0 transitions. [2022-07-14 15:01:25,365 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-07-14 15:01:25,365 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-07-14 15:01:25,365 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-07-14 15:01:25,365 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:01:25,365 INFO L369 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-14 15:01:25,365 INFO L392 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-14 15:01:25,365 INFO L374 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-14 15:01:25,365 INFO L287 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-14 15:01:25,365 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-07-14 15:01:25,365 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-14 15:01:25,365 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-07-14 15:01:25,369 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.07 03:01:25 BoogieIcfgContainer [2022-07-14 15:01:25,369 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-14 15:01:25,370 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-14 15:01:25,370 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-14 15:01:25,370 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-14 15:01:25,370 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 03:01:21" (3/4) ... [2022-07-14 15:01:25,372 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-14 15:01:25,372 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-14 15:01:25,372 INFO L158 Benchmark]: Toolchain (without parser) took 4865.05ms. Allocated memory was 104.9MB in the beginning and 167.8MB in the end (delta: 62.9MB). Free memory was 76.2MB in the beginning and 60.4MB in the end (delta: 15.9MB). Peak memory consumption was 78.6MB. Max. memory is 16.1GB. [2022-07-14 15:01:25,373 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 104.9MB. Free memory was 62.1MB in the beginning and 62.0MB in the end (delta: 49.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 15:01:25,373 INFO L158 Benchmark]: CACSL2BoogieTranslator took 284.88ms. Allocated memory was 104.9MB in the beginning and 136.3MB in the end (delta: 31.5MB). Free memory was 76.2MB in the beginning and 105.5MB in the end (delta: -29.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-14 15:01:25,373 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.50ms. Allocated memory is still 136.3MB. Free memory was 105.5MB in the beginning and 103.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 15:01:25,373 INFO L158 Benchmark]: Boogie Preprocessor took 36.72ms. Allocated memory is still 136.3MB. Free memory was 103.9MB in the beginning and 102.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 15:01:25,374 INFO L158 Benchmark]: RCFGBuilder took 245.76ms. Allocated memory is still 136.3MB. Free memory was 102.3MB in the beginning and 92.2MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-14 15:01:25,374 INFO L158 Benchmark]: BuchiAutomizer took 4249.57ms. Allocated memory was 136.3MB in the beginning and 167.8MB in the end (delta: 31.5MB). Free memory was 91.7MB in the beginning and 60.4MB in the end (delta: 31.3MB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. [2022-07-14 15:01:25,374 INFO L158 Benchmark]: Witness Printer took 2.10ms. Allocated memory is still 167.8MB. Free memory is still 60.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 15:01:25,375 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 104.9MB. Free memory was 62.1MB in the beginning and 62.0MB in the end (delta: 49.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 284.88ms. Allocated memory was 104.9MB in the beginning and 136.3MB in the end (delta: 31.5MB). Free memory was 76.2MB in the beginning and 105.5MB in the end (delta: -29.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.50ms. Allocated memory is still 136.3MB. Free memory was 105.5MB in the beginning and 103.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.72ms. Allocated memory is still 136.3MB. Free memory was 103.9MB in the beginning and 102.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 245.76ms. Allocated memory is still 136.3MB. Free memory was 102.3MB in the beginning and 92.2MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 4249.57ms. Allocated memory was 136.3MB in the beginning and 167.8MB in the end (delta: 31.5MB). Free memory was 91.7MB in the beginning and 60.4MB in the end (delta: 31.3MB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. * Witness Printer took 2.10ms. Allocated memory is still 167.8MB. Free memory is still 60.4MB. 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.1s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 3.3s. 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.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 99 mSDsluCounter, 126 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 51 mSDsCounter, 40 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 169 IncrementalHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 40 mSolverCounterUnsat, 75 mSDtfsCounter, 169 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: 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: 18ms 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-14 15:01:25,406 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-14 15:01:25,616 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-14 15:01:25,815 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE