./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.BOUNDED-6.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml', '-i', '../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.BOUNDED-6.pals.c', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(F end) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', 'c6267d36e2eda753e26c9c989bedb16747ddf010783b33bee2d0cb2d2001d5ce'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.BOUNDED-6.pals.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c6267d36e2eda753e26c9c989bedb16747ddf010783b33bee2d0cb2d2001d5ce --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-08 00:43:17,096 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 00:43:17,174 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-08 00:43:17,178 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 00:43:17,180 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 00:43:17,213 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 00:43:17,216 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 00:43:17,217 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 00:43:17,217 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 00:43:17,217 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 00:43:17,219 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 00:43:17,219 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 00:43:17,219 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 00:43:17,219 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-08 00:43:17,219 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-08 00:43:17,219 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-08 00:43:17,219 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-08 00:43:17,220 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-08 00:43:17,220 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-08 00:43:17,221 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 00:43:17,221 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-08 00:43:17,221 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 00:43:17,221 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 00:43:17,221 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 00:43:17,221 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 00:43:17,221 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-08 00:43:17,221 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-08 00:43:17,221 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-08 00:43:17,222 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 00:43:17,222 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-08 00:43:17,222 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 00:43:17,222 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 00:43:17,222 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-08 00:43:17,222 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 00:43:17,222 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 00:43:17,223 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 00:43:17,223 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 00:43:17,223 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 00:43:17,224 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-08 00:43:17,224 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR 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-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c6267d36e2eda753e26c9c989bedb16747ddf010783b33bee2d0cb2d2001d5ce [2024-11-08 00:43:17,569 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 00:43:17,579 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 00:43:17,582 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 00:43:17,583 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 00:43:17,583 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 00:43:17,585 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.BOUNDED-6.pals.c [2024-11-08 00:43:18,884 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 00:43:19,165 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 00:43:19,167 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.BOUNDED-6.pals.c [2024-11-08 00:43:19,179 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bce591881/20f24fae0cb24684a0909591549f3262/FLAG3862d480e [2024-11-08 00:43:19,196 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bce591881/20f24fae0cb24684a0909591549f3262 [2024-11-08 00:43:19,200 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 00:43:19,201 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 00:43:19,202 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 00:43:19,204 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 00:43:19,208 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 00:43:19,209 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 12:43:19" (1/1) ... [2024-11-08 00:43:19,210 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a3ca7c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:43:19, skipping insertion in model container [2024-11-08 00:43:19,210 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 12:43:19" (1/1) ... [2024-11-08 00:43:19,239 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 00:43:19,440 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 00:43:19,453 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 00:43:19,513 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 00:43:19,528 INFO L204 MainTranslator]: Completed translation [2024-11-08 00:43:19,529 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:43:19 WrapperNode [2024-11-08 00:43:19,529 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 00:43:19,530 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 00:43:19,530 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 00:43:19,532 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 00:43:19,538 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:43:19" (1/1) ... [2024-11-08 00:43:19,551 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:43:19" (1/1) ... [2024-11-08 00:43:19,596 INFO L138 Inliner]: procedures = 21, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 463 [2024-11-08 00:43:19,599 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 00:43:19,599 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 00:43:19,600 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 00:43:19,600 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 00:43:19,608 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:43:19" (1/1) ... [2024-11-08 00:43:19,609 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:43:19" (1/1) ... [2024-11-08 00:43:19,616 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:43:19" (1/1) ... [2024-11-08 00:43:19,643 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 00:43:19,646 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:43:19" (1/1) ... [2024-11-08 00:43:19,646 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:43:19" (1/1) ... [2024-11-08 00:43:19,658 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:43:19" (1/1) ... [2024-11-08 00:43:19,671 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:43:19" (1/1) ... [2024-11-08 00:43:19,673 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:43:19" (1/1) ... [2024-11-08 00:43:19,678 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:43:19" (1/1) ... [2024-11-08 00:43:19,685 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 00:43:19,686 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 00:43:19,686 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 00:43:19,686 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 00:43:19,687 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:43:19" (1/1) ... [2024-11-08 00:43:19,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 00:43:19,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 00:43:19,723 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 00:43:19,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-08 00:43:19,752 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 00:43:19,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 00:43:19,752 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 00:43:19,752 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 00:43:19,851 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 00:43:19,853 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 00:43:20,379 INFO L? ?]: Removed 40 outVars from TransFormulas that were not future-live. [2024-11-08 00:43:20,379 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 00:43:20,391 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 00:43:20,393 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 00:43:20,394 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 12:43:20 BoogieIcfgContainer [2024-11-08 00:43:20,394 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 00:43:20,395 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-08 00:43:20,395 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-08 00:43:20,399 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-08 00:43:20,399 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-08 00:43:20,399 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 08.11 12:43:19" (1/3) ... [2024-11-08 00:43:20,400 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@25e75036 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.11 12:43:20, skipping insertion in model container [2024-11-08 00:43:20,400 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-08 00:43:20,401 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:43:19" (2/3) ... [2024-11-08 00:43:20,401 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@25e75036 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.11 12:43:20, skipping insertion in model container [2024-11-08 00:43:20,401 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-08 00:43:20,401 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 12:43:20" (3/3) ... [2024-11-08 00:43:20,402 INFO L332 chiAutomizerObserver]: Analyzing ICFG pals_opt-floodmax.3.1.ufo.BOUNDED-6.pals.c [2024-11-08 00:43:20,450 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-08 00:43:20,451 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-08 00:43:20,451 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-08 00:43:20,451 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-08 00:43:20,451 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-08 00:43:20,451 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-08 00:43:20,452 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-08 00:43:20,452 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-08 00:43:20,458 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 125 states, 124 states have (on average 1.7580645161290323) internal successors, (218), 124 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 00:43:20,477 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 67 [2024-11-08 00:43:20,477 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-08 00:43:20,477 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-08 00:43:20,487 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 00:43:20,487 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 00:43:20,487 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-08 00:43:20,488 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 125 states, 124 states have (on average 1.7580645161290323) internal successors, (218), 124 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 00:43:20,497 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 67 [2024-11-08 00:43:20,498 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-08 00:43:20,498 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-08 00:43:20,499 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 00:43:20,501 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 00:43:20,507 INFO L745 eck$LassoCheckResult]: Stem: 27#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(43, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0; 40#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~ret34#1, main_#t~ret35#1, main_#t~post36#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;havoc main_#t~nondet4#1;assume 0 == main_#t~nondet4#1 || 1 == main_#t~nondet4#1;~ep12~0 := (if 0 == main_#t~nondet4#1 % 256 then 0 else 1);havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;assume 0 == main_#t~nondet5#1 || 1 == main_#t~nondet5#1;~ep13~0 := (if 0 == main_#t~nondet5#1 % 256 then 0 else 1);havoc main_#t~nondet5#1;havoc main_#t~nondet6#1;assume 0 == main_#t~nondet6#1 || 1 == main_#t~nondet6#1;~ep21~0 := (if 0 == main_#t~nondet6#1 % 256 then 0 else 1);havoc main_#t~nondet6#1;havoc main_#t~nondet7#1;assume 0 == main_#t~nondet7#1 || 1 == main_#t~nondet7#1;~ep23~0 := (if 0 == main_#t~nondet7#1 % 256 then 0 else 1);havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;assume 0 == main_#t~nondet8#1 || 1 == main_#t~nondet8#1;~ep31~0 := (if 0 == main_#t~nondet8#1 % 256 then 0 else 1);havoc main_#t~nondet8#1;havoc main_#t~nondet9#1;assume 0 == main_#t~nondet9#1 || 1 == main_#t~nondet9#1;~ep32~0 := (if 0 == main_#t~nondet9#1 % 256 then 0 else 1);havoc main_#t~nondet9#1;havoc main_#t~nondet10#1;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_#t~nondet11#1;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_#t~nondet13#1;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_#t~nondet14#1;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_#t~nondet15#1;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_#t~nondet16#1;assume 0 == main_#t~nondet16#1 || 1 == main_#t~nondet16#1;~mode1~0 := (if 0 == main_#t~nondet16#1 % 256 then 0 else 1);havoc main_#t~nondet16#1;havoc main_#t~nondet17#1;assume 0 == main_#t~nondet17#1 || 1 == main_#t~nondet17#1;~newmax1~0 := (if 0 == main_#t~nondet17#1 % 256 then 0 else 1);havoc main_#t~nondet17#1;havoc main_#t~nondet18#1;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_#t~nondet19#1;~r2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_#t~nondet20#1;~st2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_#t~nondet21#1;~nl2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_#t~nondet22#1;~m2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;havoc main_#t~nondet23#1;~max2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;havoc main_#t~nondet24#1;assume 0 == main_#t~nondet24#1 || 1 == main_#t~nondet24#1;~mode2~0 := (if 0 == main_#t~nondet24#1 % 256 then 0 else 1);havoc main_#t~nondet24#1;havoc main_#t~nondet25#1;assume 0 == main_#t~nondet25#1 || 1 == main_#t~nondet25#1;~newmax2~0 := (if 0 == main_#t~nondet25#1 % 256 then 0 else 1);havoc main_#t~nondet25#1;havoc main_#t~nondet26#1;~id3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;havoc main_#t~nondet27#1;~r3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;havoc main_#t~nondet28#1;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;havoc main_#t~nondet29#1;~nl3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;havoc main_#t~nondet30#1;~m3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;havoc main_#t~nondet31#1;~max3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;havoc main_#t~nondet32#1;assume 0 == main_#t~nondet32#1 || 1 == main_#t~nondet32#1;~mode3~0 := (if 0 == main_#t~nondet32#1 % 256 then 0 else 1);havoc main_#t~nondet32#1;havoc main_#t~nondet33#1;assume 0 == main_#t~nondet33#1 || 1 == main_#t~nondet33#1;~newmax3~0 := (if 0 == main_#t~nondet33#1 % 256 then 0 else 1);havoc main_#t~nondet33#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := (if 0 == ~ep12~0 % 256 then 0 else 1);init_~r131~0#1 := (if 0 == ~ep13~0 % 256 then 0 else 1);init_~r211~0#1 := (if 0 == ~ep21~0 % 256 then 0 else 1);init_~r231~0#1 := (if 0 == ~ep23~0 % 256 then 0 else 1);init_~r311~0#1 := (if 0 == ~ep31~0 % 256 then 0 else 1);init_~r321~0#1 := (if 0 == ~ep32~0 % 256 then 0 else 1); 16#L255true assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 8#L258-1true init_~r122~0#1 := (if 0 == (if 0 == init_~tmp~0#1 then 0 else 1) % 256 then 0 else 1); 19#L268true assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 22#L271-1true init_~r132~0#1 := (if 0 == (if 0 == init_~tmp___0~0#1 then 0 else 1) % 256 then 0 else 1); 10#L281true assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; 45#L284-1true init_~r212~0#1 := (if 0 == (if 0 == init_~tmp___1~0#1 then 0 else 1) % 256 then 0 else 1); 111#L294true assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; 31#L297-1true init_~r232~0#1 := (if 0 == (if 0 == init_~tmp___2~0#1 then 0 else 1) % 256 then 0 else 1); 70#L307true assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; 71#L310-1true init_~r312~0#1 := (if 0 == (if 0 == init_~tmp___3~0#1 then 0 else 1) % 256 then 0 else 1); 74#L320true assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; 83#L323-1true init_~r322~0#1 := (if 0 == (if 0 == init_~tmp___4~0#1 then 0 else 1) % 256 then 0 else 1); 60#L333true assume !(~id1~0 != ~id2~0);init_~tmp___5~0#1 := 0; 107#L333-1true init_#res#1 := init_~tmp___5~0#1; 81#init_returnLabel#1true main_#t~ret34#1 := init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret34#1;havoc main_#t~ret34#1; 87#L527true assume !(0 == main_~i2~0#1); 112#L527-2true ~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 15#L541-2true [2024-11-08 00:43:20,512 INFO L747 eck$LassoCheckResult]: Loop: 15#L541-2true assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; 50#L79true assume !(0 != ~mode1~0 % 256); 121#L107true assume !(~r1~0 < 2); 117#L107-1true ~mode1~0 := 1; 37#L79-2true havoc node1_~newmax~0#1;assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; 56#L130true assume !(0 != ~mode2~0 % 256); 12#L158true assume !(~r2~0 < 2); 85#L158-1true ~mode2~0 := 1; 52#L130-2true havoc node2_~newmax~1#1;assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; 90#L181true assume !(0 != ~mode3~0 % 256); 106#L209true assume !(~r3~0 < 2); 126#L209-1true ~mode3~0 := 1; 44#L181-2true havoc node3_~newmax~2#1;assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 88#L438true assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; 41#L438-1true check_#res#1 := check_~tmp~1#1; 17#check_returnLabel#1true main_#t~ret35#1 := check_#res#1;havoc check_~tmp~1#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret35#1;havoc main_#t~ret35#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 119#L571true assume !(0 == assert_~arg#1 % 256); 108#L566true havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true;main_#t~post36#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post36#1;havoc main_#t~post36#1; 15#L541-2true [2024-11-08 00:43:20,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:43:20,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1710390244, now seen corresponding path program 1 times [2024-11-08 00:43:20,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:43:20,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870703669] [2024-11-08 00:43:20,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:43:20,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:43:20,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:43:20,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 00:43:20,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 00:43:20,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870703669] [2024-11-08 00:43:20,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870703669] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 00:43:20,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 00:43:20,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 00:43:20,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624718845] [2024-11-08 00:43:20,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 00:43:20,941 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-08 00:43:20,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:43:20,942 INFO L85 PathProgramCache]: Analyzing trace with hash 842436594, now seen corresponding path program 1 times [2024-11-08 00:43:20,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:43:20,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301885364] [2024-11-08 00:43:20,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:43:20,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:43:20,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:43:21,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 00:43:21,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 00:43:21,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301885364] [2024-11-08 00:43:21,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301885364] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 00:43:21,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 00:43:21,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 00:43:21,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605723283] [2024-11-08 00:43:21,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 00:43:21,148 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-08 00:43:21,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 00:43:21,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 00:43:21,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 00:43:21,177 INFO L87 Difference]: Start difference. First operand has 125 states, 124 states have (on average 1.7580645161290323) internal successors, (218), 124 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 00:43:21,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 00:43:21,255 INFO L93 Difference]: Finished difference Result 127 states and 217 transitions. [2024-11-08 00:43:21,256 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 127 states and 217 transitions. [2024-11-08 00:43:21,259 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 65 [2024-11-08 00:43:21,265 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 127 states to 119 states and 201 transitions. [2024-11-08 00:43:21,266 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 119 [2024-11-08 00:43:21,266 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 119 [2024-11-08 00:43:21,268 INFO L73 IsDeterministic]: Start isDeterministic. Operand 119 states and 201 transitions. [2024-11-08 00:43:21,269 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-08 00:43:21,269 INFO L218 hiAutomatonCegarLoop]: Abstraction has 119 states and 201 transitions. [2024-11-08 00:43:21,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states and 201 transitions. [2024-11-08 00:43:21,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2024-11-08 00:43:21,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 119 states have (on average 1.6890756302521008) internal successors, (201), 118 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 00:43:21,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 201 transitions. [2024-11-08 00:43:21,302 INFO L240 hiAutomatonCegarLoop]: Abstraction has 119 states and 201 transitions. [2024-11-08 00:43:21,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 00:43:21,308 INFO L425 stractBuchiCegarLoop]: Abstraction has 119 states and 201 transitions. [2024-11-08 00:43:21,309 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-08 00:43:21,309 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 119 states and 201 transitions. [2024-11-08 00:43:21,312 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 65 [2024-11-08 00:43:21,314 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-08 00:43:21,314 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-08 00:43:21,315 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 00:43:21,315 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 00:43:21,315 INFO L745 eck$LassoCheckResult]: Stem: 315#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(43, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0; 316#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~ret34#1, main_#t~ret35#1, main_#t~post36#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;havoc main_#t~nondet4#1;assume 0 == main_#t~nondet4#1 || 1 == main_#t~nondet4#1;~ep12~0 := (if 0 == main_#t~nondet4#1 % 256 then 0 else 1);havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;assume 0 == main_#t~nondet5#1 || 1 == main_#t~nondet5#1;~ep13~0 := (if 0 == main_#t~nondet5#1 % 256 then 0 else 1);havoc main_#t~nondet5#1;havoc main_#t~nondet6#1;assume 0 == main_#t~nondet6#1 || 1 == main_#t~nondet6#1;~ep21~0 := (if 0 == main_#t~nondet6#1 % 256 then 0 else 1);havoc main_#t~nondet6#1;havoc main_#t~nondet7#1;assume 0 == main_#t~nondet7#1 || 1 == main_#t~nondet7#1;~ep23~0 := (if 0 == main_#t~nondet7#1 % 256 then 0 else 1);havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;assume 0 == main_#t~nondet8#1 || 1 == main_#t~nondet8#1;~ep31~0 := (if 0 == main_#t~nondet8#1 % 256 then 0 else 1);havoc main_#t~nondet8#1;havoc main_#t~nondet9#1;assume 0 == main_#t~nondet9#1 || 1 == main_#t~nondet9#1;~ep32~0 := (if 0 == main_#t~nondet9#1 % 256 then 0 else 1);havoc main_#t~nondet9#1;havoc main_#t~nondet10#1;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_#t~nondet11#1;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_#t~nondet13#1;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_#t~nondet14#1;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_#t~nondet15#1;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_#t~nondet16#1;assume 0 == main_#t~nondet16#1 || 1 == main_#t~nondet16#1;~mode1~0 := (if 0 == main_#t~nondet16#1 % 256 then 0 else 1);havoc main_#t~nondet16#1;havoc main_#t~nondet17#1;assume 0 == main_#t~nondet17#1 || 1 == main_#t~nondet17#1;~newmax1~0 := (if 0 == main_#t~nondet17#1 % 256 then 0 else 1);havoc main_#t~nondet17#1;havoc main_#t~nondet18#1;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_#t~nondet19#1;~r2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_#t~nondet20#1;~st2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_#t~nondet21#1;~nl2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_#t~nondet22#1;~m2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;havoc main_#t~nondet23#1;~max2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;havoc main_#t~nondet24#1;assume 0 == main_#t~nondet24#1 || 1 == main_#t~nondet24#1;~mode2~0 := (if 0 == main_#t~nondet24#1 % 256 then 0 else 1);havoc main_#t~nondet24#1;havoc main_#t~nondet25#1;assume 0 == main_#t~nondet25#1 || 1 == main_#t~nondet25#1;~newmax2~0 := (if 0 == main_#t~nondet25#1 % 256 then 0 else 1);havoc main_#t~nondet25#1;havoc main_#t~nondet26#1;~id3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;havoc main_#t~nondet27#1;~r3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;havoc main_#t~nondet28#1;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;havoc main_#t~nondet29#1;~nl3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;havoc main_#t~nondet30#1;~m3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;havoc main_#t~nondet31#1;~max3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;havoc main_#t~nondet32#1;assume 0 == main_#t~nondet32#1 || 1 == main_#t~nondet32#1;~mode3~0 := (if 0 == main_#t~nondet32#1 % 256 then 0 else 1);havoc main_#t~nondet32#1;havoc main_#t~nondet33#1;assume 0 == main_#t~nondet33#1 || 1 == main_#t~nondet33#1;~newmax3~0 := (if 0 == main_#t~nondet33#1 % 256 then 0 else 1);havoc main_#t~nondet33#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := (if 0 == ~ep12~0 % 256 then 0 else 1);init_~r131~0#1 := (if 0 == ~ep13~0 % 256 then 0 else 1);init_~r211~0#1 := (if 0 == ~ep21~0 % 256 then 0 else 1);init_~r231~0#1 := (if 0 == ~ep23~0 % 256 then 0 else 1);init_~r311~0#1 := (if 0 == ~ep31~0 % 256 then 0 else 1);init_~r321~0#1 := (if 0 == ~ep32~0 % 256 then 0 else 1); 294#L255 assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 279#L258-1 init_~r122~0#1 := (if 0 == (if 0 == init_~tmp~0#1 then 0 else 1) % 256 then 0 else 1); 280#L268 assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 298#L271-1 init_~r132~0#1 := (if 0 == (if 0 == init_~tmp___0~0#1 then 0 else 1) % 256 then 0 else 1); 283#L281 assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; 284#L284-1 init_~r212~0#1 := (if 0 == (if 0 == init_~tmp___1~0#1 then 0 else 1) % 256 then 0 else 1); 336#L294 assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; 318#L297-1 init_~r232~0#1 := (if 0 == (if 0 == init_~tmp___2~0#1 then 0 else 1) % 256 then 0 else 1); 322#L307 assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; 338#L310-1 init_~r312~0#1 := (if 0 == (if 0 == init_~tmp___3~0#1 then 0 else 1) % 256 then 0 else 1); 363#L320 assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; 272#L323-1 init_~r322~0#1 := (if 0 == (if 0 == init_~tmp___4~0#1 then 0 else 1) % 256 then 0 else 1); 354#L333 assume !(~id1~0 != ~id2~0);init_~tmp___5~0#1 := 0; 307#L333-1 init_#res#1 := init_~tmp___5~0#1; 370#init_returnLabel#1 main_#t~ret34#1 := init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret34#1;havoc main_#t~ret34#1; 371#L527 assume !(0 == main_~i2~0#1); 374#L527-2 ~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 290#L541-2 [2024-11-08 00:43:21,316 INFO L747 eck$LassoCheckResult]: Loop: 290#L541-2 assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; 291#L79 assume !(0 != ~mode1~0 % 256); 344#L107 assume !(~r1~0 < 2); 342#L107-1 ~mode1~0 := 1; 289#L79-2 havoc node1_~newmax~0#1;assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; 330#L130 assume !(0 != ~mode2~0 % 256); 286#L158 assume !(~r2~0 < 2); 282#L158-1 ~mode2~0 := 1; 347#L130-2 havoc node2_~newmax~1#1;assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; 348#L181 assume !(0 != ~mode3~0 % 256); 375#L209 assume !(~r3~0 < 2); 313#L209-1 ~mode3~0 := 1; 297#L181-2 havoc node3_~newmax~2#1;assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 335#L438 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 349#L439 assume ~st1~0 + ~nl1~0 <= 1; 350#L440 assume ~st2~0 + ~nl2~0 <= 1; 300#L441 assume ~st3~0 + ~nl3~0 <= 1; 301#L442 assume ~r1~0 >= 2; 308#$Ultimate##257 assume ~r1~0 < 2; 331#$Ultimate##261 assume ~r1~0 >= 2; 266#$Ultimate##265 assume ~r1~0 < 2;check_~tmp~1#1 := 1; 267#L438-1 check_#res#1 := check_~tmp~1#1; 292#check_returnLabel#1 main_#t~ret35#1 := check_#res#1;havoc check_~tmp~1#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret35#1;havoc main_#t~ret35#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 293#L571 assume !(0 == assert_~arg#1 % 256); 382#L566 havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true;main_#t~post36#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post36#1;havoc main_#t~post36#1; 290#L541-2 [2024-11-08 00:43:21,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:43:21,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1710390244, now seen corresponding path program 2 times [2024-11-08 00:43:21,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:43:21,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669913333] [2024-11-08 00:43:21,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:43:21,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:43:21,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:43:21,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 00:43:21,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 00:43:21,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669913333] [2024-11-08 00:43:21,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669913333] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 00:43:21,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 00:43:21,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 00:43:21,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781481588] [2024-11-08 00:43:21,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 00:43:21,466 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-08 00:43:21,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:43:21,466 INFO L85 PathProgramCache]: Analyzing trace with hash -626971476, now seen corresponding path program 1 times [2024-11-08 00:43:21,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:43:21,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54463237] [2024-11-08 00:43:21,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:43:21,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:43:21,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:43:21,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 00:43:21,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 00:43:21,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54463237] [2024-11-08 00:43:21,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54463237] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 00:43:21,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 00:43:21,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 00:43:21,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559623845] [2024-11-08 00:43:21,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 00:43:21,509 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-08 00:43:21,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 00:43:21,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 00:43:21,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 00:43:21,510 INFO L87 Difference]: Start difference. First operand 119 states and 201 transitions. cyclomatic complexity: 83 Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 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) [2024-11-08 00:43:21,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 00:43:21,585 INFO L93 Difference]: Finished difference Result 187 states and 308 transitions. [2024-11-08 00:43:21,585 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 187 states and 308 transitions. [2024-11-08 00:43:21,587 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 65 [2024-11-08 00:43:21,592 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 187 states to 184 states and 282 transitions. [2024-11-08 00:43:21,593 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 184 [2024-11-08 00:43:21,593 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 184 [2024-11-08 00:43:21,593 INFO L73 IsDeterministic]: Start isDeterministic. Operand 184 states and 282 transitions. [2024-11-08 00:43:21,594 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-08 00:43:21,595 INFO L218 hiAutomatonCegarLoop]: Abstraction has 184 states and 282 transitions. [2024-11-08 00:43:21,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states and 282 transitions. [2024-11-08 00:43:21,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 119. [2024-11-08 00:43:21,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 119 states have (on average 1.4873949579831933) internal successors, (177), 118 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 00:43:21,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 177 transitions. [2024-11-08 00:43:21,602 INFO L240 hiAutomatonCegarLoop]: Abstraction has 119 states and 177 transitions. [2024-11-08 00:43:21,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 00:43:21,604 INFO L425 stractBuchiCegarLoop]: Abstraction has 119 states and 177 transitions. [2024-11-08 00:43:21,604 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-08 00:43:21,604 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 119 states and 177 transitions. [2024-11-08 00:43:21,605 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 65 [2024-11-08 00:43:21,606 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-08 00:43:21,606 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-08 00:43:21,607 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 00:43:21,607 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 00:43:21,607 INFO L745 eck$LassoCheckResult]: Stem: 629#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(43, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0; 630#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~ret34#1, main_#t~ret35#1, main_#t~post36#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;havoc main_#t~nondet4#1;assume 0 == main_#t~nondet4#1 || 1 == main_#t~nondet4#1;~ep12~0 := (if 0 == main_#t~nondet4#1 % 256 then 0 else 1);havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;assume 0 == main_#t~nondet5#1 || 1 == main_#t~nondet5#1;~ep13~0 := (if 0 == main_#t~nondet5#1 % 256 then 0 else 1);havoc main_#t~nondet5#1;havoc main_#t~nondet6#1;assume 0 == main_#t~nondet6#1 || 1 == main_#t~nondet6#1;~ep21~0 := (if 0 == main_#t~nondet6#1 % 256 then 0 else 1);havoc main_#t~nondet6#1;havoc main_#t~nondet7#1;assume 0 == main_#t~nondet7#1 || 1 == main_#t~nondet7#1;~ep23~0 := (if 0 == main_#t~nondet7#1 % 256 then 0 else 1);havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;assume 0 == main_#t~nondet8#1 || 1 == main_#t~nondet8#1;~ep31~0 := (if 0 == main_#t~nondet8#1 % 256 then 0 else 1);havoc main_#t~nondet8#1;havoc main_#t~nondet9#1;assume 0 == main_#t~nondet9#1 || 1 == main_#t~nondet9#1;~ep32~0 := (if 0 == main_#t~nondet9#1 % 256 then 0 else 1);havoc main_#t~nondet9#1;havoc main_#t~nondet10#1;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_#t~nondet11#1;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_#t~nondet13#1;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_#t~nondet14#1;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_#t~nondet15#1;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_#t~nondet16#1;assume 0 == main_#t~nondet16#1 || 1 == main_#t~nondet16#1;~mode1~0 := (if 0 == main_#t~nondet16#1 % 256 then 0 else 1);havoc main_#t~nondet16#1;havoc main_#t~nondet17#1;assume 0 == main_#t~nondet17#1 || 1 == main_#t~nondet17#1;~newmax1~0 := (if 0 == main_#t~nondet17#1 % 256 then 0 else 1);havoc main_#t~nondet17#1;havoc main_#t~nondet18#1;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_#t~nondet19#1;~r2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_#t~nondet20#1;~st2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_#t~nondet21#1;~nl2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_#t~nondet22#1;~m2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;havoc main_#t~nondet23#1;~max2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;havoc main_#t~nondet24#1;assume 0 == main_#t~nondet24#1 || 1 == main_#t~nondet24#1;~mode2~0 := (if 0 == main_#t~nondet24#1 % 256 then 0 else 1);havoc main_#t~nondet24#1;havoc main_#t~nondet25#1;assume 0 == main_#t~nondet25#1 || 1 == main_#t~nondet25#1;~newmax2~0 := (if 0 == main_#t~nondet25#1 % 256 then 0 else 1);havoc main_#t~nondet25#1;havoc main_#t~nondet26#1;~id3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;havoc main_#t~nondet27#1;~r3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;havoc main_#t~nondet28#1;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;havoc main_#t~nondet29#1;~nl3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;havoc main_#t~nondet30#1;~m3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;havoc main_#t~nondet31#1;~max3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;havoc main_#t~nondet32#1;assume 0 == main_#t~nondet32#1 || 1 == main_#t~nondet32#1;~mode3~0 := (if 0 == main_#t~nondet32#1 % 256 then 0 else 1);havoc main_#t~nondet32#1;havoc main_#t~nondet33#1;assume 0 == main_#t~nondet33#1 || 1 == main_#t~nondet33#1;~newmax3~0 := (if 0 == main_#t~nondet33#1 % 256 then 0 else 1);havoc main_#t~nondet33#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := (if 0 == ~ep12~0 % 256 then 0 else 1);init_~r131~0#1 := (if 0 == ~ep13~0 % 256 then 0 else 1);init_~r211~0#1 := (if 0 == ~ep21~0 % 256 then 0 else 1);init_~r231~0#1 := (if 0 == ~ep23~0 % 256 then 0 else 1);init_~r311~0#1 := (if 0 == ~ep31~0 % 256 then 0 else 1);init_~r321~0#1 := (if 0 == ~ep32~0 % 256 then 0 else 1); 609#L255 assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 594#L258-1 init_~r122~0#1 := (if 0 == (if 0 == init_~tmp~0#1 then 0 else 1) % 256 then 0 else 1); 595#L268 assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 615#L271-1 init_~r132~0#1 := (if 0 == (if 0 == init_~tmp___0~0#1 then 0 else 1) % 256 then 0 else 1); 598#L281 assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; 599#L284-1 init_~r212~0#1 := (if 0 == (if 0 == init_~tmp___1~0#1 then 0 else 1) % 256 then 0 else 1); 650#L294 assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; 632#L297-1 init_~r232~0#1 := (if 0 == (if 0 == init_~tmp___2~0#1 then 0 else 1) % 256 then 0 else 1); 636#L307 assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; 652#L310-1 init_~r312~0#1 := (if 0 == (if 0 == init_~tmp___3~0#1 then 0 else 1) % 256 then 0 else 1); 677#L320 assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; 587#L323-1 init_~r322~0#1 := (if 0 == (if 0 == init_~tmp___4~0#1 then 0 else 1) % 256 then 0 else 1); 668#L333 assume ~id1~0 != ~id2~0; 639#L334 assume ~id1~0 != ~id3~0; 620#L335 assume ~id2~0 != ~id3~0; 621#L336 assume ~id1~0 >= 0; 676#L337 assume ~id2~0 >= 0; 653#L338 assume ~id3~0 >= 0; 654#L339 assume 0 == ~r1~0; 694#L340 assume 0 == ~r2~0; 684#L341 assume 0 == ~r3~0; 640#L342 assume ~max1~0 == ~id1~0; 641#L343 assume ~max2~0 == ~id2~0; 633#L344 assume ~max3~0 == ~id3~0; 634#L345 assume 0 == ~st1~0; 647#L346 assume 0 == ~st2~0; 648#L347 assume 0 == ~st3~0; 698#L348 assume 0 == ~nl1~0; 680#L349 assume 0 == ~nl2~0; 681#L350 assume 0 == ~nl3~0; 670#L351 assume 0 == (if ~mode1~0 % 256 % 4294967296 <= 2147483647 then ~mode1~0 % 256 % 4294967296 else ~mode1~0 % 256 % 4294967296 - 4294967296); 671#L352 assume 0 == (if ~mode2~0 % 256 % 4294967296 <= 2147483647 then ~mode2~0 % 256 % 4294967296 else ~mode2~0 % 256 % 4294967296 - 4294967296); 691#L353 assume 0 == (if ~mode3~0 % 256 % 4294967296 <= 2147483647 then ~mode3~0 % 256 % 4294967296 else ~mode3~0 % 256 % 4294967296 - 4294967296); 665#L354 assume 0 != ~newmax1~0 % 256; 642#L355 assume 0 != ~newmax2~0 % 256; 643#L356 assume 0 != ~newmax3~0 % 256;init_~tmp___5~0#1 := 1; 682#L333-1 init_#res#1 := init_~tmp___5~0#1; 685#init_returnLabel#1 main_#t~ret34#1 := init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret34#1;havoc main_#t~ret34#1; 686#L527 assume !(0 == main_~i2~0#1); 689#L527-2 ~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 605#L541-2 [2024-11-08 00:43:21,608 INFO L747 eck$LassoCheckResult]: Loop: 605#L541-2 assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; 606#L79 assume !(0 != ~mode1~0 % 256); 658#L107 assume !(~r1~0 < 2); 656#L107-1 ~mode1~0 := 1; 604#L79-2 havoc node1_~newmax~0#1;assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; 644#L130 assume !(0 != ~mode2~0 % 256); 601#L158 assume !(~r2~0 < 2); 597#L158-1 ~mode2~0 := 1; 661#L130-2 havoc node2_~newmax~1#1;assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; 662#L181 assume !(0 != ~mode3~0 % 256); 690#L209 assume !(~r3~0 < 2); 627#L209-1 ~mode3~0 := 1; 612#L181-2 havoc node3_~newmax~2#1;assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 649#L438 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 663#L439 assume ~st1~0 + ~nl1~0 <= 1; 664#L440 assume ~st2~0 + ~nl2~0 <= 1; 613#L441 assume ~st3~0 + ~nl3~0 <= 1; 614#L442 assume ~r1~0 >= 2; 622#$Ultimate##257 assume ~r1~0 < 2; 645#$Ultimate##261 assume ~r1~0 >= 2; 581#$Ultimate##265 assume ~r1~0 < 2;check_~tmp~1#1 := 1; 582#L438-1 check_#res#1 := check_~tmp~1#1; 607#check_returnLabel#1 main_#t~ret35#1 := check_#res#1;havoc check_~tmp~1#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret35#1;havoc main_#t~ret35#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 608#L571 assume !(0 == assert_~arg#1 % 256); 697#L566 havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true;main_#t~post36#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post36#1;havoc main_#t~post36#1; 605#L541-2 [2024-11-08 00:43:21,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:43:21,608 INFO L85 PathProgramCache]: Analyzing trace with hash -2116426971, now seen corresponding path program 1 times [2024-11-08 00:43:21,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:43:21,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125663516] [2024-11-08 00:43:21,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:43:21,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:43:21,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:43:21,721 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 00:43:21,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:43:21,832 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 00:43:21,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:43:21,833 INFO L85 PathProgramCache]: Analyzing trace with hash -626971476, now seen corresponding path program 2 times [2024-11-08 00:43:21,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:43:21,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643758898] [2024-11-08 00:43:21,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:43:21,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:43:21,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:43:21,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 00:43:21,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 00:43:21,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643758898] [2024-11-08 00:43:21,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643758898] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 00:43:21,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 00:43:21,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 00:43:21,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459132151] [2024-11-08 00:43:21,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 00:43:21,858 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-08 00:43:21,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 00:43:21,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 00:43:21,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 00:43:21,858 INFO L87 Difference]: Start difference. First operand 119 states and 177 transitions. cyclomatic complexity: 59 Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 00:43:21,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 00:43:21,915 INFO L93 Difference]: Finished difference Result 169 states and 252 transitions. [2024-11-08 00:43:21,915 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 169 states and 252 transitions. [2024-11-08 00:43:21,917 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 115 [2024-11-08 00:43:21,919 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 169 states to 169 states and 252 transitions. [2024-11-08 00:43:21,921 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 169 [2024-11-08 00:43:21,922 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 169 [2024-11-08 00:43:21,922 INFO L73 IsDeterministic]: Start isDeterministic. Operand 169 states and 252 transitions. [2024-11-08 00:43:21,922 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-08 00:43:21,922 INFO L218 hiAutomatonCegarLoop]: Abstraction has 169 states and 252 transitions. [2024-11-08 00:43:21,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states and 252 transitions. [2024-11-08 00:43:21,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2024-11-08 00:43:21,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 169 states have (on average 1.4911242603550297) internal successors, (252), 168 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 00:43:21,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 252 transitions. [2024-11-08 00:43:21,938 INFO L240 hiAutomatonCegarLoop]: Abstraction has 169 states and 252 transitions. [2024-11-08 00:43:21,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 00:43:21,941 INFO L425 stractBuchiCegarLoop]: Abstraction has 169 states and 252 transitions. [2024-11-08 00:43:21,941 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-08 00:43:21,942 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 169 states and 252 transitions. [2024-11-08 00:43:21,943 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 115 [2024-11-08 00:43:21,944 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-08 00:43:21,944 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-08 00:43:21,945 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 00:43:21,947 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 00:43:21,948 INFO L745 eck$LassoCheckResult]: Stem: 923#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(43, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0; 924#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~ret34#1, main_#t~ret35#1, main_#t~post36#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;havoc main_#t~nondet4#1;assume 0 == main_#t~nondet4#1 || 1 == main_#t~nondet4#1;~ep12~0 := (if 0 == main_#t~nondet4#1 % 256 then 0 else 1);havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;assume 0 == main_#t~nondet5#1 || 1 == main_#t~nondet5#1;~ep13~0 := (if 0 == main_#t~nondet5#1 % 256 then 0 else 1);havoc main_#t~nondet5#1;havoc main_#t~nondet6#1;assume 0 == main_#t~nondet6#1 || 1 == main_#t~nondet6#1;~ep21~0 := (if 0 == main_#t~nondet6#1 % 256 then 0 else 1);havoc main_#t~nondet6#1;havoc main_#t~nondet7#1;assume 0 == main_#t~nondet7#1 || 1 == main_#t~nondet7#1;~ep23~0 := (if 0 == main_#t~nondet7#1 % 256 then 0 else 1);havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;assume 0 == main_#t~nondet8#1 || 1 == main_#t~nondet8#1;~ep31~0 := (if 0 == main_#t~nondet8#1 % 256 then 0 else 1);havoc main_#t~nondet8#1;havoc main_#t~nondet9#1;assume 0 == main_#t~nondet9#1 || 1 == main_#t~nondet9#1;~ep32~0 := (if 0 == main_#t~nondet9#1 % 256 then 0 else 1);havoc main_#t~nondet9#1;havoc main_#t~nondet10#1;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_#t~nondet11#1;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_#t~nondet13#1;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_#t~nondet14#1;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_#t~nondet15#1;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_#t~nondet16#1;assume 0 == main_#t~nondet16#1 || 1 == main_#t~nondet16#1;~mode1~0 := (if 0 == main_#t~nondet16#1 % 256 then 0 else 1);havoc main_#t~nondet16#1;havoc main_#t~nondet17#1;assume 0 == main_#t~nondet17#1 || 1 == main_#t~nondet17#1;~newmax1~0 := (if 0 == main_#t~nondet17#1 % 256 then 0 else 1);havoc main_#t~nondet17#1;havoc main_#t~nondet18#1;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_#t~nondet19#1;~r2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_#t~nondet20#1;~st2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_#t~nondet21#1;~nl2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_#t~nondet22#1;~m2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;havoc main_#t~nondet23#1;~max2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;havoc main_#t~nondet24#1;assume 0 == main_#t~nondet24#1 || 1 == main_#t~nondet24#1;~mode2~0 := (if 0 == main_#t~nondet24#1 % 256 then 0 else 1);havoc main_#t~nondet24#1;havoc main_#t~nondet25#1;assume 0 == main_#t~nondet25#1 || 1 == main_#t~nondet25#1;~newmax2~0 := (if 0 == main_#t~nondet25#1 % 256 then 0 else 1);havoc main_#t~nondet25#1;havoc main_#t~nondet26#1;~id3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;havoc main_#t~nondet27#1;~r3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;havoc main_#t~nondet28#1;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;havoc main_#t~nondet29#1;~nl3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;havoc main_#t~nondet30#1;~m3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;havoc main_#t~nondet31#1;~max3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;havoc main_#t~nondet32#1;assume 0 == main_#t~nondet32#1 || 1 == main_#t~nondet32#1;~mode3~0 := (if 0 == main_#t~nondet32#1 % 256 then 0 else 1);havoc main_#t~nondet32#1;havoc main_#t~nondet33#1;assume 0 == main_#t~nondet33#1 || 1 == main_#t~nondet33#1;~newmax3~0 := (if 0 == main_#t~nondet33#1 % 256 then 0 else 1);havoc main_#t~nondet33#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := (if 0 == ~ep12~0 % 256 then 0 else 1);init_~r131~0#1 := (if 0 == ~ep13~0 % 256 then 0 else 1);init_~r211~0#1 := (if 0 == ~ep21~0 % 256 then 0 else 1);init_~r231~0#1 := (if 0 == ~ep23~0 % 256 then 0 else 1);init_~r311~0#1 := (if 0 == ~ep31~0 % 256 then 0 else 1);init_~r321~0#1 := (if 0 == ~ep32~0 % 256 then 0 else 1); 903#L255 assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 888#L258-1 init_~r122~0#1 := (if 0 == (if 0 == init_~tmp~0#1 then 0 else 1) % 256 then 0 else 1); 889#L268 assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 909#L271-1 init_~r132~0#1 := (if 0 == (if 0 == init_~tmp___0~0#1 then 0 else 1) % 256 then 0 else 1); 892#L281 assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; 893#L284-1 init_~r212~0#1 := (if 0 == (if 0 == init_~tmp___1~0#1 then 0 else 1) % 256 then 0 else 1); 947#L294 assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; 926#L297-1 init_~r232~0#1 := (if 0 == (if 0 == init_~tmp___2~0#1 then 0 else 1) % 256 then 0 else 1); 930#L307 assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; 949#L310-1 init_~r312~0#1 := (if 0 == (if 0 == init_~tmp___3~0#1 then 0 else 1) % 256 then 0 else 1); 975#L320 assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; 881#L323-1 init_~r322~0#1 := (if 0 == (if 0 == init_~tmp___4~0#1 then 0 else 1) % 256 then 0 else 1); 966#L333 assume ~id1~0 != ~id2~0; 933#L334 assume ~id1~0 != ~id3~0; 914#L335 assume ~id2~0 != ~id3~0; 915#L336 assume ~id1~0 >= 0; 974#L337 assume ~id2~0 >= 0; 950#L338 assume ~id3~0 >= 0; 951#L339 assume 0 == ~r1~0; 996#L340 assume 0 == ~r2~0; 983#L341 assume 0 == ~r3~0; 934#L342 assume ~max1~0 == ~id1~0; 935#L343 assume ~max2~0 == ~id2~0; 927#L344 assume ~max3~0 == ~id3~0; 928#L345 assume 0 == ~st1~0; 943#L346 assume 0 == ~st2~0; 944#L347 assume 0 == ~st3~0; 1003#L348 assume 0 == ~nl1~0; 979#L349 assume 0 == ~nl2~0; 980#L350 assume 0 == ~nl3~0; 968#L351 assume 0 == (if ~mode1~0 % 256 % 4294967296 <= 2147483647 then ~mode1~0 % 256 % 4294967296 else ~mode1~0 % 256 % 4294967296 - 4294967296); 969#L352 assume 0 == (if ~mode2~0 % 256 % 4294967296 <= 2147483647 then ~mode2~0 % 256 % 4294967296 else ~mode2~0 % 256 % 4294967296 - 4294967296); 992#L353 assume 0 == (if ~mode3~0 % 256 % 4294967296 <= 2147483647 then ~mode3~0 % 256 % 4294967296 else ~mode3~0 % 256 % 4294967296 - 4294967296); 962#L354 assume 0 != ~newmax1~0 % 256; 936#L355 assume 0 != ~newmax2~0 % 256; 937#L356 assume 0 != ~newmax3~0 % 256;init_~tmp___5~0#1 := 1; 981#L333-1 init_#res#1 := init_~tmp___5~0#1; 984#init_returnLabel#1 main_#t~ret34#1 := init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret34#1;havoc main_#t~ret34#1; 985#L527 assume !(0 == main_~i2~0#1); 990#L527-2 ~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 899#L541-2 [2024-11-08 00:43:21,948 INFO L747 eck$LassoCheckResult]: Loop: 899#L541-2 assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; 900#L79 assume !(0 != ~mode1~0 % 256); 955#L107 assume ~r1~0 < 2; 911#L108 assume !(0 != ~ep12~0 % 256); 913#L108-1 assume !(0 != ~ep13~0 % 256); 953#L107-1 ~mode1~0 := 1; 1035#L79-2 havoc node1_~newmax~0#1;assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; 1032#L130 assume !(0 != ~mode2~0 % 256); 1027#L158 assume !(~r2~0 < 2); 1024#L158-1 ~mode2~0 := 1; 958#L130-2 havoc node2_~newmax~1#1;assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; 959#L181 assume !(0 != ~mode3~0 % 256); 991#L209 assume !(~r3~0 < 2); 1013#L209-1 ~mode3~0 := 1; 945#L181-2 havoc node3_~newmax~2#1;assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 946#L438 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 1011#L439 assume ~st1~0 + ~nl1~0 <= 1; 1010#L440 assume ~st2~0 + ~nl2~0 <= 1; 1009#L441 assume ~st3~0 + ~nl3~0 <= 1; 1008#L442 assume !(~r1~0 >= 2); 940#L445 assume 0 == ~st1~0 + ~st2~0 + ~st3~0; 941#$Ultimate##257 assume ~r1~0 < 2; 1007#$Ultimate##261 assume !(~r1~0 >= 2); 877#L455 assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; 878#$Ultimate##265 assume ~r1~0 < 2;check_~tmp~1#1 := 1; 942#L438-1 check_#res#1 := check_~tmp~1#1; 901#check_returnLabel#1 main_#t~ret35#1 := check_#res#1;havoc check_~tmp~1#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret35#1;havoc main_#t~ret35#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 902#L571 assume !(0 == assert_~arg#1 % 256); 1002#L566 havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true;main_#t~post36#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post36#1;havoc main_#t~post36#1; 899#L541-2 [2024-11-08 00:43:21,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:43:21,949 INFO L85 PathProgramCache]: Analyzing trace with hash -2116426971, now seen corresponding path program 2 times [2024-11-08 00:43:21,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:43:21,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383264161] [2024-11-08 00:43:21,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:43:21,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:43:22,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:43:22,032 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 00:43:22,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:43:22,104 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 00:43:22,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:43:22,105 INFO L85 PathProgramCache]: Analyzing trace with hash 863838846, now seen corresponding path program 1 times [2024-11-08 00:43:22,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:43:22,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258411772] [2024-11-08 00:43:22,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:43:22,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:43:22,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:43:22,115 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 00:43:22,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:43:22,129 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 00:43:22,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:43:22,129 INFO L85 PathProgramCache]: Analyzing trace with hash 12206554, now seen corresponding path program 1 times [2024-11-08 00:43:22,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:43:22,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548446995] [2024-11-08 00:43:22,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:43:22,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:43:22,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:43:22,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 00:43:22,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 00:43:22,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548446995] [2024-11-08 00:43:22,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548446995] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 00:43:22,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 00:43:22,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 00:43:22,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566280219] [2024-11-08 00:43:22,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 00:43:22,872 INFO L204 LassoAnalysis]: Preferences: [2024-11-08 00:43:22,873 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-08 00:43:22,873 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-08 00:43:22,873 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-08 00:43:22,873 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-08 00:43:22,873 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 00:43:22,873 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-08 00:43:22,873 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-08 00:43:22,874 INFO L132 ssoRankerPreferences]: Filename of dumped script: pals_opt-floodmax.3.1.ufo.BOUNDED-6.pals.c_Iteration4_Loop [2024-11-08 00:43:22,874 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-08 00:43:22,874 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-08 00:43:22,893 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 00:43:22,901 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 00:43:22,907 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 00:43:22,913 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 00:43:22,915 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 00:43:22,917 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 00:43:22,919 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 00:43:22,921 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 00:43:22,936 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 00:43:22,940 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 00:43:22,943 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 00:43:22,946 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 00:43:22,948 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 00:43:22,950 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 00:43:22,955 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 00:43:22,958 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 00:43:22,965 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 00:43:22,971 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 00:43:22,994 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 00:43:22,997 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 00:43:23,395 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-08 00:43:23,396 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-08 00:43:23,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 00:43:23,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 00:43:23,401 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 00:43:23,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-11-08 00:43:23,404 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-08 00:43:23,404 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-08 00:43:23,435 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-08 00:43:23,435 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~ep12~0=0} Honda state: {~ep12~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-08 00:43:23,449 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-11-08 00:43:23,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 00:43:23,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 00:43:23,452 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 00:43:23,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-11-08 00:43:23,453 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-08 00:43:23,454 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-08 00:43:23,476 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-11-08 00:43:23,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 00:43:23,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 00:43:23,478 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 00:43:23,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-11-08 00:43:23,480 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-08 00:43:23,480 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-08 00:43:23,555 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-08 00:43:23,560 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-11-08 00:43:23,560 INFO L204 LassoAnalysis]: Preferences: [2024-11-08 00:43:23,560 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-08 00:43:23,560 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-08 00:43:23,560 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-08 00:43:23,560 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-08 00:43:23,560 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 00:43:23,560 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-08 00:43:23,561 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-08 00:43:23,561 INFO L132 ssoRankerPreferences]: Filename of dumped script: pals_opt-floodmax.3.1.ufo.BOUNDED-6.pals.c_Iteration4_Loop [2024-11-08 00:43:23,561 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-08 00:43:23,561 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-08 00:43:23,563 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 00:43:23,571 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 00:43:23,575 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 00:43:23,580 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 00:43:23,585 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 00:43:23,587 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 00:43:23,590 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 00:43:23,592 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 00:43:23,594 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 00:43:23,604 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 00:43:23,607 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 00:43:23,613 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 00:43:23,637 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 00:43:23,640 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 00:43:23,642 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 00:43:23,648 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 00:43:23,654 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 00:43:23,659 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 00:43:23,661 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 00:43:23,663 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 00:43:24,059 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-08 00:43:24,064 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-08 00:43:24,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 00:43:24,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 00:43:24,067 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 00:43:24,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-11-08 00:43:24,070 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 [2024-11-08 00:43:24,083 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-08 00:43:24,084 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-08 00:43:24,084 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-08 00:43:24,084 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-08 00:43:24,084 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-08 00:43:24,089 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-08 00:43:24,089 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-08 00:43:24,091 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-08 00:43:24,106 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-11-08 00:43:24,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 00:43:24,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 00:43:24,109 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 00:43:24,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-11-08 00:43:24,112 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 [2024-11-08 00:43:24,123 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-08 00:43:24,123 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-08 00:43:24,123 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-08 00:43:24,124 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-08 00:43:24,124 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-08 00:43:24,124 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-08 00:43:24,124 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-08 00:43:24,126 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-08 00:43:24,136 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-11-08 00:43:24,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 00:43:24,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 00:43:24,138 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 00:43:24,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-11-08 00:43:24,139 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 [2024-11-08 00:43:24,149 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-08 00:43:24,149 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-08 00:43:24,150 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-08 00:43:24,150 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-08 00:43:24,150 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-08 00:43:24,151 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-08 00:43:24,151 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-08 00:43:24,153 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-08 00:43:24,167 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-11-08 00:43:24,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 00:43:24,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 00:43:24,170 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 00:43:24,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-11-08 00:43:24,172 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 [2024-11-08 00:43:24,185 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-08 00:43:24,185 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-08 00:43:24,185 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-08 00:43:24,185 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-08 00:43:24,185 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-08 00:43:24,188 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-08 00:43:24,188 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-08 00:43:24,192 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-08 00:43:24,206 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-11-08 00:43:24,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 00:43:24,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 00:43:24,210 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 00:43:24,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-11-08 00:43:24,211 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 [2024-11-08 00:43:24,221 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-08 00:43:24,222 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-08 00:43:24,222 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-08 00:43:24,222 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-08 00:43:24,222 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-08 00:43:24,222 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-08 00:43:24,222 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-08 00:43:24,223 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-08 00:43:24,234 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2024-11-08 00:43:24,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 00:43:24,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 00:43:24,236 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 00:43:24,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-11-08 00:43:24,237 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 [2024-11-08 00:43:24,247 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-08 00:43:24,247 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-08 00:43:24,248 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-08 00:43:24,248 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-08 00:43:24,248 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-08 00:43:24,248 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-08 00:43:24,248 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-08 00:43:24,249 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-08 00:43:24,260 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-11-08 00:43:24,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 00:43:24,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 00:43:24,262 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 00:43:24,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-11-08 00:43:24,264 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 [2024-11-08 00:43:24,275 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-08 00:43:24,275 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-08 00:43:24,275 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-08 00:43:24,275 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-08 00:43:24,275 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-08 00:43:24,278 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-08 00:43:24,278 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-08 00:43:24,280 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-08 00:43:24,294 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2024-11-08 00:43:24,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 00:43:24,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 00:43:24,297 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 00:43:24,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-11-08 00:43:24,299 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 [2024-11-08 00:43:24,312 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-08 00:43:24,312 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-08 00:43:24,312 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-08 00:43:24,312 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-08 00:43:24,312 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-08 00:43:24,312 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-08 00:43:24,312 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-08 00:43:24,314 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-08 00:43:24,328 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2024-11-08 00:43:24,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 00:43:24,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 00:43:24,331 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 00:43:24,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-11-08 00:43:24,333 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 [2024-11-08 00:43:24,346 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-08 00:43:24,347 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-08 00:43:24,347 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-08 00:43:24,347 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-08 00:43:24,347 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-08 00:43:24,348 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-08 00:43:24,348 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-08 00:43:24,353 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-08 00:43:24,368 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2024-11-08 00:43:24,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 00:43:24,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 00:43:24,371 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 00:43:24,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-11-08 00:43:24,373 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 [2024-11-08 00:43:24,386 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-08 00:43:24,386 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-08 00:43:24,386 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-08 00:43:24,386 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-08 00:43:24,386 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-08 00:43:24,387 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-08 00:43:24,387 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-08 00:43:24,392 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-08 00:43:24,406 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2024-11-08 00:43:24,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 00:43:24,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 00:43:24,409 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 00:43:24,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-11-08 00:43:24,411 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 [2024-11-08 00:43:24,424 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-08 00:43:24,425 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-08 00:43:24,425 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-08 00:43:24,425 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-08 00:43:24,425 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-08 00:43:24,426 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-08 00:43:24,426 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-08 00:43:24,427 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-08 00:43:24,441 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2024-11-08 00:43:24,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 00:43:24,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 00:43:24,444 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 00:43:24,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-11-08 00:43:24,447 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 [2024-11-08 00:43:24,461 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-08 00:43:24,461 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-08 00:43:24,461 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-08 00:43:24,461 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-08 00:43:24,461 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-08 00:43:24,470 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-08 00:43:24,470 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-08 00:43:24,476 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-08 00:43:24,490 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2024-11-08 00:43:24,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 00:43:24,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 00:43:24,493 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 00:43:24,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-11-08 00:43:24,495 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 [2024-11-08 00:43:24,509 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-08 00:43:24,509 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-08 00:43:24,509 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-08 00:43:24,509 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-08 00:43:24,509 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-08 00:43:24,510 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-08 00:43:24,510 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-08 00:43:24,512 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-08 00:43:24,526 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2024-11-08 00:43:24,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 00:43:24,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 00:43:24,529 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 00:43:24,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-11-08 00:43:24,531 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 [2024-11-08 00:43:24,541 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-08 00:43:24,541 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-08 00:43:24,542 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-08 00:43:24,542 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-08 00:43:24,542 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-08 00:43:24,542 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-08 00:43:24,542 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-08 00:43:24,544 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-08 00:43:24,557 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2024-11-08 00:43:24,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 00:43:24,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 00:43:24,560 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 00:43:24,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-11-08 00:43:24,562 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 [2024-11-08 00:43:24,575 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-08 00:43:24,575 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-08 00:43:24,575 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-08 00:43:24,575 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-08 00:43:24,575 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-08 00:43:24,577 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-08 00:43:24,577 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-08 00:43:24,581 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-08 00:43:24,594 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2024-11-08 00:43:24,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 00:43:24,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 00:43:24,596 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 00:43:24,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-11-08 00:43:24,604 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 [2024-11-08 00:43:24,614 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-08 00:43:24,614 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-08 00:43:24,614 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-08 00:43:24,614 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-08 00:43:24,615 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-08 00:43:24,615 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-08 00:43:24,615 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-08 00:43:24,616 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-08 00:43:24,626 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2024-11-08 00:43:24,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 00:43:24,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 00:43:24,628 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 00:43:24,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-11-08 00:43:24,629 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 [2024-11-08 00:43:24,639 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-08 00:43:24,639 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-08 00:43:24,639 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-08 00:43:24,639 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-08 00:43:24,639 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-08 00:43:24,640 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-08 00:43:24,640 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-08 00:43:24,642 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-08 00:43:24,649 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-08 00:43:24,651 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-08 00:43:24,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 00:43:24,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 00:43:24,659 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 00:43:24,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-11-08 00:43:24,663 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-08 00:43:24,663 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-08 00:43:24,663 INFO L474 LassoAnalysis]: Proved termination. [2024-11-08 00:43:24,663 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0#1) = -2*ULTIMATE.start_main_~i2~0#1 + 11 Supporting invariants [] [2024-11-08 00:43:24,674 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2024-11-08 00:43:24,677 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-08 00:43:24,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:43:24,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:43:24,759 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 00:43:24,761 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 00:43:24,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:43:24,850 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 00:43:24,851 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 00:43:24,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 00:43:24,994 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-08 00:43:24,996 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 169 states and 252 transitions. cyclomatic complexity: 84 Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 00:43:25,061 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 169 states and 252 transitions. cyclomatic complexity: 84. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 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 283 states and 432 transitions. Complement of second has 4 states. [2024-11-08 00:43:25,062 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 [2024-11-08 00:43:25,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 00:43:25,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 177 transitions. [2024-11-08 00:43:25,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 177 transitions. Stem has 42 letters. Loop has 29 letters. [2024-11-08 00:43:25,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-08 00:43:25,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 177 transitions. Stem has 71 letters. Loop has 29 letters. [2024-11-08 00:43:25,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-08 00:43:25,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 177 transitions. Stem has 42 letters. Loop has 58 letters. [2024-11-08 00:43:25,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-08 00:43:25,073 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 283 states and 432 transitions. [2024-11-08 00:43:25,077 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-08 00:43:25,078 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 283 states to 0 states and 0 transitions. [2024-11-08 00:43:25,078 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-11-08 00:43:25,078 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-11-08 00:43:25,078 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-11-08 00:43:25,078 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-08 00:43:25,078 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-08 00:43:25,078 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-08 00:43:25,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 00:43:25,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 00:43:25,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 00:43:25,079 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 00:43:25,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 00:43:25,080 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2024-11-08 00:43:25,080 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2024-11-08 00:43:25,080 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-08 00:43:25,080 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2024-11-08 00:43:25,080 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-11-08 00:43:25,080 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-11-08 00:43:25,080 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-11-08 00:43:25,080 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-08 00:43:25,080 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-08 00:43:25,080 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-08 00:43:25,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 00:43:25,081 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-08 00:43:25,082 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-08 00:43:25,082 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-11-08 00:43:25,082 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-08 00:43:25,083 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-11-08 00:43:25,090 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 08.11 12:43:25 BoogieIcfgContainer [2024-11-08 00:43:25,090 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-08 00:43:25,092 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 00:43:25,092 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 00:43:25,092 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 00:43:25,092 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 12:43:20" (3/4) ... [2024-11-08 00:43:25,094 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 00:43:25,095 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 00:43:25,095 INFO L158 Benchmark]: Toolchain (without parser) took 5894.29ms. Allocated memory was 100.7MB in the beginning and 125.8MB in the end (delta: 25.2MB). Free memory was 76.2MB in the beginning and 52.0MB in the end (delta: 24.2MB). Peak memory consumption was 47.4MB. Max. memory is 16.1GB. [2024-11-08 00:43:25,095 INFO L158 Benchmark]: CDTParser took 0.79ms. Allocated memory is still 83.9MB. Free memory is still 48.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 00:43:25,096 INFO L158 Benchmark]: CACSL2BoogieTranslator took 327.25ms. Allocated memory is still 100.7MB. Free memory was 76.1MB in the beginning and 59.5MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-08 00:43:25,096 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.93ms. Allocated memory is still 100.7MB. Free memory was 59.5MB in the beginning and 56.5MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 00:43:25,096 INFO L158 Benchmark]: Boogie Preprocessor took 85.89ms. Allocated memory is still 100.7MB. Free memory was 56.5MB in the beginning and 53.3MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-08 00:43:25,096 INFO L158 Benchmark]: RCFGBuilder took 707.90ms. Allocated memory is still 100.7MB. Free memory was 53.3MB in the beginning and 55.1MB in the end (delta: -1.8MB). Peak memory consumption was 21.3MB. Max. memory is 16.1GB. [2024-11-08 00:43:25,096 INFO L158 Benchmark]: BuchiAutomizer took 4696.66ms. Allocated memory was 100.7MB in the beginning and 125.8MB in the end (delta: 25.2MB). Free memory was 55.1MB in the beginning and 53.2MB in the end (delta: 1.9MB). Peak memory consumption was 26.1MB. Max. memory is 16.1GB. [2024-11-08 00:43:25,097 INFO L158 Benchmark]: Witness Printer took 2.87ms. Allocated memory is still 125.8MB. Free memory was 53.2MB in the beginning and 52.0MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 00:43:25,098 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.79ms. Allocated memory is still 83.9MB. Free memory is still 48.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 327.25ms. Allocated memory is still 100.7MB. Free memory was 76.1MB in the beginning and 59.5MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.93ms. Allocated memory is still 100.7MB. Free memory was 59.5MB in the beginning and 56.5MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 85.89ms. Allocated memory is still 100.7MB. Free memory was 56.5MB in the beginning and 53.3MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 707.90ms. Allocated memory is still 100.7MB. Free memory was 53.3MB in the beginning and 55.1MB in the end (delta: -1.8MB). Peak memory consumption was 21.3MB. Max. memory is 16.1GB. * BuchiAutomizer took 4696.66ms. Allocated memory was 100.7MB in the beginning and 125.8MB in the end (delta: 25.2MB). Free memory was 55.1MB in the beginning and 53.2MB in the end (delta: 1.9MB). Peak memory consumption was 26.1MB. Max. memory is 16.1GB. * Witness Printer took 2.87ms. Allocated memory is still 125.8MB. Free memory was 53.2MB in the beginning and 52.0MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (4 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function (((long long) -2 * i2) + 11) and consists of 3 locations. 4 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.6s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 3.8s. Construction of modules took 0.1s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 65 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 445 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 444 mSDsluCounter, 2199 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1440 mSDsCounter, 42 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 59 IncrementalHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 42 mSolverCounterUnsat, 759 mSDtfsCounter, 59 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT1 SILN0 SILU0 SILI2 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital116 mio100 ax100 hnf100 lsp32 ukn100 mio100 lsp100 div123 bol100 ite100 ukn100 eq182 hnf86 smp100 dnf100 smp100 tf102 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 26ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 1 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2024-11-08 00:43:25,112 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2024-11-08 00:43:25,318 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE