./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-crafted-lit/BrockschmidtCookFuhs-CAV2013-Fig9a.c --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-crafted-lit/BrockschmidtCookFuhs-CAV2013-Fig9a.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 172ac4fa0310d14c59d9149bc1b8ec1548860e0b827250d611bfd9d710019753 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:24:45,251 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:24:45,253 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:24:45,274 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:24:45,279 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:24:45,282 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:24:45,284 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:24:45,287 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:24:45,289 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:24:45,293 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:24:45,294 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:24:45,295 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:24:45,295 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:24:45,298 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:24:45,299 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:24:45,301 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:24:45,302 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:24:45,302 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:24:45,306 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:24:45,311 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:24:45,312 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:24:45,313 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:24:45,315 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:24:45,315 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:24:45,317 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:24:45,317 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:24:45,318 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:24:45,319 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:24:45,319 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:24:45,320 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:24:45,321 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:24:45,321 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:24:45,322 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:24:45,323 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:24:45,324 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:24:45,324 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:24:45,325 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:24:45,325 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:24:45,325 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:24:45,326 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:24:45,326 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:24:45,327 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-02-21 03:24:45,359 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:24:45,360 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:24:45,360 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:24:45,360 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:24:45,362 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:24:45,362 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:24:45,362 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:24:45,362 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:24:45,362 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:24:45,362 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:24:45,363 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:24:45,363 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:24:45,363 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:24:45,364 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:24:45,364 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:24:45,364 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:24:45,364 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:24:45,364 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:24:45,364 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:24:45,365 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:24:45,365 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:24:45,365 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:24:45,365 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:24:45,365 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:24:45,365 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:24:45,365 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:24:45,366 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:24:45,366 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:24:45,367 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:24:45,367 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 172ac4fa0310d14c59d9149bc1b8ec1548860e0b827250d611bfd9d710019753 [2022-02-21 03:24:45,586 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:24:45,607 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:24:45,609 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:24:45,610 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:24:45,610 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:24:45,611 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted-lit/BrockschmidtCookFuhs-CAV2013-Fig9a.c [2022-02-21 03:24:45,669 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/238bc5f8c/0375e89270a44422975ccc06525a46c3/FLAGec08ba0c1 [2022-02-21 03:24:46,025 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:24:46,025 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/BrockschmidtCookFuhs-CAV2013-Fig9a.c [2022-02-21 03:24:46,034 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/238bc5f8c/0375e89270a44422975ccc06525a46c3/FLAGec08ba0c1 [2022-02-21 03:24:46,047 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/238bc5f8c/0375e89270a44422975ccc06525a46c3 [2022-02-21 03:24:46,049 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:24:46,050 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:24:46,053 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:24:46,053 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:24:46,056 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:24:46,061 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:24:46" (1/1) ... [2022-02-21 03:24:46,062 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fdbcd6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:24:46, skipping insertion in model container [2022-02-21 03:24:46,062 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:24:46" (1/1) ... [2022-02-21 03:24:46,067 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:24:46,076 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:24:46,237 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:24:46,248 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:24:46,261 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:24:46,269 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:24:46,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:24:46 WrapperNode [2022-02-21 03:24:46,271 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:24:46,272 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:24:46,272 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:24:46,272 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:24:46,278 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:24:46" (1/1) ... [2022-02-21 03:24:46,282 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:24:46" (1/1) ... [2022-02-21 03:24:46,302 INFO L137 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 29 [2022-02-21 03:24:46,303 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:24:46,304 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:24:46,304 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:24:46,304 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:24:46,309 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:24:46" (1/1) ... [2022-02-21 03:24:46,310 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:24:46" (1/1) ... [2022-02-21 03:24:46,310 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:24:46" (1/1) ... [2022-02-21 03:24:46,311 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:24:46" (1/1) ... [2022-02-21 03:24:46,313 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:24:46" (1/1) ... [2022-02-21 03:24:46,318 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:24:46" (1/1) ... [2022-02-21 03:24:46,319 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:24:46" (1/1) ... [2022-02-21 03:24:46,319 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:24:46,320 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:24:46,321 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:24:46,321 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:24:46,322 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:24:46" (1/1) ... [2022-02-21 03:24:46,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:46,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:46,353 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:46,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-02-21 03:24:46,397 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:24:46,397 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:24:46,440 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:24:46,441 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:24:46,539 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:24:46,544 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:24:46,544 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-21 03:24:46,546 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:24:46 BoogieIcfgContainer [2022-02-21 03:24:46,546 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:24:46,547 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:24:46,547 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:24:46,550 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:24:46,550 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:24:46,550 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:24:46" (1/3) ... [2022-02-21 03:24:46,551 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1aa62c6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:24:46, skipping insertion in model container [2022-02-21 03:24:46,552 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:24:46,552 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:24:46" (2/3) ... [2022-02-21 03:24:46,552 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1aa62c6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:24:46, skipping insertion in model container [2022-02-21 03:24:46,552 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:24:46,552 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:24:46" (3/3) ... [2022-02-21 03:24:46,554 INFO L388 chiAutomizerObserver]: Analyzing ICFG BrockschmidtCookFuhs-CAV2013-Fig9a.c [2022-02-21 03:24:46,627 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:24:46,628 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:24:46,628 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:24:46,628 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:24:46,628 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:24:46,628 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:24:46,628 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:24:46,628 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:24:46,655 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:46,675 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:24:46,676 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:46,676 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:46,680 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-02-21 03:24:46,681 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:24:46,681 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:24:46,681 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:46,682 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:24:46,683 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:46,683 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:46,683 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-02-21 03:24:46,683 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:24:46,688 INFO L791 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_~k~0#1, main_~i~0#1, main_~j~0#1, main_~n~0#1;havoc main_~k~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~n~0#1;main_~k~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~j~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~n~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 11#L20true assume main_~k~0#1 >= 1;main_~i~0#1 := 0; 9#L22-2true [2022-02-21 03:24:46,688 INFO L793 eck$LassoCheckResult]: Loop: 9#L22-2true assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; 6#L24-2true assume !(main_~j~0#1 <= main_~i~0#1); 10#L24-3true main_~i~0#1 := 1 + main_~i~0#1; 9#L22-2true [2022-02-21 03:24:46,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:46,696 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-02-21 03:24:46,703 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:46,703 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547014130] [2022-02-21 03:24:46,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:46,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:46,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:46,765 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:46,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:46,786 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:46,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:46,790 INFO L85 PathProgramCache]: Analyzing trace with hash 43923, now seen corresponding path program 1 times [2022-02-21 03:24:46,790 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:46,790 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441285704] [2022-02-21 03:24:46,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:46,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:46,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:46,806 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:46,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:46,818 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:46,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:46,820 INFO L85 PathProgramCache]: Analyzing trace with hash 889513810, now seen corresponding path program 1 times [2022-02-21 03:24:46,820 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:46,821 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760312843] [2022-02-21 03:24:46,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:46,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:46,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:46,911 INFO L290 TraceCheckUtils]: 0: Hoare triple {18#true} assume { :begin_inline_ULTIMATE.init } true; {18#true} is VALID [2022-02-21 03:24:46,911 INFO L290 TraceCheckUtils]: 1: Hoare triple {18#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_~k~0#1, main_~i~0#1, main_~j~0#1, main_~n~0#1;havoc main_~k~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~n~0#1;main_~k~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~j~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~n~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; {18#true} is VALID [2022-02-21 03:24:46,912 INFO L290 TraceCheckUtils]: 2: Hoare triple {18#true} assume main_~k~0#1 >= 1;main_~i~0#1 := 0; {20#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:24:46,913 INFO L290 TraceCheckUtils]: 3: Hoare triple {20#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; {21#(<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:24:46,914 INFO L290 TraceCheckUtils]: 4: Hoare triple {21#(<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~i~0#1|)} assume !(main_~j~0#1 <= main_~i~0#1); {19#false} is VALID [2022-02-21 03:24:46,914 INFO L290 TraceCheckUtils]: 5: Hoare triple {19#false} main_~i~0#1 := 1 + main_~i~0#1; {19#false} is VALID [2022-02-21 03:24:46,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:24:46,915 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:24:46,915 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760312843] [2022-02-21 03:24:46,916 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760312843] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:24:46,916 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:24:46,917 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 03:24:46,917 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301919643] [2022-02-21 03:24:46,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:24:46,992 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:24:46,992 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:24:46,992 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:24:46,993 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:24:46,993 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:24:46,993 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:46,993 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:24:46,993 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:24:46,994 INFO L133 ssoRankerPreferences]: Filename of dumped script: BrockschmidtCookFuhs-CAV2013-Fig9a.c_Iteration1_Loop [2022-02-21 03:24:46,994 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:24:46,994 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:24:47,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:47,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:47,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:47,108 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:24:47,110 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:24:47,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:47,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:47,113 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:47,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-02-21 03:24:47,116 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:47,116 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:47,141 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:24:47,141 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:24:47,160 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:47,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:47,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:47,162 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:47,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-02-21 03:24:47,165 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:47,165 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:47,187 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:24:47,187 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:24:47,205 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:47,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:47,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:47,212 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:47,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-02-21 03:24:47,215 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:47,217 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:47,253 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:47,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:47,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:47,256 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:47,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-02-21 03:24:47,259 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:24:47,259 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:47,375 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:24:47,380 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:47,381 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:24:47,381 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:24:47,381 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:24:47,381 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:24:47,381 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:24:47,381 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:47,381 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:24:47,381 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:24:47,381 INFO L133 ssoRankerPreferences]: Filename of dumped script: BrockschmidtCookFuhs-CAV2013-Fig9a.c_Iteration1_Loop [2022-02-21 03:24:47,382 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:24:47,382 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:24:47,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:47,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:47,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:47,478 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:24:47,481 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:24:47,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:47,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:47,483 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:47,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-02-21 03:24:47,486 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:24:47,492 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:47,492 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:47,492 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:47,492 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:47,495 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:24:47,495 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:24:47,512 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:24:47,528 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:47,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:47,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:47,530 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:47,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-02-21 03:24:47,532 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:24:47,538 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:47,538 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:47,538 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:47,538 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:47,541 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:24:47,541 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:24:47,558 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:24:47,576 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:47,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:47,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:47,578 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:47,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-02-21 03:24:47,581 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:24:47,586 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:47,587 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:24:47,587 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:47,587 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:47,587 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:47,589 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:24:47,589 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:24:47,603 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:24:47,615 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:24:47,615 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-02-21 03:24:47,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:47,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:47,618 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:47,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-02-21 03:24:47,620 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:24:47,620 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:24:47,620 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:24:47,620 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2022-02-21 03:24:47,638 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:47,648 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:24:47,654 INFO L390 LassoCheck]: Loop: "assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0;" "assume !(main_~j~0#1 <= main_~i~0#1);" "main_~i~0#1 := 1 + main_~i~0#1;" [2022-02-21 03:24:47,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:47,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:47,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:47,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:24:47,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:47,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:47,697 INFO L290 TraceCheckUtils]: 0: Hoare triple {22#unseeded} assume { :begin_inline_ULTIMATE.init } true; {22#unseeded} is VALID [2022-02-21 03:24:47,698 INFO L290 TraceCheckUtils]: 1: Hoare triple {22#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_~k~0#1, main_~i~0#1, main_~j~0#1, main_~n~0#1;havoc main_~k~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~n~0#1;main_~k~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~j~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~n~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; {22#unseeded} is VALID [2022-02-21 03:24:47,698 INFO L290 TraceCheckUtils]: 2: Hoare triple {22#unseeded} assume main_~k~0#1 >= 1;main_~i~0#1 := 0; {22#unseeded} is VALID [2022-02-21 03:24:47,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:47,705 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-21 03:24:47,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:47,710 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:47,789 INFO L290 TraceCheckUtils]: 0: Hoare triple {25#(>= oldRank0 (* (- 1) |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; {46#(and (>= oldRank0 (* (- 1) |ULTIMATE.start_main_~i~0#1|)) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:24:47,790 INFO L290 TraceCheckUtils]: 1: Hoare triple {46#(and (>= oldRank0 (* (- 1) |ULTIMATE.start_main_~i~0#1|)) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume !(main_~j~0#1 <= main_~i~0#1); {50#(and (< |ULTIMATE.start_main_~i~0#1| 0) (>= oldRank0 (* (- 1) |ULTIMATE.start_main_~i~0#1|)))} is VALID [2022-02-21 03:24:47,791 INFO L290 TraceCheckUtils]: 2: Hoare triple {50#(and (< |ULTIMATE.start_main_~i~0#1| 0) (>= oldRank0 (* (- 1) |ULTIMATE.start_main_~i~0#1|)))} main_~i~0#1 := 1 + main_~i~0#1; {35#(or unseeded (and (> oldRank0 (* (- 1) |ULTIMATE.start_main_~i~0#1|)) (>= oldRank0 0)))} is VALID [2022-02-21 03:24:47,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:24:47,813 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:47,822 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:24:47,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:47,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,827 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2022-02-21 03:24:47,828 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:47,922 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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 36 states and 54 transitions. Complement of second has 9 states. [2022-02-21 03:24:47,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2022-02-21 03:24:47,923 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:47,923 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:47,924 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:24:47,924 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:47,924 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:47,925 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:47,927 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-02-21 03:24:47,927 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:47,927 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:47,928 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 54 transitions. [2022-02-21 03:24:47,929 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:24:47,929 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:47,929 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:47,930 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:47,932 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:24:47,932 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:24:47,932 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:47,935 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-02-21 03:24:47,935 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:24:47,935 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 36 states and 54 transitions. cyclomatic complexity: 21 [2022-02-21 03:24:47,936 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 03:24:47,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:47,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:47,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 54 transitions. cyclomatic complexity: 21 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:47,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:24:47,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:24:47,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 54 transitions. cyclomatic complexity: 21 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:24:47,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 1 letters. [2022-02-21 03:24:47,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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) Stem has 5 letters. Loop has 1 letters. [2022-02-21 03:24:47,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 54 transitions. cyclomatic complexity: 21 Stem has 5 letters. Loop has 1 letters. [2022-02-21 03:24:47,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 36 letters. Loop has 36 letters. [2022-02-21 03:24:47,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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) Stem has 36 letters. Loop has 36 letters. [2022-02-21 03:24:47,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 54 transitions. cyclomatic complexity: 21 Stem has 36 letters. Loop has 36 letters. [2022-02-21 03:24:47,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 10 letters. [2022-02-21 03:24:47,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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) Stem has 10 letters. Loop has 10 letters. [2022-02-21 03:24:47,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 54 transitions. cyclomatic complexity: 21 Stem has 10 letters. Loop has 10 letters. [2022-02-21 03:24:47,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:24:47,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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) Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:24:47,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 54 transitions. cyclomatic complexity: 21 Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:24:47,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:47,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:47,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 54 transitions. cyclomatic complexity: 21 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:47,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 1 letters. [2022-02-21 03:24:47,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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) Stem has 4 letters. Loop has 1 letters. [2022-02-21 03:24:47,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 54 transitions. cyclomatic complexity: 21 Stem has 4 letters. Loop has 1 letters. [2022-02-21 03:24:47,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:24:47,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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) Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:24:47,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 54 transitions. cyclomatic complexity: 21 Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:24:47,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:24:47,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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) Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:24:47,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 54 transitions. cyclomatic complexity: 21 Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:24:47,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:24:47,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:24:47,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 54 transitions. cyclomatic complexity: 21 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:24:47,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:24:47,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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) Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:24:47,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 54 transitions. cyclomatic complexity: 21 Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:24:47,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:24:47,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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) Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:24:47,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 54 transitions. cyclomatic complexity: 21 Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:24:47,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 1 letters. [2022-02-21 03:24:47,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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) Stem has 5 letters. Loop has 1 letters. [2022-02-21 03:24:47,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 54 transitions. cyclomatic complexity: 21 Stem has 5 letters. Loop has 1 letters. [2022-02-21 03:24:47,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:24:47,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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) Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:24:47,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 54 transitions. cyclomatic complexity: 21 Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:24:47,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,968 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:47,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:47,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 34 transitions. [2022-02-21 03:24:47,976 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 34 transitions. Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:47,976 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,976 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 34 transitions. Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:24:47,976 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,976 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 34 transitions. Stem has 3 letters. Loop has 6 letters. [2022-02-21 03:24:47,976 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,977 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 54 transitions. cyclomatic complexity: 21 [2022-02-21 03:24:47,981 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:24:47,985 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 15 states and 20 transitions. [2022-02-21 03:24:47,988 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2022-02-21 03:24:47,988 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:47,989 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2022-02-21 03:24:47,989 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 20 transitions. [2022-02-21 03:24:47,989 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:24:47,990 INFO L681 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2022-02-21 03:24:48,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 20 transitions. [2022-02-21 03:24:48,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2022-02-21 03:24:48,005 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:24:48,005 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states and 20 transitions. Second operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:48,006 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states and 20 transitions. Second operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:48,007 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. Second operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:48,009 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:24:48,011 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2022-02-21 03:24:48,011 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 20 transitions. [2022-02-21 03:24:48,012 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:24:48,012 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:24:48,012 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 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) Second operand 15 states and 20 transitions. [2022-02-21 03:24:48,013 INFO L87 Difference]: Start difference. First operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 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) Second operand 15 states and 20 transitions. [2022-02-21 03:24:48,013 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:24:48,015 INFO L93 Difference]: Finished difference Result 16 states and 22 transitions. [2022-02-21 03:24:48,015 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 22 transitions. [2022-02-21 03:24:48,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:24:48,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:24:48,015 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:24:48,015 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:24:48,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:48,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2022-02-21 03:24:48,018 INFO L704 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2022-02-21 03:24:48,018 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:24:48,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:24:48,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:24:48,020 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:48,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:24:48,061 INFO L93 Difference]: Finished difference Result 12 states and 15 transitions. [2022-02-21 03:24:48,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:24:48,061 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:48,072 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:24:48,073 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 15 transitions. [2022-02-21 03:24:48,074 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:24:48,074 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 8 states and 9 transitions. [2022-02-21 03:24:48,075 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2022-02-21 03:24:48,075 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2022-02-21 03:24:48,075 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 9 transitions. [2022-02-21 03:24:48,075 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:24:48,075 INFO L681 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2022-02-21 03:24:48,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 9 transitions. [2022-02-21 03:24:48,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. [2022-02-21 03:24:48,076 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:24:48,076 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8 states and 9 transitions. Second operand has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:48,076 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states and 9 transitions. Second operand has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:48,077 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:48,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:24:48,077 INFO L93 Difference]: Finished difference Result 8 states and 9 transitions. [2022-02-21 03:24:48,077 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2022-02-21 03:24:48,078 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:24:48,078 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:24:48,078 INFO L74 IsIncluded]: Start isIncluded. First operand has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 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 8 states and 9 transitions. [2022-02-21 03:24:48,078 INFO L87 Difference]: Start difference. First operand has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 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 8 states and 9 transitions. [2022-02-21 03:24:48,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:24:48,079 INFO L93 Difference]: Finished difference Result 8 states and 9 transitions. [2022-02-21 03:24:48,079 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2022-02-21 03:24:48,079 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:24:48,079 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:24:48,079 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:24:48,080 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:24:48,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:48,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2022-02-21 03:24:48,080 INFO L704 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2022-02-21 03:24:48,081 INFO L587 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2022-02-21 03:24:48,081 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:24:48,081 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. [2022-02-21 03:24:48,081 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:24:48,081 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:48,081 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:48,082 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-02-21 03:24:48,082 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-02-21 03:24:48,082 INFO L791 eck$LassoCheckResult]: Stem: 198#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 199#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_~k~0#1, main_~i~0#1, main_~j~0#1, main_~n~0#1;havoc main_~k~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~n~0#1;main_~k~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~j~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~n~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 204#L20 assume main_~k~0#1 >= 1;main_~i~0#1 := 0; 203#L22-2 [2022-02-21 03:24:48,082 INFO L793 eck$LassoCheckResult]: Loop: 203#L22-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; 200#L24-2 assume !!(main_~j~0#1 <= main_~i~0#1);main_~j~0#1 := main_~j~0#1 + main_~k~0#1; 201#L24-2 assume !(main_~j~0#1 <= main_~i~0#1); 202#L24-3 main_~i~0#1 := 1 + main_~i~0#1; 203#L22-2 [2022-02-21 03:24:48,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:48,083 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 2 times [2022-02-21 03:24:48,083 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:48,083 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278814404] [2022-02-21 03:24:48,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:48,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:48,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:48,087 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:48,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:48,089 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:48,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:48,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1363376, now seen corresponding path program 1 times [2022-02-21 03:24:48,090 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:48,090 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294353803] [2022-02-21 03:24:48,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:48,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:48,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:48,096 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:48,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:48,101 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:48,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:48,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1805126097, now seen corresponding path program 1 times [2022-02-21 03:24:48,101 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:48,102 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672861728] [2022-02-21 03:24:48,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:48,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:48,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:48,111 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:48,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:48,117 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:48,152 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:24:48,152 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:24:48,152 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:24:48,152 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:24:48,152 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:24:48,152 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:48,152 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:24:48,153 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:24:48,153 INFO L133 ssoRankerPreferences]: Filename of dumped script: BrockschmidtCookFuhs-CAV2013-Fig9a.c_Iteration2_Loop [2022-02-21 03:24:48,153 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:24:48,153 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:24:48,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:48,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:48,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:48,216 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:24:48,219 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:24:48,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:48,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:48,220 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:48,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-02-21 03:24:48,224 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:48,224 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:48,260 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:24:48,260 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:24:48,279 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:48,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:48,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:48,281 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:48,288 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:48,288 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:48,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-02-21 03:24:48,323 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:24:48,323 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_3=1} Honda state: {v_rep~unnamed0~0~true_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:24:48,338 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:48,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:48,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:48,340 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:48,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-02-21 03:24:48,343 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:48,343 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:48,384 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:48,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:48,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:48,385 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:48,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-02-21 03:24:48,387 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:24:48,387 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:48,537 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:24:48,541 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:48,541 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:24:48,542 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:24:48,542 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:24:48,542 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:24:48,542 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:24:48,542 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:48,542 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:24:48,542 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:24:48,542 INFO L133 ssoRankerPreferences]: Filename of dumped script: BrockschmidtCookFuhs-CAV2013-Fig9a.c_Iteration2_Loop [2022-02-21 03:24:48,542 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:24:48,542 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:24:48,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:48,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:48,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:48,610 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:24:48,610 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:24:48,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:48,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:48,611 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:48,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-02-21 03:24:48,613 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:24:48,619 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:48,619 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:48,619 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:48,619 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:48,621 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:24:48,621 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:24:48,636 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:24:48,652 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:48,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:48,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:48,656 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:48,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-02-21 03:24:48,658 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:24:48,664 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:48,665 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:48,665 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:48,665 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:48,666 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:24:48,666 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:24:48,682 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:24:48,699 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:48,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:48,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:48,701 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:48,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-02-21 03:24:48,703 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:24:48,709 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:48,709 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:24:48,709 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:48,709 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:48,709 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:48,711 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:24:48,711 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:24:48,726 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:24:48,730 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-02-21 03:24:48,730 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-02-21 03:24:48,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:48,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:48,740 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:48,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-02-21 03:24:48,743 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:24:48,743 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:24:48,743 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:24:48,743 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~n~0#1) = -1*ULTIMATE.start_main_~i~0#1 + 1*ULTIMATE.start_main_~n~0#1 Supporting invariants [] [2022-02-21 03:24:48,761 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:48,770 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:24:48,774 INFO L390 LassoCheck]: Loop: "assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0;" "assume !!(main_~j~0#1 <= main_~i~0#1);main_~j~0#1 := main_~j~0#1 + main_~k~0#1;" "assume !(main_~j~0#1 <= main_~i~0#1);" "main_~i~0#1 := 1 + main_~i~0#1;" [2022-02-21 03:24:48,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:48,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:48,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:48,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:24:48,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:48,801 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:48,807 INFO L290 TraceCheckUtils]: 0: Hoare triple {230#unseeded} assume { :begin_inline_ULTIMATE.init } true; {230#unseeded} is VALID [2022-02-21 03:24:48,807 INFO L290 TraceCheckUtils]: 1: Hoare triple {230#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_~k~0#1, main_~i~0#1, main_~j~0#1, main_~n~0#1;havoc main_~k~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~n~0#1;main_~k~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~j~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~n~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; {230#unseeded} is VALID [2022-02-21 03:24:48,808 INFO L290 TraceCheckUtils]: 2: Hoare triple {230#unseeded} assume main_~k~0#1 >= 1;main_~i~0#1 := 0; {230#unseeded} is VALID [2022-02-21 03:24:48,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:48,814 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:24:48,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:48,820 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:48,883 INFO L290 TraceCheckUtils]: 0: Hoare triple {233#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~n~0#1|))} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; {254#(and (< |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~n~0#1|) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~n~0#1|)))} is VALID [2022-02-21 03:24:48,883 INFO L290 TraceCheckUtils]: 1: Hoare triple {254#(and (< |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~n~0#1|) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~n~0#1|)))} assume !!(main_~j~0#1 <= main_~i~0#1);main_~j~0#1 := main_~j~0#1 + main_~k~0#1; {254#(and (< |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~n~0#1|) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~n~0#1|)))} is VALID [2022-02-21 03:24:48,884 INFO L290 TraceCheckUtils]: 2: Hoare triple {254#(and (< |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~n~0#1|) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~n~0#1|)))} assume !(main_~j~0#1 <= main_~i~0#1); {254#(and (< |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~n~0#1|) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~n~0#1|)))} is VALID [2022-02-21 03:24:48,885 INFO L290 TraceCheckUtils]: 3: Hoare triple {254#(and (< |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~n~0#1|) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~n~0#1|)))} main_~i~0#1 := 1 + main_~i~0#1; {243#(or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~n~0#1|))) unseeded)} is VALID [2022-02-21 03:24:48,885 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 03:24:48,885 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:48,889 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:24:48,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) 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) Stem has 3 letters. Loop has 4 letters. [2022-02-21 03:24:48,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,890 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-02-21 03:24:48,890 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 8 transitions. cyclomatic complexity: 2 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:48,913 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 8 transitions. cyclomatic complexity: 2. Second operand has 3 states, 3 states have (on average 2.3333333333333335) 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) Result 11 states and 14 transitions. Complement of second has 4 states. [2022-02-21 03:24:48,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 03:24:48,916 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:48,916 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. cyclomatic complexity: 2 [2022-02-21 03:24:48,916 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:48,916 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:48,916 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:48,917 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:24:48,919 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:48,919 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:48,919 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2022-02-21 03:24:48,920 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:24:48,920 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:48,920 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:48,921 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 7 states and 8 transitions. cyclomatic complexity: 2 [2022-02-21 03:24:48,921 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 03:24:48,921 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:48,923 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:24:48,924 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:24:48,924 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 11 states and 14 transitions. cyclomatic complexity: 5 [2022-02-21 03:24:48,924 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:24:48,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 3 letters. Loop has 4 letters. [2022-02-21 03:24:48,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) 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) Stem has 3 letters. Loop has 4 letters. [2022-02-21 03:24:48,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 4 letters. [2022-02-21 03:24:48,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:48,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:48,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:48,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 5 letters. Loop has 1 letters. [2022-02-21 03:24:48,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) 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) Stem has 5 letters. Loop has 1 letters. [2022-02-21 03:24:48,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 1 letters. [2022-02-21 03:24:48,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 11 letters. Loop has 11 letters. [2022-02-21 03:24:48,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) 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) Stem has 11 letters. Loop has 11 letters. [2022-02-21 03:24:48,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 11 letters. Loop has 11 letters. [2022-02-21 03:24:48,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 7 letters. Loop has 7 letters. [2022-02-21 03:24:48,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) 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) Stem has 7 letters. Loop has 7 letters. [2022-02-21 03:24:48,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 7 letters. [2022-02-21 03:24:48,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:48,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) 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) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:48,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:48,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:24:48,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) 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) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:24:48,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:24:48,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 5 letters. Loop has 1 letters. [2022-02-21 03:24:48,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) 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) Stem has 5 letters. Loop has 1 letters. [2022-02-21 03:24:48,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 1 letters. [2022-02-21 03:24:48,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:24:48,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) 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) Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:24:48,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:24:48,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 3 letters. Loop has 4 letters. [2022-02-21 03:24:48,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) 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) Stem has 3 letters. Loop has 4 letters. [2022-02-21 03:24:48,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 4 letters. [2022-02-21 03:24:48,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:48,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:48,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:48,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 5 letters. Loop has 1 letters. [2022-02-21 03:24:48,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) 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) Stem has 5 letters. Loop has 1 letters. [2022-02-21 03:24:48,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 1 letters. [2022-02-21 03:24:48,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,940 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:48,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:48,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2022-02-21 03:24:48,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 3 letters. Loop has 4 letters. [2022-02-21 03:24:48,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:24:48,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 3 letters. Loop has 8 letters. [2022-02-21 03:24:48,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,942 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 14 transitions. cyclomatic complexity: 5 [2022-02-21 03:24:48,945 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:24:48,946 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 10 states and 13 transitions. [2022-02-21 03:24:48,946 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2022-02-21 03:24:48,947 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2022-02-21 03:24:48,947 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2022-02-21 03:24:48,947 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:24:48,947 INFO L681 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2022-02-21 03:24:48,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2022-02-21 03:24:48,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2022-02-21 03:24:48,948 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:24:48,948 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10 states and 13 transitions. Second operand has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:48,948 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states and 13 transitions. Second operand has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:48,948 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. Second operand has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:48,948 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:24:48,949 INFO L93 Difference]: Finished difference Result 10 states and 13 transitions. [2022-02-21 03:24:48,949 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 13 transitions. [2022-02-21 03:24:48,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:24:48,949 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:24:48,949 INFO L74 IsIncluded]: Start isIncluded. First operand has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 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 10 states and 13 transitions. [2022-02-21 03:24:48,950 INFO L87 Difference]: Start difference. First operand has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 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 10 states and 13 transitions. [2022-02-21 03:24:48,950 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:24:48,950 INFO L93 Difference]: Finished difference Result 10 states and 13 transitions. [2022-02-21 03:24:48,950 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 13 transitions. [2022-02-21 03:24:48,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:24:48,951 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:24:48,951 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:24:48,951 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:24:48,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:48,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 12 transitions. [2022-02-21 03:24:48,953 INFO L704 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2022-02-21 03:24:48,953 INFO L587 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2022-02-21 03:24:48,953 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:24:48,954 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 12 transitions. [2022-02-21 03:24:48,954 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:24:48,954 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:48,954 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:48,954 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-02-21 03:24:48,954 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1] [2022-02-21 03:24:48,954 INFO L791 eck$LassoCheckResult]: Stem: 281#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 282#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_~k~0#1, main_~i~0#1, main_~j~0#1, main_~n~0#1;havoc main_~k~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~n~0#1;main_~k~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~j~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~n~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 288#L20 assume main_~k~0#1 >= 1;main_~i~0#1 := 0; 289#L22-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; 283#L24-2 [2022-02-21 03:24:48,955 INFO L793 eck$LassoCheckResult]: Loop: 283#L24-2 assume !!(main_~j~0#1 <= main_~i~0#1);main_~j~0#1 := main_~j~0#1 + main_~k~0#1; 283#L24-2 [2022-02-21 03:24:48,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:48,955 INFO L85 PathProgramCache]: Analyzing trace with hash 925612, now seen corresponding path program 1 times [2022-02-21 03:24:48,955 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:48,955 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46236629] [2022-02-21 03:24:48,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:48,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:48,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:48,960 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:48,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:48,964 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:48,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:48,965 INFO L85 PathProgramCache]: Analyzing trace with hash 54, now seen corresponding path program 1 times [2022-02-21 03:24:48,966 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:48,966 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689329177] [2022-02-21 03:24:48,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:48,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:48,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:48,973 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:48,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:48,976 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:48,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:48,977 INFO L85 PathProgramCache]: Analyzing trace with hash 28693995, now seen corresponding path program 1 times [2022-02-21 03:24:48,977 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:48,977 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569275144] [2022-02-21 03:24:48,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:48,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:48,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:48,989 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:48,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:48,995 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:49,034 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:24:49,034 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:24:49,034 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:24:49,034 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:24:49,034 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:24:49,034 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:49,034 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:24:49,035 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:24:49,035 INFO L133 ssoRankerPreferences]: Filename of dumped script: BrockschmidtCookFuhs-CAV2013-Fig9a.c_Iteration3_Lasso [2022-02-21 03:24:49,035 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:24:49,035 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:24:49,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:49,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:49,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:49,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:49,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:49,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:49,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:49,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:49,142 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:24:49,142 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:24:49,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:49,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:49,152 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:49,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-02-21 03:24:49,171 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:49,171 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:49,183 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:24:49,183 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_5=0} Honda state: {v_rep~unnamed0~0~false_5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:24:49,201 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2022-02-21 03:24:49,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:49,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:49,202 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:49,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-02-21 03:24:49,214 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:49,214 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:49,233 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:49,234 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:24:49,234 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet1#1=0} Honda state: {ULTIMATE.start_main_#t~nondet1#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:24:49,250 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2022-02-21 03:24:49,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:49,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:49,253 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:49,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-02-21 03:24:49,257 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:49,257 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:49,270 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:24:49,270 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet2#1=0} Honda state: {ULTIMATE.start_main_#t~nondet2#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:24:49,285 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:49,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:49,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:49,286 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:49,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-02-21 03:24:49,290 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:49,290 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:49,297 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:24:49,297 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet3#1=0} Honda state: {ULTIMATE.start_main_#t~nondet3#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:24:49,315 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:49,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:49,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:49,316 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:49,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-02-21 03:24:49,318 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:49,319 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:49,326 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:24:49,326 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#res#1=0} Honda state: {ULTIMATE.start_main_#res#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:24:49,343 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:49,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:49,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:49,344 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:49,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-02-21 03:24:49,346 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:49,346 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:49,363 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:24:49,363 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_5=1} Honda state: {v_rep~unnamed0~0~true_5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:24:49,379 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2022-02-21 03:24:49,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:49,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:49,380 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:49,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-02-21 03:24:49,382 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:49,382 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:49,399 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:24:49,399 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet0#1=0} Honda state: {ULTIMATE.start_main_#t~nondet0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:24:49,415 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:49,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:49,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:49,417 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:49,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-02-21 03:24:49,451 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:49,452 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:49,482 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2022-02-21 03:24:49,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:49,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:49,484 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:49,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-02-21 03:24:49,486 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:24:49,486 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:49,708 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:24:49,712 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2022-02-21 03:24:49,712 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:24:49,712 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:24:49,712 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:24:49,712 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:24:49,712 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:24:49,712 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:49,712 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:24:49,712 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:24:49,712 INFO L133 ssoRankerPreferences]: Filename of dumped script: BrockschmidtCookFuhs-CAV2013-Fig9a.c_Iteration3_Lasso [2022-02-21 03:24:49,712 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:24:49,712 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:24:49,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:49,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:49,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:49,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:49,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:49,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:49,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:49,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:49,831 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:24:49,831 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:24:49,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:49,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:49,833 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) [2022-02-21 03:24:49,834 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 [2022-02-21 03:24:49,835 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:24:49,841 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:49,841 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:49,841 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:49,841 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:49,842 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:24:49,843 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:24:49,858 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:24:49,873 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2022-02-21 03:24:49,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:49,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:49,875 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:49,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-02-21 03:24:49,877 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:24:49,883 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:49,883 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:24:49,883 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:49,883 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:49,883 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:49,883 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:24:49,883 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:24:49,884 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:24:49,900 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2022-02-21 03:24:49,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:49,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:49,901 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:49,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2022-02-21 03:24:49,903 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:24:49,909 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:49,909 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:24:49,909 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:49,909 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:49,909 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:49,909 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:24:49,909 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:24:49,911 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:24:49,926 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2022-02-21 03:24:49,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:49,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:49,927 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:49,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2022-02-21 03:24:49,929 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:24:49,935 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:49,935 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:24:49,935 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:49,935 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:49,935 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:49,943 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:24:49,943 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:24:49,944 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:24:49,959 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2022-02-21 03:24:49,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:49,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:49,961 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:49,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2022-02-21 03:24:49,963 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:24:49,969 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:49,969 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:24:49,969 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:49,969 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:49,969 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:49,970 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:24:49,970 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:24:49,984 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:24:50,003 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 [2022-02-21 03:24:50,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:50,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:50,005 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:50,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2022-02-21 03:24:50,007 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:24:50,013 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:50,014 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:24:50,014 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:50,014 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:50,014 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:50,014 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:24:50,014 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:24:50,027 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:24:50,042 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:50,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:50,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:50,044 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:50,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2022-02-21 03:24:50,046 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:24:50,052 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:50,052 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:50,052 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:50,052 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:50,054 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:24:50,054 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:24:50,056 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:24:50,073 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:50,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:50,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:50,074 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:50,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2022-02-21 03:24:50,127 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:24:50,134 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:50,134 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:50,134 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:50,134 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:50,137 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:24:50,137 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:24:50,152 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:24:50,159 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2022-02-21 03:24:50,159 INFO L444 ModelExtractionUtils]: 5 out of 16 variables were initially zero. Simplification set additionally 3 variables to zero. [2022-02-21 03:24:50,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:50,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:50,161 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) [2022-02-21 03:24:50,161 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 [2022-02-21 03:24:50,163 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:24:50,169 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 2. [2022-02-21 03:24:50,169 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:24:50,169 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 [1*ULTIMATE.start_main_~k~0#1 - 1 >= 0, -2*ULTIMATE.start_main_~i~0#1 + 1*ULTIMATE.start_main_~n~0#1 - 1 >= 0] [2022-02-21 03:24:50,185 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:50,203 INFO L297 tatePredicateManager]: 0 out of 2 supporting invariants were superfluous and have been removed [2022-02-21 03:24:50,214 INFO L390 LassoCheck]: Loop: "assume !!(main_~j~0#1 <= main_~i~0#1);main_~j~0#1 := main_~j~0#1 + main_~k~0#1;" [2022-02-21 03:24:50,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:50,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:50,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:50,259 WARN L261 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-21 03:24:50,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:50,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:50,290 INFO L290 TraceCheckUtils]: 0: Hoare triple {347#unseeded} assume { :begin_inline_ULTIMATE.init } true; {347#unseeded} is VALID [2022-02-21 03:24:50,291 INFO L290 TraceCheckUtils]: 1: Hoare triple {347#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_~k~0#1, main_~i~0#1, main_~j~0#1, main_~n~0#1;havoc main_~k~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~n~0#1;main_~k~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~j~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~n~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; {347#unseeded} is VALID [2022-02-21 03:24:50,292 INFO L290 TraceCheckUtils]: 2: Hoare triple {347#unseeded} assume main_~k~0#1 >= 1;main_~i~0#1 := 0; {387#(and (<= |ULTIMATE.start_main_~i~0#1| 0) unseeded (<= 1 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-21 03:24:50,292 INFO L290 TraceCheckUtils]: 3: Hoare triple {387#(and (<= |ULTIMATE.start_main_~i~0#1| 0) unseeded (<= 1 |ULTIMATE.start_main_~k~0#1|))} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; {372#(and (>= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0) unseeded (>= (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) (- 1) |ULTIMATE.start_main_~n~0#1|) 0))} is VALID [2022-02-21 03:24:50,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:50,296 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-21 03:24:50,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:50,299 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:50,300 INFO L290 TraceCheckUtils]: 0: Hoare triple {373#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|)) (>= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0) (>= (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) (- 1) |ULTIMATE.start_main_~n~0#1|) 0))} assume !!(main_~j~0#1 <= main_~i~0#1);main_~j~0#1 := main_~j~0#1 + main_~k~0#1; {375#(and (>= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0) (>= (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) (- 1) |ULTIMATE.start_main_~n~0#1|) 0) (or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|))) unseeded))} is VALID [2022-02-21 03:24:50,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:24:50,301 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:50,306 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:24:50,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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) Stem has 4 letters. Loop has 1 letters. [2022-02-21 03:24:50,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:50,307 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 1 loop predicates [2022-02-21 03:24:50,308 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states and 12 transitions. cyclomatic complexity: 5 Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:50,357 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9 states and 12 transitions. cyclomatic complexity: 5. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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 15 states and 19 transitions. Complement of second has 6 states. [2022-02-21 03:24:50,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 03:24:50,357 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:50,357 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 12 transitions. cyclomatic complexity: 5 [2022-02-21 03:24:50,357 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:50,357 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:50,357 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:50,359 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:24:50,359 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:50,359 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:50,359 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2022-02-21 03:24:50,360 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:24:50,360 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:50,360 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:50,361 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 9 states and 12 transitions. cyclomatic complexity: 5 [2022-02-21 03:24:50,361 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:24:50,361 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:50,362 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:24:50,362 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:24:50,362 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 15 states and 19 transitions. cyclomatic complexity: 8 [2022-02-21 03:24:50,363 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:24:50,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 12 transitions. cyclomatic complexity: 5 Stem has 4 letters. Loop has 1 letters. [2022-02-21 03:24:50,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:50,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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) Stem has 4 letters. Loop has 1 letters. [2022-02-21 03:24:50,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:50,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 19 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 1 letters. [2022-02-21 03:24:50,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:50,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 12 transitions. cyclomatic complexity: 5 Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:24:50,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:50,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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) Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:24:50,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:50,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 19 transitions. cyclomatic complexity: 8 Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:24:50,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:50,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 12 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:50,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:50,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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) Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:50,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:50,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 19 transitions. cyclomatic complexity: 8 Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:50,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:50,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 12 transitions. cyclomatic complexity: 5 Stem has 15 letters. Loop has 15 letters. [2022-02-21 03:24:50,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:50,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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) Stem has 15 letters. Loop has 15 letters. [2022-02-21 03:24:50,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:50,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 19 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 15 letters. [2022-02-21 03:24:50,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:50,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 12 transitions. cyclomatic complexity: 5 Stem has 9 letters. Loop has 9 letters. [2022-02-21 03:24:50,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:50,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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) Stem has 9 letters. Loop has 9 letters. [2022-02-21 03:24:50,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:50,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 19 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 9 letters. [2022-02-21 03:24:50,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:50,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 12 transitions. cyclomatic complexity: 5 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:24:50,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:50,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:24:50,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:50,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 19 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:24:50,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:50,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 12 transitions. cyclomatic complexity: 5 Stem has 4 letters. Loop has 1 letters. [2022-02-21 03:24:50,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:50,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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) Stem has 4 letters. Loop has 1 letters. [2022-02-21 03:24:50,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:50,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 19 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 1 letters. [2022-02-21 03:24:50,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:50,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 12 transitions. cyclomatic complexity: 5 Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:24:50,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:50,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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) Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:24:50,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:50,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 19 transitions. cyclomatic complexity: 8 Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:24:50,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:50,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 12 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:50,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:50,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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) Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:50,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:50,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 19 transitions. cyclomatic complexity: 8 Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:50,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:50,368 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:50,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:50,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 6 transitions. [2022-02-21 03:24:50,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 6 transitions. Stem has 4 letters. Loop has 1 letters. [2022-02-21 03:24:50,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:50,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 6 transitions. Stem has 5 letters. Loop has 1 letters. [2022-02-21 03:24:50,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:50,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 6 transitions. Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:24:50,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:50,370 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 19 transitions. cyclomatic complexity: 8 [2022-02-21 03:24:50,371 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:24:50,375 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 12 states and 15 transitions. [2022-02-21 03:24:50,375 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2022-02-21 03:24:50,375 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2022-02-21 03:24:50,375 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 15 transitions. [2022-02-21 03:24:50,375 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:24:50,375 INFO L681 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2022-02-21 03:24:50,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 15 transitions. [2022-02-21 03:24:50,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 9. [2022-02-21 03:24:50,376 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:24:50,376 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states and 15 transitions. Second operand has 9 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:50,376 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states and 15 transitions. Second operand has 9 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:50,376 INFO L87 Difference]: Start difference. First operand 12 states and 15 transitions. Second operand has 9 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:50,377 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:24:50,378 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2022-02-21 03:24:50,378 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 16 transitions. [2022-02-21 03:24:50,379 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:24:50,380 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:24:50,380 INFO L74 IsIncluded]: Start isIncluded. First operand has 9 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 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) Second operand 12 states and 15 transitions. [2022-02-21 03:24:50,380 INFO L87 Difference]: Start difference. First operand has 9 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 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) Second operand 12 states and 15 transitions. [2022-02-21 03:24:50,380 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:24:50,382 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2022-02-21 03:24:50,382 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 16 transitions. [2022-02-21 03:24:50,383 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:24:50,383 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:24:50,383 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:24:50,383 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:24:50,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:50,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2022-02-21 03:24:50,383 INFO L704 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2022-02-21 03:24:50,383 INFO L587 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2022-02-21 03:24:50,383 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 03:24:50,384 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 11 transitions. [2022-02-21 03:24:50,384 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:24:50,384 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:50,384 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:50,384 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2022-02-21 03:24:50,384 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1] [2022-02-21 03:24:50,385 INFO L791 eck$LassoCheckResult]: Stem: 416#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 417#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_~k~0#1, main_~i~0#1, main_~j~0#1, main_~n~0#1;havoc main_~k~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~n~0#1;main_~k~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~j~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~n~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 421#L20 assume main_~k~0#1 >= 1;main_~i~0#1 := 0; 424#L22-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; 419#L24-2 assume !!(main_~j~0#1 <= main_~i~0#1);main_~j~0#1 := main_~j~0#1 + main_~k~0#1; 420#L24-2 assume !(main_~j~0#1 <= main_~i~0#1); 422#L24-3 main_~i~0#1 := 1 + main_~i~0#1; 423#L22-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; 418#L24-2 [2022-02-21 03:24:50,385 INFO L793 eck$LassoCheckResult]: Loop: 418#L24-2 assume !!(main_~j~0#1 <= main_~i~0#1);main_~j~0#1 := main_~j~0#1 + main_~k~0#1; 418#L24-2 [2022-02-21 03:24:50,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:50,385 INFO L85 PathProgramCache]: Analyzing trace with hash 124334173, now seen corresponding path program 2 times [2022-02-21 03:24:50,385 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:50,386 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834666744] [2022-02-21 03:24:50,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:50,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:50,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:50,406 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:50,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:50,415 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:50,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:50,415 INFO L85 PathProgramCache]: Analyzing trace with hash 54, now seen corresponding path program 2 times [2022-02-21 03:24:50,416 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:50,416 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437234801] [2022-02-21 03:24:50,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:50,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:50,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:50,419 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:50,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:50,420 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:50,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:50,421 INFO L85 PathProgramCache]: Analyzing trace with hash -440607910, now seen corresponding path program 3 times [2022-02-21 03:24:50,421 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:50,421 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591471390] [2022-02-21 03:24:50,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:50,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:50,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:50,431 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:50,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:50,445 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:50,500 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:24:50,500 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:24:50,500 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:24:50,500 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:24:50,500 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:24:50,500 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:50,500 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:24:50,500 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:24:50,500 INFO L133 ssoRankerPreferences]: Filename of dumped script: BrockschmidtCookFuhs-CAV2013-Fig9a.c_Iteration4_Lasso [2022-02-21 03:24:50,500 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:24:50,500 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:24:50,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:50,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:50,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:50,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:50,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:50,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:50,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:50,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:50,596 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:24:50,596 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:24:50,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:50,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:50,597 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) [2022-02-21 03:24:50,598 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 [2022-02-21 03:24:50,599 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:50,599 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:50,606 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:24:50,607 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet0#1=0} Honda state: {ULTIMATE.start_main_#t~nondet0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:24:50,621 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 [2022-02-21 03:24:50,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:50,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:50,623 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) [2022-02-21 03:24:50,635 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:50,635 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:50,636 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 [2022-02-21 03:24:50,651 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 [2022-02-21 03:24:50,652 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:24:50,652 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet1#1=0} Honda state: {ULTIMATE.start_main_#t~nondet1#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:24:50,667 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 [2022-02-21 03:24:50,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:50,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:50,669 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) [2022-02-21 03:24:50,669 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 [2022-02-21 03:24:50,671 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:50,671 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:50,682 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:24:50,682 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_7=0} Honda state: {v_rep~unnamed0~0~false_7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:24:50,697 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 [2022-02-21 03:24:50,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:50,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:50,698 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) [2022-02-21 03:24:50,699 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 [2022-02-21 03:24:50,700 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:50,700 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:50,707 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:24:50,707 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#res#1=0} Honda state: {ULTIMATE.start_main_#res#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:24:50,723 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2022-02-21 03:24:50,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:50,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:50,724 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) [2022-02-21 03:24:50,726 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 [2022-02-21 03:24:50,727 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:50,727 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:50,734 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:24:50,734 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet2#1=0} Honda state: {ULTIMATE.start_main_#t~nondet2#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:24:50,749 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 [2022-02-21 03:24:50,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:50,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:50,750 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) [2022-02-21 03:24:50,751 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 [2022-02-21 03:24:50,752 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:50,752 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:50,764 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:24:50,764 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_7=1} Honda state: {v_rep~unnamed0~0~true_7=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:24:50,782 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:50,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:50,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:50,783 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) [2022-02-21 03:24:50,784 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 [2022-02-21 03:24:50,786 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:50,786 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:50,809 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2022-02-21 03:24:50,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:50,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:50,810 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) [2022-02-21 03:24:50,811 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 [2022-02-21 03:24:50,812 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:24:50,812 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:51,164 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:24:51,168 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 [2022-02-21 03:24:51,168 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:24:51,168 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:24:51,168 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:24:51,168 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:24:51,168 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:24:51,168 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:51,168 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:24:51,168 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:24:51,168 INFO L133 ssoRankerPreferences]: Filename of dumped script: BrockschmidtCookFuhs-CAV2013-Fig9a.c_Iteration4_Lasso [2022-02-21 03:24:51,168 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:24:51,168 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:24:51,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:51,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:51,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:51,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:51,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:51,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:51,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:51,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:51,272 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:24:51,272 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:24:51,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:51,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:51,273 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) [2022-02-21 03:24:51,274 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 [2022-02-21 03:24:51,276 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:24:51,282 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:51,282 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:24:51,282 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:51,282 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:51,282 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:51,283 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:24:51,283 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:24:51,283 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:24:51,298 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2022-02-21 03:24:51,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:51,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:51,300 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) [2022-02-21 03:24:51,300 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 [2022-02-21 03:24:51,302 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:24:51,308 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:51,308 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:24:51,308 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:51,308 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:51,308 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:51,308 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:24:51,308 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:24:51,309 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:24:51,324 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 [2022-02-21 03:24:51,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:51,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:51,325 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) [2022-02-21 03:24:51,326 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 [2022-02-21 03:24:51,328 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:24:51,334 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:51,334 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:51,334 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:51,334 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:51,335 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:24:51,335 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:24:51,340 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:24:51,355 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 [2022-02-21 03:24:51,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:51,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:51,357 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) [2022-02-21 03:24:51,358 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 [2022-02-21 03:24:51,359 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:24:51,366 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:51,366 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:24:51,366 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:51,366 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:51,366 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:51,367 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:24:51,367 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:24:51,381 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:24:51,396 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 [2022-02-21 03:24:51,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:51,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:51,398 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) [2022-02-21 03:24:51,398 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 [2022-02-21 03:24:51,400 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:24:51,406 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:51,406 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:24:51,406 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:51,406 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:51,406 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:51,407 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:24:51,407 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:24:51,421 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:24:51,436 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:51,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:51,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:51,437 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) [2022-02-21 03:24:51,438 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 [2022-02-21 03:24:51,439 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:24:51,445 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:51,445 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:51,445 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:51,445 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:51,448 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:24:51,448 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:24:51,463 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:24:51,470 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2022-02-21 03:24:51,470 INFO L444 ModelExtractionUtils]: 6 out of 16 variables were initially zero. Simplification set additionally 4 variables to zero. [2022-02-21 03:24:51,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:51,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:51,471 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) [2022-02-21 03:24:51,471 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 [2022-02-21 03:24:51,473 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:24:51,479 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2022-02-21 03:24:51,480 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:24:51,480 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0#1, ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~j~0#1 + 2*ULTIMATE.start_main_~i~0#1 + 1 Supporting invariants [1*ULTIMATE.start_main_~k~0#1 - 1 >= 0] [2022-02-21 03:24:51,495 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:51,515 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2022-02-21 03:24:51,521 INFO L390 LassoCheck]: Loop: "assume !!(main_~j~0#1 <= main_~i~0#1);main_~j~0#1 := main_~j~0#1 + main_~k~0#1;" [2022-02-21 03:24:51,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:51,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:51,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:51,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-21 03:24:51,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:51,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:51,593 INFO L290 TraceCheckUtils]: 0: Hoare triple {501#unseeded} assume { :begin_inline_ULTIMATE.init } true; {501#unseeded} is VALID [2022-02-21 03:24:51,594 INFO L290 TraceCheckUtils]: 1: Hoare triple {501#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_~k~0#1, main_~i~0#1, main_~j~0#1, main_~n~0#1;havoc main_~k~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~n~0#1;main_~k~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~j~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~n~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; {501#unseeded} is VALID [2022-02-21 03:24:51,594 INFO L290 TraceCheckUtils]: 2: Hoare triple {501#unseeded} assume main_~k~0#1 >= 1;main_~i~0#1 := 0; {520#(and (>= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0) unseeded)} is VALID [2022-02-21 03:24:51,595 INFO L290 TraceCheckUtils]: 3: Hoare triple {520#(and (>= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0) unseeded)} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; {520#(and (>= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0) unseeded)} is VALID [2022-02-21 03:24:51,595 INFO L290 TraceCheckUtils]: 4: Hoare triple {520#(and (>= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0) unseeded)} assume !!(main_~j~0#1 <= main_~i~0#1);main_~j~0#1 := main_~j~0#1 + main_~k~0#1; {520#(and (>= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0) unseeded)} is VALID [2022-02-21 03:24:51,595 INFO L290 TraceCheckUtils]: 5: Hoare triple {520#(and (>= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0) unseeded)} assume !(main_~j~0#1 <= main_~i~0#1); {520#(and (>= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0) unseeded)} is VALID [2022-02-21 03:24:51,596 INFO L290 TraceCheckUtils]: 6: Hoare triple {520#(and (>= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0) unseeded)} main_~i~0#1 := 1 + main_~i~0#1; {520#(and (>= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0) unseeded)} is VALID [2022-02-21 03:24:51,596 INFO L290 TraceCheckUtils]: 7: Hoare triple {520#(and (>= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0) unseeded)} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; {520#(and (>= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0) unseeded)} is VALID [2022-02-21 03:24:51,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:51,600 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-21 03:24:51,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:51,602 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:51,603 INFO L290 TraceCheckUtils]: 0: Hoare triple {521#(and (>= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0) (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~j~0#1|) (* 2 |ULTIMATE.start_main_~i~0#1|) 1)))} assume !!(main_~j~0#1 <= main_~i~0#1);main_~j~0#1 := main_~j~0#1 + main_~k~0#1; {523#(and (or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~j~0#1|) (* 2 |ULTIMATE.start_main_~i~0#1|) 1))) unseeded) (>= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0))} is VALID [2022-02-21 03:24:51,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:24:51,603 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:51,609 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:24:51,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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) Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:51,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:51,610 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 1 loop predicates [2022-02-21 03:24:51,610 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states and 11 transitions. cyclomatic complexity: 4 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:51,641 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9 states and 11 transitions. cyclomatic complexity: 4. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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 13 states and 16 transitions. Complement of second has 6 states. [2022-02-21 03:24:51,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 03:24:51,641 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:51,641 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 11 transitions. cyclomatic complexity: 4 [2022-02-21 03:24:51,641 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:51,641 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:51,641 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:51,642 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:24:51,642 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:51,642 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:51,642 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 16 transitions. [2022-02-21 03:24:51,643 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:24:51,643 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:51,643 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:51,644 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 9 states and 11 transitions. cyclomatic complexity: 4 [2022-02-21 03:24:51,644 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:24:51,644 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:51,645 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:24:51,645 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:24:51,645 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 13 states and 16 transitions. cyclomatic complexity: 6 [2022-02-21 03:24:51,645 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:24:51,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 11 transitions. cyclomatic complexity: 4 Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:51,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:51,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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) Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:51,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:51,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 6 Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:51,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:51,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 11 transitions. cyclomatic complexity: 4 Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:24:51,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:51,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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) Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:24:51,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:51,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 6 Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:24:51,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:51,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 11 transitions. cyclomatic complexity: 4 Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:51,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:51,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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) Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:51,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:51,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 6 Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:51,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:51,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 11 transitions. cyclomatic complexity: 4 Stem has 13 letters. Loop has 13 letters. [2022-02-21 03:24:51,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:51,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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) Stem has 13 letters. Loop has 13 letters. [2022-02-21 03:24:51,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:51,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 6 Stem has 13 letters. Loop has 13 letters. [2022-02-21 03:24:51,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:51,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 11 transitions. cyclomatic complexity: 4 Stem has 9 letters. Loop has 9 letters. [2022-02-21 03:24:51,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:51,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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) Stem has 9 letters. Loop has 9 letters. [2022-02-21 03:24:51,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:51,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 6 Stem has 9 letters. Loop has 9 letters. [2022-02-21 03:24:51,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:51,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 11 transitions. cyclomatic complexity: 4 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:24:51,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:51,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:24:51,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:51,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 6 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:24:51,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:51,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 11 transitions. cyclomatic complexity: 4 Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:51,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:51,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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) Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:51,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:51,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 6 Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:51,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:51,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 11 transitions. cyclomatic complexity: 4 Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:24:51,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:51,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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) Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:24:51,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:51,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 6 Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:24:51,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:51,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 11 transitions. cyclomatic complexity: 4 Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:51,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:51,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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) Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:51,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:51,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 6 Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:51,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:51,652 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:51,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:51,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 6 transitions. [2022-02-21 03:24:51,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 6 transitions. Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:51,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:51,653 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:24:51,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:51,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:51,676 INFO L263 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-21 03:24:51,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:51,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:51,715 INFO L290 TraceCheckUtils]: 0: Hoare triple {501#unseeded} assume { :begin_inline_ULTIMATE.init } true; {501#unseeded} is VALID [2022-02-21 03:24:51,715 INFO L290 TraceCheckUtils]: 1: Hoare triple {501#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_~k~0#1, main_~i~0#1, main_~j~0#1, main_~n~0#1;havoc main_~k~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~n~0#1;main_~k~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~j~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~n~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; {501#unseeded} is VALID [2022-02-21 03:24:51,716 INFO L290 TraceCheckUtils]: 2: Hoare triple {501#unseeded} assume main_~k~0#1 >= 1;main_~i~0#1 := 0; {520#(and (>= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0) unseeded)} is VALID [2022-02-21 03:24:51,716 INFO L290 TraceCheckUtils]: 3: Hoare triple {520#(and (>= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0) unseeded)} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; {520#(and (>= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0) unseeded)} is VALID [2022-02-21 03:24:51,716 INFO L290 TraceCheckUtils]: 4: Hoare triple {520#(and (>= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0) unseeded)} assume !!(main_~j~0#1 <= main_~i~0#1);main_~j~0#1 := main_~j~0#1 + main_~k~0#1; {520#(and (>= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0) unseeded)} is VALID [2022-02-21 03:24:51,717 INFO L290 TraceCheckUtils]: 5: Hoare triple {520#(and (>= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0) unseeded)} assume !(main_~j~0#1 <= main_~i~0#1); {520#(and (>= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0) unseeded)} is VALID [2022-02-21 03:24:51,717 INFO L290 TraceCheckUtils]: 6: Hoare triple {520#(and (>= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0) unseeded)} main_~i~0#1 := 1 + main_~i~0#1; {520#(and (>= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0) unseeded)} is VALID [2022-02-21 03:24:51,717 INFO L290 TraceCheckUtils]: 7: Hoare triple {520#(and (>= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0) unseeded)} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; {520#(and (>= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0) unseeded)} is VALID [2022-02-21 03:24:51,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:51,720 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-21 03:24:51,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:51,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:51,723 INFO L290 TraceCheckUtils]: 0: Hoare triple {521#(and (>= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0) (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~j~0#1|) (* 2 |ULTIMATE.start_main_~i~0#1|) 1)))} assume !!(main_~j~0#1 <= main_~i~0#1);main_~j~0#1 := main_~j~0#1 + main_~k~0#1; {523#(and (or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~j~0#1|) (* 2 |ULTIMATE.start_main_~i~0#1|) 1))) unseeded) (>= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0))} is VALID [2022-02-21 03:24:51,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:24:51,724 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:51,728 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:24:51,728 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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) Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:51,728 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:51,728 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 1 loop predicates [2022-02-21 03:24:51,728 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states and 11 transitions. cyclomatic complexity: 4 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:51,753 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9 states and 11 transitions. cyclomatic complexity: 4. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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 13 states and 16 transitions. Complement of second has 6 states. [2022-02-21 03:24:51,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 03:24:51,753 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:51,754 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 11 transitions. cyclomatic complexity: 4 [2022-02-21 03:24:51,754 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:51,754 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:51,754 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:51,754 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:24:51,754 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:51,754 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:51,754 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 16 transitions. [2022-02-21 03:24:51,754 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:24:51,754 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:51,754 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:51,755 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 9 states and 11 transitions. cyclomatic complexity: 4 [2022-02-21 03:24:51,755 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:24:51,755 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:51,755 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:24:51,755 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:24:51,755 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 13 states and 16 transitions. cyclomatic complexity: 6 [2022-02-21 03:24:51,755 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:24:51,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 11 transitions. cyclomatic complexity: 4 Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:51,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:51,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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) Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:51,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:51,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 6 Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:51,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:51,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 11 transitions. cyclomatic complexity: 4 Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:24:51,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:51,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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) Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:24:51,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:51,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 6 Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:24:51,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:51,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 11 transitions. cyclomatic complexity: 4 Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:51,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:51,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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) Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:51,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:51,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 6 Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:51,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:51,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 11 transitions. cyclomatic complexity: 4 Stem has 13 letters. Loop has 13 letters. [2022-02-21 03:24:51,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:51,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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) Stem has 13 letters. Loop has 13 letters. [2022-02-21 03:24:51,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:51,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 6 Stem has 13 letters. Loop has 13 letters. [2022-02-21 03:24:51,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:51,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 11 transitions. cyclomatic complexity: 4 Stem has 9 letters. Loop has 9 letters. [2022-02-21 03:24:51,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:51,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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) Stem has 9 letters. Loop has 9 letters. [2022-02-21 03:24:51,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:51,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 6 Stem has 9 letters. Loop has 9 letters. [2022-02-21 03:24:51,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:51,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 11 transitions. cyclomatic complexity: 4 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:24:51,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:51,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:24:51,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:51,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 6 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:24:51,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:51,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 11 transitions. cyclomatic complexity: 4 Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:51,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:51,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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) Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:51,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:51,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 6 Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:51,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:51,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 11 transitions. cyclomatic complexity: 4 Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:24:51,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:51,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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) Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:24:51,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:51,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 6 Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:24:51,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:51,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 11 transitions. cyclomatic complexity: 4 Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:51,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:51,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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) Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:51,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:51,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 6 Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:51,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:51,758 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:51,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:51,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 6 transitions. [2022-02-21 03:24:51,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 6 transitions. Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:51,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:51,759 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:24:51,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:51,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:51,779 INFO L263 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-21 03:24:51,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:51,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:51,816 INFO L290 TraceCheckUtils]: 0: Hoare triple {501#unseeded} assume { :begin_inline_ULTIMATE.init } true; {501#unseeded} is VALID [2022-02-21 03:24:51,817 INFO L290 TraceCheckUtils]: 1: Hoare triple {501#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_~k~0#1, main_~i~0#1, main_~j~0#1, main_~n~0#1;havoc main_~k~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~n~0#1;main_~k~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~j~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~n~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; {501#unseeded} is VALID [2022-02-21 03:24:51,817 INFO L290 TraceCheckUtils]: 2: Hoare triple {501#unseeded} assume main_~k~0#1 >= 1;main_~i~0#1 := 0; {520#(and (>= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0) unseeded)} is VALID [2022-02-21 03:24:51,817 INFO L290 TraceCheckUtils]: 3: Hoare triple {520#(and (>= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0) unseeded)} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; {520#(and (>= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0) unseeded)} is VALID [2022-02-21 03:24:51,818 INFO L290 TraceCheckUtils]: 4: Hoare triple {520#(and (>= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0) unseeded)} assume !!(main_~j~0#1 <= main_~i~0#1);main_~j~0#1 := main_~j~0#1 + main_~k~0#1; {520#(and (>= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0) unseeded)} is VALID [2022-02-21 03:24:51,818 INFO L290 TraceCheckUtils]: 5: Hoare triple {520#(and (>= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0) unseeded)} assume !(main_~j~0#1 <= main_~i~0#1); {520#(and (>= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0) unseeded)} is VALID [2022-02-21 03:24:51,819 INFO L290 TraceCheckUtils]: 6: Hoare triple {520#(and (>= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0) unseeded)} main_~i~0#1 := 1 + main_~i~0#1; {520#(and (>= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0) unseeded)} is VALID [2022-02-21 03:24:51,819 INFO L290 TraceCheckUtils]: 7: Hoare triple {520#(and (>= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0) unseeded)} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; {520#(and (>= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0) unseeded)} is VALID [2022-02-21 03:24:51,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:51,828 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-21 03:24:51,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:51,831 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:51,831 INFO L290 TraceCheckUtils]: 0: Hoare triple {521#(and (>= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0) (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~j~0#1|) (* 2 |ULTIMATE.start_main_~i~0#1|) 1)))} assume !!(main_~j~0#1 <= main_~i~0#1);main_~j~0#1 := main_~j~0#1 + main_~k~0#1; {523#(and (or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~j~0#1|) (* 2 |ULTIMATE.start_main_~i~0#1|) 1))) unseeded) (>= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0))} is VALID [2022-02-21 03:24:51,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:24:51,832 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:51,836 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:24:51,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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) Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:51,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:51,837 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 1 loop predicates [2022-02-21 03:24:51,837 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states and 11 transitions. cyclomatic complexity: 4 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:51,875 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9 states and 11 transitions. cyclomatic complexity: 4. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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 11 states and 13 transitions. Complement of second has 5 states. [2022-02-21 03:24:51,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 03:24:51,875 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:51,875 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 11 transitions. cyclomatic complexity: 4 [2022-02-21 03:24:51,876 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:51,876 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:51,876 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:51,876 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:24:51,876 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:51,876 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:51,877 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 13 transitions. [2022-02-21 03:24:51,877 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:24:51,877 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:24:51,877 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 9 states and 11 transitions. cyclomatic complexity: 4 [2022-02-21 03:24:51,877 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:24:51,877 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:51,878 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:24:51,878 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:24:51,878 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 11 states and 13 transitions. cyclomatic complexity: 4 [2022-02-21 03:24:51,878 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 13 transitions. cyclomatic complexity: 4 [2022-02-21 03:24:51,878 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:24:51,878 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:24:51,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 11 transitions. cyclomatic complexity: 4 Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:51,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:51,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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) Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:51,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:51,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 4 Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:51,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:51,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 11 transitions. cyclomatic complexity: 4 Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:24:51,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:51,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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) Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:24:51,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:51,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 4 Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:24:51,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:51,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 11 transitions. cyclomatic complexity: 4 Stem has 11 letters. Loop has 11 letters. [2022-02-21 03:24:51,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:51,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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) Stem has 11 letters. Loop has 11 letters. [2022-02-21 03:24:51,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:51,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 4 Stem has 11 letters. Loop has 11 letters. [2022-02-21 03:24:51,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:51,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 11 transitions. cyclomatic complexity: 4 Stem has 9 letters. Loop has 9 letters. [2022-02-21 03:24:51,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:51,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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) Stem has 9 letters. Loop has 9 letters. [2022-02-21 03:24:51,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:51,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 4 Stem has 9 letters. Loop has 9 letters. [2022-02-21 03:24:51,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:51,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 11 transitions. cyclomatic complexity: 4 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:24:51,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:51,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:24:51,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:51,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 4 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:24:51,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:51,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 11 transitions. cyclomatic complexity: 4 Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:51,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:51,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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) Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:51,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:51,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 4 Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:51,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:51,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 11 transitions. cyclomatic complexity: 4 Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:24:51,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:51,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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) Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:24:51,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:51,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 4 Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:24:51,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:51,883 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:51,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:51,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2022-02-21 03:24:51,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:51,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:51,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 9 letters. Loop has 1 letters. [2022-02-21 03:24:51,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:51,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:24:51,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:51,884 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 13 transitions. cyclomatic complexity: 4 [2022-02-21 03:24:51,885 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:24:51,885 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 0 states and 0 transitions. [2022-02-21 03:24:51,885 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 03:24:51,885 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 03:24:51,885 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 03:24:51,885 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:24:51,885 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:24:51,885 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:24:51,885 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:24:51,885 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 03:24:51,886 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:24:51,886 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:24:51,886 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:24:51,907 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 [2022-02-21 03:24:51,910 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 03:24:51 BoogieIcfgContainer [2022-02-21 03:24:51,910 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 03:24:51,910 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 03:24:51,910 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 03:24:51,911 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 03:24:51,911 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:24:46" (3/4) ... [2022-02-21 03:24:51,912 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 03:24:51,913 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 03:24:51,913 INFO L158 Benchmark]: Toolchain (without parser) took 5862.85ms. Allocated memory was 100.7MB in the beginning and 138.4MB in the end (delta: 37.7MB). Free memory was 67.1MB in the beginning and 110.6MB in the end (delta: -43.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:24:51,913 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 100.7MB. Free memory is still 54.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:24:51,914 INFO L158 Benchmark]: CACSL2BoogieTranslator took 218.00ms. Allocated memory is still 100.7MB. Free memory was 66.9MB in the beginning and 76.7MB in the end (delta: -9.8MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. [2022-02-21 03:24:51,914 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.10ms. Allocated memory is still 100.7MB. Free memory was 76.7MB in the beginning and 75.3MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:24:51,914 INFO L158 Benchmark]: Boogie Preprocessor took 15.73ms. Allocated memory is still 100.7MB. Free memory was 75.3MB in the beginning and 74.6MB in the end (delta: 686.4kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:24:51,914 INFO L158 Benchmark]: RCFGBuilder took 225.70ms. Allocated memory is still 100.7MB. Free memory was 74.3MB in the beginning and 65.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-21 03:24:51,914 INFO L158 Benchmark]: BuchiAutomizer took 5362.95ms. Allocated memory was 100.7MB in the beginning and 138.4MB in the end (delta: 37.7MB). Free memory was 65.9MB in the beginning and 110.6MB in the end (delta: -44.7MB). Peak memory consumption was 66.7MB. Max. memory is 16.1GB. [2022-02-21 03:24:51,914 INFO L158 Benchmark]: Witness Printer took 2.16ms. Allocated memory is still 138.4MB. Free memory is still 110.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:24:51,915 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 100.7MB. Free memory is still 54.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 218.00ms. Allocated memory is still 100.7MB. Free memory was 66.9MB in the beginning and 76.7MB in the end (delta: -9.8MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.10ms. Allocated memory is still 100.7MB. Free memory was 76.7MB in the beginning and 75.3MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 15.73ms. Allocated memory is still 100.7MB. Free memory was 75.3MB in the beginning and 74.6MB in the end (delta: 686.4kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 225.70ms. Allocated memory is still 100.7MB. Free memory was 74.3MB in the beginning and 65.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 5362.95ms. Allocated memory was 100.7MB in the beginning and 138.4MB in the end (delta: 37.7MB). Free memory was 65.9MB in the beginning and 110.6MB in the end (delta: -44.7MB). Peak memory consumption was 66.7MB. Max. memory is 16.1GB. * Witness Printer took 2.16ms. Allocated memory is still 138.4MB. Free memory is still 110.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (1 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * i and consists of 6 locations. One deterministic module has affine ranking function -1 * i + n and consists of 3 locations. One deterministic module has affine ranking function -2 * j + n and consists of 4 locations. One nondeterministic module has affine ranking function -2 * j + 2 * i + 1 and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.2s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 4.0s. Construction of modules took 0.0s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 6 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 9 states and ocurred in iteration 2. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1/1 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 49 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 49 mSDsluCounter, 48 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 64 IncrementalHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 33 mSDtfsCounter, 64 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc0 concLT1 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital20 mio100 ax159 hnf100 lsp62 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq158 hnf92 smp100 dnf100 smp100 tf103 neg97 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 30ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 17 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.4s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-02-21 03:24:51,942 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE