/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/Termination.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/chl/nzb-file-subst.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:54:51,357 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:54:51,427 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 16:54:51,432 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:54:51,432 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:54:51,432 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 16:54:51,432 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:54:51,458 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:54:51,460 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:54:51,461 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:54:51,461 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:54:51,461 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:54:51,461 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:54:51,461 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:54:51,461 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:54:51,461 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:54:51,461 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:54:51,461 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:54:51,461 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:54:51,461 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:54:51,462 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:54:51,462 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:54:51,462 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:54:51,462 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:54:51,462 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:54:51,462 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:54:51,462 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:54:51,462 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:54:51,462 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:54:51,462 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:54:51,462 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:54:51,462 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:54:51,462 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:54:51,462 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:54:51,463 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:54:51,463 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:54:51,463 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:54:51,463 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:54:51,463 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:54:51,463 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:54:51,463 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:54:51,463 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:54:51,463 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:54:51,702 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:54:51,708 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:54:51,710 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:54:51,711 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:54:51,711 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:54:51,712 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/chl/nzb-file-subst.wvr.bpl [2025-04-26 16:54:51,714 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/chl/nzb-file-subst.wvr.bpl' [2025-04-26 16:54:51,730 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:54:51,730 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:54:51,731 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:54:51,731 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:54:51,731 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:54:51,741 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "nzb-file-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:51" (1/1) ... [2025-04-26 16:54:51,768 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "nzb-file-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:51" (1/1) ... [2025-04-26 16:54:51,775 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:54:51,776 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:54:51,776 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:54:51,777 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:54:51,777 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:54:51,781 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "nzb-file-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:51" (1/1) ... [2025-04-26 16:54:51,781 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "nzb-file-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:51" (1/1) ... [2025-04-26 16:54:51,783 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "nzb-file-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:51" (1/1) ... [2025-04-26 16:54:51,783 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "nzb-file-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:51" (1/1) ... [2025-04-26 16:54:51,788 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "nzb-file-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:51" (1/1) ... [2025-04-26 16:54:51,789 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "nzb-file-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:51" (1/1) ... [2025-04-26 16:54:51,791 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "nzb-file-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:51" (1/1) ... [2025-04-26 16:54:51,792 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "nzb-file-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:51" (1/1) ... [2025-04-26 16:54:51,792 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "nzb-file-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:51" (1/1) ... [2025-04-26 16:54:51,799 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:54:51,802 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:54:51,802 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:54:51,802 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:54:51,803 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "nzb-file-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:51" (1/1) ... [2025-04-26 16:54:51,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:54:51,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:51,825 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:51,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-26 16:54:51,848 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:54:51,849 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:54:51,849 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:54:51,849 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:54:51,849 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:54:51,849 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:54:51,849 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:54:51,849 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:54:51,849 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:54:51,849 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 16:54:51,849 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:54:51,849 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:54:51,850 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 16:54:51,898 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:54:51,899 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:54:52,053 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:54:52,053 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:54:52,147 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:54:52,147 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2025-04-26 16:54:52,148 INFO L201 PluginConnector]: Adding new model nzb-file-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:54:52 BoogieIcfgContainer [2025-04-26 16:54:52,148 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:54:52,151 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:54:52,151 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:54:52,155 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:54:52,155 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:54:52,156 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "nzb-file-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:51" (1/2) ... [2025-04-26 16:54:52,156 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@516eed84 and model type nzb-file-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:54:52, skipping insertion in model container [2025-04-26 16:54:52,157 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:54:52,157 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "nzb-file-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:54:52" (2/2) ... [2025-04-26 16:54:52,158 INFO L376 chiAutomizerObserver]: Analyzing ICFG nzb-file-subst.wvr.bpl [2025-04-26 16:54:52,214 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-26 16:54:52,251 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:54:52,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:54:52,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:52,254 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:52,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-26 16:54:52,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 31 transitions, 83 flow [2025-04-26 16:54:52,353 INFO L116 PetriNetUnfolderBase]: 6/25 cut-off events. [2025-04-26 16:54:52,354 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-26 16:54:52,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 25 events. 6/25 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 28 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 21. Up to 2 conditions per place. [2025-04-26 16:54:52,357 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 31 transitions, 83 flow [2025-04-26 16:54:52,359 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 25 transitions, 68 flow [2025-04-26 16:54:52,360 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 29 places, 25 transitions, 68 flow [2025-04-26 16:54:52,365 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:54:52,390 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 67#[L138, L109, thread1EXIT, thread2EXIT]true [2025-04-26 16:54:52,395 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 87#[thread2EXIT, L109, L139]true [2025-04-26 16:54:52,400 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 53#[L137, L75, thread1EXIT]true [2025-04-26 16:54:52,402 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 105#[L75, L138, thread1EXIT, thread3EXIT]true [2025-04-26 16:54:52,403 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 99#[L75, L138, L109, thread1EXIT]true [2025-04-26 16:54:52,404 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 113#[L109, L139, L75]true [2025-04-26 16:54:52,405 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 43#[L41, L136]true [2025-04-26 16:54:52,407 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 123#[L137, L41, L92]true [2025-04-26 16:54:52,408 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 131#[thread2EXIT, L137, L41]true [2025-04-26 16:54:52,410 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 145#[L138, L109, L41, thread2EXIT]true [2025-04-26 16:54:52,411 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 159#[L138, L41, L92, thread3EXIT]true [2025-04-26 16:54:52,412 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 157#[L138, L109, L41, L92]true [2025-04-26 16:54:52,413 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 125#[L137, L41, L75]true [2025-04-26 16:54:52,415 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 177#[L75, L138, L41, thread3EXIT]true [2025-04-26 16:54:52,416 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 175#[L75, L138, L109, L41]true [2025-04-26 16:54:52,416 WARN L140 AmpleReduction]: Number of pruned transitions: 59 [2025-04-26 16:54:52,416 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 15 [2025-04-26 16:54:52,416 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 15 [2025-04-26 16:54:52,418 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:16 [2025-04-26 16:54:52,418 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:38 [2025-04-26 16:54:52,418 WARN L145 AmpleReduction]: Times succ was already a loop node:0 [2025-04-26 16:54:52,418 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:0 [2025-04-26 16:54:52,418 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:54:52,420 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 55 states, 53 states have (on average 1.7924528301886793) internal successors, (in total 95), 54 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:52,428 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:54:52,428 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:54:52,428 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:54:52,428 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:54:52,428 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:54:52,429 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:54:52,429 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:54:52,429 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:54:52,431 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 55 states, 53 states have (on average 1.7924528301886793) internal successors, (in total 95), 54 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:52,447 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 18 [2025-04-26 16:54:52,448 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:52,448 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:52,452 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:54:52,452 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:54:52,452 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:54:52,453 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 55 states, 53 states have (on average 1.7924528301886793) internal successors, (in total 95), 54 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:52,454 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 18 [2025-04-26 16:54:52,454 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:52,455 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:52,455 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:54:52,455 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:54:52,459 INFO L752 eck$LassoCheckResult]: Stem: "[157] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[141] $Ultimate##0-->L41: Formula: (and (not v_is_null_1_9) (not v_break_14_61) (= v_i_13_44 0) (not v_is_null_5_9)) InVars {is_null_1=v_is_null_1_9, is_null_5=v_is_null_5_9} OutVars{i_13=v_i_13_44, is_null_5=v_is_null_5_9, break_14=v_break_14_61, is_null_1=v_is_null_1_9} AuxVars[] AssignedVars[i_13, break_14]" [2025-04-26 16:54:52,459 INFO L754 eck$LassoCheckResult]: Loop: "[144] L41-->L41: Formula: (let ((.cse5 (not v_break_14_68)) (.cse8 (select v_ends_with_6_21 v_i_13_39)) (.cse1 (not v_break_14_67)) (.cse9 (select v_ends_with_2_17 v_i_13_39))) (let ((.cse0 (not v_break_14_52)) (.cse2 (not .cse9)) (.cse6 (and .cse9 .cse1)) (.cse4 (and .cse8 .cse9)) (.cse3 (not .cse8)) (.cse7 (and .cse8 .cse5))) (and (or (and .cse0 .cse1 (or .cse2 .cse3)) (and (or v_break_14_52 .cse4) v_break_14_67)) .cse0 (or (and (or .cse2 v_break_14_67) .cse1 .cse5) (and (or v_break_14_67 .cse6) v_break_14_68)) (< v_i_13_39 5) (= (+ v_i_13_39 1) v_i_13_38) (= v_result_12_41 (ite .cse7 (+ 1000 v_i_13_39) (ite .cse6 (+ v_i_13_39 (- 1000)) (ite .cse4 0 v_result_12_42)))) (or (and (or .cse3 v_break_14_68) (not v_break_14_51) .cse5) (and (or .cse7 v_break_14_68) v_break_14_51))))) InVars {result_12=v_result_12_42, i_13=v_i_13_39, ends_with_6=v_ends_with_6_21, break_14=v_break_14_52, ends_with_2=v_ends_with_2_17} OutVars{result_12=v_result_12_41, i_13=v_i_13_38, ends_with_6=v_ends_with_6_21, break_14=v_break_14_51, ends_with_2=v_ends_with_2_17} AuxVars[v_break_14_68, v_break_14_67] AssignedVars[result_12, i_13, break_14]" [2025-04-26 16:54:52,462 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:52,463 INFO L85 PathProgramCache]: Analyzing trace with hash 5969, now seen corresponding path program 1 times [2025-04-26 16:54:52,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:52,467 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992092540] [2025-04-26 16:54:52,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:52,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:52,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:52,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:54:52,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:52,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:52,511 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:52,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:52,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:54:52,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:52,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:52,527 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:52,529 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:52,529 INFO L85 PathProgramCache]: Analyzing trace with hash 175, now seen corresponding path program 1 times [2025-04-26 16:54:52,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:52,529 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988820811] [2025-04-26 16:54:52,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:52,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:52,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:54:52,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:54:52,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:52,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:52,549 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:52,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:54:52,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:54:52,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:52,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:52,556 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:52,557 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:52,557 INFO L85 PathProgramCache]: Analyzing trace with hash 185183, now seen corresponding path program 1 times [2025-04-26 16:54:52,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:52,557 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37703629] [2025-04-26 16:54:52,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:52,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:52,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:54:52,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:54:52,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:52,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:52,568 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:52,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:54:52,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:54:52,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:52,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:52,575 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:53,321 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:54:53,321 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:54:53,321 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:54:53,321 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:54:53,322 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:54:53,322 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:53,322 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:54:53,322 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:54:53,322 INFO L132 ssoRankerPreferences]: Filename of dumped script: nzb-file-subst.wvr.bpl_petrified1_Iteration1_Lasso [2025-04-26 16:54:53,322 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:54:53,322 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:54:53,337 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:53,363 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:53,514 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:53,517 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:53,587 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2025-04-26 16:54:53,748 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:54:53,752 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:54:53,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:53,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:53,755 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:53,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 16:54:53,758 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 [2025-04-26 16:54:53,770 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:53,770 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:53,770 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:53,771 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:53,776 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:53,777 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:53,780 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:53,786 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-04-26 16:54:53,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:53,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:53,790 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:53,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 16:54:53,792 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 [2025-04-26 16:54:53,804 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:53,804 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:53,804 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2025-04-26 16:54:53,804 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:53,850 INFO L402 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications. [2025-04-26 16:54:53,850 INFO L403 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2025-04-26 16:54:53,925 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:54:53,975 INFO L436 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-04-26 16:54:53,975 INFO L437 ModelExtractionUtils]: 43 out of 55 variables were initially zero. Simplification set additionally 9 variables to zero. [2025-04-26 16:54:53,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:53,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:53,978 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:53,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 16:54:53,981 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:54:54,005 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:54,006 INFO L439 nArgumentSynthesizer]: Removed 8 redundant supporting invariants from a total of 8. [2025-04-26 16:54:54,006 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:54:54,006 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i_13) = -2*i_13 + 9 Supporting invariants [] [2025-04-26 16:54:54,014 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-04-26 16:54:54,016 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:54:54,035 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:54,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:54,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:54:54,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:54,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:54,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:54:54,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:54,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:54:54,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:54:54,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:54,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:54,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:54:54,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:54,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:54:54,083 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-04-26 16:54:54,085 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 55 states, 53 states have (on average 1.7924528301886793) internal successors, (in total 95), 54 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 1.5) internal successors, (in total 3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:54,161 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 55 states, 53 states have (on average 1.7924528301886793) internal successors, (in total 95), 54 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0). Second operand has 2 states, 2 states have (on average 1.5) internal successors, (in total 3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 156 states and 291 transitions. Complement of second has 5 states. [2025-04-26 16:54:54,162 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:54:54,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.5) internal successors, (in total 3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:54,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2025-04-26 16:54:54,170 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 51 transitions. Stem has 2 letters. Loop has 1 letters. [2025-04-26 16:54:54,170 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:54,170 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 51 transitions. Stem has 3 letters. Loop has 1 letters. [2025-04-26 16:54:54,170 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:54,170 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 51 transitions. Stem has 2 letters. Loop has 2 letters. [2025-04-26 16:54:54,170 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:54,171 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 156 states and 291 transitions. [2025-04-26 16:54:54,175 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 21 [2025-04-26 16:54:54,182 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 156 states to 77 states and 146 transitions. [2025-04-26 16:54:54,182 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 51 [2025-04-26 16:54:54,183 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 64 [2025-04-26 16:54:54,183 INFO L74 IsDeterministic]: Start isDeterministic. Operand 77 states and 146 transitions. [2025-04-26 16:54:54,184 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:54:54,184 INFO L218 hiAutomatonCegarLoop]: Abstraction has 77 states and 146 transitions. [2025-04-26 16:54:54,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states and 146 transitions. [2025-04-26 16:54:54,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 49. [2025-04-26 16:54:54,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 2.0408163265306123) internal successors, (in total 100), 48 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:54,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 100 transitions. [2025-04-26 16:54:54,208 INFO L240 hiAutomatonCegarLoop]: Abstraction has 49 states and 100 transitions. [2025-04-26 16:54:54,208 INFO L438 stractBuchiCegarLoop]: Abstraction has 49 states and 100 transitions. [2025-04-26 16:54:54,208 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:54:54,209 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 100 transitions. [2025-04-26 16:54:54,211 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 13 [2025-04-26 16:54:54,211 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:54,211 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:54,211 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:54:54,211 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:54:54,212 INFO L752 eck$LassoCheckResult]: Stem: "[157] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[141] $Ultimate##0-->L41: Formula: (and (not v_is_null_1_9) (not v_break_14_61) (= v_i_13_44 0) (not v_is_null_5_9)) InVars {is_null_1=v_is_null_1_9, is_null_5=v_is_null_5_9} OutVars{i_13=v_i_13_44, is_null_5=v_is_null_5_9, break_14=v_break_14_61, is_null_1=v_is_null_1_9} AuxVars[] AssignedVars[i_13, break_14]" "[160] L136-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[146] $Ultimate##0-->L75: Formula: (and (= v_i_16_44 0) (not v_is_null_1_13) (not v_break_17_61) (not v_is_null_9_9)) InVars {is_null_1=v_is_null_1_13, is_null_9=v_is_null_9_9} OutVars{break_17=v_break_17_61, i_16=v_i_16_44, is_null_1=v_is_null_1_13, is_null_9=v_is_null_9_9} AuxVars[] AssignedVars[i_16, break_17]" [2025-04-26 16:54:54,212 INFO L754 eck$LassoCheckResult]: Loop: "[149] L75-->L75: Formula: (let ((.cse6 (not v_break_17_67)) (.cse8 (select v_ends_with_2_27 v_i_16_39)) (.cse3 (not v_break_17_68)) (.cse9 (select v_ends_with_10_21 v_i_16_39))) (let ((.cse0 (and .cse3 .cse9)) (.cse4 (not .cse9)) (.cse2 (and .cse9 .cse8)) (.cse7 (not v_break_17_52)) (.cse5 (not .cse8)) (.cse1 (and .cse6 .cse8))) (and (= v_result_15_41 (ite .cse0 (+ 1000 v_i_16_39) (ite .cse1 (+ v_i_16_39 (- 1000)) (ite .cse2 0 v_result_15_42)))) (or (and (or .cse0 v_break_17_68) v_break_17_51) (and .cse3 (or .cse4 v_break_17_68) (not v_break_17_51))) (< v_i_16_39 5) (or (and (or .cse5 .cse4) .cse6 .cse7) (and (or .cse2 v_break_17_52) v_break_17_67)) (= (+ v_i_16_39 1) v_i_16_38) .cse7 (or (and .cse3 (or .cse5 v_break_17_67) .cse6) (and (or .cse1 v_break_17_67) v_break_17_68))))) InVars {break_17=v_break_17_52, ends_with_10=v_ends_with_10_21, i_16=v_i_16_39, result_15=v_result_15_42, ends_with_2=v_ends_with_2_27} OutVars{break_17=v_break_17_51, ends_with_10=v_ends_with_10_21, i_16=v_i_16_38, result_15=v_result_15_41, ends_with_2=v_ends_with_2_27} AuxVars[v_break_17_67, v_break_17_68] AssignedVars[i_16, result_15, break_17]" [2025-04-26 16:54:54,213 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:54,213 INFO L85 PathProgramCache]: Analyzing trace with hash 5741315, now seen corresponding path program 1 times [2025-04-26 16:54:54,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:54,213 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740768207] [2025-04-26 16:54:54,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:54,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:54,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:54:54,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:54:54,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:54,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:54,220 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:54,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:54:54,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:54:54,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:54,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:54,228 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:54,228 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:54,228 INFO L85 PathProgramCache]: Analyzing trace with hash 180, now seen corresponding path program 1 times [2025-04-26 16:54:54,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:54,229 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934377542] [2025-04-26 16:54:54,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:54,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:54,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:54:54,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:54:54,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:54,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:54,242 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:54,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:54:54,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:54:54,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:54,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:54,250 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:54,251 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:54,251 INFO L85 PathProgramCache]: Analyzing trace with hash 177980914, now seen corresponding path program 1 times [2025-04-26 16:54:54,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:54,251 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053626908] [2025-04-26 16:54:54,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:54,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:54,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:54:54,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:54:54,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:54,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:54,257 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:54,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:54:54,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:54:54,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:54,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:54,263 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:54,572 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:54:54,573 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:54:54,573 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:54:54,573 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:54:54,573 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:54:54,573 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:54,573 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:54:54,573 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:54:54,573 INFO L132 ssoRankerPreferences]: Filename of dumped script: nzb-file-subst.wvr.bpl_petrified1_Iteration2_Lasso [2025-04-26 16:54:54,573 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:54:54,573 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:54:54,575 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:54,578 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:54,696 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:54,698 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:54,700 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:54,702 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:54,704 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:54,706 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:54,708 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:54,785 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2025-04-26 16:54:54,974 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:54:54,974 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:54:54,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:54,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:54,976 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:54,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 16:54:54,979 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 [2025-04-26 16:54:54,988 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:54,988 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:54,988 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:54,988 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:54,990 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:54,990 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:54,992 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:54,997 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:54,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:54,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:54,999 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:55,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-04-26 16:54:55,002 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 [2025-04-26 16:54:55,012 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:55,013 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:55,013 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2025-04-26 16:54:55,013 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:55,038 INFO L402 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications. [2025-04-26 16:54:55,038 INFO L403 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2025-04-26 16:54:55,096 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:54:55,143 INFO L436 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2025-04-26 16:54:55,143 INFO L437 ModelExtractionUtils]: 42 out of 55 variables were initially zero. Simplification set additionally 10 variables to zero. [2025-04-26 16:54:55,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:55,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:55,145 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:55,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-04-26 16:54:55,147 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:54:55,165 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-04-26 16:54:55,165 INFO L439 nArgumentSynthesizer]: Removed 8 redundant supporting invariants from a total of 8. [2025-04-26 16:54:55,165 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:54:55,165 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i_16) = -2*i_16 + 9 Supporting invariants [] [2025-04-26 16:54:55,173 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-04-26 16:54:55,173 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:54:55,183 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:55,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:54:55,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:54:55,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:55,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:55,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:54:55,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:55,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:54:55,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:54:55,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:55,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:55,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:54:55,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:55,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:54:55,201 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-04-26 16:54:55,201 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 49 states and 100 transitions. cyclomatic complexity: 70 Second operand has 2 states, 2 states have (on average 2.5) internal successors, (in total 5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:55,263 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 49 states and 100 transitions. cyclomatic complexity: 70. Second operand has 2 states, 2 states have (on average 2.5) internal successors, (in total 5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 129 states and 253 transitions. Complement of second has 4 states. [2025-04-26 16:54:55,263 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:54:55,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.5) internal successors, (in total 5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:55,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2025-04-26 16:54:55,264 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 35 transitions. Stem has 4 letters. Loop has 1 letters. [2025-04-26 16:54:55,264 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:55,264 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 35 transitions. Stem has 5 letters. Loop has 1 letters. [2025-04-26 16:54:55,264 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:55,264 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 35 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 16:54:55,264 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:55,264 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 129 states and 253 transitions. [2025-04-26 16:54:55,268 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 13 [2025-04-26 16:54:55,268 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 129 states to 67 states and 127 transitions. [2025-04-26 16:54:55,269 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2025-04-26 16:54:55,269 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2025-04-26 16:54:55,269 INFO L74 IsDeterministic]: Start isDeterministic. Operand 67 states and 127 transitions. [2025-04-26 16:54:55,269 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:54:55,269 INFO L218 hiAutomatonCegarLoop]: Abstraction has 67 states and 127 transitions. [2025-04-26 16:54:55,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states and 127 transitions. [2025-04-26 16:54:55,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 44. [2025-04-26 16:54:55,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 2.0454545454545454) internal successors, (in total 90), 43 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:55,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 90 transitions. [2025-04-26 16:54:55,274 INFO L240 hiAutomatonCegarLoop]: Abstraction has 44 states and 90 transitions. [2025-04-26 16:54:55,274 INFO L438 stractBuchiCegarLoop]: Abstraction has 44 states and 90 transitions. [2025-04-26 16:54:55,274 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:54:55,274 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 90 transitions. [2025-04-26 16:54:55,274 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 8 [2025-04-26 16:54:55,275 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:55,275 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:55,275 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-04-26 16:54:55,275 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:54:55,275 INFO L752 eck$LassoCheckResult]: Stem: "[157] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[141] $Ultimate##0-->L41: Formula: (and (not v_is_null_1_9) (not v_break_14_61) (= v_i_13_44 0) (not v_is_null_5_9)) InVars {is_null_1=v_is_null_1_9, is_null_5=v_is_null_5_9} OutVars{i_13=v_i_13_44, is_null_5=v_is_null_5_9, break_14=v_break_14_61, is_null_1=v_is_null_1_9} AuxVars[] AssignedVars[i_13, break_14]" "[160] L136-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[145] $Ultimate##0-->L92: Formula: (and (or v_is_null_1_11 v_is_null_9_7) (= (ite (and (not v_is_null_1_11) v_is_null_9_7) (- 995) (ite (and v_is_null_1_11 (not v_is_null_9_7)) 1005 (+ v_get_subject_3_5 (* (- 1) v_get_subject_11_3)))) v_result_15_11)) InVars {get_subject_3=v_get_subject_3_5, is_null_1=v_is_null_1_11, get_subject_11=v_get_subject_11_3, is_null_9=v_is_null_9_7} OutVars{get_subject_3=v_get_subject_3_5, result_15=v_result_15_11, is_null_1=v_is_null_1_11, get_subject_11=v_get_subject_11_3, is_null_9=v_is_null_9_7} AuxVars[] AssignedVars[result_15]" "[163] L137-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[151] $Ultimate##0-->L109: Formula: (and (not v_is_null_5_13) (= v_i_19_44 0) (not v_break_20_61) (not v_is_null_9_13)) InVars {is_null_5=v_is_null_5_13, is_null_9=v_is_null_9_13} OutVars{break_20=v_break_20_61, i_19=v_i_19_44, is_null_5=v_is_null_5_13, is_null_9=v_is_null_9_13} AuxVars[] AssignedVars[break_20, i_19]" [2025-04-26 16:54:55,275 INFO L754 eck$LassoCheckResult]: Loop: "[154] L109-->L109: Formula: (let ((.cse3 (not v_break_20_67)) (.cse7 (not v_break_20_68)) (.cse9 (select v_ends_with_10_35 v_i_19_39)) (.cse8 (select v_ends_with_6_31 v_i_19_39))) (let ((.cse4 (and .cse9 .cse8)) (.cse5 (and .cse9 .cse7)) (.cse1 (not .cse9)) (.cse2 (not v_break_20_52)) (.cse6 (and .cse8 .cse3)) (.cse0 (not .cse8))) (and (< v_i_19_39 5) (or (and (or .cse0 .cse1) .cse2 .cse3) (and (or v_break_20_52 .cse4) v_break_20_67)) (= v_result_18_41 (ite .cse5 (+ 1000 v_i_19_39) (ite .cse6 (+ v_i_19_39 (- 1000)) (ite .cse4 0 v_result_18_42)))) (or (and (or .cse5 v_break_20_68) v_break_20_51) (and (or v_break_20_68 .cse1) (not v_break_20_51) .cse7)) (= (+ v_i_19_39 1) v_i_19_38) .cse2 (or (and (or .cse6 v_break_20_67) v_break_20_68) (and (or .cse0 v_break_20_67) .cse7 .cse3))))) InVars {i_19=v_i_19_39, break_20=v_break_20_52, ends_with_10=v_ends_with_10_35, ends_with_6=v_ends_with_6_31, result_18=v_result_18_42} OutVars{i_19=v_i_19_38, break_20=v_break_20_51, ends_with_10=v_ends_with_10_35, ends_with_6=v_ends_with_6_31, result_18=v_result_18_41} AuxVars[v_break_20_68, v_break_20_67] AssignedVars[i_19, break_20, result_18]" [2025-04-26 16:54:55,276 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:55,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1222440662, now seen corresponding path program 1 times [2025-04-26 16:54:55,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:55,276 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494497768] [2025-04-26 16:54:55,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:55,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:55,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:54:55,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:54:55,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:55,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:55,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:54:55,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:54:55,315 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494497768] [2025-04-26 16:54:55,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494497768] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:54:55,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:54:55,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 16:54:55,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786761054] [2025-04-26 16:54:55,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:54:55,319 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:54:55,319 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:55,319 INFO L85 PathProgramCache]: Analyzing trace with hash 185, now seen corresponding path program 1 times [2025-04-26 16:54:55,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:55,319 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806040371] [2025-04-26 16:54:55,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:55,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:55,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:54:55,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:54:55,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:55,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:55,325 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:55,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:54:55,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:54:55,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:55,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:55,334 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:55,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:54:55,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 16:54:55,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-26 16:54:55,574 INFO L87 Difference]: Start difference. First operand 44 states and 90 transitions. cyclomatic complexity: 61 Second operand has 4 states, 3 states have (on average 2.0) internal successors, (in total 6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:55,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:54:55,614 INFO L93 Difference]: Finished difference Result 66 states and 122 transitions. [2025-04-26 16:54:55,614 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 122 transitions. [2025-04-26 16:54:55,615 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 11 [2025-04-26 16:54:55,615 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 53 states and 99 transitions. [2025-04-26 16:54:55,615 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2025-04-26 16:54:55,615 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2025-04-26 16:54:55,616 INFO L74 IsDeterministic]: Start isDeterministic. Operand 53 states and 99 transitions. [2025-04-26 16:54:55,616 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:54:55,616 INFO L218 hiAutomatonCegarLoop]: Abstraction has 53 states and 99 transitions. [2025-04-26 16:54:55,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 99 transitions. [2025-04-26 16:54:55,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 47. [2025-04-26 16:54:55,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 1.9361702127659575) internal successors, (in total 91), 46 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:55,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 91 transitions. [2025-04-26 16:54:55,619 INFO L240 hiAutomatonCegarLoop]: Abstraction has 47 states and 91 transitions. [2025-04-26 16:54:55,621 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 16:54:55,621 INFO L438 stractBuchiCegarLoop]: Abstraction has 47 states and 91 transitions. [2025-04-26 16:54:55,621 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:54:55,621 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 91 transitions. [2025-04-26 16:54:55,622 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 8 [2025-04-26 16:54:55,623 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:55,623 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:55,623 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-04-26 16:54:55,623 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:54:55,623 INFO L752 eck$LassoCheckResult]: Stem: "[157] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[141] $Ultimate##0-->L41: Formula: (and (not v_is_null_1_9) (not v_break_14_61) (= v_i_13_44 0) (not v_is_null_5_9)) InVars {is_null_1=v_is_null_1_9, is_null_5=v_is_null_5_9} OutVars{i_13=v_i_13_44, is_null_5=v_is_null_5_9, break_14=v_break_14_61, is_null_1=v_is_null_1_9} AuxVars[] AssignedVars[i_13, break_14]" "[160] L136-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[146] $Ultimate##0-->L75: Formula: (and (= v_i_16_44 0) (not v_is_null_1_13) (not v_break_17_61) (not v_is_null_9_9)) InVars {is_null_1=v_is_null_1_13, is_null_9=v_is_null_9_9} OutVars{break_17=v_break_17_61, i_16=v_i_16_44, is_null_1=v_is_null_1_13, is_null_9=v_is_null_9_9} AuxVars[] AssignedVars[i_16, break_17]" "[163] L137-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[151] $Ultimate##0-->L109: Formula: (and (not v_is_null_5_13) (= v_i_19_44 0) (not v_break_20_61) (not v_is_null_9_13)) InVars {is_null_5=v_is_null_5_13, is_null_9=v_is_null_9_13} OutVars{break_20=v_break_20_61, i_19=v_i_19_44, is_null_5=v_is_null_5_13, is_null_9=v_is_null_9_13} AuxVars[] AssignedVars[break_20, i_19]" [2025-04-26 16:54:55,623 INFO L754 eck$LassoCheckResult]: Loop: "[154] L109-->L109: Formula: (let ((.cse3 (not v_break_20_67)) (.cse7 (not v_break_20_68)) (.cse9 (select v_ends_with_10_35 v_i_19_39)) (.cse8 (select v_ends_with_6_31 v_i_19_39))) (let ((.cse4 (and .cse9 .cse8)) (.cse5 (and .cse9 .cse7)) (.cse1 (not .cse9)) (.cse2 (not v_break_20_52)) (.cse6 (and .cse8 .cse3)) (.cse0 (not .cse8))) (and (< v_i_19_39 5) (or (and (or .cse0 .cse1) .cse2 .cse3) (and (or v_break_20_52 .cse4) v_break_20_67)) (= v_result_18_41 (ite .cse5 (+ 1000 v_i_19_39) (ite .cse6 (+ v_i_19_39 (- 1000)) (ite .cse4 0 v_result_18_42)))) (or (and (or .cse5 v_break_20_68) v_break_20_51) (and (or v_break_20_68 .cse1) (not v_break_20_51) .cse7)) (= (+ v_i_19_39 1) v_i_19_38) .cse2 (or (and (or .cse6 v_break_20_67) v_break_20_68) (and (or .cse0 v_break_20_67) .cse7 .cse3))))) InVars {i_19=v_i_19_39, break_20=v_break_20_52, ends_with_10=v_ends_with_10_35, ends_with_6=v_ends_with_6_31, result_18=v_result_18_42} OutVars{i_19=v_i_19_38, break_20=v_break_20_51, ends_with_10=v_ends_with_10_35, ends_with_6=v_ends_with_6_31, result_18=v_result_18_41} AuxVars[v_break_20_68, v_break_20_67] AssignedVars[i_19, break_20, result_18]" [2025-04-26 16:54:55,624 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:55,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1222441623, now seen corresponding path program 1 times [2025-04-26 16:54:55,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:55,624 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320797145] [2025-04-26 16:54:55,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:55,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:55,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:54:55,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:54:55,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:55,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:55,630 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:55,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:54:55,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:54:55,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:55,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:55,635 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:55,636 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:55,636 INFO L85 PathProgramCache]: Analyzing trace with hash 185, now seen corresponding path program 2 times [2025-04-26 16:54:55,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:55,636 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227226955] [2025-04-26 16:54:55,636 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:54:55,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:55,642 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:54:55,644 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:54:55,644 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:54:55,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:55,645 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:55,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:54:55,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:54:55,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:55,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:55,650 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:55,650 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:55,650 INFO L85 PathProgramCache]: Analyzing trace with hash -759015197, now seen corresponding path program 1 times [2025-04-26 16:54:55,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:55,650 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962115272] [2025-04-26 16:54:55,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:55,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:55,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:54:55,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:54:55,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:55,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:55,660 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:55,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:54:55,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:54:55,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:55,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:55,666 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:55,982 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:54:55,982 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:54:55,982 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:54:55,982 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:54:55,982 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:54:55,982 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:55,982 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:54:55,982 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:54:55,982 INFO L132 ssoRankerPreferences]: Filename of dumped script: nzb-file-subst.wvr.bpl_petrified1_Iteration4_Lasso [2025-04-26 16:54:55,982 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:54:55,982 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:54:55,984 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:55,989 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:55,991 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:55,993 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:55,995 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:55,997 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:55,999 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:56,001 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:56,003 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:56,004 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:56,006 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:56,008 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:56,141 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:56,145 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:56,223 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2025-04-26 16:54:56,375 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:54:56,375 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:54:56,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:56,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:56,377 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:56,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-04-26 16:54:56,380 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 [2025-04-26 16:54:56,390 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:56,390 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:56,391 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:56,391 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:56,391 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:56,391 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:56,396 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:56,402 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-04-26 16:54:56,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:56,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:56,404 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:56,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 16:54:56,406 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 [2025-04-26 16:54:56,416 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:56,416 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:56,416 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:56,416 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:56,417 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:56,417 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:56,419 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:56,424 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-04-26 16:54:56,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:56,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:56,427 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:56,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-04-26 16:54:56,428 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 [2025-04-26 16:54:56,439 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:56,439 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:56,439 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:56,439 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:56,441 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:56,441 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:56,445 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:56,451 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-04-26 16:54:56,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:56,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:56,453 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:56,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-04-26 16:54:56,456 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 [2025-04-26 16:54:56,467 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:56,467 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:56,467 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:56,467 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:56,468 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:56,468 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:56,471 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:56,476 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-04-26 16:54:56,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:56,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:56,479 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:56,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-04-26 16:54:56,481 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 [2025-04-26 16:54:56,493 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:56,493 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:56,493 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:56,493 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:56,494 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:56,494 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:56,496 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:56,501 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-04-26 16:54:56,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:56,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:56,503 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:56,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-04-26 16:54:56,505 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 [2025-04-26 16:54:56,514 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:56,514 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:56,514 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:56,514 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:56,515 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:56,515 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:56,519 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:56,524 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-04-26 16:54:56,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:56,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:56,526 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:56,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-04-26 16:54:56,528 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 [2025-04-26 16:54:56,541 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:56,542 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:56,542 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:56,542 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:56,543 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:56,543 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:56,556 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:56,562 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-04-26 16:54:56,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:56,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:56,564 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:56,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-04-26 16:54:56,566 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 [2025-04-26 16:54:56,576 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:56,576 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:56,577 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:56,577 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:56,578 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:56,578 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:56,580 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:56,586 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-04-26 16:54:56,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:56,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:56,588 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:56,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-04-26 16:54:56,589 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 [2025-04-26 16:54:56,598 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:56,599 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:56,599 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:56,599 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:56,599 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:56,600 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:56,602 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:56,608 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-04-26 16:54:56,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:56,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:56,610 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:56,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-04-26 16:54:56,612 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 [2025-04-26 16:54:56,621 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:56,621 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:56,621 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:56,621 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:56,624 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:56,624 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:56,626 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:56,632 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:56,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:56,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:56,634 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:56,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-04-26 16:54:56,636 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 [2025-04-26 16:54:56,647 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:56,647 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:56,647 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:56,647 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:56,648 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:56,648 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:56,650 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:56,659 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-04-26 16:54:56,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:56,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:56,661 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:56,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-04-26 16:54:56,663 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 [2025-04-26 16:54:56,672 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:56,672 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:56,672 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2025-04-26 16:54:56,673 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:56,697 INFO L402 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications. [2025-04-26 16:54:56,697 INFO L403 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2025-04-26 16:54:56,762 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:54:56,807 INFO L436 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-04-26 16:54:56,807 INFO L437 ModelExtractionUtils]: 43 out of 55 variables were initially zero. Simplification set additionally 9 variables to zero. [2025-04-26 16:54:56,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:56,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:56,812 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:56,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-04-26 16:54:56,814 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:54:56,834 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-04-26 16:54:56,834 INFO L439 nArgumentSynthesizer]: Removed 8 redundant supporting invariants from a total of 8. [2025-04-26 16:54:56,835 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:54:56,835 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i_19) = -2*i_19 + 9 Supporting invariants [] [2025-04-26 16:54:56,844 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-04-26 16:54:56,844 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:54:56,855 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:56,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:54:56,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:54:56,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:56,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:56,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:54:56,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:56,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:54:56,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:54:56,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:56,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:56,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:54:56,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:56,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:54:56,878 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-04-26 16:54:56,878 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 47 states and 91 transitions. cyclomatic complexity: 59 Second operand has 2 states, 2 states have (on average 3.5) internal successors, (in total 7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:56,901 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 47 states and 91 transitions. cyclomatic complexity: 59. Second operand has 2 states, 2 states have (on average 3.5) internal successors, (in total 7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 59 states and 108 transitions. Complement of second has 4 states. [2025-04-26 16:54:56,902 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:54:56,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (in total 7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:56,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 19 transitions. [2025-04-26 16:54:56,903 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 6 letters. Loop has 1 letters. [2025-04-26 16:54:56,903 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:56,903 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 7 letters. Loop has 1 letters. [2025-04-26 16:54:56,903 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:56,903 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 6 letters. Loop has 2 letters. [2025-04-26 16:54:56,903 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:56,903 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 108 transitions. [2025-04-26 16:54:56,904 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:54:56,904 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 0 states and 0 transitions. [2025-04-26 16:54:56,904 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:54:56,904 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:54:56,904 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:54:56,904 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:54:56,904 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:54:56,904 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:54:56,904 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:54:56,904 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:54:56,904 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:54:56,905 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:54:56,905 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:54:56,916 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-26 16:54:56,917 INFO L201 PluginConnector]: Adding new model nzb-file-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:54:56 BoogieIcfgContainer [2025-04-26 16:54:56,917 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:54:56,918 INFO L158 Benchmark]: Toolchain (without parser) took 5187.32ms. Allocated memory was 155.2MB in the beginning and 218.1MB in the end (delta: 62.9MB). Free memory was 81.8MB in the beginning and 152.7MB in the end (delta: -70.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:54:56,919 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.58ms. Allocated memory is still 155.2MB. Free memory is still 82.9MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:54:56,919 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.05ms. Allocated memory is still 155.2MB. Free memory was 81.6MB in the beginning and 79.8MB in the end (delta: 1.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:54:56,919 INFO L158 Benchmark]: Boogie Preprocessor took 22.99ms. Allocated memory is still 155.2MB. Free memory was 79.8MB in the beginning and 78.6MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:54:56,919 INFO L158 Benchmark]: RCFGBuilder took 345.88ms. Allocated memory is still 155.2MB. Free memory was 78.6MB in the beginning and 60.3MB in the end (delta: 18.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 16:54:56,919 INFO L158 Benchmark]: BuchiAutomizer took 4766.41ms. Allocated memory was 155.2MB in the beginning and 218.1MB in the end (delta: 62.9MB). Free memory was 60.1MB in the beginning and 152.7MB in the end (delta: -92.5MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:54:56,922 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.58ms. Allocated memory is still 155.2MB. Free memory is still 82.9MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 45.05ms. Allocated memory is still 155.2MB. Free memory was 81.6MB in the beginning and 79.8MB in the end (delta: 1.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.99ms. Allocated memory is still 155.2MB. Free memory was 79.8MB in the beginning and 78.6MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 345.88ms. Allocated memory is still 155.2MB. Free memory was 78.6MB in the beginning and 60.3MB in the end (delta: 18.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 4766.41ms. Allocated memory was 155.2MB in the beginning and 218.1MB in the end (delta: 62.9MB). Free memory was 60.1MB in the beginning and 152.7MB in the end (delta: -92.5MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.6s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 4.0s. Construction of modules took 0.1s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 57 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 103 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 100 mSDsluCounter, 35 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 139 IncrementalHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 21 mSDtfsCounter, 139 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital98 mio100 ax100 hnf100 lsp484 ukn13 mio100 lsp100 div100 bol135 ite100 ukn100 eq140 hnf98 smp100 dnf617 smp22 tf100 neg100 sie113 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 219ms VariablesStem: 2 VariablesLoop: 8 DisjunctsStem: 1 DisjunctsLoop: 4 SupportingInvariants: 8 MotzkinApplications: 48 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.1s InitialAbstraction: Time to compute Ample Reduction [ms]: 171, Number of transitions in reduction automaton: 95, Number of states in reduction automaton: 55, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (1 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i_13 + 9 and consists of 4 locations. One deterministic module has affine ranking function 9 + -2 * i_16 and consists of 3 locations. One deterministic module has affine ranking function -2 * i_19 + 9 and consists of 3 locations. 1 modules have a trivial ranking function, the largest among these consists of 4 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 16:54:56,934 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...