Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r027-smll-174853774300070.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool gold2024
Input is BugTracking-PT-q8m004, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r027-smll-174853774300070
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 8.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 7 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 16M May 29 14:32 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-00
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-01
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-02
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-03
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-04
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-05
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-06
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-07
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-08
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-09
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-10
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-11
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-12
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-13
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-14
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748551681973

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q8m004
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-29 20:48:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-29 20:48:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 20:48:06] [INFO ] Load time of PNML (sax parser for PT used): 1527 ms
[2025-05-29 20:48:06] [INFO ] Transformed 754 places.
[2025-05-29 20:48:06] [INFO ] Transformed 27370 transitions.
[2025-05-29 20:48:06] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1887 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 15 ms.
Deduced a syphon composed of 474 places in 253 ms
Reduce places removed 474 places and 23466 transitions.
FORMULA BugTracking-PT-q8m004-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
[2025-05-29 20:48:06] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
// Phase 1: matrix 3729 rows 280 cols
[2025-05-29 20:48:06] [INFO ] Computed 10 invariants in 83 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, +inf, 1, 1, 1, 1]
RANDOM walk for 10001 steps (100 resets) in 227 ms. (43 steps per ms)
BEST_FIRST walk for 60004 steps (164 resets) in 452 ms. (132 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, +inf, 1, 1, 1, 1]
[2025-05-29 20:48:07] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
[2025-05-29 20:48:07] [INFO ] Invariant cache hit.
[2025-05-29 20:48:07] [INFO ] [Real]Absence check using 10 positive place invariants in 11 ms returned sat
[2025-05-29 20:48:09] [INFO ] [Real]Absence check using state equation in 1455 ms returned sat
[2025-05-29 20:48:09] [INFO ] State equation strengthened by 303 read => feed constraints.
[2025-05-29 20:48:09] [INFO ] [Real]Added 303 Read/Feed constraints in 276 ms returned sat
[2025-05-29 20:48:10] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:48:10] [INFO ] [Nat]Absence check using 10 positive place invariants in 11 ms returned sat
[2025-05-29 20:48:11] [INFO ] [Nat]Absence check using state equation in 1220 ms returned sat
[2025-05-29 20:48:11] [INFO ] [Nat]Added 303 Read/Feed constraints in 268 ms returned sat
[2025-05-29 20:48:13] [INFO ] Deduced a trap composed of 70 places in 1207 ms of which 51 ms to minimize.
[2025-05-29 20:48:14] [INFO ] Deduced a trap composed of 86 places in 905 ms of which 4 ms to minimize.
[2025-05-29 20:48:15] [INFO ] Deduced a trap composed of 44 places in 1006 ms of which 3 ms to minimize.
[2025-05-29 20:48:15] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-05-29 20:48:15] [INFO ] [Real]Absence check using 10 positive place invariants in 8 ms returned sat
[2025-05-29 20:48:16] [INFO ] [Real]Absence check using state equation in 1057 ms returned sat
[2025-05-29 20:48:16] [INFO ] [Real]Added 303 Read/Feed constraints in 132 ms returned sat
[2025-05-29 20:48:17] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:48:17] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-05-29 20:48:18] [INFO ] [Nat]Absence check using state equation in 1071 ms returned sat
[2025-05-29 20:48:18] [INFO ] [Nat]Added 303 Read/Feed constraints in 292 ms returned sat
[2025-05-29 20:48:19] [INFO ] Deduced a trap composed of 12 places in 681 ms of which 3 ms to minimize.
[2025-05-29 20:48:19] [INFO ] Deduced a trap composed of 20 places in 551 ms of which 4 ms to minimize.
[2025-05-29 20:48:20] [INFO ] Deduced a trap composed of 15 places in 657 ms of which 3 ms to minimize.
[2025-05-29 20:48:21] [INFO ] Deduced a trap composed of 29 places in 576 ms of which 2 ms to minimize.
[2025-05-29 20:48:21] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2976 ms
[2025-05-29 20:48:21] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 493 ms.
Maximisation of solution failed !
Minimization took 1 ms.
[2025-05-29 20:48:22] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2025-05-29 20:48:23] [INFO ] [Real]Absence check using state equation in 954 ms returned sat
[2025-05-29 20:48:23] [INFO ] [Real]Added 303 Read/Feed constraints in 105 ms returned sat
[2025-05-29 20:48:23] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:48:23] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2025-05-29 20:48:24] [INFO ] [Nat]Absence check using state equation in 869 ms returned sat
[2025-05-29 20:48:24] [INFO ] [Nat]Added 303 Read/Feed constraints in 93 ms returned sat
[2025-05-29 20:48:25] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 644 ms.
[2025-05-29 20:48:25] [INFO ] Added : 2 causal constraints over 1 iterations in 1063 ms. Result :sat
Minimization took 1293 ms.
[2025-05-29 20:48:26] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2025-05-29 20:48:27] [INFO ] [Real]Absence check using state equation in 852 ms returned sat
[2025-05-29 20:48:28] [INFO ] [Real]Added 303 Read/Feed constraints in 93 ms returned sat
[2025-05-29 20:48:28] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:48:28] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2025-05-29 20:48:29] [INFO ] [Nat]Absence check using state equation in 838 ms returned sat
[2025-05-29 20:48:29] [INFO ] [Nat]Added 303 Read/Feed constraints in 170 ms returned sat
[2025-05-29 20:48:29] [INFO ] Deduced a trap composed of 15 places in 648 ms of which 3 ms to minimize.
[2025-05-29 20:48:30] [INFO ] Deduced a trap composed of 21 places in 663 ms of which 4 ms to minimize.
[2025-05-29 20:48:31] [INFO ] Deduced a trap composed of 19 places in 533 ms of which 3 ms to minimize.
[2025-05-29 20:48:31] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2262 ms
[2025-05-29 20:48:31] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 324 ms.
[2025-05-29 20:48:32] [INFO ] Added : 5 causal constraints over 1 iterations in 724 ms. Result :sat
Minimization took 938 ms.
[2025-05-29 20:48:33] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2025-05-29 20:48:34] [INFO ] [Real]Absence check using state equation in 882 ms returned sat
[2025-05-29 20:48:34] [INFO ] [Real]Added 303 Read/Feed constraints in 118 ms returned sat
[2025-05-29 20:48:34] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:48:34] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2025-05-29 20:48:35] [INFO ] [Nat]Absence check using state equation in 864 ms returned sat
[2025-05-29 20:48:35] [INFO ] [Nat]Added 303 Read/Feed constraints in 327 ms returned sat
[2025-05-29 20:48:36] [INFO ] Deduced a trap composed of 52 places in 868 ms of which 3 ms to minimize.
[2025-05-29 20:48:37] [INFO ] Deduced a trap composed of 42 places in 1037 ms of which 4 ms to minimize.
[2025-05-29 20:48:38] [INFO ] Deduced a trap composed of 14 places in 1111 ms of which 4 ms to minimize.
[2025-05-29 20:48:40] [INFO ] Deduced a trap composed of 61 places in 1060 ms of which 5 ms to minimize.
[2025-05-29 20:48:40] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-05-29 20:48:40] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2025-05-29 20:48:41] [INFO ] [Real]Absence check using state equation in 1003 ms returned sat
[2025-05-29 20:48:41] [INFO ] [Real]Added 303 Read/Feed constraints in 164 ms returned sat
[2025-05-29 20:48:41] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:48:41] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2025-05-29 20:48:42] [INFO ] [Nat]Absence check using state equation in 1000 ms returned sat
[2025-05-29 20:48:42] [INFO ] [Nat]Added 303 Read/Feed constraints in 357 ms returned sat
[2025-05-29 20:48:43] [INFO ] Deduced a trap composed of 14 places in 415 ms of which 1 ms to minimize.
[2025-05-29 20:48:43] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 0 ms to minimize.
[2025-05-29 20:48:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 750 ms
[2025-05-29 20:48:44] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 377 ms.
[2025-05-29 20:48:46] [INFO ] Deduced a trap composed of 57 places in 1018 ms of which 3 ms to minimize.
[2025-05-29 20:48:47] [INFO ] Deduced a trap composed of 44 places in 837 ms of which 3 ms to minimize.
[2025-05-29 20:48:47] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 5
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1128)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, +inf, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, +inf, 1, 1, 1, 1]
Support contains 6 out of 280 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 3904/3904 transitions.
Graph (complete) has 4653 edges and 280 vertex of which 278 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.28 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 277 transition count 3871
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 277 transition count 3871
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 7 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 275 transition count 3877
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 275 transition count 3871
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 19 place count 269 transition count 3871
Applied a total of 19 rules in 643 ms. Remains 269 /280 variables (removed 11) and now considering 3871/3904 (removed 33) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 665 ms. Remains : 269/280 places, 3871/3904 transitions.
[2025-05-29 20:48:47] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
Found an invariant !
This invariant on transitions {2=1, 44=1, 3014=1, 3635=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {2=1, 3014=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 3 resets, run finished after 325 ms. (steps per millisecond=30 ) properties (out of 6) seen :[0, 0, 0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, +inf, 1, 1, 1, 1]
[2025-05-29 20:48:49] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2025-05-29 20:48:49] [INFO ] Computed 8 invariants in 31 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, +inf, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (2 resets) in 7547 ms. (132 steps per ms)
BEST_FIRST walk for 6000005 steps (15 resets) in 15317 ms. (391 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, +inf, 1, 1, 1, 1]
[2025-05-29 20:49:12] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2025-05-29 20:49:12] [INFO ] Invariant cache hit.
[2025-05-29 20:49:12] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2025-05-29 20:49:13] [INFO ] [Real]Absence check using state equation in 833 ms returned sat
[2025-05-29 20:49:13] [INFO ] State equation strengthened by 283 read => feed constraints.
[2025-05-29 20:49:13] [INFO ] [Real]Added 283 Read/Feed constraints in 77 ms returned sat
[2025-05-29 20:49:14] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:49:14] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-05-29 20:49:14] [INFO ] [Nat]Absence check using state equation in 804 ms returned sat
[2025-05-29 20:49:15] [INFO ] [Nat]Added 283 Read/Feed constraints in 309 ms returned sat
[2025-05-29 20:49:15] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 319 ms.
[2025-05-29 20:49:16] [INFO ] Added : 4 causal constraints over 1 iterations in 721 ms. Result :sat
Minimization took 4376 ms.
[2025-05-29 20:49:20] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-05-29 20:49:21] [INFO ] [Real]Absence check using state equation in 881 ms returned sat
[2025-05-29 20:49:21] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:49:21] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2025-05-29 20:49:22] [INFO ] [Nat]Absence check using state equation in 1091 ms returned sat
[2025-05-29 20:49:23] [INFO ] [Nat]Added 283 Read/Feed constraints in 326 ms returned sat
[2025-05-29 20:49:24] [INFO ] Deduced a trap composed of 9 places in 1165 ms of which 4 ms to minimize.
[2025-05-29 20:49:25] [INFO ] Deduced a trap composed of 30 places in 776 ms of which 3 ms to minimize.
[2025-05-29 20:49:26] [INFO ] Deduced a trap composed of 55 places in 607 ms of which 2 ms to minimize.
[2025-05-29 20:49:26] [INFO ] Deduced a trap composed of 48 places in 353 ms of which 2 ms to minimize.
[2025-05-29 20:49:26] [INFO ] Deduced a trap composed of 16 places in 380 ms of which 1 ms to minimize.
[2025-05-29 20:49:27] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3937 ms
[2025-05-29 20:49:27] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 323 ms.
[2025-05-29 20:49:28] [INFO ] Deduced a trap composed of 10 places in 411 ms of which 2 ms to minimize.
[2025-05-29 20:49:28] [INFO ] Deduced a trap composed of 55 places in 404 ms of which 2 ms to minimize.
[2025-05-29 20:49:29] [INFO ] Deduced a trap composed of 23 places in 250 ms of which 2 ms to minimize.
[2025-05-29 20:49:29] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1620 ms
[2025-05-29 20:49:29] [INFO ] Added : 8 causal constraints over 2 iterations in 2604 ms. Result :sat
Minimization took 4268 ms.
[2025-05-29 20:49:34] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-05-29 20:49:35] [INFO ] [Real]Absence check using state equation in 939 ms returned sat
[2025-05-29 20:49:35] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:49:35] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-05-29 20:49:36] [INFO ] [Nat]Absence check using state equation in 1018 ms returned sat
[2025-05-29 20:49:36] [INFO ] [Nat]Added 283 Read/Feed constraints in 161 ms returned sat
[2025-05-29 20:49:36] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 327 ms.
[2025-05-29 20:49:37] [INFO ] Added : 2 causal constraints over 1 iterations in 697 ms. Result :sat
Minimization took 4193 ms.
[2025-05-29 20:49:41] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-05-29 20:49:42] [INFO ] [Real]Absence check using state equation in 829 ms returned sat
[2025-05-29 20:49:42] [INFO ] [Real]Added 283 Read/Feed constraints in 65 ms returned sat
[2025-05-29 20:49:42] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:49:42] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-05-29 20:49:43] [INFO ] [Nat]Absence check using state equation in 1006 ms returned sat
[2025-05-29 20:49:43] [INFO ] [Nat]Added 283 Read/Feed constraints in 227 ms returned sat
[2025-05-29 20:49:44] [INFO ] Deduced a trap composed of 17 places in 565 ms of which 3 ms to minimize.
[2025-05-29 20:49:45] [INFO ] Deduced a trap composed of 56 places in 551 ms of which 2 ms to minimize.
[2025-05-29 20:49:45] [INFO ] Deduced a trap composed of 45 places in 529 ms of which 2 ms to minimize.
[2025-05-29 20:49:46] [INFO ] Deduced a trap composed of 62 places in 571 ms of which 3 ms to minimize.
[2025-05-29 20:49:47] [INFO ] Deduced a trap composed of 61 places in 564 ms of which 3 ms to minimize.
[2025-05-29 20:49:47] [INFO ] Deduced a trap composed of 32 places in 656 ms of which 3 ms to minimize.
[2025-05-29 20:49:48] [INFO ] Deduced a trap composed of 31 places in 578 ms of which 3 ms to minimize.
[2025-05-29 20:49:49] [INFO ] Deduced a trap composed of 61 places in 579 ms of which 3 ms to minimize.
[2025-05-29 20:49:50] [INFO ] Deduced a trap composed of 17 places in 558 ms of which 3 ms to minimize.
[2025-05-29 20:49:51] [INFO ] Deduced a trap composed of 86 places in 774 ms of which 3 ms to minimize.
[2025-05-29 20:49:52] [INFO ] Deduced a trap composed of 59 places in 733 ms of which 3 ms to minimize.
[2025-05-29 20:49:53] [INFO ] Deduced a trap composed of 57 places in 812 ms of which 4 ms to minimize.
[2025-05-29 20:49:54] [INFO ] Deduced a trap composed of 61 places in 717 ms of which 4 ms to minimize.
[2025-05-29 20:49:55] [INFO ] Deduced a trap composed of 62 places in 788 ms of which 3 ms to minimize.
[2025-05-29 20:49:55] [INFO ] Deduced a trap composed of 44 places in 694 ms of which 3 ms to minimize.
[2025-05-29 20:49:56] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 12098 ms
[2025-05-29 20:49:56] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 329 ms.
[2025-05-29 20:49:56] [INFO ] Added : 6 causal constraints over 2 iterations in 938 ms. Result :sat
Minimization took 4512 ms.
[2025-05-29 20:50:01] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-05-29 20:50:02] [INFO ] [Real]Absence check using state equation in 1146 ms returned sat
[2025-05-29 20:50:02] [INFO ] [Real]Added 283 Read/Feed constraints in 125 ms returned sat
[2025-05-29 20:50:03] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:50:03] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2025-05-29 20:50:04] [INFO ] [Nat]Absence check using state equation in 1018 ms returned sat
[2025-05-29 20:50:04] [INFO ] [Nat]Added 283 Read/Feed constraints in 383 ms returned sat
[2025-05-29 20:50:05] [INFO ] Deduced a trap composed of 32 places in 491 ms of which 1 ms to minimize.
[2025-05-29 20:50:06] [INFO ] Deduced a trap composed of 107 places in 1108 ms of which 4 ms to minimize.
[2025-05-29 20:50:07] [INFO ] Deduced a trap composed of 99 places in 1003 ms of which 4 ms to minimize.
[2025-05-29 20:50:08] [INFO ] Deduced a trap composed of 92 places in 903 ms of which 3 ms to minimize.
[2025-05-29 20:50:09] [INFO ] Deduced a trap composed of 57 places in 903 ms of which 3 ms to minimize.
[2025-05-29 20:50:10] [INFO ] Deduced a trap composed of 32 places in 334 ms of which 1 ms to minimize.
[2025-05-29 20:50:10] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 5773 ms
[2025-05-29 20:50:10] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 483 ms.
[2025-05-29 20:50:12] [INFO ] Deduced a trap composed of 96 places in 1071 ms of which 3 ms to minimize.
[2025-05-29 20:50:13] [INFO ] Deduced a trap composed of 40 places in 861 ms of which 3 ms to minimize.
[2025-05-29 20:50:14] [INFO ] Deduced a trap composed of 14 places in 1089 ms of which 4 ms to minimize.
[2025-05-29 20:50:15] [INFO ] Deduced a trap composed of 96 places in 812 ms of which 3 ms to minimize.
[2025-05-29 20:50:16] [INFO ] Deduced a trap composed of 26 places in 806 ms of which 3 ms to minimize.
[2025-05-29 20:50:17] [INFO ] Deduced a trap composed of 56 places in 944 ms of which 3 ms to minimize.
[2025-05-29 20:50:18] [INFO ] Deduced a trap composed of 56 places in 580 ms of which 2 ms to minimize.
[2025-05-29 20:50:19] [INFO ] Deduced a trap composed of 23 places in 488 ms of which 3 ms to minimize.
[2025-05-29 20:50:19] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 8509 ms
[2025-05-29 20:50:19] [INFO ] Added : 5 causal constraints over 1 iterations in 9594 ms. Result :sat
Minimization took 4443 ms.
[2025-05-29 20:50:24] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-05-29 20:50:25] [INFO ] [Real]Absence check using state equation in 977 ms returned sat
[2025-05-29 20:50:25] [INFO ] [Real]Added 283 Read/Feed constraints in 128 ms returned sat
[2025-05-29 20:50:25] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:50:25] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2025-05-29 20:50:27] [INFO ] [Nat]Absence check using state equation in 1099 ms returned sat
[2025-05-29 20:50:27] [INFO ] [Nat]Added 283 Read/Feed constraints in 244 ms returned sat
[2025-05-29 20:50:27] [INFO ] Deduced a trap composed of 10 places in 562 ms of which 3 ms to minimize.
[2025-05-29 20:50:28] [INFO ] Deduced a trap composed of 57 places in 612 ms of which 6 ms to minimize.
[2025-05-29 20:50:29] [INFO ] Deduced a trap composed of 55 places in 619 ms of which 3 ms to minimize.
[2025-05-29 20:50:29] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2230 ms
[2025-05-29 20:50:29] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 469 ms.
[2025-05-29 20:50:31] [INFO ] Added : 10 causal constraints over 3 iterations in 1685 ms. Result :sat
Minimization took 4213 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, +inf, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, +inf, 1, 1, 1, 1]
Support contains 6 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 149 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 150 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 101 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2025-05-29 20:50:36] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2025-05-29 20:50:36] [INFO ] Invariant cache hit.
[2025-05-29 20:50:37] [INFO ] Implicit Places using invariants in 835 ms returned []
[2025-05-29 20:50:37] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2025-05-29 20:50:37] [INFO ] Invariant cache hit.
[2025-05-29 20:50:38] [INFO ] State equation strengthened by 283 read => feed constraints.
[2025-05-29 20:50:41] [INFO ] Implicit Places using invariants and state equation in 4024 ms returned []
Implicit Place search using SMT with State Equation took 4877 ms to find 0 implicit places.
[2025-05-29 20:50:41] [INFO ] Redundant transitions in 531 ms returned []
Running 3870 sub problems to find dead transitions.
[2025-05-29 20:50:41] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2025-05-29 20:50:41] [INFO ] Invariant cache hit.
[2025-05-29 20:50:41] [INFO ] State equation strengthened by 283 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3870 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 269/3968 variables, and 8 constraints, problems are : Problem set: 0 solved, 3870 unsolved in 30266 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/269 constraints, ReadFeed: 0/283 constraints, PredecessorRefiner: 3870/2667 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3870 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3870 unsolved
[2025-05-29 20:52:30] [INFO ] Deduced a trap composed of 6 places in 176 ms of which 2 ms to minimize.
[2025-05-29 20:52:30] [INFO ] Deduced a trap composed of 10 places in 153 ms of which 1 ms to minimize.
Problem TDEAD1546 is UNSAT
Problem TDEAD1547 is UNSAT
Problem TDEAD1548 is UNSAT
Problem TDEAD1549 is UNSAT
Problem TDEAD1550 is UNSAT
Problem TDEAD1551 is UNSAT
Problem TDEAD1552 is UNSAT
Problem TDEAD1553 is UNSAT
Problem TDEAD1554 is UNSAT
Problem TDEAD1557 is UNSAT
Problem TDEAD1558 is UNSAT
Problem TDEAD1559 is UNSAT
Problem TDEAD1560 is UNSAT
Problem TDEAD1561 is UNSAT
Problem TDEAD1562 is UNSAT
Problem TDEAD1566 is UNSAT
Problem TDEAD1567 is UNSAT
Problem TDEAD1568 is UNSAT
Problem TDEAD1569 is UNSAT
Problem TDEAD1570 is UNSAT
Problem TDEAD1571 is UNSAT
Problem TDEAD1572 is UNSAT
Problem TDEAD1573 is UNSAT
Problem TDEAD1574 is UNSAT
Problem TDEAD1577 is UNSAT
Problem TDEAD1578 is UNSAT
Problem TDEAD1579 is UNSAT
Problem TDEAD1580 is UNSAT
Problem TDEAD1581 is UNSAT
Problem TDEAD1582 is UNSAT
Problem TDEAD1586 is UNSAT
Problem TDEAD1587 is UNSAT
Problem TDEAD1588 is UNSAT
Problem TDEAD1589 is UNSAT
Problem TDEAD1590 is UNSAT
Problem TDEAD1591 is UNSAT
Problem TDEAD1592 is UNSAT
Problem TDEAD1593 is UNSAT
Problem TDEAD1594 is UNSAT
Problem TDEAD1597 is UNSAT
Problem TDEAD1598 is UNSAT
Problem TDEAD1599 is UNSAT
Problem TDEAD1600 is UNSAT
Problem TDEAD1601 is UNSAT
Problem TDEAD1602 is UNSAT
Problem TDEAD1606 is UNSAT
Problem TDEAD1607 is UNSAT
Problem TDEAD1608 is UNSAT
Problem TDEAD1609 is UNSAT
Problem TDEAD1610 is UNSAT
Problem TDEAD1611 is UNSAT
Problem TDEAD1612 is UNSAT
Problem TDEAD1613 is UNSAT
Problem TDEAD1614 is UNSAT
Problem TDEAD1617 is UNSAT
Problem TDEAD1618 is UNSAT
Problem TDEAD1619 is UNSAT
Problem TDEAD1620 is UNSAT
Problem TDEAD1621 is UNSAT
Problem TDEAD1622 is UNSAT
Problem TDEAD1623 is UNSAT
Problem TDEAD1624 is UNSAT
Problem TDEAD1625 is UNSAT
Problem TDEAD1626 is UNSAT
Problem TDEAD1627 is UNSAT
Problem TDEAD1628 is UNSAT
Problem TDEAD1629 is UNSAT
Problem TDEAD1630 is UNSAT
Problem TDEAD1631 is UNSAT
Problem TDEAD1632 is UNSAT
Problem TDEAD1633 is UNSAT
Problem TDEAD1634 is UNSAT
Problem TDEAD1635 is UNSAT
Problem TDEAD1636 is UNSAT
Problem TDEAD1637 is UNSAT
Problem TDEAD1638 is UNSAT
Problem TDEAD1639 is UNSAT
Problem TDEAD1640 is UNSAT
Problem TDEAD1641 is UNSAT
Problem TDEAD1642 is UNSAT
Problem TDEAD1643 is UNSAT
Problem TDEAD1644 is UNSAT
Problem TDEAD1645 is UNSAT
Problem TDEAD1646 is UNSAT
Problem TDEAD1647 is UNSAT
Problem TDEAD1648 is UNSAT
Problem TDEAD1649 is UNSAT
Problem TDEAD1650 is UNSAT
Problem TDEAD1651 is UNSAT
Problem TDEAD1652 is UNSAT
Problem TDEAD1653 is UNSAT
Problem TDEAD1654 is UNSAT
Problem TDEAD1655 is UNSAT
Problem TDEAD1656 is UNSAT
Problem TDEAD1657 is UNSAT
Problem TDEAD1658 is UNSAT
Problem TDEAD1659 is UNSAT
Problem TDEAD1660 is UNSAT
Problem TDEAD1661 is UNSAT
Problem TDEAD1662 is UNSAT
Problem TDEAD1663 is UNSAT
Problem TDEAD1664 is UNSAT
Problem TDEAD1665 is UNSAT
Problem TDEAD1666 is UNSAT
Problem TDEAD1667 is UNSAT
Problem TDEAD1668 is UNSAT
Problem TDEAD1669 is UNSAT
Problem TDEAD1670 is UNSAT
Problem TDEAD1671 is UNSAT
Problem TDEAD1672 is UNSAT
Problem TDEAD1673 is UNSAT
Problem TDEAD1674 is UNSAT
Problem TDEAD1675 is UNSAT
Problem TDEAD1676 is UNSAT
Problem TDEAD1677 is UNSAT
Problem TDEAD1678 is UNSAT
Problem TDEAD1679 is UNSAT
Problem TDEAD1680 is UNSAT
Problem TDEAD1681 is UNSAT
Problem TDEAD1682 is UNSAT
Problem TDEAD1683 is UNSAT
Problem TDEAD1684 is UNSAT
Problem TDEAD1685 is UNSAT
Problem TDEAD1686 is UNSAT
Problem TDEAD1687 is UNSAT
Problem TDEAD1688 is UNSAT
Problem TDEAD1689 is UNSAT
Problem TDEAD1690 is UNSAT
Problem TDEAD1691 is UNSAT
Problem TDEAD1692 is UNSAT
Problem TDEAD1693 is UNSAT
Problem TDEAD1694 is UNSAT
Problem TDEAD1695 is UNSAT
Problem TDEAD1696 is UNSAT
Problem TDEAD1697 is UNSAT
Problem TDEAD1698 is UNSAT
Problem TDEAD1699 is UNSAT
Problem TDEAD1700 is UNSAT
Problem TDEAD1701 is UNSAT
Problem TDEAD1702 is UNSAT
Problem TDEAD1703 is UNSAT
Problem TDEAD1704 is UNSAT
Problem TDEAD1705 is UNSAT
Problem TDEAD1706 is UNSAT
Problem TDEAD1707 is UNSAT
Problem TDEAD1708 is UNSAT
Problem TDEAD1709 is UNSAT
Problem TDEAD1710 is UNSAT
Problem TDEAD1711 is UNSAT
Problem TDEAD1712 is UNSAT
Problem TDEAD1713 is UNSAT
Problem TDEAD1714 is UNSAT
Problem TDEAD1715 is UNSAT
Problem TDEAD1716 is UNSAT
Problem TDEAD1717 is UNSAT
Problem TDEAD1718 is UNSAT
Problem TDEAD1719 is UNSAT
Problem TDEAD1720 is UNSAT
Problem TDEAD1721 is UNSAT
Problem TDEAD1722 is UNSAT
Problem TDEAD1803 is UNSAT
Problem TDEAD1804 is UNSAT
Problem TDEAD1805 is UNSAT
Problem TDEAD1806 is UNSAT
Problem TDEAD1807 is UNSAT
Problem TDEAD1808 is UNSAT
Problem TDEAD1809 is UNSAT
Problem TDEAD1810 is UNSAT
Problem TDEAD1811 is UNSAT
Problem TDEAD1812 is UNSAT
Problem TDEAD1813 is UNSAT
Problem TDEAD1814 is UNSAT
Problem TDEAD1815 is UNSAT
Problem TDEAD1816 is UNSAT
Problem TDEAD1817 is UNSAT
Problem TDEAD1818 is UNSAT
Problem TDEAD1819 is UNSAT
Problem TDEAD1820 is UNSAT
Problem TDEAD1821 is UNSAT
Problem TDEAD1822 is UNSAT
Problem TDEAD1823 is UNSAT
Problem TDEAD1824 is UNSAT
Problem TDEAD1825 is UNSAT
Problem TDEAD1826 is UNSAT
Problem TDEAD1827 is UNSAT
Problem TDEAD1828 is UNSAT
Problem TDEAD1829 is UNSAT
Problem TDEAD1830 is UNSAT
Problem TDEAD1831 is UNSAT
Problem TDEAD1832 is UNSAT
Problem TDEAD1833 is UNSAT
Problem TDEAD1834 is UNSAT
Problem TDEAD1835 is UNSAT
Problem TDEAD1836 is UNSAT
Problem TDEAD1837 is UNSAT
Problem TDEAD1838 is UNSAT
Problem TDEAD1839 is UNSAT
Problem TDEAD1840 is UNSAT
Problem TDEAD1841 is UNSAT
Problem TDEAD1842 is UNSAT
Problem TDEAD1843 is UNSAT
Problem TDEAD1844 is UNSAT
Problem TDEAD1845 is UNSAT
Problem TDEAD1846 is UNSAT
Problem TDEAD1847 is UNSAT
Problem TDEAD1848 is UNSAT
Problem TDEAD1849 is UNSAT
Problem TDEAD1850 is UNSAT
Problem TDEAD1851 is UNSAT
Problem TDEAD1852 is UNSAT
Problem TDEAD1853 is UNSAT
Problem TDEAD1854 is UNSAT
Problem TDEAD1855 is UNSAT
Problem TDEAD1856 is UNSAT
Problem TDEAD1857 is UNSAT
Problem TDEAD1858 is UNSAT
Problem TDEAD1859 is UNSAT
Problem TDEAD1860 is UNSAT
Problem TDEAD1861 is UNSAT
Problem TDEAD1862 is UNSAT
Problem TDEAD1863 is UNSAT
Problem TDEAD1864 is UNSAT
Problem TDEAD1865 is UNSAT
Problem TDEAD1866 is UNSAT
Problem TDEAD1867 is UNSAT
Problem TDEAD1868 is UNSAT
Problem TDEAD1869 is UNSAT
Problem TDEAD1870 is UNSAT
Problem TDEAD1871 is UNSAT
Problem TDEAD1872 is UNSAT
Problem TDEAD1873 is UNSAT
Problem TDEAD1874 is UNSAT
Problem TDEAD1875 is UNSAT
Problem TDEAD1876 is UNSAT
Problem TDEAD1877 is UNSAT
Problem TDEAD1878 is UNSAT
Problem TDEAD1879 is UNSAT
Problem TDEAD1880 is UNSAT
Problem TDEAD1881 is UNSAT
Problem TDEAD1882 is UNSAT
Problem TDEAD1883 is UNSAT
Problem TDEAD1884 is UNSAT
Problem TDEAD1885 is UNSAT
Problem TDEAD1886 is UNSAT
Problem TDEAD1887 is UNSAT
Problem TDEAD1888 is UNSAT
Problem TDEAD1889 is UNSAT
Problem TDEAD1890 is UNSAT
Problem TDEAD1891 is UNSAT
Problem TDEAD1892 is UNSAT
Problem TDEAD1893 is UNSAT
Problem TDEAD1894 is UNSAT
Problem TDEAD1895 is UNSAT
Problem TDEAD1896 is UNSAT
Problem TDEAD1897 is UNSAT
Problem TDEAD1898 is UNSAT
Problem TDEAD1899 is UNSAT
Problem TDEAD1900 is UNSAT
Problem TDEAD1901 is UNSAT
Problem TDEAD1902 is UNSAT
Problem TDEAD1903 is UNSAT
Problem TDEAD1904 is UNSAT
Problem TDEAD1905 is UNSAT
Problem TDEAD1906 is UNSAT
Problem TDEAD1907 is UNSAT
Problem TDEAD1908 is UNSAT
Problem TDEAD1909 is UNSAT
Problem TDEAD1910 is UNSAT
Problem TDEAD1911 is UNSAT
Problem TDEAD1912 is UNSAT
Problem TDEAD1913 is UNSAT
Problem TDEAD1914 is UNSAT
Problem TDEAD1915 is UNSAT
Problem TDEAD1916 is UNSAT
Problem TDEAD1917 is UNSAT
Problem TDEAD1918 is UNSAT
Problem TDEAD1919 is UNSAT
Problem TDEAD1920 is UNSAT
Problem TDEAD1921 is UNSAT
Problem TDEAD1922 is UNSAT
Problem TDEAD1923 is UNSAT
Problem TDEAD1924 is UNSAT
Problem TDEAD1925 is UNSAT
Problem TDEAD1926 is UNSAT
Problem TDEAD1927 is UNSAT
Problem TDEAD1928 is UNSAT
Problem TDEAD1929 is UNSAT
Problem TDEAD1930 is UNSAT
Problem TDEAD1931 is UNSAT
Problem TDEAD1932 is UNSAT
Problem TDEAD1933 is UNSAT
Problem TDEAD1934 is UNSAT
Problem TDEAD1935 is UNSAT
Problem TDEAD1936 is UNSAT
Problem TDEAD1937 is UNSAT
Problem TDEAD1938 is UNSAT
Problem TDEAD1939 is UNSAT
Problem TDEAD1940 is UNSAT
Problem TDEAD1941 is UNSAT
Problem TDEAD1942 is UNSAT
Problem TDEAD1943 is UNSAT
Problem TDEAD1944 is UNSAT
Problem TDEAD1945 is UNSAT
Problem TDEAD1946 is UNSAT
Problem TDEAD1947 is UNSAT
Problem TDEAD1948 is UNSAT
Problem TDEAD1949 is UNSAT
Problem TDEAD1950 is UNSAT
Problem TDEAD1951 is UNSAT
Problem TDEAD1952 is UNSAT
Problem TDEAD1953 is UNSAT
Problem TDEAD1954 is UNSAT
Problem TDEAD1955 is UNSAT
Problem TDEAD1956 is UNSAT
Problem TDEAD1957 is UNSAT
Problem TDEAD1958 is UNSAT
Problem TDEAD1959 is UNSAT
Problem TDEAD1960 is UNSAT
Problem TDEAD1961 is UNSAT
Problem TDEAD1962 is UNSAT
Problem TDEAD2044 is UNSAT
Problem TDEAD2045 is UNSAT
Problem TDEAD2046 is UNSAT
Problem TDEAD2047 is UNSAT
Problem TDEAD2048 is UNSAT
Problem TDEAD2049 is UNSAT
Problem TDEAD2050 is UNSAT
Problem TDEAD2051 is UNSAT
[2025-05-29 20:52:34] [INFO ] Deduced a trap composed of 25 places in 226 ms of which 2 ms to minimize.
Problem TDEAD2052 is UNSAT
Problem TDEAD2053 is UNSAT
[2025-05-29 20:52:34] [INFO ] Deduced a trap composed of 8 places in 226 ms of which 2 ms to minimize.
SMT process timed out in 112818ms, After SMT, problems are : Problem set: 0 solved, 3870 unsolved
Search for dead transitions found 0 dead transitions in 112906ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 118459 ms. Remains : 269/269 places, 3871/3871 transitions.
[2025-05-29 20:52:34] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
Found an invariant !
This invariant on transitions {2=1, 44=1, 3014=1, 3635=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {2=1, 3014=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 6) seen :[0, 0, 0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, +inf, 1, 1, 1, 1]
RANDOM walk for 40000 steps (11 resets) in 2696 ms. (14 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (10 resets) in 669 ms. (59 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (10 resets) in 447 ms. (89 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (10 resets) in 416 ms. (95 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (9 resets) in 411 ms. (97 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (9 resets) in 329 ms. (121 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (11 resets) in 320 ms. (124 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 295 ms. (135 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (9 resets) in 339 ms. (117 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 364 ms. (109 steps per ms) remains 11/11 properties
[2025-05-29 20:52:38] [INFO ] Flatten gal took : 1198 ms
BEST_FIRST walk for 40002 steps (8 resets) in 302 ms. (132 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (9 resets) in 297 ms. (134 steps per ms) remains 11/11 properties
[2025-05-29 20:52:39] [INFO ] Flatten gal took : 326 ms
[2025-05-29 20:52:39] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6460142256861330943.gal : 168 ms
[2025-05-29 20:52:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14745990756556807693.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6460142256861330943.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14745990756556807693.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality14745990756556807693.prop.
SDD proceeding with computation,11 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,11 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,11 properties remain. new max is 16
SDD size :10 after 15
SDD proceeding with computation,11 properties remain. new max is 32
SDD size :15 after 49
SDD proceeding with computation,11 properties remain. new max is 64
SDD size :49 after 214
SDD proceeding with computation,11 properties remain. new max is 128
SDD size :214 after 539
SDD proceeding with computation,11 properties remain. new max is 256
SDD size :539 after 1184
SDD proceeding with computation,11 properties remain. new max is 512
SDD size :1184 after 2469
SDD proceeding with computation,11 properties remain. new max is 1024
SDD size :2469 after 5034
Interrupted probabilistic random walk after 139376 steps, run timeout after 6001 ms. (steps per millisecond=23 ) properties seen :0 out of 11
Probabilistic random walk after 139376 steps, saw 57534 distinct states, run finished after 6007 ms. (steps per millisecond=23 ) properties seen :0
[2025-05-29 20:52:45] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2025-05-29 20:52:45] [INFO ] Invariant cache hit.
[2025-05-29 20:52:45] [INFO ] State equation strengthened by 283 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 102/108 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 2809/2917 variables, 108/112 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2917 variables, 2/114 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2917 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 375/3292 variables, 108/222 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3292 variables, 3/225 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3292 variables, 246/471 constraints. Problems are: Problem set: 0 solved, 11 unsolved
SDD proceeding with computation,11 properties remain. new max is 2048
SDD size :5034 after 10159
At refinement iteration 9 (INCLUDED_ONLY) 0/3292 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 649/3941 variables, 27/498 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3941 variables, 34/532 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3941 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (OVERLAPS) 27/3968 variables, 26/558 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3968 variables, 1/559 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3968 variables, 1/560 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3968 variables, 0/560 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 17 (OVERLAPS) 0/3968 variables, 0/560 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3968/3968 variables, and 560 constraints, problems are : Problem set: 0 solved, 11 unsolved in 4465 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 269/269 constraints, ReadFeed: 283/283 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 102/108 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 2809/2917 variables, 108/112 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2917 variables, 2/114 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2917 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 375/3292 variables, 108/222 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3292 variables, 3/225 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3292 variables, 246/471 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3292 variables, 11/482 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2025-05-29 20:52:52] [INFO ] Deduced a trap composed of 17 places in 405 ms of which 2 ms to minimize.
[2025-05-29 20:52:53] [INFO ] Deduced a trap composed of 16 places in 337 ms of which 2 ms to minimize.
[2025-05-29 20:52:53] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
[2025-05-29 20:52:53] [INFO ] Deduced a trap composed of 8 places in 283 ms of which 1 ms to minimize.
Problem MAX4 is UNSAT
Problem MIN4 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/3292 variables, 4/486 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3292 variables, 0/486 constraints. Problems are: Problem set: 2 solved, 9 unsolved
SMT process timed out in 9539ms, After SMT, problems are : Problem set: 2 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 74 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 269/269 places, 3871/3871 transitions.
RANDOM walk for 40000 steps (8 resets) in 956 ms. (41 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (9 resets) in 273 ms. (146 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (9 resets) in 273 ms. (145 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (10 resets) in 251 ms. (158 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (10 resets) in 235 ms. (169 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (10 resets) in 271 ms. (147 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 250 ms. (159 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (10 resets) in 256 ms. (155 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (10 resets) in 251 ms. (158 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (10 resets) in 227 ms. (175 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 76201 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :0 out of 9
Probabilistic random walk after 76201 steps, saw 27183 distinct states, run finished after 3001 ms. (steps per millisecond=25 ) properties seen :0
[2025-05-29 20:52:58] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2025-05-29 20:52:58] [INFO ] Invariant cache hit.
[2025-05-29 20:52:58] [INFO ] State equation strengthened by 283 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 103/108 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 2809/2917 variables, 108/112 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2917 variables, 2/114 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2917 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 375/3292 variables, 108/222 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3292 variables, 3/225 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3292 variables, 246/471 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3292 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 649/3941 variables, 27/498 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3941 variables, 34/532 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3941 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 27/3968 variables, 26/558 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3968 variables, 1/559 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3968 variables, 1/560 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3968 variables, 0/560 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (OVERLAPS) 0/3968 variables, 0/560 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3968/3968 variables, and 560 constraints, problems are : Problem set: 0 solved, 9 unsolved in 3262 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 269/269 constraints, ReadFeed: 283/283 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 103/108 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 2809/2917 variables, 108/112 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2917 variables, 2/114 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2917 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 375/3292 variables, 108/222 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3292 variables, 3/225 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3292 variables, 246/471 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3292 variables, 9/480 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3292 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 649/3941 variables, 27/507 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3941 variables, 34/541 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3941 variables, 0/541 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 27/3968 variables, 26/567 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3968 variables, 1/568 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3968 variables, 1/569 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3968 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 9 unsolved
SDD proceeding with computation,11 properties remain. new max is 4096
SDD size :10159 after 20404
At refinement iteration 18 (OVERLAPS) 0/3968 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3968/3968 variables, and 569 constraints, problems are : Problem set: 0 solved, 9 unsolved in 7243 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 269/269 constraints, ReadFeed: 283/283 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 10559ms problems are : Problem set: 0 solved, 9 unsolved
Fused 9 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 10268 ms.
Support contains 5 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 70 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 66 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2025-05-29 20:53:19] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2025-05-29 20:53:19] [INFO ] Invariant cache hit.
[2025-05-29 20:53:20] [INFO ] Implicit Places using invariants in 765 ms returned []
[2025-05-29 20:53:20] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2025-05-29 20:53:20] [INFO ] Invariant cache hit.
[2025-05-29 20:53:21] [INFO ] State equation strengthened by 283 read => feed constraints.
[2025-05-29 20:53:24] [INFO ] Implicit Places using invariants and state equation in 3816 ms returned []
Implicit Place search using SMT with State Equation took 4586 ms to find 0 implicit places.
[2025-05-29 20:53:24] [INFO ] Redundant transitions in 369 ms returned []
Running 3870 sub problems to find dead transitions.
[2025-05-29 20:53:24] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2025-05-29 20:53:24] [INFO ] Invariant cache hit.
[2025-05-29 20:53:24] [INFO ] State equation strengthened by 283 read => feed constraints.
Detected timeout of ITS tools.
[2025-05-29 20:53:29] [INFO ] Flatten gal took : 232 ms
[2025-05-29 20:53:29] [INFO ] Applying decomposition
[2025-05-29 20:53:30] [INFO ] Flatten gal took : 209 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2867732317781606420.txt' '-o' '/tmp/graph2867732317781606420.bin' '-w' '/tmp/graph2867732317781606420.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2867732317781606420.bin' '-l' '-1' '-v' '-w' '/tmp/graph2867732317781606420.weights' '-q' '0' '-e' '0.001'
[2025-05-29 20:53:30] [INFO ] Decomposing Gal with order
[2025-05-29 20:53:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 20:53:31] [INFO ] Removed a total of 424 redundant transitions.
[2025-05-29 20:53:31] [INFO ] Flatten gal took : 586 ms
[2025-05-29 20:53:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 387 labels/synchronizations in 54 ms.
[2025-05-29 20:53:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17498290202912870721.gal : 37 ms
[2025-05-29 20:53:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16745366992714535411.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17498290202912870721.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16745366992714535411.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality16745366992714535411.prop.
SDD proceeding with computation,9 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,9 properties remain. new max is 8
SDD size :5 after 9
SDD proceeding with computation,9 properties remain. new max is 16
SDD size :9 after 10
SDD proceeding with computation,9 properties remain. new max is 32
SDD size :10 after 41
SDD proceeding with computation,9 properties remain. new max is 64
SDD size :41 after 57
SDD proceeding with computation,9 properties remain. new max is 128
SDD size :57 after 223
SDD proceeding with computation,9 properties remain. new max is 256
SDD size :223 after 300
SDD proceeding with computation,9 properties remain. new max is 512
SDD size :300 after 737
SDD proceeding with computation,9 properties remain. new max is 1024
SDD size :737 after 1586
SDD proceeding with computation,9 properties remain. new max is 2048
SDD size :1586 after 2960
SDD proceeding with computation,9 properties remain. new max is 4096
SDD size :2960 after 7229
SDD proceeding with computation,9 properties remain. new max is 8192
SDD size :7229 after 24819
SDD proceeding with computation,9 properties remain. new max is 16384
SDD size :24819 after 98941

BK_STOP 1748552057992

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BugTracking-PT-q8m004"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool gold2024"
echo " Input is BugTracking-PT-q8m004, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r027-smll-174853774300070"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BugTracking-PT-q8m004.tgz
mv BugTracking-PT-q8m004 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;