./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/loop-invgen/heapsort.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 35987657 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/loop-invgen/heapsort.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-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 32bit --witnessprinter.graph.data.programhash 8e7c8e5dc2a9e8f11b25d1bb9948f05f37b9553e3dc9f8bd8213088dea43cb37 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-22 02:20:29,946 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 02:20:29,949 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 02:20:29,993 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 02:20:29,993 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 02:20:29,995 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 02:20:30,000 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 02:20:30,003 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 02:20:30,005 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 02:20:30,010 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 02:20:30,012 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 02:20:30,017 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 02:20:30,017 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 02:20:30,019 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 02:20:30,020 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 02:20:30,023 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 02:20:30,024 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 02:20:30,026 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 02:20:30,028 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 02:20:30,033 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 02:20:30,035 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 02:20:30,036 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 02:20:30,037 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 02:20:30,038 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 02:20:30,040 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 02:20:30,047 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 02:20:30,047 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 02:20:30,048 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 02:20:30,049 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 02:20:30,049 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 02:20:30,051 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 02:20:30,051 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 02:20:30,052 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 02:20:30,053 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 02:20:30,055 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 02:20:30,056 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 02:20:30,056 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 02:20:30,056 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 02:20:30,057 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 02:20:30,057 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 02:20:30,058 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 02:20:30,059 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 02:20:30,068 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-07-22 02:20:30,116 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 02:20:30,117 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 02:20:30,118 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 02:20:30,118 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 02:20:30,119 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 02:20:30,119 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 02:20:30,120 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 02:20:30,120 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-22 02:20:30,120 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-22 02:20:30,121 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-22 02:20:30,121 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-22 02:20:30,122 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-22 02:20:30,122 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-22 02:20:30,122 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 02:20:30,122 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 02:20:30,122 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-22 02:20:30,123 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 02:20:30,123 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 02:20:30,123 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 02:20:30,123 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-22 02:20:30,124 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-22 02:20:30,124 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-22 02:20:30,124 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 02:20:30,124 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 02:20:30,124 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-22 02:20:30,125 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 02:20:30,125 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-22 02:20:30,125 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 02:20:30,126 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 02:20:30,126 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 02:20:30,126 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 02:20:30,129 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-22 02:20:30,129 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8e7c8e5dc2a9e8f11b25d1bb9948f05f37b9553e3dc9f8bd8213088dea43cb37 [2022-07-22 02:20:30,502 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 02:20:30,524 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 02:20:30,527 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 02:20:30,528 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 02:20:30,528 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 02:20:30,530 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/heapsort.i [2022-07-22 02:20:30,598 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7fa71a6e2/729cc137c5c94315ac54edcbf204f6bd/FLAG35f4f314d [2022-07-22 02:20:31,073 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 02:20:31,076 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/heapsort.i [2022-07-22 02:20:31,083 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7fa71a6e2/729cc137c5c94315ac54edcbf204f6bd/FLAG35f4f314d [2022-07-22 02:20:31,463 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7fa71a6e2/729cc137c5c94315ac54edcbf204f6bd [2022-07-22 02:20:31,466 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 02:20:31,468 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 02:20:31,471 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 02:20:31,472 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 02:20:31,475 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 02:20:31,476 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 02:20:31" (1/1) ... [2022-07-22 02:20:31,477 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45607554 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:20:31, skipping insertion in model container [2022-07-22 02:20:31,477 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 02:20:31" (1/1) ... [2022-07-22 02:20:31,483 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 02:20:31,500 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 02:20:31,653 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/heapsort.i[893,906] [2022-07-22 02:20:31,673 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 02:20:31,680 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 02:20:31,695 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/heapsort.i[893,906] [2022-07-22 02:20:31,702 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 02:20:31,718 INFO L208 MainTranslator]: Completed translation [2022-07-22 02:20:31,718 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:20:31 WrapperNode [2022-07-22 02:20:31,719 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 02:20:31,719 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 02:20:31,720 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 02:20:31,720 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 02:20:31,725 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:20:31" (1/1) ... [2022-07-22 02:20:31,754 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:20:31" (1/1) ... [2022-07-22 02:20:31,797 INFO L137 Inliner]: procedures = 16, calls = 20, calls flagged for inlining = 16, calls inlined = 16, statements flattened = 158 [2022-07-22 02:20:31,798 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 02:20:31,799 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 02:20:31,799 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 02:20:31,800 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 02:20:31,807 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:20:31" (1/1) ... [2022-07-22 02:20:31,808 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:20:31" (1/1) ... [2022-07-22 02:20:31,821 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:20:31" (1/1) ... [2022-07-22 02:20:31,821 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:20:31" (1/1) ... [2022-07-22 02:20:31,826 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:20:31" (1/1) ... [2022-07-22 02:20:31,841 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:20:31" (1/1) ... [2022-07-22 02:20:31,843 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:20:31" (1/1) ... [2022-07-22 02:20:31,854 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 02:20:31,855 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 02:20:31,856 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 02:20:31,856 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 02:20:31,857 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:20:31" (1/1) ... [2022-07-22 02:20:31,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:20:31,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:20:31,901 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-22 02:20:31,913 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-22 02:20:31,941 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 02:20:31,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 02:20:31,942 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 02:20:31,942 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 02:20:31,998 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 02:20:32,000 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 02:20:32,219 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 02:20:32,226 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 02:20:32,226 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-22 02:20:32,245 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 02:20:32 BoogieIcfgContainer [2022-07-22 02:20:32,245 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 02:20:32,247 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-22 02:20:32,247 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-22 02:20:32,256 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-22 02:20:32,257 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 02:20:32,258 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.07 02:20:31" (1/3) ... [2022-07-22 02:20:32,259 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7a4de692 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 02:20:32, skipping insertion in model container [2022-07-22 02:20:32,259 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 02:20:32,259 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:20:31" (2/3) ... [2022-07-22 02:20:32,259 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7a4de692 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 02:20:32, skipping insertion in model container [2022-07-22 02:20:32,260 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 02:20:32,260 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 02:20:32" (3/3) ... [2022-07-22 02:20:32,261 INFO L354 chiAutomizerObserver]: Analyzing ICFG heapsort.i [2022-07-22 02:20:32,338 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-22 02:20:32,339 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-22 02:20:32,339 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-22 02:20:32,339 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-22 02:20:32,339 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-22 02:20:32,339 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-22 02:20:32,339 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-22 02:20:32,340 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-22 02:20:32,363 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 57 states, 56 states have (on average 1.4285714285714286) internal successors, (80), 56 states have internal predecessors, (80), 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-22 02:20:32,390 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 49 [2022-07-22 02:20:32,390 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 02:20:32,390 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 02:20:32,406 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-22 02:20:32,407 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-22 02:20:32,407 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-22 02:20:32,407 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 57 states, 56 states have (on average 1.4285714285714286) internal successors, (80), 56 states have internal predecessors, (80), 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-22 02:20:32,415 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 49 [2022-07-22 02:20:32,416 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 02:20:32,416 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 02:20:32,417 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-22 02:20:32,417 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-22 02:20:32,424 INFO L752 eck$LassoCheckResult]: Stem: 49#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); 37#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;main_#in~argc#1, main_#in~argv#1.base, main_#in~argv#1.offset := #in~argc#1, #in~argv#1.base, #in~argv#1.offset;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~post3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~post7#1, main_~argc#1, main_~argv#1.base, main_~argv#1.offset, main_~n~0#1, main_~l~0#1, main_~r~0#1, main_~i~0#1, main_~j~0#1;main_~argc#1 := main_#in~argc#1;main_~argv#1.base, main_~argv#1.offset := main_#in~argv#1.base, main_#in~argv#1.offset;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~r~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; 18#L27true assume !!(1 <= main_~n~0#1 && main_~n~0#1 <= 1000000);main_~l~0#1 := 1 + (if main_~n~0#1 < 0 && 0 != main_~n~0#1 % 2 then 1 + main_~n~0#1 / 2 else main_~n~0#1 / 2);main_~r~0#1 := main_~n~0#1; 3#L30true assume !(main_~l~0#1 > 1);main_#t~post3#1 := main_~r~0#1;main_~r~0#1 := main_#t~post3#1 - 1;havoc main_#t~post3#1; 15#L59-1true [2022-07-22 02:20:32,425 INFO L754 eck$LassoCheckResult]: Loop: 15#L59-1true assume !!(main_~r~0#1 > 1);main_~i~0#1 := main_~l~0#1;main_~j~0#1 := 2 * main_~l~0#1; 50#L38-2true assume !true; 34#L38-3true assume main_~l~0#1 > 1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~l~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 14#L18-30true assume !(0 == __VERIFIER_assert_~cond#1); 19#L18-32true assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~l~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 32#L18-33true assume !(0 == __VERIFIER_assert_~cond#1); 13#L18-35true assume { :end_inline___VERIFIER_assert } true;main_#t~post6#1 := main_~l~0#1;main_~l~0#1 := main_#t~post6#1 - 1;havoc main_#t~post6#1; 15#L59-1true [2022-07-22 02:20:32,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:20:32,438 INFO L85 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 1 times [2022-07-22 02:20:32,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:20:32,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065866571] [2022-07-22 02:20:32,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:20:32,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:20:32,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:20:32,559 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 02:20:32,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:20:32,612 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 02:20:32,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:20:32,615 INFO L85 PathProgramCache]: Analyzing trace with hash -947861826, now seen corresponding path program 1 times [2022-07-22 02:20:32,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:20:32,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434924742] [2022-07-22 02:20:32,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:20:32,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:20:32,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:20:32,662 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-22 02:20:32,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 02:20:32,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434924742] [2022-07-22 02:20:32,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434924742] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 02:20:32,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 02:20:32,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 02:20:32,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292325218] [2022-07-22 02:20:32,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 02:20:32,672 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-22 02:20:32,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 02:20:32,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-22 02:20:32,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 02:20:32,711 INFO L87 Difference]: Start difference. First operand has 57 states, 56 states have (on average 1.4285714285714286) internal successors, (80), 56 states have internal predecessors, (80), 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 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-22 02:20:32,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 02:20:32,726 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2022-07-22 02:20:32,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-22 02:20:32,734 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 64 transitions. [2022-07-22 02:20:32,741 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2022-07-22 02:20:32,745 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 39 states and 45 transitions. [2022-07-22 02:20:32,746 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2022-07-22 02:20:32,746 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2022-07-22 02:20:32,746 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 45 transitions. [2022-07-22 02:20:32,747 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 02:20:32,754 INFO L369 hiAutomatonCegarLoop]: Abstraction has 39 states and 45 transitions. [2022-07-22 02:20:32,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 45 transitions. [2022-07-22 02:20:32,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-07-22 02:20:32,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 38 states have internal predecessors, (45), 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-22 02:20:32,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2022-07-22 02:20:32,784 INFO L392 hiAutomatonCegarLoop]: Abstraction has 39 states and 45 transitions. [2022-07-22 02:20:32,784 INFO L374 stractBuchiCegarLoop]: Abstraction has 39 states and 45 transitions. [2022-07-22 02:20:32,785 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-22 02:20:32,785 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 45 transitions. [2022-07-22 02:20:32,787 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2022-07-22 02:20:32,787 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 02:20:32,788 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 02:20:32,788 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-22 02:20:32,788 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-22 02:20:32,788 INFO L752 eck$LassoCheckResult]: Stem: 155#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); 135#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;main_#in~argc#1, main_#in~argv#1.base, main_#in~argv#1.offset := #in~argc#1, #in~argv#1.base, #in~argv#1.offset;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~post3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~post7#1, main_~argc#1, main_~argv#1.base, main_~argv#1.offset, main_~n~0#1, main_~l~0#1, main_~r~0#1, main_~i~0#1, main_~j~0#1;main_~argc#1 := main_#in~argc#1;main_~argv#1.base, main_~argv#1.offset := main_#in~argv#1.base, main_#in~argv#1.offset;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~r~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; 136#L27 assume !!(1 <= main_~n~0#1 && main_~n~0#1 <= 1000000);main_~l~0#1 := 1 + (if main_~n~0#1 < 0 && 0 != main_~n~0#1 % 2 then 1 + main_~n~0#1 / 2 else main_~n~0#1 / 2);main_~r~0#1 := main_~n~0#1; 124#L30 assume !(main_~l~0#1 > 1);main_#t~post3#1 := main_~r~0#1;main_~r~0#1 := main_#t~post3#1 - 1;havoc main_#t~post3#1; 125#L59-1 [2022-07-22 02:20:32,789 INFO L754 eck$LassoCheckResult]: Loop: 125#L59-1 assume !!(main_~r~0#1 > 1);main_~i~0#1 := main_~l~0#1;main_~j~0#1 := 2 * main_~l~0#1; 145#L38-2 assume !(main_~j~0#1 <= main_~r~0#1); 126#L38-3 assume main_~l~0#1 > 1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~l~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 128#L18-30 assume !(0 == __VERIFIER_assert_~cond#1); 142#L18-32 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~l~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 122#L18-33 assume !(0 == __VERIFIER_assert_~cond#1); 123#L18-35 assume { :end_inline___VERIFIER_assert } true;main_#t~post6#1 := main_~l~0#1;main_~l~0#1 := main_#t~post6#1 - 1;havoc main_#t~post6#1; 125#L59-1 [2022-07-22 02:20:32,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:20:32,791 INFO L85 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 2 times [2022-07-22 02:20:32,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:20:32,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234931284] [2022-07-22 02:20:32,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:20:32,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:20:32,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:20:32,821 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 02:20:32,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:20:32,846 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 02:20:32,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:20:32,847 INFO L85 PathProgramCache]: Analyzing trace with hash -145650952, now seen corresponding path program 1 times [2022-07-22 02:20:32,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:20:32,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483955173] [2022-07-22 02:20:32,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:20:32,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:20:32,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:20:32,857 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 02:20:32,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:20:32,871 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 02:20:32,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:20:32,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1814169905, now seen corresponding path program 1 times [2022-07-22 02:20:32,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:20:32,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669768202] [2022-07-22 02:20:32,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:20:32,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:20:32,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:20:32,929 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-22 02:20:32,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 02:20:32,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669768202] [2022-07-22 02:20:32,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669768202] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 02:20:32,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 02:20:32,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 02:20:32,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353348162] [2022-07-22 02:20:32,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 02:20:33,075 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 02:20:33,076 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 02:20:33,076 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 02:20:33,076 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 02:20:33,077 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 02:20:33,077 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:20:33,077 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 02:20:33,077 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 02:20:33,077 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration2_Loop [2022-07-22 02:20:33,077 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 02:20:33,078 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 02:20:33,092 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-22 02:20:33,113 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-22 02:20:33,118 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-22 02:20:33,201 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 02:20:33,202 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 02:20:33,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:20:33,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:20:33,211 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-22 02:20:33,222 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 02:20:33,222 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 02:20:33,230 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-22 02:20:33,267 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2022-07-22 02:20:33,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:20:33,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:20:33,269 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-22 02:20:33,280 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-22 02:20:33,287 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 02:20:33,288 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 02:20:33,512 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 02:20:33,517 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-22 02:20:33,517 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 02:20:33,517 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 02:20:33,517 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 02:20:33,517 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 02:20:33,517 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 02:20:33,517 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:20:33,518 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 02:20:33,518 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 02:20:33,518 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration2_Loop [2022-07-22 02:20:33,518 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 02:20:33,518 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 02:20:33,519 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-22 02:20:33,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-22 02:20:33,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:20:33,598 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 02:20:33,601 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 02:20:33,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:20:33,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:20:33,604 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-22 02:20:33,665 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-22 02:20:33,672 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-22 02:20:33,675 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:20:33,675 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 02:20:33,676 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:20:33,676 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 02:20:33,676 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:20:33,678 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 02:20:33,679 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 02:20:33,692 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:20:33,722 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-22 02:20:33,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:20:33,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:20:33,724 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-22 02:20:33,730 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-22 02:20:33,738 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:20:33,738 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 02:20:33,739 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:20:33,739 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 02:20:33,739 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:20:33,741 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 02:20:33,742 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 02:20:33,751 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-22 02:20:33,767 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 02:20:33,775 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-22 02:20:33,776 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-07-22 02:20:33,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:20:33,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:20:33,779 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-22 02:20:33,780 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-22 02:20:33,784 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 02:20:33,787 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 02:20:33,787 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 02:20:33,788 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~l~0#1) = 1*ULTIMATE.start_main_~l~0#1 Supporting invariants [] [2022-07-22 02:20:33,817 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-22 02:20:33,820 INFO L293 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 02:20:33,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:20:33,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:20:33,863 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 02:20:33,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 02:20:33,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:20:33,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 02:20:33,894 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 02:20:33,950 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-22 02:20:33,953 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-22 02:20:33,955 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 45 transitions. cyclomatic complexity: 7 Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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-22 02:20:34,016 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 45 transitions. cyclomatic complexity: 7. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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) Result 112 states and 130 transitions. Complement of second has 6 states. [2022-07-22 02:20:34,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-22 02:20:34,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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-22 02:20:34,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2022-07-22 02:20:34,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 86 transitions. Stem has 4 letters. Loop has 7 letters. [2022-07-22 02:20:34,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 02:20:34,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 86 transitions. Stem has 11 letters. Loop has 7 letters. [2022-07-22 02:20:34,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 02:20:34,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 86 transitions. Stem has 4 letters. Loop has 14 letters. [2022-07-22 02:20:34,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 02:20:34,025 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 112 states and 130 transitions. [2022-07-22 02:20:34,028 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 66 [2022-07-22 02:20:34,031 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 112 states to 108 states and 126 transitions. [2022-07-22 02:20:34,032 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 71 [2022-07-22 02:20:34,032 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 72 [2022-07-22 02:20:34,032 INFO L73 IsDeterministic]: Start isDeterministic. Operand 108 states and 126 transitions. [2022-07-22 02:20:34,032 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 02:20:34,032 INFO L369 hiAutomatonCegarLoop]: Abstraction has 108 states and 126 transitions. [2022-07-22 02:20:34,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states and 126 transitions. [2022-07-22 02:20:34,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2022-07-22 02:20:34,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 107 states have (on average 1.158878504672897) internal successors, (124), 106 states have internal predecessors, (124), 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-22 02:20:34,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 124 transitions. [2022-07-22 02:20:34,039 INFO L392 hiAutomatonCegarLoop]: Abstraction has 107 states and 124 transitions. [2022-07-22 02:20:34,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 02:20:34,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 02:20:34,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 02:20:34,041 INFO L87 Difference]: Start difference. First operand 107 states and 124 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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-22 02:20:34,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 02:20:34,064 INFO L93 Difference]: Finished difference Result 129 states and 148 transitions. [2022-07-22 02:20:34,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 02:20:34,066 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 129 states and 148 transitions. [2022-07-22 02:20:34,071 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 93 [2022-07-22 02:20:34,075 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 129 states to 98 states and 112 transitions. [2022-07-22 02:20:34,077 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 98 [2022-07-22 02:20:34,077 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 98 [2022-07-22 02:20:34,078 INFO L73 IsDeterministic]: Start isDeterministic. Operand 98 states and 112 transitions. [2022-07-22 02:20:34,078 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 02:20:34,079 INFO L369 hiAutomatonCegarLoop]: Abstraction has 98 states and 112 transitions. [2022-07-22 02:20:34,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states and 112 transitions. [2022-07-22 02:20:34,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 66. [2022-07-22 02:20:34,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 66 states have (on average 1.1515151515151516) internal successors, (76), 65 states have internal predecessors, (76), 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-22 02:20:34,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 76 transitions. [2022-07-22 02:20:34,090 INFO L392 hiAutomatonCegarLoop]: Abstraction has 66 states and 76 transitions. [2022-07-22 02:20:34,090 INFO L374 stractBuchiCegarLoop]: Abstraction has 66 states and 76 transitions. [2022-07-22 02:20:34,091 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-22 02:20:34,091 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 66 states and 76 transitions. [2022-07-22 02:20:34,092 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 62 [2022-07-22 02:20:34,094 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 02:20:34,094 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 02:20:34,095 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-22 02:20:34,095 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-22 02:20:34,095 INFO L752 eck$LassoCheckResult]: Stem: 600#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); 579#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;main_#in~argc#1, main_#in~argv#1.base, main_#in~argv#1.offset := #in~argc#1, #in~argv#1.base, #in~argv#1.offset;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~post3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~post7#1, main_~argc#1, main_~argv#1.base, main_~argv#1.offset, main_~n~0#1, main_~l~0#1, main_~r~0#1, main_~i~0#1, main_~j~0#1;main_~argc#1 := main_#in~argc#1;main_~argv#1.base, main_~argv#1.offset := main_#in~argv#1.base, main_#in~argv#1.offset;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~r~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; 580#L27 assume !!(1 <= main_~n~0#1 && main_~n~0#1 <= 1000000);main_~l~0#1 := 1 + (if main_~n~0#1 < 0 && 0 != main_~n~0#1 % 2 then 1 + main_~n~0#1 / 2 else main_~n~0#1 / 2);main_~r~0#1 := main_~n~0#1; 568#L30 assume main_~l~0#1 > 1;main_#t~post2#1 := main_~l~0#1;main_~l~0#1 := main_#t~post2#1 - 1;havoc main_#t~post2#1; 569#L59-1 [2022-07-22 02:20:34,096 INFO L754 eck$LassoCheckResult]: Loop: 569#L59-1 assume !!(main_~r~0#1 > 1);main_~i~0#1 := main_~l~0#1;main_~j~0#1 := 2 * main_~l~0#1; 609#L38-2 assume !(main_~j~0#1 <= main_~r~0#1); 606#L38-3 assume main_~l~0#1 > 1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~l~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 586#L18-30 assume !(0 == __VERIFIER_assert_~cond#1); 587#L18-32 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~l~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 566#L18-33 assume !(0 == __VERIFIER_assert_~cond#1); 567#L18-35 assume { :end_inline___VERIFIER_assert } true;main_#t~post6#1 := main_~l~0#1;main_~l~0#1 := main_#t~post6#1 - 1;havoc main_#t~post6#1; 569#L59-1 [2022-07-22 02:20:34,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:20:34,108 INFO L85 PathProgramCache]: Analyzing trace with hash 925670, now seen corresponding path program 1 times [2022-07-22 02:20:34,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:20:34,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325823786] [2022-07-22 02:20:34,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:20:34,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:20:34,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:20:34,118 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 02:20:34,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:20:34,138 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 02:20:34,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:20:34,144 INFO L85 PathProgramCache]: Analyzing trace with hash -145650952, now seen corresponding path program 2 times [2022-07-22 02:20:34,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:20:34,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314501019] [2022-07-22 02:20:34,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:20:34,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:20:34,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:20:34,152 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 02:20:34,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:20:34,160 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-07-22 02:20:34,172 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 02:20:34,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:20:34,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1671450765, now seen corresponding path program 1 times [2022-07-22 02:20:34,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:20:34,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779694995] [2022-07-22 02:20:34,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:20:34,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:20:34,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:20:34,250 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-22 02:20:34,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 02:20:34,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779694995] [2022-07-22 02:20:34,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779694995] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 02:20:34,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 02:20:34,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 02:20:34,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211629353] [2022-07-22 02:20:34,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 02:20:34,361 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 02:20:34,362 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 02:20:34,362 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 02:20:34,362 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 02:20:34,362 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 02:20:34,362 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:20:34,362 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 02:20:34,362 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 02:20:34,362 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration3_Loop [2022-07-22 02:20:34,362 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 02:20:34,363 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 02:20:34,366 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-22 02:20:34,368 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-22 02:20:34,372 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-22 02:20:34,436 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 02:20:34,436 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 02:20:34,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:20:34,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:20:34,438 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-22 02:20:34,447 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-22 02:20:34,448 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 02:20:34,448 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 02:20:34,475 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 02:20:34,475 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post6#1=0} Honda state: {ULTIMATE.start_main_#t~post6#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 02:20:34,504 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-22 02:20:34,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:20:34,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:20:34,507 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-22 02:20:34,519 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 02:20:34,519 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 02:20:34,535 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-22 02:20:34,540 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 02:20:34,540 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___VERIFIER_assert_~cond#1=1, ULTIMATE.start___VERIFIER_assert_#in~cond#1=1} Honda state: {ULTIMATE.start___VERIFIER_assert_~cond#1=1, ULTIMATE.start___VERIFIER_assert_#in~cond#1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 02:20:34,568 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-22 02:20:34,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:20:34,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:20:34,571 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-22 02:20:34,574 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-22 02:20:34,575 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 02:20:34,576 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 02:20:34,608 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-07-22 02:20:34,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:20:34,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:20:34,610 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-22 02:20:34,621 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-22 02:20:34,622 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 02:20:34,622 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 02:20:34,836 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 02:20:34,841 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-22 02:20:34,841 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 02:20:34,841 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 02:20:34,841 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 02:20:34,842 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 02:20:34,842 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 02:20:34,842 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:20:34,842 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 02:20:34,842 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 02:20:34,842 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration3_Loop [2022-07-22 02:20:34,842 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 02:20:34,842 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 02:20:34,846 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-22 02:20:34,853 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-22 02:20:34,866 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-22 02:20:34,920 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 02:20:34,921 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 02:20:34,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:20:34,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:20:34,923 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-22 02:20:34,945 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-22 02:20:34,968 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-22 02:20:34,977 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:20:34,977 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 02:20:34,977 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:20:34,977 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 02:20:34,977 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:20:34,978 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 02:20:34,978 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 02:20:34,991 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:20:35,030 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-22 02:20:35,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:20:35,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:20:35,033 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 02:20:35,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-07-22 02:20:35,036 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-22 02:20:35,044 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:20:35,044 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 02:20:35,044 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:20:35,044 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 02:20:35,044 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:20:35,047 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 02:20:35,047 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 02:20:35,063 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 02:20:35,067 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-22 02:20:35,068 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-07-22 02:20:35,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:20:35,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:20:35,072 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-22 02:20:35,082 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 02:20:35,083 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 02:20:35,083 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 02:20:35,083 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~l~0#1) = 1*ULTIMATE.start_main_~l~0#1 Supporting invariants [] [2022-07-22 02:20:35,107 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-22 02:20:35,112 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-07-22 02:20:35,112 INFO L293 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 02:20:35,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:20:35,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:20:35,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 02:20:35,142 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 02:20:35,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:20:35,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 02:20:35,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 02:20:35,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 02:20:35,200 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-22 02:20:35,201 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 66 states and 76 transitions. cyclomatic complexity: 12 Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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-22 02:20:35,228 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 66 states and 76 transitions. cyclomatic complexity: 12. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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) Result 160 states and 185 transitions. Complement of second has 6 states. [2022-07-22 02:20:35,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-22 02:20:35,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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-22 02:20:35,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions. [2022-07-22 02:20:35,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 81 transitions. Stem has 4 letters. Loop has 7 letters. [2022-07-22 02:20:35,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 02:20:35,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 81 transitions. Stem has 11 letters. Loop has 7 letters. [2022-07-22 02:20:35,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 02:20:35,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 81 transitions. Stem has 4 letters. Loop has 14 letters. [2022-07-22 02:20:35,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 02:20:35,231 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 160 states and 185 transitions. [2022-07-22 02:20:35,232 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 87 [2022-07-22 02:20:35,233 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 160 states to 125 states and 145 transitions. [2022-07-22 02:20:35,233 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 93 [2022-07-22 02:20:35,234 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 94 [2022-07-22 02:20:35,234 INFO L73 IsDeterministic]: Start isDeterministic. Operand 125 states and 145 transitions. [2022-07-22 02:20:35,234 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 02:20:35,234 INFO L369 hiAutomatonCegarLoop]: Abstraction has 125 states and 145 transitions. [2022-07-22 02:20:35,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states and 145 transitions. [2022-07-22 02:20:35,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 67. [2022-07-22 02:20:35,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 67 states have (on average 1.164179104477612) internal successors, (78), 66 states have internal predecessors, (78), 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-22 02:20:35,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 78 transitions. [2022-07-22 02:20:35,238 INFO L392 hiAutomatonCegarLoop]: Abstraction has 67 states and 78 transitions. [2022-07-22 02:20:35,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 02:20:35,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 02:20:35,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-22 02:20:35,239 INFO L87 Difference]: Start difference. First operand 67 states and 78 transitions. 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-22 02:20:35,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 02:20:35,356 INFO L93 Difference]: Finished difference Result 207 states and 231 transitions. [2022-07-22 02:20:35,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 02:20:35,357 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 207 states and 231 transitions. [2022-07-22 02:20:35,359 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 128 [2022-07-22 02:20:35,361 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 207 states to 207 states and 231 transitions. [2022-07-22 02:20:35,361 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 155 [2022-07-22 02:20:35,361 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 155 [2022-07-22 02:20:35,361 INFO L73 IsDeterministic]: Start isDeterministic. Operand 207 states and 231 transitions. [2022-07-22 02:20:35,362 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 02:20:35,362 INFO L369 hiAutomatonCegarLoop]: Abstraction has 207 states and 231 transitions. [2022-07-22 02:20:35,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states and 231 transitions. [2022-07-22 02:20:35,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 69. [2022-07-22 02:20:35,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 69 states have (on average 1.1594202898550725) internal successors, (80), 68 states have internal predecessors, (80), 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-22 02:20:35,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 80 transitions. [2022-07-22 02:20:35,368 INFO L392 hiAutomatonCegarLoop]: Abstraction has 69 states and 80 transitions. [2022-07-22 02:20:35,368 INFO L374 stractBuchiCegarLoop]: Abstraction has 69 states and 80 transitions. [2022-07-22 02:20:35,368 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-22 02:20:35,368 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states and 80 transitions. [2022-07-22 02:20:35,369 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 31 [2022-07-22 02:20:35,369 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 02:20:35,369 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 02:20:35,369 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-22 02:20:35,369 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-22 02:20:35,370 INFO L752 eck$LassoCheckResult]: Stem: 1186#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); 1149#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;main_#in~argc#1, main_#in~argv#1.base, main_#in~argv#1.offset := #in~argc#1, #in~argv#1.base, #in~argv#1.offset;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~post3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~post7#1, main_~argc#1, main_~argv#1.base, main_~argv#1.offset, main_~n~0#1, main_~l~0#1, main_~r~0#1, main_~i~0#1, main_~j~0#1;main_~argc#1 := main_#in~argc#1;main_~argv#1.base, main_~argv#1.offset := main_#in~argv#1.base, main_#in~argv#1.offset;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~r~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; 1150#L27 assume !!(1 <= main_~n~0#1 && main_~n~0#1 <= 1000000);main_~l~0#1 := 1 + (if main_~n~0#1 < 0 && 0 != main_~n~0#1 % 2 then 1 + main_~n~0#1 / 2 else main_~n~0#1 / 2);main_~r~0#1 := main_~n~0#1; 1131#L30 assume !(main_~l~0#1 > 1);main_#t~post3#1 := main_~r~0#1;main_~r~0#1 := main_#t~post3#1 - 1;havoc main_#t~post3#1; 1133#L59-1 [2022-07-22 02:20:35,370 INFO L754 eck$LassoCheckResult]: Loop: 1133#L59-1 assume !!(main_~r~0#1 > 1);main_~i~0#1 := main_~l~0#1;main_~j~0#1 := 2 * main_~l~0#1; 1169#L38-2 assume !(main_~j~0#1 <= main_~r~0#1); 1134#L38-3 assume !(main_~l~0#1 > 1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~r~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1135#L18-36 assume !(0 == __VERIFIER_assert_~cond#1); 1146#L18-38 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~r~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1147#L18-39 assume !(0 == __VERIFIER_assert_~cond#1); 1148#L18-41 assume { :end_inline___VERIFIER_assert } true;main_#t~post7#1 := main_~r~0#1;main_~r~0#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 1133#L59-1 [2022-07-22 02:20:35,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:20:35,371 INFO L85 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 3 times [2022-07-22 02:20:35,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:20:35,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981692809] [2022-07-22 02:20:35,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:20:35,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:20:35,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:20:35,380 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 02:20:35,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:20:35,388 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 02:20:35,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:20:35,388 INFO L85 PathProgramCache]: Analyzing trace with hash -124656242, now seen corresponding path program 1 times [2022-07-22 02:20:35,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:20:35,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235873212] [2022-07-22 02:20:35,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:20:35,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:20:35,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:20:35,407 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-22 02:20:35,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 02:20:35,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235873212] [2022-07-22 02:20:35,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235873212] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 02:20:35,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 02:20:35,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 02:20:35,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900646430] [2022-07-22 02:20:35,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 02:20:35,409 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-22 02:20:35,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 02:20:35,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 02:20:35,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 02:20:35,410 INFO L87 Difference]: Start difference. First operand 69 states and 80 transitions. cyclomatic complexity: 13 Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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-22 02:20:35,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 02:20:35,480 INFO L93 Difference]: Finished difference Result 129 states and 146 transitions. [2022-07-22 02:20:35,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 02:20:35,481 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 129 states and 146 transitions. [2022-07-22 02:20:35,482 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 61 [2022-07-22 02:20:35,483 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 129 states to 128 states and 145 transitions. [2022-07-22 02:20:35,483 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 67 [2022-07-22 02:20:35,484 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 67 [2022-07-22 02:20:35,484 INFO L73 IsDeterministic]: Start isDeterministic. Operand 128 states and 145 transitions. [2022-07-22 02:20:35,484 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 02:20:35,484 INFO L369 hiAutomatonCegarLoop]: Abstraction has 128 states and 145 transitions. [2022-07-22 02:20:35,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states and 145 transitions. [2022-07-22 02:20:35,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 69. [2022-07-22 02:20:35,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 69 states have (on average 1.1594202898550725) internal successors, (80), 68 states have internal predecessors, (80), 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-22 02:20:35,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 80 transitions. [2022-07-22 02:20:35,488 INFO L392 hiAutomatonCegarLoop]: Abstraction has 69 states and 80 transitions. [2022-07-22 02:20:35,488 INFO L374 stractBuchiCegarLoop]: Abstraction has 69 states and 80 transitions. [2022-07-22 02:20:35,488 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-22 02:20:35,488 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states and 80 transitions. [2022-07-22 02:20:35,488 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 32 [2022-07-22 02:20:35,489 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 02:20:35,489 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 02:20:35,489 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-22 02:20:35,489 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 02:20:35,489 INFO L752 eck$LassoCheckResult]: Stem: 1392#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); 1356#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;main_#in~argc#1, main_#in~argv#1.base, main_#in~argv#1.offset := #in~argc#1, #in~argv#1.base, #in~argv#1.offset;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~post3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~post7#1, main_~argc#1, main_~argv#1.base, main_~argv#1.offset, main_~n~0#1, main_~l~0#1, main_~r~0#1, main_~i~0#1, main_~j~0#1;main_~argc#1 := main_#in~argc#1;main_~argv#1.base, main_~argv#1.offset := main_#in~argv#1.base, main_#in~argv#1.offset;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~r~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; 1357#L27 assume !!(1 <= main_~n~0#1 && main_~n~0#1 <= 1000000);main_~l~0#1 := 1 + (if main_~n~0#1 < 0 && 0 != main_~n~0#1 % 2 then 1 + main_~n~0#1 / 2 else main_~n~0#1 / 2);main_~r~0#1 := main_~n~0#1; 1338#L30 assume !(main_~l~0#1 > 1);main_#t~post3#1 := main_~r~0#1;main_~r~0#1 := main_#t~post3#1 - 1;havoc main_#t~post3#1; 1340#L59-1 [2022-07-22 02:20:35,489 INFO L754 eck$LassoCheckResult]: Loop: 1340#L59-1 assume !!(main_~r~0#1 > 1);main_~i~0#1 := main_~l~0#1;main_~j~0#1 := 2 * main_~l~0#1; 1376#L38-2 assume !!(main_~j~0#1 <= main_~r~0#1); 1380#L39 assume !(main_~j~0#1 < main_~r~0#1); 1350#L39-1 assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1358#L18-12 assume !(0 == __VERIFIER_assert_~cond#1); 1359#L18-14 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1393#L18-15 assume !(0 == __VERIFIER_assert_~cond#1); 1394#L18-17 assume { :end_inline___VERIFIER_assert } true; 1378#L49 assume 0 != main_#t~nondet5#1;havoc main_#t~nondet5#1; 1341#L38-3 assume !(main_~l~0#1 > 1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~r~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1342#L18-36 assume !(0 == __VERIFIER_assert_~cond#1); 1353#L18-38 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~r~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1354#L18-39 assume !(0 == __VERIFIER_assert_~cond#1); 1355#L18-41 assume { :end_inline___VERIFIER_assert } true;main_#t~post7#1 := main_~r~0#1;main_~r~0#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 1340#L59-1 [2022-07-22 02:20:35,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:20:35,490 INFO L85 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 4 times [2022-07-22 02:20:35,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:20:35,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049140250] [2022-07-22 02:20:35,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:20:35,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:20:35,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:20:35,498 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 02:20:35,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:20:35,505 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 02:20:35,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:20:35,506 INFO L85 PathProgramCache]: Analyzing trace with hash -470789538, now seen corresponding path program 1 times [2022-07-22 02:20:35,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:20:35,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486357437] [2022-07-22 02:20:35,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:20:35,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:20:35,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:20:35,515 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 02:20:35,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:20:35,528 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 02:20:35,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:20:35,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1515786757, now seen corresponding path program 1 times [2022-07-22 02:20:35,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:20:35,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745605053] [2022-07-22 02:20:35,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:20:35,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:20:35,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:20:35,556 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-22 02:20:35,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 02:20:35,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745605053] [2022-07-22 02:20:35,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745605053] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 02:20:35,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 02:20:35,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 02:20:35,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116151558] [2022-07-22 02:20:35,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 02:20:35,627 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-22 02:20:35,734 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 02:20:35,734 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 02:20:35,735 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 02:20:35,735 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 02:20:35,735 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 02:20:35,735 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:20:35,735 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 02:20:35,735 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 02:20:35,735 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration5_Loop [2022-07-22 02:20:35,736 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 02:20:35,736 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 02:20:35,737 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-22 02:20:35,743 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-22 02:20:35,745 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-22 02:20:35,765 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-22 02:20:35,819 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 02:20:35,819 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 02:20:35,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:20:35,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:20:35,826 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-22 02:20:35,827 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-22 02:20:35,829 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 02:20:35,830 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 02:20:35,844 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 02:20:35,844 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___VERIFIER_assert_~cond#1=1, ULTIMATE.start___VERIFIER_assert_#in~cond#1=1} Honda state: {ULTIMATE.start___VERIFIER_assert_~cond#1=1, ULTIMATE.start___VERIFIER_assert_#in~cond#1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 02:20:35,871 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-22 02:20:35,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:20:35,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:20:35,873 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-22 02:20:35,874 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-22 02:20:35,875 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 02:20:35,875 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 02:20:35,888 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 02:20:35,888 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet5#1=4} Honda state: {ULTIMATE.start_main_#t~nondet5#1=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 02:20:35,907 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2022-07-22 02:20:35,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:20:35,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:20:35,909 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-22 02:20:35,910 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-22 02:20:35,912 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 02:20:35,912 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 02:20:35,965 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-22 02:20:35,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:20:35,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:20:35,966 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-22 02:20:35,967 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-22 02:20:35,969 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 02:20:35,969 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 02:20:36,391 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 02:20:36,397 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-22 02:20:36,397 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 02:20:36,397 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 02:20:36,397 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 02:20:36,398 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 02:20:36,398 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 02:20:36,398 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:20:36,398 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 02:20:36,398 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 02:20:36,398 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration5_Loop [2022-07-22 02:20:36,398 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 02:20:36,398 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 02:20:36,399 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-22 02:20:36,421 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-22 02:20:36,424 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-22 02:20:36,428 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-22 02:20:36,489 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 02:20:36,490 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 02:20:36,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:20:36,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:20:36,494 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-22 02:20:36,502 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-22 02:20:36,512 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:20:36,512 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 02:20:36,513 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:20:36,513 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 02:20:36,513 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:20:36,516 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 02:20:36,516 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 02:20:36,527 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-22 02:20:36,528 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 02:20:36,530 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2022-07-22 02:20:36,530 INFO L444 ModelExtractionUtils]: 5 out of 7 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-22 02:20:36,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:20:36,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:20:36,532 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-22 02:20:36,534 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-22 02:20:36,534 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 02:20:36,534 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 02:20:36,534 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 02:20:36,534 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~r~0#1) = 1*ULTIMATE.start_main_~r~0#1 Supporting invariants [] [2022-07-22 02:20:36,552 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-22 02:20:36,552 INFO L293 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 02:20:36,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:20:36,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:20:36,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 02:20:36,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 02:20:36,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:20:36,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 02:20:36,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 02:20:36,684 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-22 02:20:36,701 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-22 02:20:36,702 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-22 02:20:36,702 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 69 states and 80 transitions. cyclomatic complexity: 13 Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-22 02:20:36,737 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 69 states and 80 transitions. cyclomatic complexity: 13. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 133 states and 153 transitions. Complement of second has 4 states. [2022-07-22 02:20:36,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-07-22 02:20:36,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-22 02:20:36,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2022-07-22 02:20:36,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 80 transitions. Stem has 4 letters. Loop has 14 letters. [2022-07-22 02:20:36,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 02:20:36,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 80 transitions. Stem has 18 letters. Loop has 14 letters. [2022-07-22 02:20:36,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 02:20:36,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 80 transitions. Stem has 4 letters. Loop has 28 letters. [2022-07-22 02:20:36,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 02:20:36,746 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 133 states and 153 transitions. [2022-07-22 02:20:36,747 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 57 [2022-07-22 02:20:36,748 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 133 states to 128 states and 147 transitions. [2022-07-22 02:20:36,748 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63 [2022-07-22 02:20:36,749 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 64 [2022-07-22 02:20:36,749 INFO L73 IsDeterministic]: Start isDeterministic. Operand 128 states and 147 transitions. [2022-07-22 02:20:36,753 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 02:20:36,753 INFO L369 hiAutomatonCegarLoop]: Abstraction has 128 states and 147 transitions. [2022-07-22 02:20:36,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states and 147 transitions. [2022-07-22 02:20:36,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2022-07-22 02:20:36,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 127 states have (on average 1.1496062992125984) internal successors, (146), 126 states have internal predecessors, (146), 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-22 02:20:36,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 146 transitions. [2022-07-22 02:20:36,769 INFO L392 hiAutomatonCegarLoop]: Abstraction has 127 states and 146 transitions. [2022-07-22 02:20:36,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 02:20:36,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 02:20:36,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 02:20:36,770 INFO L87 Difference]: Start difference. First operand 127 states and 146 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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-22 02:20:36,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 02:20:36,797 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2022-07-22 02:20:36,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 02:20:36,800 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 70 states and 80 transitions. [2022-07-22 02:20:36,801 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 32 [2022-07-22 02:20:36,801 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 70 states to 69 states and 79 transitions. [2022-07-22 02:20:36,801 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2022-07-22 02:20:36,801 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2022-07-22 02:20:36,802 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 79 transitions. [2022-07-22 02:20:36,802 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 02:20:36,802 INFO L369 hiAutomatonCegarLoop]: Abstraction has 69 states and 79 transitions. [2022-07-22 02:20:36,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 79 transitions. [2022-07-22 02:20:36,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2022-07-22 02:20:36,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 69 states have (on average 1.144927536231884) internal successors, (79), 68 states have internal predecessors, (79), 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-22 02:20:36,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 79 transitions. [2022-07-22 02:20:36,805 INFO L392 hiAutomatonCegarLoop]: Abstraction has 69 states and 79 transitions. [2022-07-22 02:20:36,805 INFO L374 stractBuchiCegarLoop]: Abstraction has 69 states and 79 transitions. [2022-07-22 02:20:36,806 INFO L287 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-22 02:20:36,806 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states and 79 transitions. [2022-07-22 02:20:36,806 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 32 [2022-07-22 02:20:36,806 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 02:20:36,806 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 02:20:36,807 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-22 02:20:36,807 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 02:20:36,807 INFO L752 eck$LassoCheckResult]: Stem: 1869#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); 1832#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;main_#in~argc#1, main_#in~argv#1.base, main_#in~argv#1.offset := #in~argc#1, #in~argv#1.base, #in~argv#1.offset;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~post3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~post7#1, main_~argc#1, main_~argv#1.base, main_~argv#1.offset, main_~n~0#1, main_~l~0#1, main_~r~0#1, main_~i~0#1, main_~j~0#1;main_~argc#1 := main_#in~argc#1;main_~argv#1.base, main_~argv#1.offset := main_#in~argv#1.base, main_#in~argv#1.offset;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~r~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; 1833#L27 assume !!(1 <= main_~n~0#1 && main_~n~0#1 <= 1000000);main_~l~0#1 := 1 + (if main_~n~0#1 < 0 && 0 != main_~n~0#1 % 2 then 1 + main_~n~0#1 / 2 else main_~n~0#1 / 2);main_~r~0#1 := main_~n~0#1; 1815#L30 assume main_~l~0#1 > 1;main_#t~post2#1 := main_~l~0#1;main_~l~0#1 := main_#t~post2#1 - 1;havoc main_#t~post2#1; 1816#L59-1 assume !!(main_~r~0#1 > 1);main_~i~0#1 := main_~l~0#1;main_~j~0#1 := 2 * main_~l~0#1; 1849#L38-2 [2022-07-22 02:20:36,807 INFO L754 eck$LassoCheckResult]: Loop: 1849#L38-2 assume !!(main_~j~0#1 <= main_~r~0#1); 1865#L39 assume !(main_~j~0#1 < main_~r~0#1); 1818#L39-1 assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1834#L18-12 assume !(0 == __VERIFIER_assert_~cond#1); 1835#L18-14 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1870#L18-15 assume !(0 == __VERIFIER_assert_~cond#1); 1871#L18-17 assume { :end_inline___VERIFIER_assert } true; 1855#L49 assume 0 != main_#t~nondet5#1;havoc main_#t~nondet5#1; 1825#L38-3 assume !(main_~l~0#1 > 1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~r~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1826#L18-36 assume !(0 == __VERIFIER_assert_~cond#1); 1829#L18-38 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~r~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1830#L18-39 assume !(0 == __VERIFIER_assert_~cond#1); 1831#L18-41 assume { :end_inline___VERIFIER_assert } true;main_#t~post7#1 := main_~r~0#1;main_~r~0#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 1843#L59-1 assume !!(main_~r~0#1 > 1);main_~i~0#1 := main_~l~0#1;main_~j~0#1 := 2 * main_~l~0#1; 1849#L38-2 [2022-07-22 02:20:36,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:20:36,808 INFO L85 PathProgramCache]: Analyzing trace with hash 28695791, now seen corresponding path program 1 times [2022-07-22 02:20:36,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:20:36,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903044194] [2022-07-22 02:20:36,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:20:36,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:20:36,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:20:36,833 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 02:20:36,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:20:36,846 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 02:20:36,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:20:36,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1285304700, now seen corresponding path program 2 times [2022-07-22 02:20:36,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:20:36,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460015873] [2022-07-22 02:20:36,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:20:36,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:20:36,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:20:36,866 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 02:20:36,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:20:36,888 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 02:20:36,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:20:36,893 INFO L85 PathProgramCache]: Analyzing trace with hash 765817586, now seen corresponding path program 1 times [2022-07-22 02:20:36,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:20:36,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620197594] [2022-07-22 02:20:36,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:20:36,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:20:36,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:20:36,987 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-22 02:20:36,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 02:20:36,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620197594] [2022-07-22 02:20:36,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620197594] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 02:20:36,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 02:20:36,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 02:20:36,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643997307] [2022-07-22 02:20:36,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 02:20:37,169 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 02:20:37,169 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 02:20:37,169 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 02:20:37,169 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 02:20:37,169 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 02:20:37,169 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:20:37,170 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 02:20:37,170 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 02:20:37,170 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration6_Loop [2022-07-22 02:20:37,170 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 02:20:37,170 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 02:20:37,171 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-22 02:20:37,173 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-22 02:20:37,177 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-22 02:20:37,188 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-22 02:20:37,238 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 02:20:37,239 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 02:20:37,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:20:37,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:20:37,240 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 02:20:37,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-07-22 02:20:37,253 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 02:20:37,253 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 02:20:37,280 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 02:20:37,280 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet5#1=4} Honda state: {ULTIMATE.start_main_#t~nondet5#1=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 02:20:37,313 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-07-22 02:20:37,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:20:37,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:20:37,315 INFO L229 MonitoredProcess]: Starting monitored process 21 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-22 02:20:37,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-07-22 02:20:37,337 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 02:20:37,337 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 02:20:37,358 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 02:20:37,358 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___VERIFIER_assert_~cond#1=1, ULTIMATE.start___VERIFIER_assert_#in~cond#1=1} Honda state: {ULTIMATE.start___VERIFIER_assert_~cond#1=1, ULTIMATE.start___VERIFIER_assert_#in~cond#1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 02:20:37,389 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-07-22 02:20:37,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:20:37,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:20:37,391 INFO L229 MonitoredProcess]: Starting monitored process 22 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-22 02:20:37,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-07-22 02:20:37,394 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 02:20:37,394 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 02:20:37,449 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-07-22 02:20:37,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:20:37,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:20:37,451 INFO L229 MonitoredProcess]: Starting monitored process 23 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-22 02:20:37,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-07-22 02:20:37,454 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 02:20:37,454 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 02:20:37,825 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 02:20:37,831 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2022-07-22 02:20:37,831 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 02:20:37,831 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 02:20:37,831 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 02:20:37,831 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 02:20:37,831 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 02:20:37,831 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:20:37,831 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 02:20:37,831 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 02:20:37,832 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration6_Loop [2022-07-22 02:20:37,832 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 02:20:37,832 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 02:20:37,833 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-22 02:20:37,842 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-22 02:20:37,856 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-22 02:20:37,858 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-22 02:20:37,932 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 02:20:37,932 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 02:20:37,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:20:37,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:20:37,934 INFO L229 MonitoredProcess]: Starting monitored process 24 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-22 02:20:37,942 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-22 02:20:37,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-07-22 02:20:37,948 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:20:37,949 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 02:20:37,949 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:20:37,949 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-22 02:20:37,949 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:20:37,950 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-22 02:20:37,950 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 02:20:37,957 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:20:37,973 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2022-07-22 02:20:37,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:20:37,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:20:37,974 INFO L229 MonitoredProcess]: Starting monitored process 25 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-22 02:20:37,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-07-22 02:20:37,976 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-22 02:20:37,983 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:20:37,983 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 02:20:37,984 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:20:37,984 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 02:20:37,984 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:20:37,985 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 02:20:37,985 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 02:20:38,005 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 02:20:38,008 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-22 02:20:38,008 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-07-22 02:20:38,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:20:38,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:20:38,009 INFO L229 MonitoredProcess]: Starting monitored process 26 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-22 02:20:38,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-07-22 02:20:38,011 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 02:20:38,011 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 02:20:38,011 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 02:20:38,011 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~r~0#1) = 1*ULTIMATE.start_main_~r~0#1 Supporting invariants [] [2022-07-22 02:20:38,030 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-07-22 02:20:38,030 INFO L293 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 02:20:38,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:20:38,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:20:38,057 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 02:20:38,057 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 02:20:38,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:20:38,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 02:20:38,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 02:20:38,097 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-22 02:20:38,098 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-22 02:20:38,098 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 69 states and 79 transitions. cyclomatic complexity: 12 Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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-22 02:20:38,135 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 69 states and 79 transitions. cyclomatic complexity: 12. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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 137 states and 159 transitions. Complement of second has 6 states. [2022-07-22 02:20:38,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-22 02:20:38,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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-22 02:20:38,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2022-07-22 02:20:38,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 47 transitions. Stem has 5 letters. Loop has 14 letters. [2022-07-22 02:20:38,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 02:20:38,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 47 transitions. Stem has 19 letters. Loop has 14 letters. [2022-07-22 02:20:38,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 02:20:38,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 47 transitions. Stem has 5 letters. Loop has 28 letters. [2022-07-22 02:20:38,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 02:20:38,138 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 137 states and 159 transitions. [2022-07-22 02:20:38,140 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2022-07-22 02:20:38,140 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 137 states to 131 states and 152 transitions. [2022-07-22 02:20:38,141 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2022-07-22 02:20:38,141 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2022-07-22 02:20:38,141 INFO L73 IsDeterministic]: Start isDeterministic. Operand 131 states and 152 transitions. [2022-07-22 02:20:38,141 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 02:20:38,141 INFO L369 hiAutomatonCegarLoop]: Abstraction has 131 states and 152 transitions. [2022-07-22 02:20:38,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states and 152 transitions. [2022-07-22 02:20:38,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 129. [2022-07-22 02:20:38,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 129 states have (on average 1.1550387596899225) internal successors, (149), 128 states have internal predecessors, (149), 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-22 02:20:38,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 149 transitions. [2022-07-22 02:20:38,145 INFO L392 hiAutomatonCegarLoop]: Abstraction has 129 states and 149 transitions. [2022-07-22 02:20:38,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 02:20:38,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 02:20:38,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-22 02:20:38,146 INFO L87 Difference]: Start difference. First operand 129 states and 149 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 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-22 02:20:38,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 02:20:38,273 INFO L93 Difference]: Finished difference Result 430 states and 476 transitions. [2022-07-22 02:20:38,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 02:20:38,274 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 430 states and 476 transitions. [2022-07-22 02:20:38,277 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 64 [2022-07-22 02:20:38,279 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 430 states to 379 states and 421 transitions. [2022-07-22 02:20:38,279 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 96 [2022-07-22 02:20:38,280 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 96 [2022-07-22 02:20:38,280 INFO L73 IsDeterministic]: Start isDeterministic. Operand 379 states and 421 transitions. [2022-07-22 02:20:38,280 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 02:20:38,280 INFO L369 hiAutomatonCegarLoop]: Abstraction has 379 states and 421 transitions. [2022-07-22 02:20:38,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states and 421 transitions. [2022-07-22 02:20:38,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 130. [2022-07-22 02:20:38,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 130 states have (on average 1.1538461538461537) internal successors, (150), 129 states have internal predecessors, (150), 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-22 02:20:38,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 150 transitions. [2022-07-22 02:20:38,288 INFO L392 hiAutomatonCegarLoop]: Abstraction has 130 states and 150 transitions. [2022-07-22 02:20:38,288 INFO L374 stractBuchiCegarLoop]: Abstraction has 130 states and 150 transitions. [2022-07-22 02:20:38,288 INFO L287 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-22 02:20:38,288 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 130 states and 150 transitions. [2022-07-22 02:20:38,290 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2022-07-22 02:20:38,290 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 02:20:38,290 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 02:20:38,291 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-07-22 02:20:38,291 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 02:20:38,291 INFO L752 eck$LassoCheckResult]: Stem: 2730#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); 2688#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;main_#in~argc#1, main_#in~argv#1.base, main_#in~argv#1.offset := #in~argc#1, #in~argv#1.base, #in~argv#1.offset;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~post3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~post7#1, main_~argc#1, main_~argv#1.base, main_~argv#1.offset, main_~n~0#1, main_~l~0#1, main_~r~0#1, main_~i~0#1, main_~j~0#1;main_~argc#1 := main_#in~argc#1;main_~argv#1.base, main_~argv#1.offset := main_#in~argv#1.base, main_#in~argv#1.offset;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~r~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; 2689#L27 assume !!(1 <= main_~n~0#1 && main_~n~0#1 <= 1000000);main_~l~0#1 := 1 + (if main_~n~0#1 < 0 && 0 != main_~n~0#1 % 2 then 1 + main_~n~0#1 / 2 else main_~n~0#1 / 2);main_~r~0#1 := main_~n~0#1; 2674#L30 assume main_~l~0#1 > 1;main_#t~post2#1 := main_~l~0#1;main_~l~0#1 := main_#t~post2#1 - 1;havoc main_#t~post2#1; 2675#L59-1 assume !!(main_~r~0#1 > 1);main_~i~0#1 := main_~l~0#1;main_~j~0#1 := 2 * main_~l~0#1; 2711#L38-2 assume !!(main_~j~0#1 <= main_~r~0#1); 2718#L39 [2022-07-22 02:20:38,296 INFO L754 eck$LassoCheckResult]: Loop: 2718#L39 assume !(main_~j~0#1 < main_~r~0#1); 2677#L39-1 assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 2691#L18-12 assume !(0 == __VERIFIER_assert_~cond#1); 2692#L18-14 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 2731#L18-15 assume !(0 == __VERIFIER_assert_~cond#1); 2732#L18-17 assume { :end_inline___VERIFIER_assert } true; 2715#L49 assume !(0 != main_#t~nondet5#1);havoc main_#t~nondet5#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 2703#L18-18 assume !(0 == __VERIFIER_assert_~cond#1); 2704#L18-20 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 2722#L18-21 assume !(0 == __VERIFIER_assert_~cond#1); 2723#L18-23 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 2726#L18-24 assume !(0 == __VERIFIER_assert_~cond#1); 2727#L18-26 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 2743#L18-27 assume !(0 == __VERIFIER_assert_~cond#1); 2738#L18-29 assume { :end_inline___VERIFIER_assert } true;main_~i~0#1 := main_~j~0#1;main_~j~0#1 := 2 * main_~j~0#1; 2713#L38-2 assume !!(main_~j~0#1 <= main_~r~0#1); 2718#L39 [2022-07-22 02:20:38,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:20:38,297 INFO L85 PathProgramCache]: Analyzing trace with hash 889569551, now seen corresponding path program 1 times [2022-07-22 02:20:38,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:20:38,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971594797] [2022-07-22 02:20:38,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:20:38,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:20:38,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:20:38,308 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 02:20:38,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:20:38,329 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 02:20:38,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:20:38,333 INFO L85 PathProgramCache]: Analyzing trace with hash 184163919, now seen corresponding path program 1 times [2022-07-22 02:20:38,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:20:38,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962216497] [2022-07-22 02:20:38,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:20:38,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:20:38,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:20:38,417 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2022-07-22 02:20:38,453 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-22 02:20:38,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 02:20:38,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962216497] [2022-07-22 02:20:38,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962216497] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 02:20:38,455 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 02:20:38,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 02:20:38,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951023189] [2022-07-22 02:20:38,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 02:20:38,456 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-22 02:20:38,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 02:20:38,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 02:20:38,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-22 02:20:38,457 INFO L87 Difference]: Start difference. First operand 130 states and 150 transitions. cyclomatic complexity: 24 Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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-22 02:20:38,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 02:20:38,589 INFO L93 Difference]: Finished difference Result 225 states and 251 transitions. [2022-07-22 02:20:38,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-22 02:20:38,590 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 225 states and 251 transitions. [2022-07-22 02:20:38,591 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2022-07-22 02:20:38,592 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 225 states to 210 states and 236 transitions. [2022-07-22 02:20:38,593 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2022-07-22 02:20:38,593 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2022-07-22 02:20:38,593 INFO L73 IsDeterministic]: Start isDeterministic. Operand 210 states and 236 transitions. [2022-07-22 02:20:38,593 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 02:20:38,593 INFO L369 hiAutomatonCegarLoop]: Abstraction has 210 states and 236 transitions. [2022-07-22 02:20:38,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states and 236 transitions. [2022-07-22 02:20:38,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 175. [2022-07-22 02:20:38,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 175 states have (on average 1.1257142857142857) internal successors, (197), 174 states have internal predecessors, (197), 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-22 02:20:38,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 197 transitions. [2022-07-22 02:20:38,597 INFO L392 hiAutomatonCegarLoop]: Abstraction has 175 states and 197 transitions. [2022-07-22 02:20:38,597 INFO L374 stractBuchiCegarLoop]: Abstraction has 175 states and 197 transitions. [2022-07-22 02:20:38,597 INFO L287 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-07-22 02:20:38,598 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 175 states and 197 transitions. [2022-07-22 02:20:38,599 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2022-07-22 02:20:38,599 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 02:20:38,599 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 02:20:38,599 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-07-22 02:20:38,599 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 02:20:38,600 INFO L752 eck$LassoCheckResult]: Stem: 3103#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); 3060#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;main_#in~argc#1, main_#in~argv#1.base, main_#in~argv#1.offset := #in~argc#1, #in~argv#1.base, #in~argv#1.offset;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~post3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~post7#1, main_~argc#1, main_~argv#1.base, main_~argv#1.offset, main_~n~0#1, main_~l~0#1, main_~r~0#1, main_~i~0#1, main_~j~0#1;main_~argc#1 := main_#in~argc#1;main_~argv#1.base, main_~argv#1.offset := main_#in~argv#1.base, main_#in~argv#1.offset;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~r~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; 3061#L27 assume !!(1 <= main_~n~0#1 && main_~n~0#1 <= 1000000);main_~l~0#1 := 1 + (if main_~n~0#1 < 0 && 0 != main_~n~0#1 % 2 then 1 + main_~n~0#1 / 2 else main_~n~0#1 / 2);main_~r~0#1 := main_~n~0#1; 3046#L30 assume main_~l~0#1 > 1;main_#t~post2#1 := main_~l~0#1;main_~l~0#1 := main_#t~post2#1 - 1;havoc main_#t~post2#1; 3047#L59-1 assume !!(main_~r~0#1 > 1);main_~i~0#1 := main_~l~0#1;main_~j~0#1 := 2 * main_~l~0#1; 3079#L38-2 assume !!(main_~j~0#1 <= main_~r~0#1); 3090#L39 [2022-07-22 02:20:38,600 INFO L754 eck$LassoCheckResult]: Loop: 3090#L39 assume main_~j~0#1 < main_~r~0#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 3091#L18 assume !(0 == __VERIFIER_assert_~cond#1); 3082#L18-2 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 3083#L18-3 assume !(0 == __VERIFIER_assert_~cond#1); 3048#L18-5 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= 1 + main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 3049#L18-6 assume !(0 == __VERIFIER_assert_~cond#1); 3067#L18-8 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 + main_~j~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 3068#L18-9 assume !(0 == __VERIFIER_assert_~cond#1); 3113#L18-11 assume { :end_inline___VERIFIER_assert } true; 3054#L44 assume 0 != main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; 3055#L39-1 assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 3063#L18-12 assume !(0 == __VERIFIER_assert_~cond#1); 3064#L18-14 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 3104#L18-15 assume !(0 == __VERIFIER_assert_~cond#1); 3105#L18-17 assume { :end_inline___VERIFIER_assert } true; 3086#L49 assume !(0 != main_#t~nondet5#1);havoc main_#t~nondet5#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 3075#L18-18 assume !(0 == __VERIFIER_assert_~cond#1); 3076#L18-20 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 3095#L18-21 assume !(0 == __VERIFIER_assert_~cond#1); 3096#L18-23 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 3099#L18-24 assume !(0 == __VERIFIER_assert_~cond#1); 3100#L18-26 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 3124#L18-27 assume !(0 == __VERIFIER_assert_~cond#1); 3115#L18-29 assume { :end_inline___VERIFIER_assert } true;main_~i~0#1 := main_~j~0#1;main_~j~0#1 := 2 * main_~j~0#1; 3116#L38-2 assume !!(main_~j~0#1 <= main_~r~0#1); 3090#L39 [2022-07-22 02:20:38,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:20:38,601 INFO L85 PathProgramCache]: Analyzing trace with hash 889569551, now seen corresponding path program 2 times [2022-07-22 02:20:38,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:20:38,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719954584] [2022-07-22 02:20:38,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:20:38,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:20:38,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:20:38,608 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 02:20:38,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:20:38,614 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 02:20:38,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:20:38,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1105792449, now seen corresponding path program 1 times [2022-07-22 02:20:38,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:20:38,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346325185] [2022-07-22 02:20:38,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:20:38,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:20:38,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:20:38,628 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 02:20:38,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:20:38,639 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 02:20:38,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:20:38,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1170285327, now seen corresponding path program 1 times [2022-07-22 02:20:38,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:20:38,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575530193] [2022-07-22 02:20:38,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:20:38,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:20:38,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:20:38,704 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 02:20:38,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 02:20:38,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575530193] [2022-07-22 02:20:38,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575530193] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 02:20:38,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [545465164] [2022-07-22 02:20:38,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:20:38,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 02:20:38,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:20:38,708 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 02:20:38,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-07-22 02:20:38,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:20:38,754 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-22 02:20:38,756 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 02:20:38,994 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-22 02:20:38,994 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 02:20:38,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [545465164] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 02:20:38,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 02:20:38,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 11 [2022-07-22 02:20:38,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967541091] [2022-07-22 02:20:38,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 02:20:39,259 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 02:20:39,259 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 02:20:39,259 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 02:20:39,260 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 02:20:39,260 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 02:20:39,260 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:20:39,260 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 02:20:39,260 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 02:20:39,260 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration8_Loop [2022-07-22 02:20:39,260 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 02:20:39,260 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 02:20:39,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-22 02:20:39,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-22 02:20:39,274 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-22 02:20:39,277 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-22 02:20:39,338 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 02:20:39,339 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 02:20:39,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:20:39,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:20:39,341 INFO L229 MonitoredProcess]: Starting monitored process 28 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-22 02:20:39,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-07-22 02:20:39,344 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 02:20:39,344 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 02:20:39,377 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 02:20:39,377 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet4#1=4} Honda state: {ULTIMATE.start_main_#t~nondet4#1=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 02:20:39,406 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2022-07-22 02:20:39,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:20:39,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:20:39,408 INFO L229 MonitoredProcess]: Starting monitored process 29 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-22 02:20:39,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2022-07-22 02:20:39,413 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 02:20:39,413 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 02:20:39,446 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2022-07-22 02:20:39,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:20:39,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:20:39,447 INFO L229 MonitoredProcess]: Starting monitored process 30 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-22 02:20:39,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2022-07-22 02:20:39,450 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 02:20:39,450 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 02:20:39,559 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 02:20:39,563 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2022-07-22 02:20:39,564 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 02:20:39,564 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 02:20:39,564 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 02:20:39,564 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 02:20:39,564 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 02:20:39,564 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:20:39,564 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 02:20:39,564 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 02:20:39,564 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration8_Loop [2022-07-22 02:20:39,564 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 02:20:39,564 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 02:20:39,565 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-22 02:20:39,574 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-22 02:20:39,586 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-22 02:20:39,591 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-22 02:20:39,648 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 02:20:39,649 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 02:20:39,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:20:39,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:20:39,650 INFO L229 MonitoredProcess]: Starting monitored process 31 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-22 02:20:39,658 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-22 02:20:39,666 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:20:39,667 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 02:20:39,667 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:20:39,667 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-22 02:20:39,667 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:20:39,668 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-22 02:20:39,668 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 02:20:39,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2022-07-22 02:20:39,691 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:20:39,709 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2022-07-22 02:20:39,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:20:39,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:20:39,711 INFO L229 MonitoredProcess]: Starting monitored process 32 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-22 02:20:39,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2022-07-22 02:20:39,714 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-22 02:20:39,721 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:20:39,721 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 02:20:39,722 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:20:39,722 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 02:20:39,722 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:20:39,723 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 02:20:39,724 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 02:20:39,726 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 02:20:39,729 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-22 02:20:39,729 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-07-22 02:20:39,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:20:39,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:20:39,731 INFO L229 MonitoredProcess]: Starting monitored process 33 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-22 02:20:39,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2022-07-22 02:20:39,733 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 02:20:39,733 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 02:20:39,733 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 02:20:39,734 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0#1, ULTIMATE.start_main_~j~0#1) = 1*ULTIMATE.start_main_~n~0#1 - 1*ULTIMATE.start_main_~j~0#1 Supporting invariants [] [2022-07-22 02:20:39,751 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2022-07-22 02:20:39,752 INFO L293 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 02:20:39,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:20:39,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:20:39,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 02:20:39,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 02:20:39,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:20:39,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-22 02:20:39,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 02:20:39,871 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2022-07-22 02:20:40,044 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-22 02:20:40,045 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2022-07-22 02:20:40,045 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 175 states and 197 transitions. cyclomatic complexity: 26 Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 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-22 02:20:40,144 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 175 states and 197 transitions. cyclomatic complexity: 26. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 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 483 states and 524 transitions. Complement of second has 11 states. [2022-07-22 02:20:40,144 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-22 02:20:40,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 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-22 02:20:40,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 47 transitions. [2022-07-22 02:20:40,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 47 transitions. Stem has 6 letters. Loop has 25 letters. [2022-07-22 02:20:40,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 02:20:40,146 INFO L577 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-07-22 02:20:40,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:20:40,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:20:40,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 02:20:40,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 02:20:40,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:20:40,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-22 02:20:40,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 02:20:40,375 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-22 02:20:40,376 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 7 loop predicates [2022-07-22 02:20:40,376 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 175 states and 197 transitions. cyclomatic complexity: 26 Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 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-22 02:20:40,530 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 175 states and 197 transitions. cyclomatic complexity: 26. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 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 483 states and 524 transitions. Complement of second has 11 states. [2022-07-22 02:20:40,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2022-07-22 02:20:40,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 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-22 02:20:40,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 47 transitions. [2022-07-22 02:20:40,531 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 47 transitions. Stem has 6 letters. Loop has 25 letters. [2022-07-22 02:20:40,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 02:20:40,532 INFO L577 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-07-22 02:20:40,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:20:40,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:20:40,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 02:20:40,553 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 02:20:40,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:20:40,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-22 02:20:40,580 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 02:20:40,756 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-22 02:20:40,756 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 7 loop predicates [2022-07-22 02:20:40,757 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 175 states and 197 transitions. cyclomatic complexity: 26 Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 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-22 02:20:40,867 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 175 states and 197 transitions. cyclomatic complexity: 26. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 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 373 states and 405 transitions. Complement of second has 10 states. [2022-07-22 02:20:40,868 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-22 02:20:40,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 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-22 02:20:40,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 86 transitions. [2022-07-22 02:20:40,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 86 transitions. Stem has 6 letters. Loop has 25 letters. [2022-07-22 02:20:40,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 02:20:40,869 INFO L577 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-07-22 02:20:40,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:20:40,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:20:40,889 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 02:20:40,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 02:20:40,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:20:40,908 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-22 02:20:40,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 02:20:41,093 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-22 02:20:41,094 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 7 loop predicates [2022-07-22 02:20:41,094 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 175 states and 197 transitions. cyclomatic complexity: 26 Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 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-22 02:20:41,223 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 175 states and 197 transitions. cyclomatic complexity: 26. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 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 373 states and 405 transitions. Complement of second has 10 states. [2022-07-22 02:20:41,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2022-07-22 02:20:41,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 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-22 02:20:41,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 86 transitions. [2022-07-22 02:20:41,225 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 86 transitions. Stem has 6 letters. Loop has 25 letters. [2022-07-22 02:20:41,225 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 02:20:41,225 INFO L577 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-07-22 02:20:41,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:20:41,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:20:41,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 02:20:41,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 02:20:41,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:20:41,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-22 02:20:41,277 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 02:20:41,470 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-22 02:20:41,471 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemin loopwithout honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2022-07-22 02:20:41,472 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 175 states and 197 transitions. cyclomatic complexity: 26 Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 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-22 02:20:41,733 INFO L108 BuchiDifferenceFKV]: Finished buchiDifferenceFKV. First operand 175 states and 197 transitions. cyclomatic complexity: 26 Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 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 2225 states and 2838 transitions. Complement of second has 60 states 8 powerset states52 rank states. The highest rank that occured is 5 [2022-07-22 02:20:41,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2022-07-22 02:20:41,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 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-22 02:20:41,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 196 transitions. [2022-07-22 02:20:41,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 196 transitions. Stem has 6 letters. Loop has 25 letters. [2022-07-22 02:20:41,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 02:20:41,736 INFO L577 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-07-22 02:20:41,736 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: no settings was sufficient at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.cegar.BuchiAutomatonCegarLoop.refineBuchi(BuchiAutomatonCegarLoop.java:325) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.cegar.BuchiAutomatonCegarLoop.refineBuchi(BuchiAutomatonCegarLoop.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.cegar.AbstractBuchiCegarLoop.refineBuchiAndReportRankingFunction(AbstractBuchiCegarLoop.java:401) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.cegar.AbstractBuchiCegarLoop.runCegarLoop(AbstractBuchiCegarLoop.java:352) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:146) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:363) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-22 02:20:41,739 INFO L158 Benchmark]: Toolchain (without parser) took 10271.03ms. Allocated memory was 50.3MB in the beginning and 96.5MB in the end (delta: 46.1MB). Free memory was 27.3MB in the beginning and 69.5MB in the end (delta: -42.2MB). Peak memory consumption was 48.9MB. Max. memory is 16.1GB. [2022-07-22 02:20:41,740 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 50.3MB. Free memory was 31.5MB in the beginning and 31.5MB in the end (delta: 33.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 02:20:41,740 INFO L158 Benchmark]: CACSL2BoogieTranslator took 247.56ms. Allocated memory was 50.3MB in the beginning and 65.0MB in the end (delta: 14.7MB). Free memory was 27.1MB in the beginning and 48.2MB in the end (delta: -21.1MB). Peak memory consumption was 5.7MB. Max. memory is 16.1GB. [2022-07-22 02:20:41,740 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.76ms. Allocated memory is still 65.0MB. Free memory was 48.2MB in the beginning and 46.2MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 02:20:41,740 INFO L158 Benchmark]: Boogie Preprocessor took 55.33ms. Allocated memory is still 65.0MB. Free memory was 46.2MB in the beginning and 45.0MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 02:20:41,741 INFO L158 Benchmark]: RCFGBuilder took 389.95ms. Allocated memory is still 65.0MB. Free memory was 45.0MB in the beginning and 33.0MB in the end (delta: 12.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-22 02:20:41,741 INFO L158 Benchmark]: BuchiAutomizer took 9491.84ms. Allocated memory was 65.0MB in the beginning and 96.5MB in the end (delta: 31.5MB). Free memory was 33.0MB in the beginning and 69.5MB in the end (delta: -36.4MB). Peak memory consumption was 43.3MB. Max. memory is 16.1GB. [2022-07-22 02:20:41,742 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 50.3MB. Free memory was 31.5MB in the beginning and 31.5MB in the end (delta: 33.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 247.56ms. Allocated memory was 50.3MB in the beginning and 65.0MB in the end (delta: 14.7MB). Free memory was 27.1MB in the beginning and 48.2MB in the end (delta: -21.1MB). Peak memory consumption was 5.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 78.76ms. Allocated memory is still 65.0MB. Free memory was 48.2MB in the beginning and 46.2MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.33ms. Allocated memory is still 65.0MB. Free memory was 46.2MB in the beginning and 45.0MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 389.95ms. Allocated memory is still 65.0MB. Free memory was 45.0MB in the beginning and 33.0MB in the end (delta: 12.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 9491.84ms. Allocated memory was 65.0MB in the beginning and 96.5MB in the end (delta: 31.5MB). Free memory was 33.0MB in the beginning and 69.5MB in the end (delta: -36.4MB). Peak memory consumption was 43.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: no settings was sufficient de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: no settings was sufficient: de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.cegar.BuchiAutomatonCegarLoop.refineBuchi(BuchiAutomatonCegarLoop.java:325) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-22 02:20:41,780 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-07-22 02:20:41,982 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 Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: no settings was sufficient