Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r223-tall-174902009200058.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 SieveSingleMsgMbox-PT-d2m06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r223-tall-174902009200058
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 6.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.4K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K 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 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 6 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 1.1M May 29 14:33 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 SieveSingleMsgMbox-PT-d2m06-UpperBounds-00
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-UpperBounds-01
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-UpperBounds-02
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-UpperBounds-03
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-UpperBounds-04
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-UpperBounds-05
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-UpperBounds-06
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-UpperBounds-07
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-UpperBounds-08
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-UpperBounds-09
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-UpperBounds-10
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-UpperBounds-11
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-UpperBounds-12
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-UpperBounds-13
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-UpperBounds-14
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1749106515198

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d2m06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-05 06:55:16] [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-06-05 06:55:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 06:55:16] [INFO ] Load time of PNML (sax parser for PT used): 163 ms
[2025-06-05 06:55:16] [INFO ] Transformed 2398 places.
[2025-06-05 06:55:16] [INFO ] Transformed 1954 transitions.
[2025-06-05 06:55:16] [INFO ] Parsed PT model containing 2398 places and 1954 transitions and 7816 arcs in 271 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 1984 places in 16 ms
Reduce places removed 1984 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d2m06-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
// Phase 1: matrix 1954 rows 414 cols
[2025-06-05 06:55:16] [INFO ] Computed 6 invariants in 82 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (2192 resets) in 285 ms. (34 steps per ms)
BEST_FIRST walk for 10001 steps (898 resets) in 56 ms. (175 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-06-05 06:55:17] [INFO ] Invariant cache hit.
[2025-06-05 06:55:17] [INFO ] [Real]Absence check using 3 positive place invariants in 9 ms returned sat
[2025-06-05 06:55:17] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 17 ms returned sat
[2025-06-05 06:55:17] [INFO ] [Real]Absence check using state equation in 315 ms returned sat
[2025-06-05 06:55:17] [INFO ] State equation strengthened by 1674 read => feed constraints.
[2025-06-05 06:55:18] [INFO ] [Real]Added 1674 Read/Feed constraints in 320 ms returned sat
[2025-06-05 06:55:18] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 06:55:18] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-05 06:55:18] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2025-06-05 06:55:18] [INFO ] [Nat]Absence check using state equation in 323 ms returned sat
[2025-06-05 06:55:19] [INFO ] [Nat]Added 1674 Read/Feed constraints in 422 ms returned sat
[2025-06-05 06:55:19] [INFO ] Deduced a trap composed of 196 places in 248 ms of which 30 ms to minimize.
[2025-06-05 06:55:19] [INFO ] Deduced a trap composed of 124 places in 233 ms of which 3 ms to minimize.
[2025-06-05 06:55:20] [INFO ] Deduced a trap composed of 196 places in 204 ms of which 3 ms to minimize.
[2025-06-05 06:55:20] [INFO ] Deduced a trap composed of 122 places in 211 ms of which 3 ms to minimize.
[2025-06-05 06:55:21] [INFO ] Deduced a trap composed of 121 places in 236 ms of which 2 ms to minimize.
[2025-06-05 06:55:21] [INFO ] Deduced a trap composed of 122 places in 201 ms of which 2 ms to minimize.
[2025-06-05 06:55:22] [INFO ] Deduced a trap composed of 92 places in 207 ms of which 3 ms to minimize.
[2025-06-05 06:55:22] [INFO ] Deduced a trap composed of 96 places in 200 ms of which 3 ms to minimize.
[2025-06-05 06:55:22] [INFO ] Deduced a trap composed of 115 places in 197 ms of which 3 ms to minimize.
[2025-06-05 06:55:23] [INFO ] Deduced a trap composed of 102 places in 198 ms of which 3 ms to minimize.
[2025-06-05 06:55:23] [INFO ] Deduced a trap composed of 161 places in 204 ms of which 3 ms to minimize.
[2025-06-05 06:55:23] [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)
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 414 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p70) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 1953/1953 transitions.
Graph (complete) has 2615 edges and 414 vertex of which 388 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.7 ms
Discarding 26 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 3 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 828 transitions
Reduce isomorphic transitions removed 830 transitions.
Iterating post reduction 0 with 831 rules applied. Total rules applied 832 place count 387 transition count 1120
Discarding 118 places :
Symmetric choice reduction at 1 with 118 rule applications. Total rules 950 place count 269 transition count 371
Iterating global reduction 1 with 118 rules applied. Total rules applied 1068 place count 269 transition count 371
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 1078 place count 269 transition count 361
Discarding 92 places :
Symmetric choice reduction at 2 with 92 rule applications. Total rules 1170 place count 177 transition count 269
Iterating global reduction 2 with 92 rules applied. Total rules applied 1262 place count 177 transition count 269
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 2 with 36 rules applied. Total rules applied 1298 place count 177 transition count 233
Discarding 38 places :
Symmetric choice reduction at 3 with 38 rule applications. Total rules 1336 place count 139 transition count 180
Iterating global reduction 3 with 38 rules applied. Total rules applied 1374 place count 139 transition count 180
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 3 with 24 rules applied. Total rules applied 1398 place count 139 transition count 156
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1407 place count 130 transition count 142
Iterating global reduction 4 with 9 rules applied. Total rules applied 1416 place count 130 transition count 142
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1425 place count 121 transition count 133
Iterating global reduction 4 with 9 rules applied. Total rules applied 1434 place count 121 transition count 133
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 1439 place count 116 transition count 128
Iterating global reduction 4 with 5 rules applied. Total rules applied 1444 place count 116 transition count 128
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1446 place count 116 transition count 126
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 1451 place count 111 transition count 121
Iterating global reduction 5 with 5 rules applied. Total rules applied 1456 place count 111 transition count 121
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 1459 place count 108 transition count 118
Iterating global reduction 5 with 3 rules applied. Total rules applied 1462 place count 108 transition count 118
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1463 place count 107 transition count 115
Iterating global reduction 5 with 1 rules applied. Total rules applied 1464 place count 107 transition count 115
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1465 place count 106 transition count 114
Iterating global reduction 5 with 1 rules applied. Total rules applied 1466 place count 106 transition count 114
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1467 place count 105 transition count 113
Iterating global reduction 5 with 1 rules applied. Total rules applied 1468 place count 105 transition count 113
Applied a total of 1468 rules in 124 ms. Remains 105 /414 variables (removed 309) and now considering 113/1953 (removed 1840) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 132 ms. Remains : 105/414 places, 113/1953 transitions.
// Phase 1: matrix 113 rows 105 cols
[2025-06-05 06:55:23] [INFO ] Computed 4 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (224538 resets) in 849 ms. (1176 steps per ms)
BEST_FIRST walk for 1000000 steps (103333 resets) in 437 ms. (2283 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-06-05 06:55:24] [INFO ] Invariant cache hit.
[2025-06-05 06:55:25] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-05 06:55:25] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2025-06-05 06:55:25] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2025-06-05 06:55:25] [INFO ] State equation strengthened by 42 read => feed constraints.
[2025-06-05 06:55:25] [INFO ] [Real]Added 42 Read/Feed constraints in 12 ms returned sat
[2025-06-05 06:55:25] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 06:55:25] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-05 06:55:25] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-05 06:55:25] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2025-06-05 06:55:25] [INFO ] [Nat]Added 42 Read/Feed constraints in 8 ms returned sat
[2025-06-05 06:55:25] [INFO ] Computed and/alt/rep : 27/69/27 causal constraints (skipped 85 transitions) in 10 ms.
[2025-06-05 06:55:25] [INFO ] Added : 19 causal constraints over 4 iterations in 60 ms. Result :sat
Minimization took 52 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 113/113 transitions.
Applied a total of 0 rules in 6 ms. Remains 105 /105 variables (removed 0) and now considering 113/113 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 105/105 places, 113/113 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 113/113 transitions.
Applied a total of 0 rules in 6 ms. Remains 105 /105 variables (removed 0) and now considering 113/113 (removed 0) transitions.
[2025-06-05 06:55:25] [INFO ] Invariant cache hit.
[2025-06-05 06:55:25] [INFO ] Implicit Places using invariants in 63 ms returned []
[2025-06-05 06:55:25] [INFO ] Invariant cache hit.
[2025-06-05 06:55:25] [INFO ] State equation strengthened by 42 read => feed constraints.
[2025-06-05 06:55:25] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
[2025-06-05 06:55:25] [INFO ] Redundant transitions in 3 ms returned []
Running 112 sub problems to find dead transitions.
[2025-06-05 06:55:25] [INFO ] Invariant cache hit.
[2025-06-05 06:55:25] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (OVERLAPS) 2/105 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2025-06-05 06:55:26] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (OVERLAPS) 113/218 variables, 105/110 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/218 variables, 42/152 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/218 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 9 (OVERLAPS) 0/218 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Real declared 218/218 variables, and 152 constraints, problems are : Problem set: 0 solved, 112 unsolved in 4004 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 105/105 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 112 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (OVERLAPS) 2/105 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (OVERLAPS) 113/218 variables, 105/110 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/218 variables, 42/152 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/218 variables, 112/264 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2025-06-05 06:55:31] [INFO ] Deduced a trap composed of 30 places in 31 ms of which 1 ms to minimize.
Problem TDEAD39 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD103 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/218 variables, 1/265 constraints. Problems are: Problem set: 3 solved, 109 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/218 variables, 0/265 constraints. Problems are: Problem set: 3 solved, 109 unsolved
At refinement iteration 11 (OVERLAPS) 0/218 variables, 0/265 constraints. Problems are: Problem set: 3 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 218/218 variables, and 265 constraints, problems are : Problem set: 3 solved, 109 unsolved in 10124 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 105/105 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 2/2 constraints]
After SMT, in 14292ms problems are : Problem set: 3 solved, 109 unsolved
Search for dead transitions found 3 dead transitions in 14300ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 105/105 places, 110/113 transitions.
Graph (complete) has 287 edges and 105 vertex of which 102 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 7 ms. Remains 102 /105 variables (removed 3) and now considering 110/110 (removed 0) transitions.
// Phase 1: matrix 110 rows 102 cols
[2025-06-05 06:55:39] [INFO ] Computed 3 invariants in 2 ms
[2025-06-05 06:55:39] [INFO ] Implicit Places using invariants in 65 ms returned []
[2025-06-05 06:55:39] [INFO ] Invariant cache hit.
[2025-06-05 06:55:39] [INFO ] State equation strengthened by 41 read => feed constraints.
[2025-06-05 06:55:40] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 102/105 places, 110/113 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 14782 ms. Remains : 102/105 places, 110/113 transitions.
[2025-06-05 06:55:40] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (224789 resets) in 795 ms. (1256 steps per ms)
BEST_FIRST walk for 1000001 steps (104092 resets) in 408 ms. (2444 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-06-05 06:55:41] [INFO ] Invariant cache hit.
[2025-06-05 06:55:41] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-05 06:55:41] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2025-06-05 06:55:41] [INFO ] State equation strengthened by 41 read => feed constraints.
[2025-06-05 06:55:41] [INFO ] [Real]Added 41 Read/Feed constraints in 10 ms returned sat
[2025-06-05 06:55:41] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 06:55:41] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-05 06:55:41] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2025-06-05 06:55:41] [INFO ] [Nat]Added 41 Read/Feed constraints in 6 ms returned sat
[2025-06-05 06:55:41] [INFO ] Computed and/alt/rep : 26/65/26 causal constraints (skipped 83 transitions) in 9 ms.
[2025-06-05 06:55:41] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2025-06-05 06:55:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2025-06-05 06:55:41] [INFO ] Added : 18 causal constraints over 4 iterations in 112 ms. Result :sat
Minimization took 49 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 110/110 transitions.
Applied a total of 0 rules in 6 ms. Remains 102 /102 variables (removed 0) and now considering 110/110 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 102/102 places, 110/110 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 110/110 transitions.
Applied a total of 0 rules in 5 ms. Remains 102 /102 variables (removed 0) and now considering 110/110 (removed 0) transitions.
[2025-06-05 06:55:41] [INFO ] Invariant cache hit.
[2025-06-05 06:55:41] [INFO ] Implicit Places using invariants in 58 ms returned []
[2025-06-05 06:55:41] [INFO ] Invariant cache hit.
[2025-06-05 06:55:41] [INFO ] State equation strengthened by 41 read => feed constraints.
[2025-06-05 06:55:41] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
[2025-06-05 06:55:41] [INFO ] Redundant transitions in 3 ms returned []
Running 109 sub problems to find dead transitions.
[2025-06-05 06:55:41] [INFO ] Invariant cache hit.
[2025-06-05 06:55:41] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (OVERLAPS) 1/101 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2025-06-05 06:55:42] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 109 unsolved
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
At refinement iteration 5 (OVERLAPS) 110/211 variables, 101/105 constraints. Problems are: Problem set: 11 solved, 98 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/211 variables, 41/146 constraints. Problems are: Problem set: 11 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/211 variables, 0/146 constraints. Problems are: Problem set: 11 solved, 98 unsolved
At refinement iteration 8 (OVERLAPS) 1/212 variables, 1/147 constraints. Problems are: Problem set: 11 solved, 98 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/212 variables, 0/147 constraints. Problems are: Problem set: 11 solved, 98 unsolved
At refinement iteration 10 (OVERLAPS) 0/212 variables, 0/147 constraints. Problems are: Problem set: 11 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 212/212 variables, and 147 constraints, problems are : Problem set: 11 solved, 98 unsolved in 3662 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 102/102 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 11 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 0/0 constraints. Problems are: Problem set: 11 solved, 98 unsolved
At refinement iteration 1 (OVERLAPS) 4/94 variables, 3/3 constraints. Problems are: Problem set: 11 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 1/4 constraints. Problems are: Problem set: 11 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/4 constraints. Problems are: Problem set: 11 solved, 98 unsolved
At refinement iteration 4 (OVERLAPS) 108/202 variables, 94/98 constraints. Problems are: Problem set: 11 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/202 variables, 39/137 constraints. Problems are: Problem set: 11 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/202 variables, 9/146 constraints. Problems are: Problem set: 11 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 0/146 constraints. Problems are: Problem set: 11 solved, 98 unsolved
At refinement iteration 8 (OVERLAPS) 10/212 variables, 8/154 constraints. Problems are: Problem set: 11 solved, 98 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/212 variables, 2/156 constraints. Problems are: Problem set: 11 solved, 98 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/212 variables, 89/245 constraints. Problems are: Problem set: 11 solved, 98 unsolved
[2025-06-05 06:55:48] [INFO ] Deduced a trap composed of 30 places in 30 ms of which 0 ms to minimize.
[2025-06-05 06:55:48] [INFO ] Deduced a trap composed of 43 places in 36 ms of which 1 ms to minimize.
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/212 variables, 2/247 constraints. Problems are: Problem set: 38 solved, 71 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/212 variables, 0/247 constraints. Problems are: Problem set: 38 solved, 71 unsolved
At refinement iteration 13 (OVERLAPS) 0/212 variables, 0/247 constraints. Problems are: Problem set: 38 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Int declared 212/212 variables, and 247 constraints, problems are : Problem set: 38 solved, 71 unsolved in 7493 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 102/102 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 98/109 constraints, Known Traps: 3/3 constraints]
After SMT, in 11268ms problems are : Problem set: 38 solved, 71 unsolved
Search for dead transitions found 38 dead transitions in 11273ms
Found 38 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 38 transitions
Dead transitions reduction (with SMT) removed 38 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 102/102 places, 72/110 transitions.
Graph (complete) has 196 edges and 102 vertex of which 72 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.1 ms
Discarding 30 places :
Also discarding 0 output transitions
Reduce places removed 4 places and 4 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 170 edges and 68 vertex of which 66 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 66 transition count 66
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 9 place count 66 transition count 65
Applied a total of 9 rules in 12 ms. Remains 66 /102 variables (removed 36) and now considering 65/72 (removed 7) transitions.
// Phase 1: matrix 65 rows 66 cols
[2025-06-05 06:55:53] [INFO ] Computed 2 invariants in 1 ms
[2025-06-05 06:55:53] [INFO ] Implicit Places using invariants in 47 ms returned []
[2025-06-05 06:55:53] [INFO ] Invariant cache hit.
[2025-06-05 06:55:53] [INFO ] State equation strengthened by 24 read => feed constraints.
[2025-06-05 06:55:53] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 66/102 places, 65/110 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 11627 ms. Remains : 66/102 places, 65/110 transitions.
[2025-06-05 06:55:53] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (224333 resets) in 555 ms. (1798 steps per ms)
BEST_FIRST walk for 1000000 steps (103468 resets) in 292 ms. (3412 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-06-05 06:55:54] [INFO ] Invariant cache hit.
[2025-06-05 06:55:54] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-05 06:55:54] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2025-06-05 06:55:54] [INFO ] State equation strengthened by 24 read => feed constraints.
[2025-06-05 06:55:54] [INFO ] [Real]Added 24 Read/Feed constraints in 3 ms returned sat
[2025-06-05 06:55:54] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 06:55:54] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-05 06:55:54] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2025-06-05 06:55:54] [INFO ] [Nat]Added 24 Read/Feed constraints in 3 ms returned sat
[2025-06-05 06:55:54] [INFO ] Computed and/alt/rep : 15/26/15 causal constraints (skipped 49 transitions) in 4 ms.
[2025-06-05 06:55:54] [INFO ] Added : 11 causal constraints over 3 iterations in 21 ms. Result :sat
Minimization took 22 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 66 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 66/66 places, 65/65 transitions.
Applied a total of 0 rules in 3 ms. Remains 66 /66 variables (removed 0) and now considering 65/65 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 66/66 places, 65/65 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 66/66 places, 65/65 transitions.
Applied a total of 0 rules in 3 ms. Remains 66 /66 variables (removed 0) and now considering 65/65 (removed 0) transitions.
[2025-06-05 06:55:54] [INFO ] Invariant cache hit.
[2025-06-05 06:55:54] [INFO ] Implicit Places using invariants in 39 ms returned []
[2025-06-05 06:55:54] [INFO ] Invariant cache hit.
[2025-06-05 06:55:54] [INFO ] State equation strengthened by 24 read => feed constraints.
[2025-06-05 06:55:54] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
[2025-06-05 06:55:54] [INFO ] Redundant transitions in 1 ms returned []
Running 64 sub problems to find dead transitions.
[2025-06-05 06:55:54] [INFO ] Invariant cache hit.
[2025-06-05 06:55:54] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 2/66 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
Problem TDEAD62 is UNSAT
Problem TDEAD64 is UNSAT
At refinement iteration 3 (OVERLAPS) 65/131 variables, 66/68 constraints. Problems are: Problem set: 2 solved, 62 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 24/92 constraints. Problems are: Problem set: 2 solved, 62 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 0/92 constraints. Problems are: Problem set: 2 solved, 62 unsolved
At refinement iteration 6 (OVERLAPS) 0/131 variables, 0/92 constraints. Problems are: Problem set: 2 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Real declared 131/131 variables, and 92 constraints, problems are : Problem set: 2 solved, 62 unsolved in 1075 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 66/66 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 62 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 62 unsolved
At refinement iteration 1 (OVERLAPS) 3/64 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 62 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 62 unsolved
At refinement iteration 3 (OVERLAPS) 65/129 variables, 64/66 constraints. Problems are: Problem set: 2 solved, 62 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 24/90 constraints. Problems are: Problem set: 2 solved, 62 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 6/96 constraints. Problems are: Problem set: 2 solved, 62 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 0/96 constraints. Problems are: Problem set: 2 solved, 62 unsolved
At refinement iteration 7 (OVERLAPS) 2/131 variables, 2/98 constraints. Problems are: Problem set: 2 solved, 62 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/131 variables, 56/154 constraints. Problems are: Problem set: 2 solved, 62 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/131 variables, 0/154 constraints. Problems are: Problem set: 2 solved, 62 unsolved
[2025-06-05 06:55:56] [INFO ] Deduced a trap composed of 38 places in 34 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/131 variables, 1/155 constraints. Problems are: Problem set: 2 solved, 62 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/131 variables, 0/155 constraints. Problems are: Problem set: 2 solved, 62 unsolved
At refinement iteration 12 (OVERLAPS) 0/131 variables, 0/155 constraints. Problems are: Problem set: 2 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Int declared 131/131 variables, and 155 constraints, problems are : Problem set: 2 solved, 62 unsolved in 2618 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 66/66 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 62/64 constraints, Known Traps: 1/1 constraints]
After SMT, in 3726ms problems are : Problem set: 2 solved, 62 unsolved
Search for dead transitions found 2 dead transitions in 3726ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 66/66 places, 63/65 transitions.
Graph (complete) has 159 edges and 66 vertex of which 63 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 63 transition count 63
Applied a total of 2 rules in 14 ms. Remains 63 /66 variables (removed 3) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 63 cols
[2025-06-05 06:55:58] [INFO ] Computed 1 invariants in 1 ms
[2025-06-05 06:55:58] [INFO ] Implicit Places using invariants in 40 ms returned []
[2025-06-05 06:55:58] [INFO ] Invariant cache hit.
[2025-06-05 06:55:58] [INFO ] State equation strengthened by 25 read => feed constraints.
[2025-06-05 06:55:58] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 63/66 places, 63/65 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3975 ms. Remains : 63/66 places, 63/65 transitions.
[2025-06-05 06:55:58] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (224680 resets) in 622 ms. (1605 steps per ms)
BEST_FIRST walk for 1000000 steps (103687 resets) in 317 ms. (3144 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-06-05 06:55:59] [INFO ] Invariant cache hit.
[2025-06-05 06:55:59] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-05 06:55:59] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2025-06-05 06:55:59] [INFO ] State equation strengthened by 25 read => feed constraints.
[2025-06-05 06:55:59] [INFO ] [Real]Added 25 Read/Feed constraints in 2 ms returned sat
[2025-06-05 06:55:59] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 49 transitions) in 4 ms.
[2025-06-05 06:55:59] [INFO ] Added : 11 causal constraints over 3 iterations in 22 ms. Result :sat
Minimization took 14 ms.
[2025-06-05 06:55:59] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 06:55:59] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-05 06:55:59] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2025-06-05 06:55:59] [INFO ] [Nat]Added 25 Read/Feed constraints in 2 ms returned sat
[2025-06-05 06:55:59] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 49 transitions) in 4 ms.
[2025-06-05 06:55:59] [INFO ] Added : 11 causal constraints over 3 iterations in 19 ms. Result :sat
Minimization took 13 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 3 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 63/63 places, 63/63 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 2 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2025-06-05 06:55:59] [INFO ] Invariant cache hit.
[2025-06-05 06:55:59] [INFO ] Implicit Places using invariants in 40 ms returned []
[2025-06-05 06:55:59] [INFO ] Invariant cache hit.
[2025-06-05 06:55:59] [INFO ] State equation strengthened by 25 read => feed constraints.
[2025-06-05 06:55:59] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
[2025-06-05 06:55:59] [INFO ] Redundant transitions in 0 ms returned []
Running 62 sub problems to find dead transitions.
[2025-06-05 06:55:59] [INFO ] Invariant cache hit.
[2025-06-05 06:55:59] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (OVERLAPS) 63/125 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 25/88 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (OVERLAPS) 1/126 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 8 (OVERLAPS) 0/126 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Real declared 126/126 variables, and 89 constraints, problems are : Problem set: 0 solved, 62 unsolved in 1176 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 62 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (OVERLAPS) 63/125 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 25/88 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 13/101 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 7 (OVERLAPS) 1/126 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 49/151 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 10 (OVERLAPS) 0/126 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Int declared 126/126 variables, and 151 constraints, problems are : Problem set: 0 solved, 62 unsolved in 1814 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 0/0 constraints]
After SMT, in 3020ms problems are : Problem set: 0 solved, 62 unsolved
Search for dead transitions found 0 dead transitions in 3020ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3136 ms. Remains : 63/63 places, 63/63 transitions.
RANDOM walk for 40000 steps (8979 resets) in 676 ms. (59 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (4083 resets) in 275 ms. (144 steps per ms) remains 2/2 properties
[2025-06-05 06:56:02] [INFO ] Flatten gal took : 35 ms
[2025-06-05 06:56:02] [INFO ] Flatten gal took : 20 ms
BEST_FIRST walk for 40002 steps (4092 resets) in 285 ms. (139 steps per ms) remains 2/2 properties
[2025-06-05 06:56:02] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16971309411034955232.gal : 5 ms
[2025-06-05 06:56:02] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9863139069577764959.prop : 0 ms
Finished probabilistic random walk after 1525 steps, run visited all 2 properties in 19 ms. (steps per millisecond=80 )
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/ReachabilityCardinality16971309411034955232.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9863139069577764959.prop' '--nowitness' '--gen-order' 'FOLLOW'
Probabilistic random walk after 1525 steps, saw 745 distinct states, run finished after 30 ms. (steps per millisecond=50 ) properties seen :2

ITS runner timed out or was interrupted.
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
ITS tools runner thread asked to quit. Dying gracefully.
FORMULA SieveSingleMsgMbox-PT-d2m06-UpperBounds-07 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 46596 ms.

BK_STOP 1749106563078

--------------------
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="SieveSingleMsgMbox-PT-d2m06"
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 SieveSingleMsgMbox-PT-d2m06, 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 r223-tall-174902009200058"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SieveSingleMsgMbox-PT-d2m06.tgz
mv SieveSingleMsgMbox-PT-d2m06 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 ;