./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 c3fed411 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/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-tmp.no-commuhash-c3fed41 [2021-12-19 18:38:57,576 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-19 18:38:57,578 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-19 18:38:57,645 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-19 18:38:57,646 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-19 18:38:57,647 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-19 18:38:57,648 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-19 18:38:57,649 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-19 18:38:57,650 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-19 18:38:57,651 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-19 18:38:57,652 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-19 18:38:57,653 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-19 18:38:57,653 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-19 18:38:57,654 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-19 18:38:57,655 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-19 18:38:57,656 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-19 18:38:57,656 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-19 18:38:57,657 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-19 18:38:57,658 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-19 18:38:57,666 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-19 18:38:57,667 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-19 18:38:57,668 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-19 18:38:57,670 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-19 18:38:57,670 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-19 18:38:57,672 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-19 18:38:57,673 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-19 18:38:57,673 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-19 18:38:57,675 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-19 18:38:57,675 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-19 18:38:57,676 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-19 18:38:57,676 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-19 18:38:57,677 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-19 18:38:57,678 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-19 18:38:57,678 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-19 18:38:57,679 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-19 18:38:57,679 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-19 18:38:57,680 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-19 18:38:57,680 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-19 18:38:57,680 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-19 18:38:57,680 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-19 18:38:57,681 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-19 18:38:57,682 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-12-19 18:38:57,703 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-19 18:38:57,703 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-19 18:38:57,704 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-19 18:38:57,704 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-19 18:38:57,705 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-19 18:38:57,705 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-19 18:38:57,705 INFO L138 SettingsManager]: * Use SBE=true [2021-12-19 18:38:57,705 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-19 18:38:57,706 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-19 18:38:57,706 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-19 18:38:57,706 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-19 18:38:57,706 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-19 18:38:57,706 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-19 18:38:57,707 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-19 18:38:57,707 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-19 18:38:57,707 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-19 18:38:57,707 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-19 18:38:57,707 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-19 18:38:57,707 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-19 18:38:57,708 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-19 18:38:57,708 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-19 18:38:57,708 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-19 18:38:57,708 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-19 18:38:57,708 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-19 18:38:57,709 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-19 18:38:57,709 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-19 18:38:57,709 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-19 18:38:57,709 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-19 18:38:57,709 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-19 18:38:57,710 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-19 18:38:57,710 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-19 18:38:57,710 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-19 18:38:57,711 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-19 18:38:57,711 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 [2021-12-19 18:38:57,952 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-19 18:38:57,985 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-19 18:38:57,988 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-19 18:38:57,990 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-19 18:38:57,991 INFO L275 PluginConnector]: CDTParser initialized [2021-12-19 18:38:57,992 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/heapsort.i [2021-12-19 18:38:58,064 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eda1c5e6a/321888512b034eae8a9062385d1ef8d1/FLAG01355f681 [2021-12-19 18:38:58,496 INFO L306 CDTParser]: Found 1 translation units. [2021-12-19 18:38:58,497 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/heapsort.i [2021-12-19 18:38:58,506 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eda1c5e6a/321888512b034eae8a9062385d1ef8d1/FLAG01355f681 [2021-12-19 18:38:58,902 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eda1c5e6a/321888512b034eae8a9062385d1ef8d1 [2021-12-19 18:38:58,904 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-19 18:38:58,906 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-19 18:38:58,907 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-19 18:38:58,907 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-19 18:38:58,915 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-19 18:38:58,916 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 06:38:58" (1/1) ... [2021-12-19 18:38:58,918 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@254925c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 06:38:58, skipping insertion in model container [2021-12-19 18:38:58,918 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 06:38:58" (1/1) ... [2021-12-19 18:38:58,925 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-19 18:38:58,941 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-19 18:38:59,095 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] [2021-12-19 18:38:59,107 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-19 18:38:59,114 INFO L203 MainTranslator]: Completed pre-run [2021-12-19 18:38:59,123 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] [2021-12-19 18:38:59,130 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-19 18:38:59,141 INFO L208 MainTranslator]: Completed translation [2021-12-19 18:38:59,142 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 06:38:59 WrapperNode [2021-12-19 18:38:59,142 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-19 18:38:59,143 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-19 18:38:59,143 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-19 18:38:59,143 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-19 18:38:59,149 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 06:38:59" (1/1) ... [2021-12-19 18:38:59,155 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 06:38:59" (1/1) ... [2021-12-19 18:38:59,174 INFO L137 Inliner]: procedures = 16, calls = 20, calls flagged for inlining = 16, calls inlined = 16, statements flattened = 158 [2021-12-19 18:38:59,174 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-19 18:38:59,175 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-19 18:38:59,175 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-19 18:38:59,175 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-19 18:38:59,182 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 06:38:59" (1/1) ... [2021-12-19 18:38:59,182 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 06:38:59" (1/1) ... [2021-12-19 18:38:59,184 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 06:38:59" (1/1) ... [2021-12-19 18:38:59,184 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 06:38:59" (1/1) ... [2021-12-19 18:38:59,189 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 06:38:59" (1/1) ... [2021-12-19 18:38:59,198 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 06:38:59" (1/1) ... [2021-12-19 18:38:59,200 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 06:38:59" (1/1) ... [2021-12-19 18:38:59,202 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-19 18:38:59,202 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-19 18:38:59,203 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-19 18:38:59,203 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-19 18:38:59,204 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 06:38:59" (1/1) ... [2021-12-19 18:38:59,210 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 18:38:59,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 18:38:59,231 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 18:38:59,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-12-19 18:38:59,283 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-19 18:38:59,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-19 18:38:59,283 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-19 18:38:59,284 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-19 18:38:59,345 INFO L236 CfgBuilder]: Building ICFG [2021-12-19 18:38:59,346 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-19 18:38:59,574 INFO L277 CfgBuilder]: Performing block encoding [2021-12-19 18:38:59,580 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-19 18:38:59,580 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-19 18:38:59,582 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 06:38:59 BoogieIcfgContainer [2021-12-19 18:38:59,582 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-19 18:38:59,583 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-19 18:38:59,583 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-19 18:38:59,586 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-19 18:38:59,600 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-19 18:38:59,600 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.12 06:38:58" (1/3) ... [2021-12-19 18:38:59,602 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7120ae99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.12 06:38:59, skipping insertion in model container [2021-12-19 18:38:59,602 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-19 18:38:59,602 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 06:38:59" (2/3) ... [2021-12-19 18:38:59,602 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7120ae99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.12 06:38:59, skipping insertion in model container [2021-12-19 18:38:59,603 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-19 18:38:59,603 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 06:38:59" (3/3) ... [2021-12-19 18:38:59,604 INFO L388 chiAutomizerObserver]: Analyzing ICFG heapsort.i [2021-12-19 18:38:59,654 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-19 18:38:59,655 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-19 18:38:59,655 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-19 18:38:59,655 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-19 18:38:59,655 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-19 18:38:59,656 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-19 18:38:59,656 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-19 18:38:59,657 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-19 18:38:59,677 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) [2021-12-19 18:38:59,697 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 49 [2021-12-19 18:38:59,698 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 18:38:59,698 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 18:38:59,704 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2021-12-19 18:38:59,704 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-19 18:38:59,704 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-19 18:38:59,705 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) [2021-12-19 18:38:59,712 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 49 [2021-12-19 18:38:59,713 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 18:38:59,713 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 18:38:59,715 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2021-12-19 18:38:59,715 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-19 18:38:59,722 INFO L791 eck$LassoCheckResult]: Stem: 50#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); 38#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; 19#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; 4#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; 16#L59-1true [2021-12-19 18:38:59,723 INFO L793 eck$LassoCheckResult]: Loop: 16#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; 51#L38-2true assume !true; 35#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; 15#L18-30true assume !(0 == __VERIFIER_assert_~cond#1); 20#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; 33#L18-33true assume !(0 == __VERIFIER_assert_~cond#1); 14#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; 16#L59-1true [2021-12-19 18:38:59,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 18:38:59,733 INFO L85 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 1 times [2021-12-19 18:38:59,741 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 18:38:59,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412942372] [2021-12-19 18:38:59,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 18:38:59,743 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 18:38:59,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 18:38:59,843 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 18:38:59,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 18:38:59,894 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 18:38:59,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 18:38:59,897 INFO L85 PathProgramCache]: Analyzing trace with hash -947861826, now seen corresponding path program 1 times [2021-12-19 18:38:59,898 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 18:38:59,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329460667] [2021-12-19 18:38:59,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 18:38:59,900 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 18:38:59,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 18:38:59,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 18:38:59,946 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 18:38:59,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329460667] [2021-12-19 18:38:59,948 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329460667] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 18:38:59,948 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 18:38:59,948 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-19 18:38:59,948 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057469528] [2021-12-19 18:38:59,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 18:38:59,955 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-19 18:38:59,956 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 18:38:59,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-19 18:38:59,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-19 18:38:59,987 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) [2021-12-19 18:38:59,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 18:38:59,995 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2021-12-19 18:38:59,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-19 18:39:00,001 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 64 transitions. [2021-12-19 18:39:00,003 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2021-12-19 18:39:00,007 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 39 states and 45 transitions. [2021-12-19 18:39:00,008 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2021-12-19 18:39:00,009 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2021-12-19 18:39:00,009 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 45 transitions. [2021-12-19 18:39:00,010 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-19 18:39:00,010 INFO L681 BuchiCegarLoop]: Abstraction has 39 states and 45 transitions. [2021-12-19 18:39:00,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 45 transitions. [2021-12-19 18:39:00,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2021-12-19 18:39:00,038 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) [2021-12-19 18:39:00,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2021-12-19 18:39:00,051 INFO L704 BuchiCegarLoop]: Abstraction has 39 states and 45 transitions. [2021-12-19 18:39:00,051 INFO L587 BuchiCegarLoop]: Abstraction has 39 states and 45 transitions. [2021-12-19 18:39:00,051 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-19 18:39:00,052 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 45 transitions. [2021-12-19 18:39:00,054 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2021-12-19 18:39:00,054 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 18:39:00,055 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 18:39:00,055 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2021-12-19 18:39:00,055 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-19 18:39:00,056 INFO L791 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 [2021-12-19 18:39:00,056 INFO L793 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 [2021-12-19 18:39:00,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 18:39:00,059 INFO L85 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 2 times [2021-12-19 18:39:00,059 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 18:39:00,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391156385] [2021-12-19 18:39:00,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 18:39:00,060 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 18:39:00,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 18:39:00,085 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 18:39:00,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 18:39:00,116 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 18:39:00,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 18:39:00,117 INFO L85 PathProgramCache]: Analyzing trace with hash -145650952, now seen corresponding path program 1 times [2021-12-19 18:39:00,117 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 18:39:00,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813321385] [2021-12-19 18:39:00,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 18:39:00,118 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 18:39:00,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 18:39:00,126 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 18:39:00,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 18:39:00,135 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 18:39:00,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 18:39:00,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1814169905, now seen corresponding path program 1 times [2021-12-19 18:39:00,137 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 18:39:00,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75380578] [2021-12-19 18:39:00,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 18:39:00,137 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 18:39:00,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 18:39:00,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 18:39:00,173 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 18:39:00,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75380578] [2021-12-19 18:39:00,174 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75380578] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 18:39:00,174 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 18:39:00,174 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-19 18:39:00,174 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053458102] [2021-12-19 18:39:00,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 18:39:00,343 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 18:39:00,344 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 18:39:00,344 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 18:39:00,345 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 18:39:00,345 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-12-19 18:39:00,345 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 18:39:00,345 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 18:39:00,345 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 18:39:00,345 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration2_Loop [2021-12-19 18:39:00,346 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 18:39:00,346 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 18:39:00,362 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 18:39:00,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 18:39:00,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 18:39:00,465 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 18:39:00,465 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-12-19 18:39:00,467 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 18:39:00,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 18:39:00,499 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 18:39:00,509 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-19 18:39:00,509 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 18:39:00,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2021-12-19 18:39:00,549 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2021-12-19 18:39:00,550 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 18:39:00,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 18:39:00,551 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 18:39:00,560 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-12-19 18:39:00,560 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 18:39:00,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2021-12-19 18:39:00,848 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-12-19 18:39:00,859 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 [2021-12-19 18:39:00,859 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 18:39:00,859 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 18:39:00,860 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 18:39:00,860 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 18:39:00,860 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-19 18:39:00,860 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 18:39:00,860 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 18:39:00,860 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 18:39:00,860 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration2_Loop [2021-12-19 18:39:00,860 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 18:39:00,860 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 18:39:00,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 18:39:00,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 18:39:00,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 18:39:00,960 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 18:39:00,964 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-19 18:39:00,965 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 18:39:00,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 18:39:00,967 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 18:39:00,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2021-12-19 18:39:00,970 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 18:39:00,978 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 18:39:00,978 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 18:39:00,979 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 18:39:00,979 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 18:39:00,979 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 18:39:00,983 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 18:39:00,984 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 18:39:01,000 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 18:39:01,026 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2021-12-19 18:39:01,027 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 18:39:01,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 18:39:01,029 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 18:39:01,038 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 18:39:01,047 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 18:39:01,047 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 18:39:01,047 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 18:39:01,047 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 18:39:01,047 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 18:39:01,051 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 18:39:01,051 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 18:39:01,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2021-12-19 18:39:01,063 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-19 18:39:01,071 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-12-19 18:39:01,071 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2021-12-19 18:39:01,073 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 18:39:01,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 18:39:01,074 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 18:39:01,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2021-12-19 18:39:01,077 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-19 18:39:01,077 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-12-19 18:39:01,077 INFO L513 LassoAnalysis]: Proved termination. [2021-12-19 18:39:01,077 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 [] [2021-12-19 18:39:01,104 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2021-12-19 18:39:01,107 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-12-19 18:39:01,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 18:39:01,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 18:39:01,147 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-19 18:39:01,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 18:39:01,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 18:39:01,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-19 18:39:01,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 18:39:01,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 18:39:01,212 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 [2021-12-19 18:39:01,213 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) [2021-12-19 18:39:01,258 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. [2021-12-19 18:39:01,258 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 [2021-12-19 18:39:01,259 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) [2021-12-19 18:39:01,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2021-12-19 18:39:01,261 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 86 transitions. Stem has 4 letters. Loop has 7 letters. [2021-12-19 18:39:01,262 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 18:39:01,262 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 86 transitions. Stem has 11 letters. Loop has 7 letters. [2021-12-19 18:39:01,262 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 18:39:01,262 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 86 transitions. Stem has 4 letters. Loop has 14 letters. [2021-12-19 18:39:01,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 18:39:01,263 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 112 states and 130 transitions. [2021-12-19 18:39:01,265 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 66 [2021-12-19 18:39:01,266 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 112 states to 108 states and 126 transitions. [2021-12-19 18:39:01,266 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 71 [2021-12-19 18:39:01,267 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 72 [2021-12-19 18:39:01,267 INFO L73 IsDeterministic]: Start isDeterministic. Operand 108 states and 126 transitions. [2021-12-19 18:39:01,267 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 18:39:01,267 INFO L681 BuchiCegarLoop]: Abstraction has 108 states and 126 transitions. [2021-12-19 18:39:01,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states and 126 transitions. [2021-12-19 18:39:01,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2021-12-19 18:39:01,273 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) [2021-12-19 18:39:01,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 124 transitions. [2021-12-19 18:39:01,274 INFO L704 BuchiCegarLoop]: Abstraction has 107 states and 124 transitions. [2021-12-19 18:39:01,282 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 18:39:01,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-19 18:39:01,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-19 18:39:01,283 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) [2021-12-19 18:39:01,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 18:39:01,319 INFO L93 Difference]: Finished difference Result 129 states and 148 transitions. [2021-12-19 18:39:01,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-19 18:39:01,320 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 129 states and 148 transitions. [2021-12-19 18:39:01,322 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 93 [2021-12-19 18:39:01,323 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 129 states to 98 states and 112 transitions. [2021-12-19 18:39:01,323 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 98 [2021-12-19 18:39:01,324 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 98 [2021-12-19 18:39:01,324 INFO L73 IsDeterministic]: Start isDeterministic. Operand 98 states and 112 transitions. [2021-12-19 18:39:01,324 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-19 18:39:01,324 INFO L681 BuchiCegarLoop]: Abstraction has 98 states and 112 transitions. [2021-12-19 18:39:01,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states and 112 transitions. [2021-12-19 18:39:01,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 66. [2021-12-19 18:39:01,331 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2021-12-19 18:39:01,332 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) [2021-12-19 18:39:01,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 76 transitions. [2021-12-19 18:39:01,332 INFO L704 BuchiCegarLoop]: Abstraction has 66 states and 76 transitions. [2021-12-19 18:39:01,332 INFO L587 BuchiCegarLoop]: Abstraction has 66 states and 76 transitions. [2021-12-19 18:39:01,333 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-19 18:39:01,333 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 66 states and 76 transitions. [2021-12-19 18:39:01,333 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 62 [2021-12-19 18:39:01,333 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 18:39:01,333 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 18:39:01,334 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2021-12-19 18:39:01,334 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-19 18:39:01,334 INFO L791 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 [2021-12-19 18:39:01,334 INFO L793 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 [2021-12-19 18:39:01,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 18:39:01,335 INFO L85 PathProgramCache]: Analyzing trace with hash 925670, now seen corresponding path program 1 times [2021-12-19 18:39:01,335 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 18:39:01,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090604351] [2021-12-19 18:39:01,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 18:39:01,335 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 18:39:01,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 18:39:01,347 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 18:39:01,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 18:39:01,365 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 18:39:01,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 18:39:01,366 INFO L85 PathProgramCache]: Analyzing trace with hash -145650952, now seen corresponding path program 2 times [2021-12-19 18:39:01,366 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 18:39:01,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906005023] [2021-12-19 18:39:01,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 18:39:01,367 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 18:39:01,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 18:39:01,377 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 18:39:01,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 18:39:01,384 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 18:39:01,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 18:39:01,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1671450765, now seen corresponding path program 1 times [2021-12-19 18:39:01,385 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 18:39:01,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885221741] [2021-12-19 18:39:01,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 18:39:01,386 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 18:39:01,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 18:39:01,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 18:39:01,422 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 18:39:01,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885221741] [2021-12-19 18:39:01,422 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885221741] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 18:39:01,422 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 18:39:01,423 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-19 18:39:01,423 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10982582] [2021-12-19 18:39:01,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 18:39:01,503 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 18:39:01,503 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 18:39:01,503 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 18:39:01,504 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 18:39:01,504 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-12-19 18:39:01,504 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 18:39:01,504 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 18:39:01,504 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 18:39:01,504 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration3_Loop [2021-12-19 18:39:01,504 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 18:39:01,504 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 18:39:01,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 18:39:01,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 18:39:01,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 18:39:01,567 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 18:39:01,568 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-12-19 18:39:01,568 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 18:39:01,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 18:39:01,571 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 18:39:01,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2021-12-19 18:39:01,577 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-19 18:39:01,577 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 18:39:01,594 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-19 18:39:01,594 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: [] [2021-12-19 18:39:01,610 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2021-12-19 18:39:01,611 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 18:39:01,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 18:39:01,612 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 18:39:01,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2021-12-19 18:39:01,620 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-19 18:39:01,621 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 18:39:01,649 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-19 18:39:01,649 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: [] [2021-12-19 18:39:01,676 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2021-12-19 18:39:01,677 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 18:39:01,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 18:39:01,679 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 18:39:01,686 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-19 18:39:01,686 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 18:39:01,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2021-12-19 18:39:01,737 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2021-12-19 18:39:01,737 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 18:39:01,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 18:39:01,739 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 18:39:01,746 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-12-19 18:39:01,746 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 18:39:01,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2021-12-19 18:39:01,997 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-12-19 18:39:02,001 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2021-12-19 18:39:02,002 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 18:39:02,002 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 18:39:02,002 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 18:39:02,002 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 18:39:02,002 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-19 18:39:02,002 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 18:39:02,002 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 18:39:02,002 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 18:39:02,002 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration3_Loop [2021-12-19 18:39:02,003 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 18:39:02,003 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 18:39:02,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 18:39:02,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 18:39:02,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 18:39:02,094 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 18:39:02,095 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-19 18:39:02,095 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 18:39:02,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 18:39:02,100 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 18:39:02,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2021-12-19 18:39:02,103 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 18:39:02,110 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 18:39:02,111 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 18:39:02,111 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 18:39:02,111 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 18:39:02,111 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 18:39:02,112 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 18:39:02,112 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 18:39:02,125 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 18:39:02,152 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2021-12-19 18:39:02,152 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 18:39:02,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 18:39:02,154 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 18:39:02,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2021-12-19 18:39:02,158 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 18:39:02,166 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 18:39:02,166 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 18:39:02,166 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 18:39:02,166 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 18:39:02,166 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 18:39:02,170 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 18:39:02,170 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 18:39:02,187 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-19 18:39:02,191 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-12-19 18:39:02,191 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2021-12-19 18:39:02,192 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 18:39:02,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 18:39:02,196 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) [2021-12-19 18:39:02,236 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 [2021-12-19 18:39:02,236 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-19 18:39:02,237 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-12-19 18:39:02,237 INFO L513 LassoAnalysis]: Proved termination. [2021-12-19 18:39:02,237 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 [] [2021-12-19 18:39:02,260 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2021-12-19 18:39:02,260 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-12-19 18:39:02,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 18:39:02,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 18:39:02,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-19 18:39:02,290 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 18:39:02,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 18:39:02,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-19 18:39:02,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 18:39:02,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 18:39:02,353 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 [2021-12-19 18:39:02,354 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) [2021-12-19 18:39:02,394 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. [2021-12-19 18:39:02,395 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 [2021-12-19 18:39:02,395 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) [2021-12-19 18:39:02,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions. [2021-12-19 18:39:02,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 81 transitions. Stem has 4 letters. Loop has 7 letters. [2021-12-19 18:39:02,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 18:39:02,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 81 transitions. Stem has 11 letters. Loop has 7 letters. [2021-12-19 18:39:02,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 18:39:02,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 81 transitions. Stem has 4 letters. Loop has 14 letters. [2021-12-19 18:39:02,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 18:39:02,398 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 160 states and 185 transitions. [2021-12-19 18:39:02,399 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 87 [2021-12-19 18:39:02,400 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 160 states to 125 states and 145 transitions. [2021-12-19 18:39:02,401 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 93 [2021-12-19 18:39:02,401 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 94 [2021-12-19 18:39:02,401 INFO L73 IsDeterministic]: Start isDeterministic. Operand 125 states and 145 transitions. [2021-12-19 18:39:02,401 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 18:39:02,402 INFO L681 BuchiCegarLoop]: Abstraction has 125 states and 145 transitions. [2021-12-19 18:39:02,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states and 145 transitions. [2021-12-19 18:39:02,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 67. [2021-12-19 18:39:02,405 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) [2021-12-19 18:39:02,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 78 transitions. [2021-12-19 18:39:02,406 INFO L704 BuchiCegarLoop]: Abstraction has 67 states and 78 transitions. [2021-12-19 18:39:02,406 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 18:39:02,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-19 18:39:02,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-19 18:39:02,407 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) [2021-12-19 18:39:02,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 18:39:02,549 INFO L93 Difference]: Finished difference Result 207 states and 231 transitions. [2021-12-19 18:39:02,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-19 18:39:02,550 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 207 states and 231 transitions. [2021-12-19 18:39:02,551 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 128 [2021-12-19 18:39:02,553 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 207 states to 207 states and 231 transitions. [2021-12-19 18:39:02,553 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 155 [2021-12-19 18:39:02,553 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 155 [2021-12-19 18:39:02,554 INFO L73 IsDeterministic]: Start isDeterministic. Operand 207 states and 231 transitions. [2021-12-19 18:39:02,554 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 18:39:02,554 INFO L681 BuchiCegarLoop]: Abstraction has 207 states and 231 transitions. [2021-12-19 18:39:02,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states and 231 transitions. [2021-12-19 18:39:02,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 69. [2021-12-19 18:39:02,558 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) [2021-12-19 18:39:02,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 80 transitions. [2021-12-19 18:39:02,559 INFO L704 BuchiCegarLoop]: Abstraction has 69 states and 80 transitions. [2021-12-19 18:39:02,559 INFO L587 BuchiCegarLoop]: Abstraction has 69 states and 80 transitions. [2021-12-19 18:39:02,559 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-19 18:39:02,559 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states and 80 transitions. [2021-12-19 18:39:02,560 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 31 [2021-12-19 18:39:02,560 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 18:39:02,560 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 18:39:02,561 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2021-12-19 18:39:02,561 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-19 18:39:02,561 INFO L791 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 [2021-12-19 18:39:02,561 INFO L793 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 [2021-12-19 18:39:02,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 18:39:02,562 INFO L85 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 3 times [2021-12-19 18:39:02,562 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 18:39:02,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758241956] [2021-12-19 18:39:02,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 18:39:02,562 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 18:39:02,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 18:39:02,569 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 18:39:02,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 18:39:02,576 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 18:39:02,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 18:39:02,582 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 [2021-12-19 18:39:02,586 INFO L85 PathProgramCache]: Analyzing trace with hash -124656242, now seen corresponding path program 1 times [2021-12-19 18:39:02,586 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 18:39:02,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120411751] [2021-12-19 18:39:02,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 18:39:02,587 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 18:39:02,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 18:39:02,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 18:39:02,614 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 18:39:02,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120411751] [2021-12-19 18:39:02,615 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120411751] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 18:39:02,615 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 18:39:02,615 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-19 18:39:02,615 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322013596] [2021-12-19 18:39:02,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 18:39:02,616 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-19 18:39:02,616 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 18:39:02,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-19 18:39:02,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-19 18:39:02,617 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) [2021-12-19 18:39:02,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 18:39:02,668 INFO L93 Difference]: Finished difference Result 129 states and 146 transitions. [2021-12-19 18:39:02,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-19 18:39:02,669 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 129 states and 146 transitions. [2021-12-19 18:39:02,670 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 61 [2021-12-19 18:39:02,671 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 129 states to 128 states and 145 transitions. [2021-12-19 18:39:02,671 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 67 [2021-12-19 18:39:02,672 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 67 [2021-12-19 18:39:02,672 INFO L73 IsDeterministic]: Start isDeterministic. Operand 128 states and 145 transitions. [2021-12-19 18:39:02,672 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 18:39:02,672 INFO L681 BuchiCegarLoop]: Abstraction has 128 states and 145 transitions. [2021-12-19 18:39:02,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states and 145 transitions. [2021-12-19 18:39:02,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 69. [2021-12-19 18:39:02,678 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) [2021-12-19 18:39:02,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 80 transitions. [2021-12-19 18:39:02,679 INFO L704 BuchiCegarLoop]: Abstraction has 69 states and 80 transitions. [2021-12-19 18:39:02,679 INFO L587 BuchiCegarLoop]: Abstraction has 69 states and 80 transitions. [2021-12-19 18:39:02,679 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-12-19 18:39:02,679 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states and 80 transitions. [2021-12-19 18:39:02,680 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 32 [2021-12-19 18:39:02,680 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 18:39:02,680 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 18:39:02,680 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2021-12-19 18:39:02,681 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 18:39:02,682 INFO L791 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 [2021-12-19 18:39:02,682 INFO L793 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 [2021-12-19 18:39:02,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 18:39:02,683 INFO L85 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 4 times [2021-12-19 18:39:02,683 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 18:39:02,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650391314] [2021-12-19 18:39:02,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 18:39:02,684 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 18:39:02,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 18:39:02,703 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 18:39:02,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 18:39:02,722 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 18:39:02,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 18:39:02,722 INFO L85 PathProgramCache]: Analyzing trace with hash -470789538, now seen corresponding path program 1 times [2021-12-19 18:39:02,723 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 18:39:02,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842752561] [2021-12-19 18:39:02,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 18:39:02,725 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 18:39:02,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 18:39:02,739 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 18:39:02,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 18:39:02,755 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 18:39:02,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 18:39:02,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1515786757, now seen corresponding path program 1 times [2021-12-19 18:39:02,758 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 18:39:02,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67673320] [2021-12-19 18:39:02,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 18:39:02,761 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 18:39:02,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 18:39:02,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 18:39:02,800 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 18:39:02,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67673320] [2021-12-19 18:39:02,800 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67673320] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 18:39:02,800 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 18:39:02,801 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-19 18:39:02,801 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941078110] [2021-12-19 18:39:02,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 18:39:02,946 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 18:39:02,946 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 18:39:02,946 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 18:39:02,947 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 18:39:02,947 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-12-19 18:39:02,947 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 18:39:02,947 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 18:39:02,947 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 18:39:02,947 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration5_Loop [2021-12-19 18:39:02,947 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 18:39:02,947 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 18:39:02,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 18:39:02,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 18:39:02,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 18:39:02,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 18:39:03,025 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 18:39:03,026 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-12-19 18:39:03,026 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 18:39:03,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 18:39:03,027 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 18:39:03,039 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-19 18:39:03,039 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 18:39:03,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2021-12-19 18:39:03,060 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-19 18:39:03,060 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: [] [2021-12-19 18:39:03,084 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2021-12-19 18:39:03,085 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 18:39:03,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 18:39:03,086 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 18:39:03,092 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-19 18:39:03,092 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 18:39:03,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2021-12-19 18:39:03,105 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-19 18:39:03,106 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet5#1=-1} Honda state: {ULTIMATE.start_main_#t~nondet5#1=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-12-19 18:39:03,123 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2021-12-19 18:39:03,124 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 18:39:03,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 18:39:03,125 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 18:39:03,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2021-12-19 18:39:03,127 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-19 18:39:03,127 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 18:39:03,164 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2021-12-19 18:39:03,164 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 18:39:03,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 18:39:03,165 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 18:39:03,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2021-12-19 18:39:03,172 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-12-19 18:39:03,172 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 18:39:03,227 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-12-19 18:39:03,234 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2021-12-19 18:39:03,234 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 18:39:03,234 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 18:39:03,235 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 18:39:03,235 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 18:39:03,235 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-19 18:39:03,235 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 18:39:03,235 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 18:39:03,235 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 18:39:03,235 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration5_Loop [2021-12-19 18:39:03,235 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 18:39:03,235 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 18:39:03,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 18:39:03,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 18:39:03,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 18:39:03,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 18:39:03,316 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 18:39:03,317 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-19 18:39:03,317 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 18:39:03,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 18:39:03,321 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 18:39:03,334 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 18:39:03,342 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 18:39:03,342 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 18:39:03,342 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 18:39:03,342 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2021-12-19 18:39:03,342 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 18:39:03,344 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-12-19 18:39:03,344 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 18:39:03,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2021-12-19 18:39:03,355 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 18:39:03,381 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2021-12-19 18:39:03,382 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 18:39:03,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 18:39:03,383 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 18:39:03,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2021-12-19 18:39:03,386 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 18:39:03,394 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 18:39:03,394 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 18:39:03,394 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 18:39:03,394 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 18:39:03,394 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 18:39:03,398 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 18:39:03,398 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 18:39:03,412 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-19 18:39:03,416 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-12-19 18:39:03,416 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2021-12-19 18:39:03,416 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 18:39:03,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 18:39:03,418 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 18:39:03,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2021-12-19 18:39:03,426 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-19 18:39:03,426 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-12-19 18:39:03,426 INFO L513 LassoAnalysis]: Proved termination. [2021-12-19 18:39:03,426 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 [] [2021-12-19 18:39:03,443 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2021-12-19 18:39:03,444 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-12-19 18:39:03,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 18:39:03,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 18:39:03,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-19 18:39:03,498 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 18:39:03,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 18:39:03,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-19 18:39:03,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 18:39:03,532 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2021-12-19 18:39:03,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 18:39:03,601 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 [2021-12-19 18:39:03,601 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) [2021-12-19 18:39:03,622 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. [2021-12-19 18:39:03,622 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 [2021-12-19 18:39:03,623 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) [2021-12-19 18:39:03,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2021-12-19 18:39:03,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 80 transitions. Stem has 4 letters. Loop has 14 letters. [2021-12-19 18:39:03,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 18:39:03,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 80 transitions. Stem has 18 letters. Loop has 14 letters. [2021-12-19 18:39:03,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 18:39:03,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 80 transitions. Stem has 4 letters. Loop has 28 letters. [2021-12-19 18:39:03,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 18:39:03,625 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 133 states and 153 transitions. [2021-12-19 18:39:03,626 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 57 [2021-12-19 18:39:03,627 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 133 states to 128 states and 147 transitions. [2021-12-19 18:39:03,627 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63 [2021-12-19 18:39:03,627 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 64 [2021-12-19 18:39:03,627 INFO L73 IsDeterministic]: Start isDeterministic. Operand 128 states and 147 transitions. [2021-12-19 18:39:03,627 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 18:39:03,628 INFO L681 BuchiCegarLoop]: Abstraction has 128 states and 147 transitions. [2021-12-19 18:39:03,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states and 147 transitions. [2021-12-19 18:39:03,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2021-12-19 18:39:03,631 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) [2021-12-19 18:39:03,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 146 transitions. [2021-12-19 18:39:03,632 INFO L704 BuchiCegarLoop]: Abstraction has 127 states and 146 transitions. [2021-12-19 18:39:03,632 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 18:39:03,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-19 18:39:03,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-19 18:39:03,633 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) [2021-12-19 18:39:03,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 18:39:03,655 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2021-12-19 18:39:03,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-19 18:39:03,656 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 70 states and 80 transitions. [2021-12-19 18:39:03,657 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 32 [2021-12-19 18:39:03,657 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 70 states to 69 states and 79 transitions. [2021-12-19 18:39:03,657 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2021-12-19 18:39:03,658 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2021-12-19 18:39:03,658 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 79 transitions. [2021-12-19 18:39:03,658 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 18:39:03,658 INFO L681 BuchiCegarLoop]: Abstraction has 69 states and 79 transitions. [2021-12-19 18:39:03,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 79 transitions. [2021-12-19 18:39:03,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2021-12-19 18:39:03,660 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) [2021-12-19 18:39:03,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 79 transitions. [2021-12-19 18:39:03,660 INFO L704 BuchiCegarLoop]: Abstraction has 69 states and 79 transitions. [2021-12-19 18:39:03,661 INFO L587 BuchiCegarLoop]: Abstraction has 69 states and 79 transitions. [2021-12-19 18:39:03,661 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-12-19 18:39:03,661 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states and 79 transitions. [2021-12-19 18:39:03,661 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 32 [2021-12-19 18:39:03,661 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 18:39:03,661 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 18:39:03,662 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2021-12-19 18:39:03,662 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 18:39:03,662 INFO L791 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 [2021-12-19 18:39:03,662 INFO L793 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 [2021-12-19 18:39:03,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 18:39:03,663 INFO L85 PathProgramCache]: Analyzing trace with hash 28695791, now seen corresponding path program 1 times [2021-12-19 18:39:03,663 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 18:39:03,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735952353] [2021-12-19 18:39:03,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 18:39:03,663 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 18:39:03,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 18:39:03,669 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 18:39:03,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 18:39:03,686 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 18:39:03,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 18:39:03,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1285304700, now seen corresponding path program 2 times [2021-12-19 18:39:03,688 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 18:39:03,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118295753] [2021-12-19 18:39:03,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 18:39:03,691 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 18:39:03,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 18:39:03,700 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 18:39:03,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 18:39:03,707 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 18:39:03,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 18:39:03,707 INFO L85 PathProgramCache]: Analyzing trace with hash 765817586, now seen corresponding path program 1 times [2021-12-19 18:39:03,707 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 18:39:03,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098807861] [2021-12-19 18:39:03,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 18:39:03,708 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 18:39:03,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 18:39:03,747 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 18:39:03,748 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 18:39:03,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098807861] [2021-12-19 18:39:03,748 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098807861] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 18:39:03,748 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 18:39:03,748 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-19 18:39:03,748 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975004630] [2021-12-19 18:39:03,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 18:39:03,884 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 18:39:03,884 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 18:39:03,884 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 18:39:03,884 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 18:39:03,884 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-12-19 18:39:03,884 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 18:39:03,884 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 18:39:03,885 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 18:39:03,885 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration6_Loop [2021-12-19 18:39:03,885 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 18:39:03,885 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 18:39:03,886 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 18:39:03,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 18:39:03,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 18:39:03,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 18:39:03,950 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 18:39:03,950 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-12-19 18:39:03,950 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 18:39:03,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 18:39:03,952 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) [2021-12-19 18:39:03,953 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 [2021-12-19 18:39:03,954 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-19 18:39:03,954 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 18:39:03,968 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-19 18:39:03,968 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet5#1=-1} Honda state: {ULTIMATE.start_main_#t~nondet5#1=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-12-19 18:39:03,984 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 [2021-12-19 18:39:03,984 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 18:39:03,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 18:39:03,985 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) [2021-12-19 18:39:03,986 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 [2021-12-19 18:39:03,987 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-19 18:39:03,987 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 18:39:04,016 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-19 18:39:04,016 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: [] [2021-12-19 18:39:04,033 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 [2021-12-19 18:39:04,034 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 18:39:04,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 18:39:04,035 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) [2021-12-19 18:39:04,036 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 [2021-12-19 18:39:04,037 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-19 18:39:04,037 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 18:39:04,060 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2021-12-19 18:39:04,060 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 18:39:04,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 18:39:04,061 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) [2021-12-19 18:39:04,062 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 [2021-12-19 18:39:04,064 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-12-19 18:39:04,064 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 18:39:04,342 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-12-19 18:39:04,346 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 [2021-12-19 18:39:04,347 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 18:39:04,347 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 18:39:04,347 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 18:39:04,347 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 18:39:04,347 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-19 18:39:04,347 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 18:39:04,347 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 18:39:04,347 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 18:39:04,347 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration6_Loop [2021-12-19 18:39:04,347 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 18:39:04,347 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 18:39:04,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 18:39:04,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 18:39:04,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 18:39:04,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 18:39:04,423 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 18:39:04,423 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-19 18:39:04,423 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 18:39:04,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 18:39:04,424 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) [2021-12-19 18:39:04,425 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 [2021-12-19 18:39:04,426 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 18:39:04,432 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 18:39:04,433 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 18:39:04,433 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 18:39:04,433 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2021-12-19 18:39:04,433 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 18:39:04,433 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-12-19 18:39:04,434 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 18:39:04,438 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 18:39:04,454 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 [2021-12-19 18:39:04,454 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 18:39:04,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 18:39:04,455 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) [2021-12-19 18:39:04,456 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 [2021-12-19 18:39:04,457 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 18:39:04,464 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 18:39:04,464 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 18:39:04,464 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 18:39:04,464 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 18:39:04,464 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 18:39:04,467 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 18:39:04,467 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 18:39:04,469 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-19 18:39:04,472 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-12-19 18:39:04,472 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2021-12-19 18:39:04,472 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 18:39:04,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 18:39:04,473 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 18:39:04,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2021-12-19 18:39:04,475 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-19 18:39:04,475 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-12-19 18:39:04,475 INFO L513 LassoAnalysis]: Proved termination. [2021-12-19 18:39:04,475 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0#1) = 1*ULTIMATE.start_main_~j~0#1 Supporting invariants [] [2021-12-19 18:39:04,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2021-12-19 18:39:04,492 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-12-19 18:39:04,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 18:39:04,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 18:39:04,527 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-19 18:39:04,527 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 18:39:04,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 18:39:04,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-19 18:39:04,582 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 18:39:04,584 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2021-12-19 18:39:04,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 18:39:04,655 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2021-12-19 18:39:04,655 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 69 states and 79 transitions. cyclomatic complexity: 12 Second operand has 6 states, 6 states have (on average 3.1666666666666665) 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) [2021-12-19 18:39:04,808 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 69 states and 79 transitions. cyclomatic complexity: 12. Second operand has 6 states, 6 states have (on average 3.1666666666666665) 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) Result 400 states and 442 transitions. Complement of second has 17 states. [2021-12-19 18:39:04,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 7 non-accepting loop states 1 accepting loop states [2021-12-19 18:39:04,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.1666666666666665) 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) [2021-12-19 18:39:04,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 109 transitions. [2021-12-19 18:39:04,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 109 transitions. Stem has 5 letters. Loop has 14 letters. [2021-12-19 18:39:04,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 18:39:04,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 109 transitions. Stem has 19 letters. Loop has 14 letters. [2021-12-19 18:39:04,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 18:39:04,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 109 transitions. Stem has 5 letters. Loop has 28 letters. [2021-12-19 18:39:04,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 18:39:04,811 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 400 states and 442 transitions. [2021-12-19 18:39:04,814 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 71 [2021-12-19 18:39:04,816 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 400 states to 330 states and 371 transitions. [2021-12-19 18:39:04,816 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 108 [2021-12-19 18:39:04,816 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 109 [2021-12-19 18:39:04,817 INFO L73 IsDeterministic]: Start isDeterministic. Operand 330 states and 371 transitions. [2021-12-19 18:39:04,817 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 18:39:04,817 INFO L681 BuchiCegarLoop]: Abstraction has 330 states and 371 transitions. [2021-12-19 18:39:04,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states and 371 transitions. [2021-12-19 18:39:04,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 197. [2021-12-19 18:39:04,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 197 states have (on average 1.1573604060913705) internal successors, (228), 196 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 18:39:04,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 228 transitions. [2021-12-19 18:39:04,823 INFO L704 BuchiCegarLoop]: Abstraction has 197 states and 228 transitions. [2021-12-19 18:39:04,823 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 18:39:04,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-19 18:39:04,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-19 18:39:04,824 INFO L87 Difference]: Start difference. First operand 197 states and 228 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) [2021-12-19 18:39:04,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 18:39:04,941 INFO L93 Difference]: Finished difference Result 657 states and 728 transitions. [2021-12-19 18:39:04,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-19 18:39:04,942 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 657 states and 728 transitions. [2021-12-19 18:39:04,946 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 165 [2021-12-19 18:39:04,949 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 657 states to 593 states and 657 transitions. [2021-12-19 18:39:04,949 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 198 [2021-12-19 18:39:04,949 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 211 [2021-12-19 18:39:04,949 INFO L73 IsDeterministic]: Start isDeterministic. Operand 593 states and 657 transitions. [2021-12-19 18:39:04,950 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 18:39:04,950 INFO L681 BuchiCegarLoop]: Abstraction has 593 states and 657 transitions. [2021-12-19 18:39:04,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states and 657 transitions. [2021-12-19 18:39:04,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 189. [2021-12-19 18:39:04,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 189 states have (on average 1.1534391534391535) internal successors, (218), 188 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 18:39:04,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 218 transitions. [2021-12-19 18:39:04,955 INFO L704 BuchiCegarLoop]: Abstraction has 189 states and 218 transitions. [2021-12-19 18:39:04,955 INFO L587 BuchiCegarLoop]: Abstraction has 189 states and 218 transitions. [2021-12-19 18:39:04,955 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-12-19 18:39:04,956 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 189 states and 218 transitions. [2021-12-19 18:39:04,956 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 58 [2021-12-19 18:39:04,957 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 18:39:04,957 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 18:39:04,957 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2021-12-19 18:39:04,957 INFO L843 BuchiCegarLoop]: 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] [2021-12-19 18:39:04,958 INFO L791 eck$LassoCheckResult]: Stem: 3309#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); 3269#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; 3270#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; 3253#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; 3254#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; 3287#L38-2 [2021-12-19 18:39:04,958 INFO L793 eck$LassoCheckResult]: Loop: 3287#L38-2 assume !!(main_~j~0#1 <= main_~r~0#1); 3377#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; 3354#L18 assume !(0 == __VERIFIER_assert_~cond#1); 3371#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; 3369#L18-3 assume !(0 == __VERIFIER_assert_~cond#1); 3367#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; 3365#L18-6 assume !(0 == __VERIFIER_assert_~cond#1); 3363#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; 3361#L18-9 assume !(0 == __VERIFIER_assert_~cond#1); 3359#L18-11 assume { :end_inline___VERIFIER_assert } true; 3355#L44 assume 0 != main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; 3349#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; 3345#L18-12 assume !(0 == __VERIFIER_assert_~cond#1); 3341#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; 3337#L18-15 assume !(0 == __VERIFIER_assert_~cond#1); 3333#L18-17 assume { :end_inline___VERIFIER_assert } true; 3324#L49 assume 0 != main_#t~nondet5#1;havoc main_#t~nondet5#1; 3259#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; 3260#L18-36 assume !(0 == __VERIFIER_assert_~cond#1); 3267#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; 3268#L18-39 assume !(0 == __VERIFIER_assert_~cond#1); 3271#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; 3281#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; 3287#L38-2 [2021-12-19 18:39:04,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 18:39:04,958 INFO L85 PathProgramCache]: Analyzing trace with hash 28695791, now seen corresponding path program 2 times [2021-12-19 18:39:04,959 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 18:39:04,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053532028] [2021-12-19 18:39:04,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 18:39:04,959 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 18:39:04,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 18:39:04,965 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 18:39:04,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 18:39:04,971 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 18:39:04,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 18:39:04,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1619896972, now seen corresponding path program 1 times [2021-12-19 18:39:04,972 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 18:39:04,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289585780] [2021-12-19 18:39:04,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 18:39:04,972 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 18:39:04,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 18:39:04,983 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 18:39:04,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 18:39:04,993 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 18:39:04,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 18:39:04,993 INFO L85 PathProgramCache]: Analyzing trace with hash -478993954, now seen corresponding path program 1 times [2021-12-19 18:39:04,994 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 18:39:04,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274804624] [2021-12-19 18:39:04,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 18:39:04,994 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 18:39:05,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 18:39:05,004 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 18:39:05,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 18:39:05,019 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 18:39:05,249 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 18:39:05,249 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 18:39:05,250 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 18:39:05,250 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 18:39:05,250 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-12-19 18:39:05,250 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 18:39:05,250 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 18:39:05,250 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 18:39:05,250 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration7_Loop [2021-12-19 18:39:05,250 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 18:39:05,250 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 18:39:05,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 18:39:05,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 18:39:05,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 18:39:05,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 18:39:05,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 18:39:05,344 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 18:39:05,344 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-12-19 18:39:05,344 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 18:39:05,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 18:39:05,347 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) [2021-12-19 18:39:05,349 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 [2021-12-19 18:39:05,351 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-19 18:39:05,351 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 18:39:05,372 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-19 18:39:05,372 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet5#1=-1} Honda state: {ULTIMATE.start_main_#t~nondet5#1=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-12-19 18:39:05,398 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 [2021-12-19 18:39:05,398 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 18:39:05,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 18:39:05,400 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) [2021-12-19 18:39:05,401 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 [2021-12-19 18:39:05,402 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-19 18:39:05,402 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 18:39:05,449 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 [2021-12-19 18:39:05,450 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 18:39:05,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 18:39:05,451 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) [2021-12-19 18:39:05,455 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-12-19 18:39:05,456 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 18:39:05,475 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 [2021-12-19 18:39:05,631 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-12-19 18:39:05,635 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 [2021-12-19 18:39:05,635 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 18:39:05,635 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 18:39:05,635 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 18:39:05,636 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 18:39:05,636 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-19 18:39:05,636 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 18:39:05,636 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 18:39:05,636 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 18:39:05,636 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration7_Loop [2021-12-19 18:39:05,636 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 18:39:05,636 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 18:39:05,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 18:39:05,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 18:39:05,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 18:39:05,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 18:39:05,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 18:39:05,731 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 18:39:05,732 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-19 18:39:05,732 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 18:39:05,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 18:39:05,733 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) [2021-12-19 18:39:05,740 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 18:39:05,743 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 [2021-12-19 18:39:05,747 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 18:39:05,747 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 18:39:05,747 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 18:39:05,747 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2021-12-19 18:39:05,747 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 18:39:05,748 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-12-19 18:39:05,748 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 18:39:05,749 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 18:39:05,764 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2021-12-19 18:39:05,764 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 18:39:05,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 18:39:05,765 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) [2021-12-19 18:39:05,766 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 [2021-12-19 18:39:05,768 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 18:39:05,774 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 18:39:05,774 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 18:39:05,774 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 18:39:05,774 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 18:39:05,774 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 18:39:05,776 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 18:39:05,777 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 18:39:05,779 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-19 18:39:05,782 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-12-19 18:39:05,782 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2021-12-19 18:39:05,782 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 18:39:05,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 18:39:05,783 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) [2021-12-19 18:39:05,784 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 [2021-12-19 18:39:05,785 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-19 18:39:05,785 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-12-19 18:39:05,785 INFO L513 LassoAnalysis]: Proved termination. [2021-12-19 18:39:05,785 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 [] [2021-12-19 18:39:05,804 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 [2021-12-19 18:39:05,804 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-12-19 18:39:05,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 18:39:05,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 18:39:05,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-19 18:39:05,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 18:39:05,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 18:39:05,858 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-19 18:39:05,859 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 18:39:05,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 18:39:05,977 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 [2021-12-19 18:39:05,978 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 189 states and 218 transitions. cyclomatic complexity: 35 Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 18:39:06,005 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 189 states and 218 transitions. cyclomatic complexity: 35. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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 376 states and 436 transitions. Complement of second has 6 states. [2021-12-19 18:39:06,006 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 [2021-12-19 18:39:06,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 18:39:06,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2021-12-19 18:39:06,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 47 transitions. Stem has 5 letters. Loop has 23 letters. [2021-12-19 18:39:06,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 18:39:06,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 47 transitions. Stem has 28 letters. Loop has 23 letters. [2021-12-19 18:39:06,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 18:39:06,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 47 transitions. Stem has 5 letters. Loop has 46 letters. [2021-12-19 18:39:06,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 18:39:06,008 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 376 states and 436 transitions. [2021-12-19 18:39:06,011 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 50 [2021-12-19 18:39:06,013 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 376 states to 252 states and 292 transitions. [2021-12-19 18:39:06,013 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 60 [2021-12-19 18:39:06,013 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 61 [2021-12-19 18:39:06,013 INFO L73 IsDeterministic]: Start isDeterministic. Operand 252 states and 292 transitions. [2021-12-19 18:39:06,014 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 18:39:06,014 INFO L681 BuchiCegarLoop]: Abstraction has 252 states and 292 transitions. [2021-12-19 18:39:06,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states and 292 transitions. [2021-12-19 18:39:06,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 132. [2021-12-19 18:39:06,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 132 states have (on average 1.1590909090909092) internal successors, (153), 131 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 18:39:06,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 153 transitions. [2021-12-19 18:39:06,017 INFO L704 BuchiCegarLoop]: Abstraction has 132 states and 153 transitions. [2021-12-19 18:39:06,017 INFO L587 BuchiCegarLoop]: Abstraction has 132 states and 153 transitions. [2021-12-19 18:39:06,017 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-12-19 18:39:06,017 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 132 states and 153 transitions. [2021-12-19 18:39:06,018 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2021-12-19 18:39:06,018 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 18:39:06,018 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 18:39:06,019 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-12-19 18:39:06,019 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 18:39:06,019 INFO L791 eck$LassoCheckResult]: Stem: 3980#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); 3940#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; 3941#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; 3925#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; 3926#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; 3959#L38-2 assume !!(main_~j~0#1 <= main_~r~0#1); 3976#L39 [2021-12-19 18:39:06,019 INFO L793 eck$LassoCheckResult]: Loop: 3976#L39 assume !(main_~j~0#1 < main_~r~0#1); 3934#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; 3942#L18-12 assume !(0 == __VERIFIER_assert_~cond#1); 3943#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; 3981#L18-15 assume !(0 == __VERIFIER_assert_~cond#1); 3982#L18-17 assume { :end_inline___VERIFIER_assert } true; 3966#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; 3954#L18-18 assume !(0 == __VERIFIER_assert_~cond#1); 3955#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; 3968#L18-21 assume !(0 == __VERIFIER_assert_~cond#1); 3969#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; 3972#L18-24 assume !(0 == __VERIFIER_assert_~cond#1); 3973#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; 3995#L18-27 assume !(0 == __VERIFIER_assert_~cond#1); 3989#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; 3961#L38-2 assume !!(main_~j~0#1 <= main_~r~0#1); 3976#L39 [2021-12-19 18:39:06,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 18:39:06,020 INFO L85 PathProgramCache]: Analyzing trace with hash 889569551, now seen corresponding path program 1 times [2021-12-19 18:39:06,020 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 18:39:06,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866451630] [2021-12-19 18:39:06,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 18:39:06,021 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 18:39:06,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 18:39:06,025 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 18:39:06,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 18:39:06,030 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 18:39:06,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 18:39:06,031 INFO L85 PathProgramCache]: Analyzing trace with hash 184163919, now seen corresponding path program 1 times [2021-12-19 18:39:06,031 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 18:39:06,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550034421] [2021-12-19 18:39:06,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 18:39:06,032 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 18:39:06,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 18:39:06,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 18:39:06,072 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 18:39:06,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550034421] [2021-12-19 18:39:06,072 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550034421] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 18:39:06,073 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 18:39:06,073 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-19 18:39:06,073 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091082069] [2021-12-19 18:39:06,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 18:39:06,073 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-19 18:39:06,073 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 18:39:06,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-19 18:39:06,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-19 18:39:06,074 INFO L87 Difference]: Start difference. First operand 132 states and 153 transitions. cyclomatic complexity: 25 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) [2021-12-19 18:39:06,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 18:39:06,193 INFO L93 Difference]: Finished difference Result 227 states and 254 transitions. [2021-12-19 18:39:06,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-19 18:39:06,194 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 227 states and 254 transitions. [2021-12-19 18:39:06,195 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2021-12-19 18:39:06,196 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 227 states to 212 states and 239 transitions. [2021-12-19 18:39:06,196 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2021-12-19 18:39:06,196 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2021-12-19 18:39:06,197 INFO L73 IsDeterministic]: Start isDeterministic. Operand 212 states and 239 transitions. [2021-12-19 18:39:06,197 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 18:39:06,197 INFO L681 BuchiCegarLoop]: Abstraction has 212 states and 239 transitions. [2021-12-19 18:39:06,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states and 239 transitions. [2021-12-19 18:39:06,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 177. [2021-12-19 18:39:06,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 177 states have (on average 1.1299435028248588) internal successors, (200), 176 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 18:39:06,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 200 transitions. [2021-12-19 18:39:06,200 INFO L704 BuchiCegarLoop]: Abstraction has 177 states and 200 transitions. [2021-12-19 18:39:06,200 INFO L587 BuchiCegarLoop]: Abstraction has 177 states and 200 transitions. [2021-12-19 18:39:06,200 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-12-19 18:39:06,200 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 177 states and 200 transitions. [2021-12-19 18:39:06,201 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2021-12-19 18:39:06,201 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 18:39:06,201 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 18:39:06,201 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-12-19 18:39:06,201 INFO L843 BuchiCegarLoop]: 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] [2021-12-19 18:39:06,201 INFO L791 eck$LassoCheckResult]: Stem: 4359#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); 4316#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; 4317#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; 4301#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; 4302#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; 4334#L38-2 assume !!(main_~j~0#1 <= main_~r~0#1); 4355#L39 [2021-12-19 18:39:06,201 INFO L793 eck$LassoCheckResult]: Loop: 4355#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; 4356#L18 assume !(0 == __VERIFIER_assert_~cond#1); 4337#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; 4338#L18-3 assume !(0 == __VERIFIER_assert_~cond#1); 4303#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; 4304#L18-6 assume !(0 == __VERIFIER_assert_~cond#1); 4322#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; 4323#L18-9 assume !(0 == __VERIFIER_assert_~cond#1); 4371#L18-11 assume { :end_inline___VERIFIER_assert } true; 4309#L44 assume 0 != main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; 4310#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; 4318#L18-12 assume !(0 == __VERIFIER_assert_~cond#1); 4319#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; 4360#L18-15 assume !(0 == __VERIFIER_assert_~cond#1); 4361#L18-17 assume { :end_inline___VERIFIER_assert } true; 4345#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; 4329#L18-18 assume !(0 == __VERIFIER_assert_~cond#1); 4330#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; 4347#L18-21 assume !(0 == __VERIFIER_assert_~cond#1); 4348#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; 4351#L18-24 assume !(0 == __VERIFIER_assert_~cond#1); 4352#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; 4383#L18-27 assume !(0 == __VERIFIER_assert_~cond#1); 4374#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; 4336#L38-2 assume !!(main_~j~0#1 <= main_~r~0#1); 4355#L39 [2021-12-19 18:39:06,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 18:39:06,202 INFO L85 PathProgramCache]: Analyzing trace with hash 889569551, now seen corresponding path program 2 times [2021-12-19 18:39:06,202 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 18:39:06,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073756900] [2021-12-19 18:39:06,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 18:39:06,202 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 18:39:06,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 18:39:06,207 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 18:39:06,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 18:39:06,213 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 18:39:06,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 18:39:06,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1105792449, now seen corresponding path program 1 times [2021-12-19 18:39:06,213 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 18:39:06,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327840415] [2021-12-19 18:39:06,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 18:39:06,214 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 18:39:06,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 18:39:06,224 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 18:39:06,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 18:39:06,234 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 18:39:06,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 18:39:06,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1170285327, now seen corresponding path program 1 times [2021-12-19 18:39:06,235 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 18:39:06,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752275665] [2021-12-19 18:39:06,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 18:39:06,235 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 18:39:06,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 18:39:06,275 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 18:39:06,276 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 18:39:06,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752275665] [2021-12-19 18:39:06,276 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752275665] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 18:39:06,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [696759010] [2021-12-19 18:39:06,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 18:39:06,277 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 18:39:06,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 18:39:06,278 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-19 18:39:06,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2021-12-19 18:39:06,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 18:39:06,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-19 18:39:06,332 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 18:39:06,602 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 [2021-12-19 18:39:06,637 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 18:39:06,637 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 18:39:06,637 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [696759010] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 18:39:06,637 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-19 18:39:06,638 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 11 [2021-12-19 18:39:06,638 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987255492] [2021-12-19 18:39:06,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 18:39:06,863 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 18:39:06,863 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 18:39:06,863 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 18:39:06,863 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 18:39:06,864 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-12-19 18:39:06,864 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 18:39:06,864 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 18:39:06,864 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 18:39:06,864 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration9_Loop [2021-12-19 18:39:06,864 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 18:39:06,864 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 18:39:06,865 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 18:39:06,867 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 18:39:06,870 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 18:39:06,872 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 18:39:06,925 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 18:39:06,926 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-12-19 18:39:06,926 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 18:39:06,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 18:39:06,927 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 18:39:06,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2021-12-19 18:39:06,929 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-19 18:39:06,929 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 18:39:06,944 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-19 18:39:06,944 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet5#1=0} Honda state: {ULTIMATE.start_main_#t~nondet5#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-12-19 18:39:06,959 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2021-12-19 18:39:06,959 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 18:39:06,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 18:39:06,960 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 18:39:06,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2021-12-19 18:39:06,962 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-19 18:39:06,962 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 18:39:06,974 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-19 18:39:06,974 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: [] [2021-12-19 18:39:06,990 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2021-12-19 18:39:06,990 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 18:39:06,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 18:39:06,991 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 18:39:06,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2021-12-19 18:39:06,994 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-19 18:39:06,994 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 18:39:07,011 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-19 18:39:07,011 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet4#1=-1} Honda state: {ULTIMATE.start_main_#t~nondet4#1=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-12-19 18:39:07,035 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2021-12-19 18:39:07,035 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 18:39:07,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 18:39:07,036 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 18:39:07,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2021-12-19 18:39:07,039 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-19 18:39:07,039 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 18:39:07,066 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2021-12-19 18:39:07,066 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 18:39:07,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 18:39:07,067 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 18:39:07,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2021-12-19 18:39:07,069 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-12-19 18:39:07,069 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 18:39:07,140 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-12-19 18:39:07,143 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2021-12-19 18:39:07,143 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 18:39:07,143 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 18:39:07,143 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 18:39:07,144 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 18:39:07,144 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-19 18:39:07,144 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 18:39:07,144 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 18:39:07,144 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 18:39:07,144 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration9_Loop [2021-12-19 18:39:07,144 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 18:39:07,144 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 18:39:07,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 18:39:07,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 18:39:07,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 18:39:07,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 18:39:07,210 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 18:39:07,211 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-19 18:39:07,211 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 18:39:07,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 18:39:07,212 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 18:39:07,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2021-12-19 18:39:07,215 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 18:39:07,221 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 18:39:07,221 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 18:39:07,221 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 18:39:07,221 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 18:39:07,221 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 18:39:07,222 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 18:39:07,222 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 18:39:07,223 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 18:39:07,238 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2021-12-19 18:39:07,238 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 18:39:07,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 18:39:07,239 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 18:39:07,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2021-12-19 18:39:07,241 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 18:39:07,247 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 18:39:07,247 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 18:39:07,247 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 18:39:07,248 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 18:39:07,248 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 18:39:07,248 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 18:39:07,248 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 18:39:07,253 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 18:39:07,268 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2021-12-19 18:39:07,269 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 18:39:07,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 18:39:07,270 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 18:39:07,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2021-12-19 18:39:07,273 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 18:39:07,280 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 18:39:07,280 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 18:39:07,280 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 18:39:07,280 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2021-12-19 18:39:07,280 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 18:39:07,281 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-12-19 18:39:07,281 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 18:39:07,282 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 18:39:07,298 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2021-12-19 18:39:07,298 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 18:39:07,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 18:39:07,299 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 18:39:07,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2021-12-19 18:39:07,301 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 18:39:07,307 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 18:39:07,308 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 18:39:07,308 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 18:39:07,308 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 18:39:07,308 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 18:39:07,310 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 18:39:07,310 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 18:39:07,326 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-19 18:39:07,329 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2021-12-19 18:39:07,329 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2021-12-19 18:39:07,329 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 18:39:07,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 18:39:07,330 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 18:39:07,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2021-12-19 18:39:07,332 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-19 18:39:07,332 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-12-19 18:39:07,332 INFO L513 LassoAnalysis]: Proved termination. [2021-12-19 18:39:07,332 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0#1, ULTIMATE.start_main_~j~0#1) = 3*ULTIMATE.start_main_~n~0#1 - 2*ULTIMATE.start_main_~j~0#1 Supporting invariants [] [2021-12-19 18:39:07,347 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2021-12-19 18:39:07,348 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-12-19 18:39:07,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 18:39:07,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 18:39:07,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-19 18:39:07,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 18:39:07,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 18:39:07,401 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-19 18:39:07,402 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 18:39:07,599 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2021-12-19 18:39:07,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 18:39:07,650 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 [2021-12-19 18:39:07,650 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 177 states and 200 transitions. cyclomatic complexity: 27 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) [2021-12-19 18:39:07,772 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 177 states and 200 transitions. cyclomatic complexity: 27. 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 493 states and 534 transitions. Complement of second has 13 states. [2021-12-19 18:39:07,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2021-12-19 18:39:07,773 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) [2021-12-19 18:39:07,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 47 transitions. [2021-12-19 18:39:07,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 47 transitions. Stem has 6 letters. Loop has 25 letters. [2021-12-19 18:39:07,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 18:39:07,774 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-19 18:39:07,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 18:39:07,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 18:39:07,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-19 18:39:07,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 18:39:07,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 18:39:07,813 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-19 18:39:07,813 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 18:39:08,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 18:39:08,029 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 [2021-12-19 18:39:08,029 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 177 states and 200 transitions. cyclomatic complexity: 27 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) [2021-12-19 18:39:08,266 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 177 states and 200 transitions. cyclomatic complexity: 27. 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 679 states and 734 transitions. Complement of second has 21 states. [2021-12-19 18:39:08,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 1 stem states 9 non-accepting loop states 1 accepting loop states [2021-12-19 18:39:08,267 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) [2021-12-19 18:39:08,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 79 transitions. [2021-12-19 18:39:08,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 79 transitions. Stem has 6 letters. Loop has 25 letters. [2021-12-19 18:39:08,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 18:39:08,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 79 transitions. Stem has 31 letters. Loop has 25 letters. [2021-12-19 18:39:08,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 18:39:08,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 79 transitions. Stem has 6 letters. Loop has 50 letters. [2021-12-19 18:39:08,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 18:39:08,268 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 679 states and 734 transitions. [2021-12-19 18:39:08,270 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2021-12-19 18:39:08,272 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 679 states to 512 states and 563 transitions. [2021-12-19 18:39:08,272 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 [2021-12-19 18:39:08,273 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 56 [2021-12-19 18:39:08,273 INFO L73 IsDeterministic]: Start isDeterministic. Operand 512 states and 563 transitions. [2021-12-19 18:39:08,273 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 18:39:08,273 INFO L681 BuchiCegarLoop]: Abstraction has 512 states and 563 transitions. [2021-12-19 18:39:08,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states and 563 transitions. [2021-12-19 18:39:08,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 315. [2021-12-19 18:39:08,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 315 states have (on average 1.1142857142857143) internal successors, (351), 314 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 18:39:08,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 351 transitions. [2021-12-19 18:39:08,278 INFO L704 BuchiCegarLoop]: Abstraction has 315 states and 351 transitions. [2021-12-19 18:39:08,278 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 18:39:08,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-19 18:39:08,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2021-12-19 18:39:08,279 INFO L87 Difference]: Start difference. First operand 315 states and 351 transitions. Second operand has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 7 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) [2021-12-19 18:39:08,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 18:39:08,458 INFO L93 Difference]: Finished difference Result 556 states and 602 transitions. [2021-12-19 18:39:08,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-19 18:39:08,462 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 556 states and 602 transitions. [2021-12-19 18:39:08,465 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2021-12-19 18:39:08,467 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 556 states to 323 states and 361 transitions. [2021-12-19 18:39:08,467 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2021-12-19 18:39:08,467 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2021-12-19 18:39:08,467 INFO L73 IsDeterministic]: Start isDeterministic. Operand 323 states and 361 transitions. [2021-12-19 18:39:08,467 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 18:39:08,467 INFO L681 BuchiCegarLoop]: Abstraction has 323 states and 361 transitions. [2021-12-19 18:39:08,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states and 361 transitions. [2021-12-19 18:39:08,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 226. [2021-12-19 18:39:08,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 226 states have (on average 1.1238938053097345) internal successors, (254), 225 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 18:39:08,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 254 transitions. [2021-12-19 18:39:08,471 INFO L704 BuchiCegarLoop]: Abstraction has 226 states and 254 transitions. [2021-12-19 18:39:08,471 INFO L587 BuchiCegarLoop]: Abstraction has 226 states and 254 transitions. [2021-12-19 18:39:08,472 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-12-19 18:39:08,472 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 226 states and 254 transitions. [2021-12-19 18:39:08,473 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2021-12-19 18:39:08,473 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 18:39:08,473 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 18:39:08,473 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 18:39:08,473 INFO L843 BuchiCegarLoop]: 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] [2021-12-19 18:39:08,473 INFO L791 eck$LassoCheckResult]: Stem: 6947#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); 6905#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; 6906#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; 6890#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; 6891#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; 6922#L38-2 assume !!(main_~j~0#1 <= main_~r~0#1); 7021#L39 assume !(main_~j~0#1 < main_~r~0#1); 6946#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; 6909#L18-12 assume !(0 == __VERIFIER_assert_~cond#1); 6910#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; 6951#L18-15 assume !(0 == __VERIFIER_assert_~cond#1); 6952#L18-17 assume { :end_inline___VERIFIER_assert } true; 6932#L49 assume 0 != main_#t~nondet5#1;havoc main_#t~nondet5#1; 6896#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; 6897#L18-30 assume !(0 == __VERIFIER_assert_~cond#1); 6917#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; 6948#L18-33 assume !(0 == __VERIFIER_assert_~cond#1); 7015#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; 6972#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; 6962#L38-2 [2021-12-19 18:39:08,474 INFO L793 eck$LassoCheckResult]: Loop: 6962#L38-2 assume !!(main_~j~0#1 <= main_~r~0#1); 6943#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; 6944#L18 assume !(0 == __VERIFIER_assert_~cond#1); 6925#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; 6926#L18-3 assume !(0 == __VERIFIER_assert_~cond#1); 6898#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; 6899#L18-6 assume !(0 == __VERIFIER_assert_~cond#1); 6911#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; 6912#L18-9 assume !(0 == __VERIFIER_assert_~cond#1); 6958#L18-11 assume { :end_inline___VERIFIER_assert } true; 6892#L44 assume 0 != main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; 6893#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; 6907#L18-12 assume !(0 == __VERIFIER_assert_~cond#1); 6908#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; 6949#L18-15 assume !(0 == __VERIFIER_assert_~cond#1); 6950#L18-17 assume { :end_inline___VERIFIER_assert } true; 6931#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; 6918#L18-18 assume !(0 == __VERIFIER_assert_~cond#1); 6919#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; 6935#L18-21 assume !(0 == __VERIFIER_assert_~cond#1); 6936#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; 6939#L18-24 assume !(0 == __VERIFIER_assert_~cond#1); 6940#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; 6968#L18-27 assume !(0 == __VERIFIER_assert_~cond#1); 6961#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; 6962#L38-2 [2021-12-19 18:39:08,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 18:39:08,474 INFO L85 PathProgramCache]: Analyzing trace with hash 114981576, now seen corresponding path program 1 times [2021-12-19 18:39:08,474 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 18:39:08,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333328061] [2021-12-19 18:39:08,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 18:39:08,474 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 18:39:08,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 18:39:08,481 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 18:39:08,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 18:39:08,488 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 18:39:08,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 18:39:08,488 INFO L85 PathProgramCache]: Analyzing trace with hash 24367611, now seen corresponding path program 2 times [2021-12-19 18:39:08,488 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 18:39:08,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994286392] [2021-12-19 18:39:08,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 18:39:08,489 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 18:39:08,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 18:39:08,498 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 18:39:08,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 18:39:08,506 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 18:39:08,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 18:39:08,507 INFO L85 PathProgramCache]: Analyzing trace with hash -2056899308, now seen corresponding path program 1 times [2021-12-19 18:39:08,507 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 18:39:08,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536971036] [2021-12-19 18:39:08,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 18:39:08,508 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 18:39:08,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 18:39:08,517 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 18:39:08,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 18:39:08,529 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 18:39:08,773 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 18:39:08,774 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 18:39:08,774 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 18:39:08,774 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 18:39:08,774 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-12-19 18:39:08,774 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 18:39:08,774 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 18:39:08,774 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 18:39:08,774 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration10_Loop [2021-12-19 18:39:08,774 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 18:39:08,774 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 18:39:08,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 18:39:08,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 18:39:08,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 18:39:08,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 18:39:08,831 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 18:39:08,832 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-12-19 18:39:08,832 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 18:39:08,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 18:39:08,833 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 18:39:08,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2021-12-19 18:39:08,835 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-19 18:39:08,835 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 18:39:08,842 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-19 18:39:08,842 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet5#1=0} Honda state: {ULTIMATE.start_main_#t~nondet5#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-12-19 18:39:08,857 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2021-12-19 18:39:08,859 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 18:39:08,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 18:39:08,860 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 18:39:08,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2021-12-19 18:39:08,862 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-19 18:39:08,862 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 18:39:08,873 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-19 18:39:08,873 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: [] [2021-12-19 18:39:08,888 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2021-12-19 18:39:08,889 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 18:39:08,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 18:39:08,889 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 18:39:08,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2021-12-19 18:39:08,891 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-19 18:39:08,891 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 18:39:08,919 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2021-12-19 18:39:08,919 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 18:39:08,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 18:39:08,920 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 18:39:08,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2021-12-19 18:39:08,922 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-12-19 18:39:08,922 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 18:39:09,018 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-12-19 18:39:09,022 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2021-12-19 18:39:09,022 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 18:39:09,022 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 18:39:09,022 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 18:39:09,022 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 18:39:09,022 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-19 18:39:09,022 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 18:39:09,022 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 18:39:09,022 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 18:39:09,022 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration10_Loop [2021-12-19 18:39:09,022 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 18:39:09,022 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 18:39:09,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 18:39:09,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 18:39:09,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 18:39:09,039 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 18:39:09,100 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 18:39:09,100 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-19 18:39:09,100 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 18:39:09,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 18:39:09,102 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 18:39:09,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2021-12-19 18:39:09,104 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 18:39:09,111 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 18:39:09,112 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 18:39:09,112 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 18:39:09,112 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 18:39:09,112 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 18:39:09,112 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 18:39:09,112 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 18:39:09,126 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 18:39:09,145 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2021-12-19 18:39:09,145 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 18:39:09,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 18:39:09,146 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 18:39:09,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2021-12-19 18:39:09,148 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 18:39:09,154 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 18:39:09,154 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 18:39:09,155 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 18:39:09,155 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 18:39:09,155 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 18:39:09,155 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 18:39:09,155 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 18:39:09,157 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 18:39:09,172 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2021-12-19 18:39:09,172 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 18:39:09,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 18:39:09,173 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 18:39:09,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2021-12-19 18:39:09,175 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 18:39:09,181 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 18:39:09,181 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 18:39:09,181 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 18:39:09,181 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 18:39:09,181 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 18:39:09,182 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 18:39:09,182 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 18:39:09,184 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-19 18:39:09,187 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2021-12-19 18:39:09,187 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2021-12-19 18:39:09,187 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 18:39:09,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 18:39:09,189 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 18:39:09,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2021-12-19 18:39:09,192 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-19 18:39:09,192 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-12-19 18:39:09,192 INFO L513 LassoAnalysis]: Proved termination. [2021-12-19 18:39:09,192 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~r~0#1, ULTIMATE.start_main_~j~0#1) = 1*ULTIMATE.start_main_~r~0#1 - 1*ULTIMATE.start_main_~j~0#1 Supporting invariants [] [2021-12-19 18:39:09,208 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2021-12-19 18:39:09,208 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-12-19 18:39:09,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 18:39:09,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 18:39:09,232 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-19 18:39:09,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 18:39:09,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 18:39:09,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-19 18:39:09,312 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 18:39:09,324 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2021-12-19 18:39:09,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 18:39:09,499 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2021-12-19 18:39:09,499 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 226 states and 254 transitions. cyclomatic complexity: 32 Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 18:39:09,535 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 226 states and 254 transitions. cyclomatic complexity: 32. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 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 382 states and 418 transitions. Complement of second has 7 states. [2021-12-19 18:39:09,535 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 [2021-12-19 18:39:09,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 18:39:09,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2021-12-19 18:39:09,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 57 transitions. Stem has 19 letters. Loop has 25 letters. [2021-12-19 18:39:09,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 18:39:09,536 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-19 18:39:09,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 18:39:09,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 18:39:09,561 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-19 18:39:09,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 18:39:09,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 18:39:09,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-19 18:39:09,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 18:39:09,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 18:39:09,807 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 5 loop predicates [2021-12-19 18:39:09,807 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 226 states and 254 transitions. cyclomatic complexity: 32 Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 18:39:09,924 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 226 states and 254 transitions. cyclomatic complexity: 32. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 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 462 states and 502 transitions. Complement of second has 15 states. [2021-12-19 18:39:09,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2021-12-19 18:39:09,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 18:39:09,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 77 transitions. [2021-12-19 18:39:09,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 77 transitions. Stem has 19 letters. Loop has 25 letters. [2021-12-19 18:39:09,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 18:39:09,926 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-19 18:39:09,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 18:39:09,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 18:39:09,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-19 18:39:09,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 18:39:09,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 18:39:09,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-19 18:39:09,988 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 18:39:10,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 18:39:10,170 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 5 loop predicates [2021-12-19 18:39:10,170 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 226 states and 254 transitions. cyclomatic complexity: 32 Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 18:39:10,215 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 226 states and 254 transitions. cyclomatic complexity: 32. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 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 761 states and 824 transitions. Complement of second has 7 states. [2021-12-19 18:39:10,216 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 [2021-12-19 18:39:10,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 18:39:10,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2021-12-19 18:39:10,217 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 107 transitions. Stem has 19 letters. Loop has 25 letters. [2021-12-19 18:39:10,218 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 18:39:10,218 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-19 18:39:10,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 18:39:10,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 18:39:10,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-19 18:39:10,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 18:39:10,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 18:39:10,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-19 18:39:10,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 18:39:10,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 18:39:10,450 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 5 loop predicates [2021-12-19 18:39:10,450 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 226 states and 254 transitions. cyclomatic complexity: 32 Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 18:39:10,609 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 226 states and 254 transitions. cyclomatic complexity: 32. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 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 913 states and 989 transitions. Complement of second has 14 states. [2021-12-19 18:39:10,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2021-12-19 18:39:10,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 18:39:10,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 132 transitions. [2021-12-19 18:39:10,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 132 transitions. Stem has 19 letters. Loop has 25 letters. [2021-12-19 18:39:10,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 18:39:10,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 132 transitions. Stem has 44 letters. Loop has 25 letters. [2021-12-19 18:39:10,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 18:39:10,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 132 transitions. Stem has 19 letters. Loop has 50 letters. [2021-12-19 18:39:10,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 18:39:10,612 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 913 states and 989 transitions. [2021-12-19 18:39:10,617 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2021-12-19 18:39:10,620 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 913 states to 632 states and 696 transitions. [2021-12-19 18:39:10,620 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 57 [2021-12-19 18:39:10,620 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 58 [2021-12-19 18:39:10,620 INFO L73 IsDeterministic]: Start isDeterministic. Operand 632 states and 696 transitions. [2021-12-19 18:39:10,620 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 18:39:10,620 INFO L681 BuchiCegarLoop]: Abstraction has 632 states and 696 transitions. [2021-12-19 18:39:10,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states and 696 transitions. [2021-12-19 18:39:10,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 418. [2021-12-19 18:39:10,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 418 states have (on average 1.1172248803827751) internal successors, (467), 417 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 18:39:10,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 467 transitions. [2021-12-19 18:39:10,627 INFO L704 BuchiCegarLoop]: Abstraction has 418 states and 467 transitions. [2021-12-19 18:39:10,627 INFO L587 BuchiCegarLoop]: Abstraction has 418 states and 467 transitions. [2021-12-19 18:39:10,627 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-12-19 18:39:10,627 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 418 states and 467 transitions. [2021-12-19 18:39:10,629 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2021-12-19 18:39:10,629 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 18:39:10,629 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 18:39:10,630 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 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, 1] [2021-12-19 18:39:10,630 INFO L843 BuchiCegarLoop]: 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] [2021-12-19 18:39:10,630 INFO L791 eck$LassoCheckResult]: Stem: 10311#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); 10265#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; 10266#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; 10250#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; 10251#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; 10284#L38-2 assume !!(main_~j~0#1 <= main_~r~0#1); 10322#L39 assume !(main_~j~0#1 < main_~r~0#1); 10546#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; 10664#L18-12 assume !(0 == __VERIFIER_assert_~cond#1); 10662#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; 10661#L18-15 assume !(0 == __VERIFIER_assert_~cond#1); 10659#L18-17 assume { :end_inline___VERIFIER_assert } true; 10657#L49 assume 0 != main_#t~nondet5#1;havoc main_#t~nondet5#1; 10256#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; 10257#L18-30 assume !(0 == __VERIFIER_assert_~cond#1); 10316#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; 10248#L18-33 assume !(0 == __VERIFIER_assert_~cond#1); 10249#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; 10276#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; 10348#L38-2 assume !!(main_~j~0#1 <= main_~r~0#1); 10344#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; 10345#L18 assume !(0 == __VERIFIER_assert_~cond#1); 10286#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; 10287#L18-3 assume !(0 == __VERIFIER_assert_~cond#1); 10252#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; 10253#L18-6 assume !(0 == __VERIFIER_assert_~cond#1); 10346#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; 10324#L18-9 assume !(0 == __VERIFIER_assert_~cond#1); 10325#L18-11 assume { :end_inline___VERIFIER_assert } true; 10258#L44 assume !(0 != main_#t~nondet4#1);havoc main_#t~nondet4#1; 10259#L39-1 [2021-12-19 18:39:10,630 INFO L793 eck$LassoCheckResult]: Loop: 10259#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; 10268#L18-12 assume !(0 == __VERIFIER_assert_~cond#1); 10269#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; 10312#L18-15 assume !(0 == __VERIFIER_assert_~cond#1); 10313#L18-17 assume { :end_inline___VERIFIER_assert } true; 10296#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; 10280#L18-18 assume !(0 == __VERIFIER_assert_~cond#1); 10281#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; 10303#L18-21 assume !(0 == __VERIFIER_assert_~cond#1); 10304#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; 10307#L18-24 assume !(0 == __VERIFIER_assert_~cond#1); 10308#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; 10342#L18-27 assume !(0 == __VERIFIER_assert_~cond#1); 10328#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; 10329#L38-2 assume !!(main_~j~0#1 <= main_~r~0#1); 10347#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; 10332#L18 assume !(0 == __VERIFIER_assert_~cond#1); 10333#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; 10292#L18-3 assume !(0 == __VERIFIER_assert_~cond#1); 10293#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; 10290#L18-6 assume !(0 == __VERIFIER_assert_~cond#1); 10272#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; 10273#L18-9 assume !(0 == __VERIFIER_assert_~cond#1); 10336#L18-11 assume { :end_inline___VERIFIER_assert } true; 10337#L44 assume 0 != main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; 10259#L39-1 [2021-12-19 18:39:10,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 18:39:10,631 INFO L85 PathProgramCache]: Analyzing trace with hash -115703145, now seen corresponding path program 1 times [2021-12-19 18:39:10,631 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 18:39:10,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803328064] [2021-12-19 18:39:10,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 18:39:10,631 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 18:39:10,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 18:39:10,641 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 18:39:10,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 18:39:10,655 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 18:39:10,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 18:39:10,657 INFO L85 PathProgramCache]: Analyzing trace with hash -627845923, now seen corresponding path program 3 times [2021-12-19 18:39:10,657 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 18:39:10,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997937197] [2021-12-19 18:39:10,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 18:39:10,657 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 18:39:10,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 18:39:10,671 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 18:39:10,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 18:39:10,690 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 18:39:10,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 18:39:10,691 INFO L85 PathProgramCache]: Analyzing trace with hash -465156345, now seen corresponding path program 1 times [2021-12-19 18:39:10,691 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 18:39:10,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057905094] [2021-12-19 18:39:10,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 18:39:10,691 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 18:39:10,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 18:39:10,764 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 18:39:10,764 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 18:39:10,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057905094] [2021-12-19 18:39:10,764 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057905094] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 18:39:10,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2088439915] [2021-12-19 18:39:10,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 18:39:10,765 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 18:39:10,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 18:39:10,768 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-19 18:39:10,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2021-12-19 18:39:10,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 18:39:10,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-19 18:39:10,822 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 18:39:11,098 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 18:39:11,099 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 18:39:11,252 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 18:39:11,252 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2088439915] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 18:39:11,252 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-19 18:39:11,252 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2021-12-19 18:39:11,252 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534569888] [2021-12-19 18:39:11,252 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-19 18:39:11,485 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 18:39:11,486 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 18:39:11,486 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 18:39:11,486 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 18:39:11,486 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-12-19 18:39:11,486 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 18:39:11,486 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 18:39:11,486 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 18:39:11,486 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration11_Loop [2021-12-19 18:39:11,486 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 18:39:11,486 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 18:39:11,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 18:39:11,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 18:39:11,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 18:39:11,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 18:39:11,542 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 18:39:11,543 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-12-19 18:39:11,543 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 18:39:11,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 18:39:11,544 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 18:39:11,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2021-12-19 18:39:11,546 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-19 18:39:11,546 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 18:39:11,574 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2021-12-19 18:39:11,574 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 18:39:11,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 18:39:11,575 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 18:39:11,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2021-12-19 18:39:11,577 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-12-19 18:39:11,577 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 18:39:11,673 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-12-19 18:39:11,676 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2021-12-19 18:39:11,677 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 18:39:11,677 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 18:39:11,677 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 18:39:11,677 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 18:39:11,677 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-19 18:39:11,677 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 18:39:11,677 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 18:39:11,677 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 18:39:11,677 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration11_Loop [2021-12-19 18:39:11,677 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 18:39:11,677 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 18:39:11,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 18:39:11,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 18:39:11,700 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 18:39:11,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 18:39:11,742 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 18:39:11,742 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-19 18:39:11,742 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 18:39:11,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 18:39:11,744 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 18:39:11,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2021-12-19 18:39:11,746 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 18:39:11,752 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 18:39:11,752 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 18:39:11,752 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 18:39:11,752 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 18:39:11,752 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 18:39:11,753 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 18:39:11,753 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 18:39:11,754 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 18:39:11,769 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2021-12-19 18:39:11,769 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 18:39:11,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 18:39:11,770 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 18:39:11,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2021-12-19 18:39:11,772 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 18:39:11,778 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 18:39:11,778 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 18:39:11,779 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 18:39:11,779 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 18:39:11,779 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 18:39:11,780 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 18:39:11,780 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 18:39:11,782 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-19 18:39:11,784 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2021-12-19 18:39:11,784 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2021-12-19 18:39:11,784 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 18:39:11,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 18:39:11,785 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 18:39:11,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2021-12-19 18:39:11,787 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-19 18:39:11,787 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-12-19 18:39:11,787 INFO L513 LassoAnalysis]: Proved termination. [2021-12-19 18:39:11,787 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~r~0#1, ULTIMATE.start_main_~j~0#1) = 2*ULTIMATE.start_main_~r~0#1 - 3*ULTIMATE.start_main_~j~0#1 Supporting invariants [] [2021-12-19 18:39:11,803 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2021-12-19 18:39:11,803 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-12-19 18:39:11,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 18:39:11,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 18:39:11,828 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-19 18:39:11,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 18:39:11,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 18:39:11,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-19 18:39:11,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 18:39:12,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 18:39:12,022 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2021-12-19 18:39:12,023 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 418 states and 467 transitions. cyclomatic complexity: 54 Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 18:39:12,305 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 418 states and 467 transitions. cyclomatic complexity: 54. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 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 1359 states and 1489 transitions. Complement of second has 21 states. [2021-12-19 18:39:12,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 1 stem states 9 non-accepting loop states 1 accepting loop states [2021-12-19 18:39:12,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 18:39:12,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 166 transitions. [2021-12-19 18:39:12,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 166 transitions. Stem has 30 letters. Loop has 25 letters. [2021-12-19 18:39:12,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 18:39:12,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 166 transitions. Stem has 55 letters. Loop has 25 letters. [2021-12-19 18:39:12,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 18:39:12,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 166 transitions. Stem has 30 letters. Loop has 50 letters. [2021-12-19 18:39:12,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 18:39:12,308 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1359 states and 1489 transitions. [2021-12-19 18:39:12,315 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 50 [2021-12-19 18:39:12,320 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1359 states to 1171 states and 1286 transitions. [2021-12-19 18:39:12,320 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 101 [2021-12-19 18:39:12,321 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 102 [2021-12-19 18:39:12,321 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1171 states and 1286 transitions. [2021-12-19 18:39:12,321 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 18:39:12,321 INFO L681 BuchiCegarLoop]: Abstraction has 1171 states and 1286 transitions. [2021-12-19 18:39:12,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states and 1286 transitions. [2021-12-19 18:39:12,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 862. [2021-12-19 18:39:12,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 862 states, 862 states have (on average 1.1078886310904872) internal successors, (955), 861 states have internal predecessors, (955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 18:39:12,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 862 states and 955 transitions. [2021-12-19 18:39:12,343 INFO L704 BuchiCegarLoop]: Abstraction has 862 states and 955 transitions. [2021-12-19 18:39:12,343 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 18:39:12,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-19 18:39:12,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2021-12-19 18:39:12,344 INFO L87 Difference]: Start difference. First operand 862 states and 955 transitions. Second operand has 14 states, 14 states have (on average 7.0) internal successors, (98), 14 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 18:39:12,371 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2021-12-19 18:39:13,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 18:39:13,345 INFO L93 Difference]: Finished difference Result 4142 states and 4446 transitions. [2021-12-19 18:39:13,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2021-12-19 18:39:13,345 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4142 states and 4446 transitions. [2021-12-19 18:39:13,365 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 114 [2021-12-19 18:39:13,377 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4142 states to 2896 states and 3128 transitions. [2021-12-19 18:39:13,377 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 276 [2021-12-19 18:39:13,378 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 276 [2021-12-19 18:39:13,378 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2896 states and 3128 transitions. [2021-12-19 18:39:13,378 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 18:39:13,378 INFO L681 BuchiCegarLoop]: Abstraction has 2896 states and 3128 transitions. [2021-12-19 18:39:13,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2896 states and 3128 transitions. [2021-12-19 18:39:13,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2896 to 1303. [2021-12-19 18:39:13,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1303 states, 1303 states have (on average 1.1028396009209516) internal successors, (1437), 1302 states have internal predecessors, (1437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 18:39:13,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1303 states to 1303 states and 1437 transitions. [2021-12-19 18:39:13,404 INFO L704 BuchiCegarLoop]: Abstraction has 1303 states and 1437 transitions. [2021-12-19 18:39:13,404 INFO L587 BuchiCegarLoop]: Abstraction has 1303 states and 1437 transitions. [2021-12-19 18:39:13,404 INFO L425 BuchiCegarLoop]: ======== Iteration 12============ [2021-12-19 18:39:13,404 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1303 states and 1437 transitions. [2021-12-19 18:39:13,408 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 50 [2021-12-19 18:39:13,409 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 18:39:13,409 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 18:39:13,411 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 18:39:13,411 INFO L843 BuchiCegarLoop]: 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] [2021-12-19 18:39:13,412 INFO L791 eck$LassoCheckResult]: Stem: 17717#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); 17676#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; 17677#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; 17662#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; 17663#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; 17694#L38-2 assume !!(main_~j~0#1 <= main_~r~0#1); 18063#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; 18580#L18 assume !(0 == __VERIFIER_assert_~cond#1); 18579#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; 18578#L18-3 assume !(0 == __VERIFIER_assert_~cond#1); 18577#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; 18576#L18-6 assume !(0 == __VERIFIER_assert_~cond#1); 18575#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; 18574#L18-9 assume !(0 == __VERIFIER_assert_~cond#1); 18573#L18-11 assume { :end_inline___VERIFIER_assert } true; 18564#L44 assume !(0 != main_#t~nondet4#1);havoc main_#t~nondet4#1; 18562#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; 18561#L18-12 assume !(0 == __VERIFIER_assert_~cond#1); 18560#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; 18559#L18-15 assume !(0 == __VERIFIER_assert_~cond#1); 18558#L18-17 assume { :end_inline___VERIFIER_assert } true; 18536#L49 assume 0 != main_#t~nondet5#1;havoc main_#t~nondet5#1; 18309#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; 18307#L18-30 assume !(0 == __VERIFIER_assert_~cond#1); 18305#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; 18303#L18-33 assume !(0 == __VERIFIER_assert_~cond#1); 17943#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; 17744#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; 17745#L38-2 assume !!(main_~j~0#1 <= main_~r~0#1); 17914#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; 17735#L18 assume !(0 == __VERIFIER_assert_~cond#1); 17697#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; 17698#L18-3 assume !(0 == __VERIFIER_assert_~cond#1); 17664#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; 17665#L18-6 assume !(0 == __VERIFIER_assert_~cond#1); 17683#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; 17684#L18-9 assume !(0 == __VERIFIER_assert_~cond#1); 17729#L18-11 assume { :end_inline___VERIFIER_assert } true; 17670#L44 assume !(0 != main_#t~nondet4#1);havoc main_#t~nondet4#1; 17671#L39-1 [2021-12-19 18:39:13,412 INFO L793 eck$LassoCheckResult]: Loop: 17671#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; 17722#L18-12 assume !(0 == __VERIFIER_assert_~cond#1); 17902#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; 17718#L18-15 assume !(0 == __VERIFIER_assert_~cond#1); 17719#L18-17 assume { :end_inline___VERIFIER_assert } true; 17701#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; 17702#L18-18 assume !(0 == __VERIFIER_assert_~cond#1); 17899#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; 17898#L18-21 assume !(0 == __VERIFIER_assert_~cond#1); 17897#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; 17709#L18-24 assume !(0 == __VERIFIER_assert_~cond#1); 17710#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; 17739#L18-27 assume !(0 == __VERIFIER_assert_~cond#1); 17895#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; 17894#L38-2 assume !!(main_~j~0#1 <= main_~r~0#1); 17893#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; 17892#L18 assume !(0 == __VERIFIER_assert_~cond#1); 17891#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; 17890#L18-3 assume !(0 == __VERIFIER_assert_~cond#1); 17889#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; 17888#L18-6 assume !(0 == __VERIFIER_assert_~cond#1); 17887#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; 17886#L18-9 assume !(0 == __VERIFIER_assert_~cond#1); 17885#L18-11 assume { :end_inline___VERIFIER_assert } true; 17884#L44 assume 0 != main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; 17671#L39-1 [2021-12-19 18:39:13,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 18:39:13,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1599841769, now seen corresponding path program 1 times [2021-12-19 18:39:13,413 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 18:39:13,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024757150] [2021-12-19 18:39:13,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 18:39:13,413 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 18:39:13,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 18:39:13,424 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 18:39:13,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 18:39:13,440 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 18:39:13,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 18:39:13,441 INFO L85 PathProgramCache]: Analyzing trace with hash -627845923, now seen corresponding path program 4 times [2021-12-19 18:39:13,441 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 18:39:13,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086106330] [2021-12-19 18:39:13,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 18:39:13,441 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 18:39:13,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 18:39:13,451 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 18:39:13,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 18:39:13,458 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 18:39:13,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 18:39:13,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1491131403, now seen corresponding path program 1 times [2021-12-19 18:39:13,458 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 18:39:13,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977516831] [2021-12-19 18:39:13,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 18:39:13,459 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 18:39:13,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 18:39:13,467 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 18:39:13,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 18:39:13,479 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 18:39:13,701 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 18:39:13,701 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 18:39:13,701 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 18:39:13,701 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 18:39:13,701 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-12-19 18:39:13,701 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 18:39:13,701 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 18:39:13,701 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 18:39:13,701 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration12_Loop [2021-12-19 18:39:13,701 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 18:39:13,701 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 18:39:13,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 18:39:13,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 18:39:13,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 18:39:13,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 18:39:13,766 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 18:39:13,767 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-12-19 18:39:13,767 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 18:39:13,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 18:39:13,769 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 18:39:13,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2021-12-19 18:39:13,778 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-19 18:39:13,778 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 18:39:13,790 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-19 18:39:13,790 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: [] [2021-12-19 18:39:13,805 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Forceful destruction successful, exit code 0 [2021-12-19 18:39:13,805 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 18:39:13,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 18:39:13,806 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 18:39:13,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2021-12-19 18:39:13,808 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-19 18:39:13,808 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 18:39:13,820 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-19 18:39:13,820 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet4#1=-1} Honda state: {ULTIMATE.start_main_#t~nondet4#1=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-12-19 18:39:13,835 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2021-12-19 18:39:13,836 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 18:39:13,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 18:39:13,836 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 18:39:13,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2021-12-19 18:39:13,839 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-19 18:39:13,839 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 18:39:13,846 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-19 18:39:13,846 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet5#1=0} Honda state: {ULTIMATE.start_main_#t~nondet5#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-12-19 18:39:13,862 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2021-12-19 18:39:13,862 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 18:39:13,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 18:39:13,863 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 18:39:13,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2021-12-19 18:39:13,865 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-19 18:39:13,865 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 18:39:13,893 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2021-12-19 18:39:13,893 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 18:39:13,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 18:39:13,894 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 18:39:13,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2021-12-19 18:39:13,896 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-12-19 18:39:13,896 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 18:39:13,961 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-12-19 18:39:13,964 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0 [2021-12-19 18:39:13,964 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 18:39:13,964 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 18:39:13,965 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 18:39:13,965 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 18:39:13,965 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-19 18:39:13,965 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 18:39:13,965 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 18:39:13,965 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 18:39:13,965 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration12_Loop [2021-12-19 18:39:13,965 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 18:39:13,965 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 18:39:13,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 18:39:13,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 18:39:13,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 18:39:13,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 18:39:14,023 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 18:39:14,023 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-19 18:39:14,023 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 18:39:14,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 18:39:14,024 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 18:39:14,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2021-12-19 18:39:14,027 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 18:39:14,033 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 18:39:14,033 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 18:39:14,034 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 18:39:14,034 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2021-12-19 18:39:14,034 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 18:39:14,034 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-12-19 18:39:14,034 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 18:39:14,035 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 18:39:14,051 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Forceful destruction successful, exit code 0 [2021-12-19 18:39:14,051 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 18:39:14,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 18:39:14,052 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 18:39:14,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2021-12-19 18:39:14,054 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 18:39:14,061 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 18:39:14,061 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 18:39:14,061 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 18:39:14,061 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 18:39:14,061 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 18:39:14,062 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 18:39:14,063 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 18:39:14,064 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 18:39:14,079 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2021-12-19 18:39:14,080 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 18:39:14,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 18:39:14,080 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 18:39:14,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2021-12-19 18:39:14,083 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 18:39:14,089 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 18:39:14,089 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 18:39:14,089 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 18:39:14,089 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 18:39:14,089 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 18:39:14,090 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 18:39:14,090 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 18:39:14,091 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 18:39:14,106 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Forceful destruction successful, exit code 0 [2021-12-19 18:39:14,106 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 18:39:14,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 18:39:14,108 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 18:39:14,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2021-12-19 18:39:14,110 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 18:39:14,116 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 18:39:14,116 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 18:39:14,116 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 18:39:14,116 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 18:39:14,116 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 18:39:14,118 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 18:39:14,118 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 18:39:14,121 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-19 18:39:14,124 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-12-19 18:39:14,124 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2021-12-19 18:39:14,124 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 18:39:14,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 18:39:14,126 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 18:39:14,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2021-12-19 18:39:14,127 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-19 18:39:14,128 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-12-19 18:39:14,128 INFO L513 LassoAnalysis]: Proved termination. [2021-12-19 18:39:14,128 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0#1, ULTIMATE.start_main_~n~0#1) = -3*ULTIMATE.start_main_~j~0#1 + 2*ULTIMATE.start_main_~n~0#1 Supporting invariants [] [2021-12-19 18:39:14,144 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Forceful destruction successful, exit code 0 [2021-12-19 18:39:14,144 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-12-19 18:39:14,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 18:39:14,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 18:39:14,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-19 18:39:14,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 18:39:14,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 18:39:14,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-19 18:39:14,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 18:39:14,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 18:39:14,441 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2021-12-19 18:39:14,441 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1303 states and 1437 transitions. cyclomatic complexity: 151 Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 18:39:14,736 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1303 states and 1437 transitions. cyclomatic complexity: 151. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 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 2341 states and 2536 transitions. Complement of second has 19 states. [2021-12-19 18:39:14,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 1 stem states 8 non-accepting loop states 1 accepting loop states [2021-12-19 18:39:14,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 18:39:14,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 169 transitions. [2021-12-19 18:39:14,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 169 transitions. Stem has 39 letters. Loop has 25 letters. [2021-12-19 18:39:14,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 18:39:14,738 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-19 18:39:14,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 18:39:14,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 18:39:14,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-19 18:39:14,766 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 18:39:14,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 18:39:14,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-19 18:39:14,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 18:39:14,937 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Forceful destruction successful, exit code 0 [2021-12-19 18:39:15,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 18:39:15,033 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 6 loop predicates [2021-12-19 18:39:15,033 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1303 states and 1437 transitions. cyclomatic complexity: 151 Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 18:39:15,317 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1303 states and 1437 transitions. cyclomatic complexity: 151. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 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 2341 states and 2536 transitions. Complement of second has 19 states. [2021-12-19 18:39:15,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 1 stem states 8 non-accepting loop states 1 accepting loop states [2021-12-19 18:39:15,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 18:39:15,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 169 transitions. [2021-12-19 18:39:15,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 169 transitions. Stem has 39 letters. Loop has 25 letters. [2021-12-19 18:39:15,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 18:39:15,318 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-19 18:39:15,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 18:39:15,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 18:39:15,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-19 18:39:15,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 18:39:15,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 18:39:15,417 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-19 18:39:15,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 18:39:15,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 18:39:15,597 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 6 loop predicates [2021-12-19 18:39:15,597 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1303 states and 1437 transitions. cyclomatic complexity: 151 Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 18:39:15,844 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1303 states and 1437 transitions. cyclomatic complexity: 151. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 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 2939 states and 3173 transitions. Complement of second has 33 states. [2021-12-19 18:39:15,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 1 stem states 8 non-accepting loop states 1 accepting loop states [2021-12-19 18:39:15,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 18:39:15,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 170 transitions. [2021-12-19 18:39:15,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 170 transitions. Stem has 39 letters. Loop has 25 letters. [2021-12-19 18:39:15,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 18:39:15,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 170 transitions. Stem has 64 letters. Loop has 25 letters. [2021-12-19 18:39:15,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 18:39:15,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 170 transitions. Stem has 39 letters. Loop has 50 letters. [2021-12-19 18:39:15,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 18:39:15,847 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2939 states and 3173 transitions. [2021-12-19 18:39:15,861 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 50 [2021-12-19 18:39:15,869 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2939 states to 2023 states and 2202 transitions. [2021-12-19 18:39:15,869 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 119 [2021-12-19 18:39:15,869 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 123 [2021-12-19 18:39:15,870 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2023 states and 2202 transitions. [2021-12-19 18:39:15,870 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 18:39:15,870 INFO L681 BuchiCegarLoop]: Abstraction has 2023 states and 2202 transitions. [2021-12-19 18:39:15,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2023 states and 2202 transitions. [2021-12-19 18:39:15,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2023 to 1062. [2021-12-19 18:39:15,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1062 states, 1062 states have (on average 1.10075329566855) internal successors, (1169), 1061 states have internal predecessors, (1169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 18:39:15,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1062 states to 1062 states and 1169 transitions. [2021-12-19 18:39:15,887 INFO L704 BuchiCegarLoop]: Abstraction has 1062 states and 1169 transitions. [2021-12-19 18:39:15,887 INFO L587 BuchiCegarLoop]: Abstraction has 1062 states and 1169 transitions. [2021-12-19 18:39:15,887 INFO L425 BuchiCegarLoop]: ======== Iteration 13============ [2021-12-19 18:39:15,888 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1062 states and 1169 transitions. [2021-12-19 18:39:15,891 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2021-12-19 18:39:15,891 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 18:39:15,891 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 18:39:15,892 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 18:39:15,892 INFO L843 BuchiCegarLoop]: 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] [2021-12-19 18:39:15,892 INFO L791 eck$LassoCheckResult]: Stem: 27347#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); 27305#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; 27306#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; 27290#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; 27291#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; 27326#L38-2 assume !!(main_~j~0#1 <= main_~r~0#1); 27867#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; 28197#L18 assume !(0 == __VERIFIER_assert_~cond#1); 28195#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; 28193#L18-3 assume !(0 == __VERIFIER_assert_~cond#1); 28191#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; 28189#L18-6 assume !(0 == __VERIFIER_assert_~cond#1); 28187#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; 28185#L18-9 assume !(0 == __VERIFIER_assert_~cond#1); 28183#L18-11 assume { :end_inline___VERIFIER_assert } true; 28180#L44 assume 0 != main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; 28181#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; 28344#L18-12 assume !(0 == __VERIFIER_assert_~cond#1); 28343#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; 28342#L18-15 assume !(0 == __VERIFIER_assert_~cond#1); 28341#L18-17 assume { :end_inline___VERIFIER_assert } true; 27456#L49 assume 0 != main_#t~nondet5#1;havoc main_#t~nondet5#1; 27450#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; 27448#L18-30 assume !(0 == __VERIFIER_assert_~cond#1); 27446#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; 27444#L18-33 assume !(0 == __VERIFIER_assert_~cond#1); 27442#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; 27410#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; 27407#L38-2 assume !!(main_~j~0#1 <= main_~r~0#1); 27406#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; 27405#L18 assume !(0 == __VERIFIER_assert_~cond#1); 27404#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; 27403#L18-3 assume !(0 == __VERIFIER_assert_~cond#1); 27298#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; 27299#L18-6 assume !(0 == __VERIFIER_assert_~cond#1); 27329#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; 27360#L18-9 assume !(0 == __VERIFIER_assert_~cond#1); 27361#L18-11 assume { :end_inline___VERIFIER_assert } true; 27292#L44 assume !(0 != main_#t~nondet4#1);havoc main_#t~nondet4#1; 27293#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; 27307#L18-12 [2021-12-19 18:39:15,892 INFO L793 eck$LassoCheckResult]: Loop: 27307#L18-12 assume !(0 == __VERIFIER_assert_~cond#1); 27308#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; 27348#L18-15 assume !(0 == __VERIFIER_assert_~cond#1); 27349#L18-17 assume { :end_inline___VERIFIER_assert } true; 27332#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; 27318#L18-18 assume !(0 == __VERIFIER_assert_~cond#1); 27319#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; 27339#L18-21 assume !(0 == __VERIFIER_assert_~cond#1); 27340#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; 27343#L18-24 assume !(0 == __VERIFIER_assert_~cond#1); 27344#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; 27373#L18-27 assume !(0 == __VERIFIER_assert_~cond#1); 27364#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; 27365#L38-2 assume !!(main_~j~0#1 <= main_~r~0#1); 27335#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; 27336#L18 assume !(0 == __VERIFIER_assert_~cond#1); 27322#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; 27323#L18-3 assume !(0 == __VERIFIER_assert_~cond#1); 27331#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; 27402#L18-6 assume !(0 == __VERIFIER_assert_~cond#1); 27311#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; 27312#L18-9 assume !(0 == __VERIFIER_assert_~cond#1); 27369#L18-11 assume { :end_inline___VERIFIER_assert } true; 27370#L44 assume !(0 != main_#t~nondet4#1);havoc main_#t~nondet4#1; 27352#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; 27307#L18-12 [2021-12-19 18:39:15,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 18:39:15,893 INFO L85 PathProgramCache]: Analyzing trace with hash -2085061240, now seen corresponding path program 1 times [2021-12-19 18:39:15,893 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 18:39:15,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970478524] [2021-12-19 18:39:15,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 18:39:15,893 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 18:39:15,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 18:39:15,900 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 18:39:15,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 18:39:15,908 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 18:39:15,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 18:39:15,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1493625179, now seen corresponding path program 1 times [2021-12-19 18:39:15,909 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 18:39:15,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889453262] [2021-12-19 18:39:15,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 18:39:15,910 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 18:39:15,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 18:39:15,915 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 18:39:15,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 18:39:15,923 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 18:39:15,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 18:39:15,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1500647166, now seen corresponding path program 2 times [2021-12-19 18:39:15,924 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 18:39:15,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433601909] [2021-12-19 18:39:15,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 18:39:15,924 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 18:39:15,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 18:39:15,933 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 18:39:15,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 18:39:15,945 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 18:39:16,147 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 18:39:16,148 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 18:39:16,148 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 18:39:16,148 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 18:39:16,148 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-12-19 18:39:16,148 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 18:39:16,148 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 18:39:16,148 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 18:39:16,148 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration13_Loop [2021-12-19 18:39:16,148 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 18:39:16,148 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 18:39:16,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 18:39:16,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 18:39:16,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 18:39:16,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 18:39:16,222 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 18:39:16,222 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-12-19 18:39:16,222 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 18:39:16,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 18:39:16,223 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 18:39:16,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2021-12-19 18:39:16,225 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-19 18:39:16,226 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 18:39:16,233 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-19 18:39:16,233 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet5#1=0} Honda state: {ULTIMATE.start_main_#t~nondet5#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-12-19 18:39:16,248 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Ended with exit code 0 [2021-12-19 18:39:16,248 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 18:39:16,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 18:39:16,249 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 18:39:16,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2021-12-19 18:39:16,251 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-19 18:39:16,251 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 18:39:16,278 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Forceful destruction successful, exit code 0 [2021-12-19 18:39:16,279 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 18:39:16,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 18:39:16,279 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 18:39:16,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2021-12-19 18:39:16,281 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-12-19 18:39:16,281 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 18:39:16,446 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-12-19 18:39:16,450 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Ended with exit code 0 [2021-12-19 18:39:16,450 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 18:39:16,450 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 18:39:16,450 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 18:39:16,450 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 18:39:16,450 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-19 18:39:16,451 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 18:39:16,451 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 18:39:16,451 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 18:39:16,451 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration13_Loop [2021-12-19 18:39:16,451 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 18:39:16,451 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 18:39:16,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 18:39:16,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 18:39:16,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 18:39:16,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 18:39:16,520 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 18:39:16,520 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-19 18:39:16,520 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 18:39:16,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 18:39:16,521 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 18:39:16,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2021-12-19 18:39:16,524 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 18:39:16,530 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 18:39:16,530 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 18:39:16,530 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 18:39:16,530 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 18:39:16,530 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 18:39:16,531 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 18:39:16,531 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 18:39:16,532 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 18:39:16,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Forceful destruction successful, exit code 0 [2021-12-19 18:39:16,548 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 18:39:16,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 18:39:16,548 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 18:39:16,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2021-12-19 18:39:16,551 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 18:39:16,557 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 18:39:16,557 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 18:39:16,557 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 18:39:16,557 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 18:39:16,557 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 18:39:16,559 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 18:39:16,559 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 18:39:16,567 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-19 18:39:16,570 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-12-19 18:39:16,570 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2021-12-19 18:39:16,570 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 18:39:16,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 18:39:16,572 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 18:39:16,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2021-12-19 18:39:16,573 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-19 18:39:16,574 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-12-19 18:39:16,574 INFO L513 LassoAnalysis]: Proved termination. [2021-12-19 18:39:16,574 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0#1, ULTIMATE.start_main_~n~0#1) = -2*ULTIMATE.start_main_~j~0#1 + 1*ULTIMATE.start_main_~n~0#1 Supporting invariants [] [2021-12-19 18:39:16,589 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Ended with exit code 0 [2021-12-19 18:39:16,590 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-12-19 18:39:16,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 18:39:16,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 18:39:16,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-19 18:39:16,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 18:39:16,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 18:39:16,689 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-19 18:39:16,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 18:39:16,702 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Forceful destruction successful, exit code 0 [2021-12-19 18:39:16,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 18:39:16,873 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2021-12-19 18:39:16,873 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1062 states and 1169 transitions. cyclomatic complexity: 118 Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 18:39:17,007 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1062 states and 1169 transitions. cyclomatic complexity: 118. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 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 1477 states and 1604 transitions. Complement of second has 15 states. [2021-12-19 18:39:17,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2021-12-19 18:39:17,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 18:39:17,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 61 transitions. [2021-12-19 18:39:17,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 61 transitions. Stem has 40 letters. Loop has 25 letters. [2021-12-19 18:39:17,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 18:39:17,009 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-19 18:39:17,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 18:39:17,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 18:39:17,037 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-19 18:39:17,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 18:39:17,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 18:39:17,108 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-19 18:39:17,108 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 18:39:17,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 18:39:17,311 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 6 loop predicates [2021-12-19 18:39:17,311 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1062 states and 1169 transitions. cyclomatic complexity: 118 Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 18:39:17,444 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1062 states and 1169 transitions. cyclomatic complexity: 118. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 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 1477 states and 1604 transitions. Complement of second has 15 states. [2021-12-19 18:39:17,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2021-12-19 18:39:17,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 18:39:17,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 61 transitions. [2021-12-19 18:39:17,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 61 transitions. Stem has 40 letters. Loop has 25 letters. [2021-12-19 18:39:17,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 18:39:17,446 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-19 18:39:17,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 18:39:17,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 18:39:17,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-19 18:39:17,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 18:39:17,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 18:39:17,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-19 18:39:17,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 18:39:17,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 18:39:17,782 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 6 loop predicates [2021-12-19 18:39:17,782 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1062 states and 1169 transitions. cyclomatic complexity: 118 Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 18:39:17,975 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1062 states and 1169 transitions. cyclomatic complexity: 118. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 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 3069 states and 3287 transitions. Complement of second has 44 states. [2021-12-19 18:39:17,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 7 non-accepting loop states 1 accepting loop states [2021-12-19 18:39:17,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 18:39:17,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 130 transitions. [2021-12-19 18:39:17,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 130 transitions. Stem has 40 letters. Loop has 25 letters. [2021-12-19 18:39:17,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 18:39:17,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 130 transitions. Stem has 65 letters. Loop has 25 letters. [2021-12-19 18:39:17,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 18:39:17,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 130 transitions. Stem has 40 letters. Loop has 50 letters. [2021-12-19 18:39:17,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 18:39:17,979 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3069 states and 3287 transitions. [2021-12-19 18:39:17,996 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-12-19 18:39:17,996 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3069 states to 0 states and 0 transitions. [2021-12-19 18:39:17,997 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2021-12-19 18:39:17,997 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2021-12-19 18:39:17,997 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2021-12-19 18:39:17,997 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-19 18:39:17,997 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-19 18:39:17,997 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-19 18:39:17,997 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-19 18:39:17,997 INFO L425 BuchiCegarLoop]: ======== Iteration 14============ [2021-12-19 18:39:17,997 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2021-12-19 18:39:17,998 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-12-19 18:39:17,998 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2021-12-19 18:39:18,005 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 19.12 06:39:18 BoogieIcfgContainer [2021-12-19 18:39:18,006 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-12-19 18:39:18,006 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-19 18:39:18,006 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-19 18:39:18,006 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-19 18:39:18,007 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 06:38:59" (3/4) ... [2021-12-19 18:39:18,009 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-19 18:39:18,010 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-19 18:39:18,010 INFO L158 Benchmark]: Toolchain (without parser) took 19104.57ms. Allocated memory was 90.2MB in the beginning and 163.6MB in the end (delta: 73.4MB). Free memory was 59.8MB in the beginning and 80.2MB in the end (delta: -20.4MB). Peak memory consumption was 52.0MB. Max. memory is 16.1GB. [2021-12-19 18:39:18,011 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 90.2MB. Free memory is still 46.4MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-19 18:39:18,011 INFO L158 Benchmark]: CACSL2BoogieTranslator took 235.47ms. Allocated memory is still 90.2MB. Free memory was 59.6MB in the beginning and 67.1MB in the end (delta: -7.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-19 18:39:18,012 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.41ms. Allocated memory is still 90.2MB. Free memory was 67.1MB in the beginning and 65.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-19 18:39:18,012 INFO L158 Benchmark]: Boogie Preprocessor took 26.84ms. Allocated memory is still 90.2MB. Free memory was 65.3MB in the beginning and 64.2MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-19 18:39:18,012 INFO L158 Benchmark]: RCFGBuilder took 380.03ms. Allocated memory is still 90.2MB. Free memory was 63.7MB in the beginning and 52.0MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-12-19 18:39:18,012 INFO L158 Benchmark]: BuchiAutomizer took 18422.47ms. Allocated memory was 90.2MB in the beginning and 163.6MB in the end (delta: 73.4MB). Free memory was 52.0MB in the beginning and 80.2MB in the end (delta: -28.2MB). Peak memory consumption was 46.7MB. Max. memory is 16.1GB. [2021-12-19 18:39:18,013 INFO L158 Benchmark]: Witness Printer took 3.54ms. Allocated memory is still 163.6MB. Free memory is still 80.2MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-19 18:39:18,014 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.22ms. Allocated memory is still 90.2MB. Free memory is still 46.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 235.47ms. Allocated memory is still 90.2MB. Free memory was 59.6MB in the beginning and 67.1MB in the end (delta: -7.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.41ms. Allocated memory is still 90.2MB. Free memory was 67.1MB in the beginning and 65.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.84ms. Allocated memory is still 90.2MB. Free memory was 65.3MB in the beginning and 64.2MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 380.03ms. Allocated memory is still 90.2MB. Free memory was 63.7MB in the beginning and 52.0MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 18422.47ms. Allocated memory was 90.2MB in the beginning and 163.6MB in the end (delta: 73.4MB). Free memory was 52.0MB in the beginning and 80.2MB in the end (delta: -28.2MB). Peak memory consumption was 46.7MB. Max. memory is 16.1GB. * Witness Printer took 3.54ms. Allocated memory is still 163.6MB. Free memory is still 80.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 19 terminating modules (9 trivial, 7 deterministic, 3 nondeterministic). One deterministic module has affine ranking function l and consists of 4 locations. One deterministic module has affine ranking function l and consists of 4 locations. One deterministic module has affine ranking function r and consists of 3 locations. One deterministic module has affine ranking function j and consists of 9 locations. One deterministic module has affine ranking function r and consists of 4 locations. One deterministic module has affine ranking function 3 * n + -2 * j and consists of 11 locations. One deterministic module has affine ranking function 2 * r + -3 * j and consists of 11 locations. One nondeterministic module has affine ranking function r + -1 * j and consists of 8 locations. One nondeterministic module has affine ranking function -3 * j + 2 * n and consists of 10 locations. One nondeterministic module has affine ranking function -2 * j + n and consists of 9 locations. 9 modules have a trivial ranking function, the largest among these consists of 14 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 18.3s and 14 iterations. TraceHistogramMax:2. Analysis of lassos took 9.2s. Construction of modules took 1.9s. Büchi inclusion checks took 6.7s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 16. Automata minimization 0.2s AutomataMinimizationTime, 18 MinimizatonAttempts, 4352 StatesRemovedByMinimization, 16 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 1303 states and ocurred in iteration 11. Nontrivial modules had stage [6, 1, 2, 1, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3256 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3238 mSDsluCounter, 4029 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2416 mSDsCounter, 384 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3122 IncrementalHoareTripleChecker+Invalid, 3506 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 384 mSolverCounterUnsat, 1613 mSDtfsCounter, 3122 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI3 SFLT4 conc0 concLT6 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital40 mio100 ax100 hnf100 lsp72 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq149 hnf94 smp100 dnf100 smp100 tf104 neg99 sie105 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 38ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 16 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 10 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 2.3s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2021-12-19 18:39:18,051 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Forceful destruction successful, exit code 0 [2021-12-19 18:39:18,263 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2021-12-19 18:39:18,444 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE