Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r198-tall-174894533500839.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 itstools
Input is ShieldPPPt-PT-004B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r198-tall-174894533500839
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 6.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 176K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 5 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 74K 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 booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1749299623828

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-004B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202505121319
[2025-06-07 12:33:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-07 12:33:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 12:33:45] [INFO ] Load time of PNML (sax parser for PT used): 87 ms
[2025-06-07 12:33:45] [INFO ] Transformed 315 places.
[2025-06-07 12:33:45] [INFO ] Transformed 287 transitions.
[2025-06-07 12:33:45] [INFO ] Found NUPN structural information;
[2025-06-07 12:33:45] [INFO ] Parsed PT model containing 315 places and 287 transitions and 718 arcs in 180 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (8 resets) in 1113 ms. (35 steps per ms) remains 5/16 properties
FORMULA ShieldPPPt-PT-004B-ReachabilityFireability-2025-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-004B-ReachabilityFireability-2025-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-004B-ReachabilityFireability-2025-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-004B-ReachabilityFireability-2025-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-004B-ReachabilityFireability-2025-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-004B-ReachabilityFireability-2025-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-004B-ReachabilityFireability-2025-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-004B-ReachabilityFireability-2025-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-004B-ReachabilityFireability-2025-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-004B-ReachabilityFireability-2025-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-004B-ReachabilityFireability-2025-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-07 12:33:45] [INFO ] Flatten gal took : 55 ms
[2025-06-07 12:33:45] [INFO ] Flatten gal took : 28 ms
[2025-06-07 12:33:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9113904839951494001.gal : 24 ms
[2025-06-07 12:33:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17080615237950009388.prop : 6 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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9113904839951494001.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17080615237950009388.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (8 resets) in 403 ms. (99 steps per ms) remains 5/5 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality17080615237950009388.prop.
BEST_FIRST walk for 40003 steps (8 resets) in 462 ms. (86 steps per ms) remains 5/5 properties
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :5 after 6
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :6 after 13
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :13 after 76
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :76 after 1671
BEST_FIRST walk for 40003 steps (8 resets) in 1012 ms. (39 steps per ms) remains 4/5 properties
FORMULA ShieldPPPt-PT-004B-ReachabilityFireability-2025-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40002 steps (8 resets) in 143 ms. (277 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 3/4 properties
FORMULA ShieldPPPt-PT-004B-ReachabilityFireability-2025-14 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 287 rows 315 cols
[2025-06-07 12:33:46] [INFO ] Computed 45 invariants in 23 ms
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 77/77 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 238/315 variables, 45/122 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/315 variables, 238/360 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/315 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 287/602 variables, 315/675 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/602 variables, 0/675 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/602 variables, 0/675 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 602/602 variables, and 675 constraints, problems are : Problem set: 0 solved, 3 unsolved in 551 ms.
Refiners :[Domain max(s): 315/315 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 315/315 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 77/77 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 238/315 variables, 45/122 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/315 variables, 238/360 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:33:47] [INFO ] Deduced a trap composed of 12 places in 100 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:33:47] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:33:47] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:33:47] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:33:47] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:33:47] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:33:47] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:33:47] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:33:47] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/315 variables, 9/369 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/315 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 287/602 variables, 315/684 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/602 variables, 2/686 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:33:48] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:33:48] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:33:48] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/602 variables, 3/689 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:33:48] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/602 variables, 1/690 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/602 variables, 0/690 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/602 variables, 0/690 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 602/602 variables, and 690 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2035 ms.
Refiners :[Domain max(s): 315/315 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 315/315 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2693ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 1983 ms.
Support contains 77 out of 315 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 315/315 places, 287/287 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 315 transition count 254
Reduce places removed 33 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 35 rules applied. Total rules applied 68 place count 282 transition count 252
Reduce places removed 1 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 2 with 11 rules applied. Total rules applied 79 place count 281 transition count 242
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 89 place count 271 transition count 242
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 19 Pre rules applied. Total rules applied 89 place count 271 transition count 223
Deduced a syphon composed of 19 places in 2 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 127 place count 252 transition count 223
Discarding 19 places :
Symmetric choice reduction at 4 with 19 rule applications. Total rules 146 place count 233 transition count 204
Iterating global reduction 4 with 19 rules applied. Total rules applied 165 place count 233 transition count 204
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 165 place count 233 transition count 198
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 177 place count 227 transition count 198
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 4 with 70 rules applied. Total rules applied 247 place count 192 transition count 163
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 253 place count 189 transition count 163
Free-agglomeration rule applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 257 place count 189 transition count 159
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 261 place count 185 transition count 159
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 266 place count 185 transition count 159
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 267 place count 185 transition count 159
Applied a total of 267 rules in 104 ms. Remains 185 /315 variables (removed 130) and now considering 159/287 (removed 128) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 111 ms. Remains : 185/315 places, 159/287 transitions.
RANDOM walk for 40000 steps (8 resets) in 427 ms. (93 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 145 ms. (274 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 178 ms. (223 steps per ms) remains 2/3 properties
FORMULA ShieldPPPt-PT-004B-ReachabilityFireability-2025-11 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 134 ms. (296 steps per ms) remains 2/2 properties
// Phase 1: matrix 159 rows 185 cols
[2025-06-07 12:33:51] [INFO ] Computed 45 invariants in 1 ms
[2025-06-07 12:33:51] [INFO ] State equation strengthened by 4 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 145/185 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 159/344 variables, 185/230 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/344 variables, 4/234 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/344 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/344 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 344/344 variables, and 234 constraints, problems are : Problem set: 0 solved, 2 unsolved in 127 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 185/185 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 145/185 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:33:51] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:33:51] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:33:51] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:33:51] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:33:51] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:33:51] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:33:51] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:33:52] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:33:52] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:33:52] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 10/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 159/344 variables, 185/240 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/344 variables, 4/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/344 variables, 2/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:33:52] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:33:52] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:33:52] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/344 variables, 3/249 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:33:52] [INFO ] Deduced a trap along path composed of 2 places in 35 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:33:52] [INFO ] Deduced a trap along path composed of 2 places in 29 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:33:52] [INFO ] Deduced a trap along path composed of 5 places in 34 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:33:52] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/344 variables, 4/253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:33:52] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:33:53] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/344 variables, 2/255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/344 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/344 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 344/344 variables, and 255 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1687 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 185/185 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 1828ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 78 ms.
Support contains 40 out of 185 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 185/185 places, 159/159 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 185 transition count 150
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 10 rules applied. Total rules applied 19 place count 176 transition count 149
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 20 place count 175 transition count 149
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 20 place count 175 transition count 144
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 30 place count 170 transition count 144
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 33 place count 167 transition count 141
Iterating global reduction 3 with 3 rules applied. Total rules applied 36 place count 167 transition count 141
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 76 place count 147 transition count 121
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 84 place count 143 transition count 121
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 89 place count 143 transition count 121
Applied a total of 89 rules in 40 ms. Remains 143 /185 variables (removed 42) and now considering 121/159 (removed 38) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 143/185 places, 121/159 transitions.
RANDOM walk for 40000 steps (8 resets) in 216 ms. (184 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 163 ms. (243 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 153 ms. (259 steps per ms) remains 2/2 properties
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :1671 after 1.38945e+06
Interrupted probabilistic random walk after 558288 steps, run timeout after 3001 ms. (steps per millisecond=186 ) properties seen :0 out of 2
Probabilistic random walk after 558288 steps, saw 343956 distinct states, run finished after 3006 ms. (steps per millisecond=185 ) properties seen :0
// Phase 1: matrix 121 rows 143 cols
[2025-06-07 12:33:56] [INFO ] Computed 45 invariants in 1 ms
[2025-06-07 12:33:56] [INFO ] State equation strengthened by 12 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 103/143 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 121/264 variables, 143/188 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 12/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/264 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/264 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 264/264 variables, and 200 constraints, problems are : Problem set: 0 solved, 2 unsolved in 121 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 143/143 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 103/143 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:33:56] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:33:56] [INFO ] Deduced a trap composed of 7 places in 115 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:33:56] [INFO ] Deduced a trap composed of 7 places in 103 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:33:57] [INFO ] Deduced a trap composed of 7 places in 258 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:33:57] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:33:57] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:33:57] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:33:57] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 8/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:33:57] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:33:57] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 121/264 variables, 143/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/264 variables, 12/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/264 variables, 2/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:33:57] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:33:57] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/264 variables, 2/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:33:57] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/264 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:33:57] [INFO ] Deduced a trap along path composed of 2 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:33:57] [INFO ] Deduced a trap along path composed of 2 places in 18 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:33:57] [INFO ] Deduced a trap along path composed of 2 places in 18 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/264 variables, 3/218 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/264 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/264 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 264/264 variables, and 218 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1533 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 143/143 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 1676ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 260 ms.
Support contains 40 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 121/121 transitions.
Applied a total of 0 rules in 5 ms. Remains 143 /143 variables (removed 0) and now considering 121/121 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 143/143 places, 121/121 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 121/121 transitions.
Applied a total of 0 rules in 3 ms. Remains 143 /143 variables (removed 0) and now considering 121/121 (removed 0) transitions.
[2025-06-07 12:33:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 12:33:58] [INFO ] Implicit Places using invariants in 423 ms returned [132]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 434 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 142/143 places, 121/121 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 142 transition count 120
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 141 transition count 120
Applied a total of 2 rules in 5 ms. Remains 141 /142 variables (removed 1) and now considering 120/121 (removed 1) transitions.
// Phase 1: matrix 120 rows 141 cols
[2025-06-07 12:33:58] [INFO ] Computed 44 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 12:33:59] [INFO ] Implicit Places using invariants in 175 ms returned [124]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 176 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 140/143 places, 120/121 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 139 transition count 119
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 139 transition count 119
Applied a total of 2 rules in 7 ms. Remains 139 /140 variables (removed 1) and now considering 119/120 (removed 1) transitions.
// Phase 1: matrix 119 rows 139 cols
[2025-06-07 12:33:59] [INFO ] Computed 43 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 12:33:59] [INFO ] Implicit Places using invariants in 342 ms returned []
[2025-06-07 12:33:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 12:33:59] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-07 12:33:59] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 467 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 139/143 places, 119/121 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1092 ms. Remains : 139/143 places, 119/121 transitions.
RANDOM walk for 40000 steps (8 resets) in 324 ms. (123 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 162 ms. (245 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 152 ms. (261 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 717773 steps, run timeout after 3001 ms. (steps per millisecond=239 ) properties seen :0 out of 2
Probabilistic random walk after 717773 steps, saw 446623 distinct states, run finished after 3001 ms. (steps per millisecond=239 ) properties seen :0
[2025-06-07 12:34:02] [INFO ] Invariant cache hit.
[2025-06-07 12:34:02] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 99/139 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 119/258 variables, 139/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 10/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/258 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 192 constraints, problems are : Problem set: 0 solved, 2 unsolved in 125 ms.
Refiners :[Positive P Invariants (semi-flows): 43/43 constraints, State Equation: 139/139 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 99/139 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:34:03] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:34:03] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:34:03] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:34:03] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:34:03] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:34:03] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:34:03] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 7/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:34:03] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:34:03] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 119/258 variables, 139/191 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 10/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/258 variables, 2/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:34:03] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:34:03] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/258 variables, 2/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:34:03] [INFO ] Deduced a trap composed of 10 places in 96 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/258 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:34:03] [INFO ] Deduced a trap along path composed of 2 places in 29 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:34:04] [INFO ] Deduced a trap along path composed of 2 places in 14 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/258 variables, 2/208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:34:04] [INFO ] Deduced a trap along path composed of 2 places in 17 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:34:04] [INFO ] Deduced a trap along path composed of 3 places in 16 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/258 variables, 2/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/258 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/258 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 258/258 variables, and 210 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1516 ms.
Refiners :[Positive P Invariants (semi-flows): 43/43 constraints, State Equation: 139/139 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 1657ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 141 ms.
Support contains 40 out of 139 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 139/139 places, 119/119 transitions.
Applied a total of 0 rules in 4 ms. Remains 139 /139 variables (removed 0) and now considering 119/119 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 139/139 places, 119/119 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 139/139 places, 119/119 transitions.
Applied a total of 0 rules in 4 ms. Remains 139 /139 variables (removed 0) and now considering 119/119 (removed 0) transitions.
[2025-06-07 12:34:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 12:34:05] [INFO ] Implicit Places using invariants in 392 ms returned []
[2025-06-07 12:34:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 12:34:05] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-07 12:34:05] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 511 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 12:34:05] [INFO ] Redundant transitions in 2 ms returned []
Running 118 sub problems to find dead transitions.
[2025-06-07 12:34:05] [INFO ] Invariant cache hit.
[2025-06-07 12:34:05] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (OVERLAPS) 1/139 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 118 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:34:05] [INFO ] Deduced a trap composed of 7 places in 16 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:34:06] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:34:06] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:34:06] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:34:06] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:34:06] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:34:06] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:34:06] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:34:06] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:34:06] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:34:06] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:34:06] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:34:06] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:34:06] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:34:06] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:34:06] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:34:06] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:34:06] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:34:07] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:34:07] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 118 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:34:07] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:34:07] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:34:07] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 3/66 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (OVERLAPS) 119/258 variables, 139/205 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 10/215 constraints. Problems are: Problem set: 0 solved, 118 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:34:08] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/258 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 118 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:34:09] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:34:09] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/258 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 118 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:34:09] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:34:09] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:34:10] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/258 variables, 3/221 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/258 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 118 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:34:11] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 2 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/258 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/258 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 13 (OVERLAPS) 0/258 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 222 constraints, problems are : Problem set: 0 solved, 118 unsolved in 7410 ms.
Refiners :[Positive P Invariants (semi-flows): 43/43 constraints, State Equation: 139/139 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 30/30 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 118 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (OVERLAPS) 1/139 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 30/73 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (OVERLAPS) 119/258 variables, 139/212 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 10/222 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 118/340 constraints. Problems are: Problem set: 0 solved, 118 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:34:14] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:34:14] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:34:14] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:34:14] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:34:14] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/258 variables, 5/345 constraints. Problems are: Problem set: 0 solved, 118 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:34:16] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/258 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 118 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:34:18] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:34:18] [INFO ] Deduced a trap along path composed of 2 places in 14 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:34:18] [INFO ] Deduced a trap along path composed of 2 places in 15 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:34:18] [INFO ] Deduced a trap along path composed of 2 places in 20 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:34:18] [INFO ] Deduced a trap along path composed of 3 places in 16 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:34:18] [INFO ] Deduced a trap along path composed of 3 places in 15 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:34:18] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:34:19] [INFO ] Deduced a trap along path composed of 3 places in 16 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:34:19] [INFO ] Deduced a trap along path composed of 2 places in 14 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/258 variables, 9/355 constraints. Problems are: Problem set: 0 solved, 118 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:34:25] [INFO ] Deduced a trap along path composed of 2 places in 16 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/258 variables, 1/356 constraints. Problems are: Problem set: 0 solved, 118 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:34:30] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:34:31] [INFO ] Deduced a trap along path composed of 3 places in 18 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/258 variables, 2/358 constraints. Problems are: Problem set: 0 solved, 118 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:34:35] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/258 variables, 1/359 constraints. Problems are: Problem set: 0 solved, 118 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 258/258 variables, and 359 constraints, problems are : Problem set: 0 solved, 118 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 43/43 constraints, State Equation: 139/139 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 37/37 constraints, Known Traps Along Path: 12/12 constraints]
After SMT, in 37461ms problems are : Problem set: 0 solved, 118 unsolved
Search for dead transitions found 0 dead transitions in 37462ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37986 ms. Remains : 139/139 places, 119/119 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 139 transition count 119
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 139 transition count 118
Applied a total of 7 rules in 9 ms. Remains 139 /139 variables (removed 0) and now considering 118/119 (removed 1) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 118 rows 139 cols
[2025-06-07 12:34:42] [INFO ] Computed 43 invariants in 1 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-07 12:34:42] [INFO ] After 138ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-07 12:34:42] [INFO ] [Nat]Absence check using 43 positive place invariants in 5 ms returned sat
[2025-06-07 12:34:42] [INFO ] After 73ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2025-06-07 12:34:42] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-06-07 12:34:42] [INFO ] After 39ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:34:43] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:34:43] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:34:43] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:34:43] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:34:43] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2025-06-07 12:34:43] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 192 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:34:43] [INFO ] Deduced a trap composed of 6 places in 97 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:34:43] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:34:43] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:34:43] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:34:43] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:34:43] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:34:43] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:34:43] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 3 ms to minimize.
[2025-06-07 12:34:43] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 457 ms
TRAPS : Iteration 1
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:34:43] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:34:43] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 2 ms to minimize.
[2025-06-07 12:34:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 92 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:34:43] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:34:43] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 3 ms to minimize.
[2025-06-07 12:34:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 91 ms
TRAPS : Iteration 2
[2025-06-07 12:34:43] [INFO ] After 1029ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2025-06-07 12:34:43] [INFO ] After 1216ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2025-06-07 12:34:44] [INFO ] Flatten gal took : 20 ms
[2025-06-07 12:34:44] [INFO ] Flatten gal took : 13 ms
[2025-06-07 12:34:44] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10358854760151122717.gal : 4 ms
[2025-06-07 12:34:44] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8545585039589591976.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10358854760151122717.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8545585039589591976.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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality8545585039589591976.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 15
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :15 after 21
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :21 after 78
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :78 after 952
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :952 after 47801
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :47801 after 49013
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :49013 after 52580
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :52580 after 100360
Detected timeout of ITS tools.
[2025-06-07 12:34:59] [INFO ] Flatten gal took : 13 ms
[2025-06-07 12:34:59] [INFO ] Applying decomposition
[2025-06-07 12:34:59] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph16774504792350938972.txt' '-o' '/tmp/graph16774504792350938972.bin' '-w' '/tmp/graph16774504792350938972.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16774504792350938972.bin' '-l' '-1' '-v' '-w' '/tmp/graph16774504792350938972.weights' '-q' '0' '-e' '0.001'
[2025-06-07 12:34:59] [INFO ] Decomposing Gal with order
[2025-06-07 12:34:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 12:34:59] [INFO ] Removed a total of 27 redundant transitions.
[2025-06-07 12:34:59] [INFO ] Flatten gal took : 38 ms
[2025-06-07 12:34:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 5 ms.
[2025-06-07 12:34:59] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15881721558505553867.gal : 4 ms
[2025-06-07 12:34:59] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality661099186502969769.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15881721558505553867.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality661099186502969769.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality661099186502969769.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 12
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :12 after 16
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :16 after 77
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :77 after 24711
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :247101 after 3.55123e+06
Reachability property ShieldPPPt-PT-004B-ReachabilityFireability-2025-13 is true.
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 31713 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-07 12:35:14] [INFO ] Flatten gal took : 12 ms
[2025-06-07 12:35:14] [INFO ] Applying decomposition
[2025-06-07 12:35:14] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph2970904708518453400.txt' '-o' '/tmp/graph2970904708518453400.bin' '-w' '/tmp/graph2970904708518453400.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2970904708518453400.bin' '-l' '-1' '-v' '-w' '/tmp/graph2970904708518453400.weights' '-q' '0' '-e' '0.001'
[2025-06-07 12:35:14] [INFO ] Decomposing Gal with order
[2025-06-07 12:35:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 12:35:14] [INFO ] Removed a total of 24 redundant transitions.
[2025-06-07 12:35:14] [INFO ] Flatten gal took : 29 ms
[2025-06-07 12:35:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2025-06-07 12:35:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15240481716184812657.gal : 5 ms
[2025-06-07 12:35:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11119258639811815584.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15240481716184812657.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11119258639811815584.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality11119258639811815584.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1 after 2.22659e+09
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :3.76158e+10 after 4.09318e+12
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :4.09318e+12 after 2.57184e+13
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,3.10072e+27,122.856,2009884,9628,56,2.66786e+06,619,708,8.11412e+06,73,2743,0
Total reachable state count : 3100720960797397340527788032

Verifying 2 reachability properties.
Invariant property ShieldPPPt-PT-004B-ReachabilityFireability-2025-06 is true.
FORMULA ShieldPPPt-PT-004B-ReachabilityFireability-2025-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldPPPt-PT-004B-ReachabilityFireability-2025-06,0,123.671,2009884,1,0,2.66786e+06,619,727,8.11412e+06,79,2743,15937
Reachability property ShieldPPPt-PT-004B-ReachabilityFireability-2025-13 is true.
FORMULA ShieldPPPt-PT-004B-ReachabilityFireability-2025-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldPPPt-PT-004B-ReachabilityFireability-2025-13,2.87318e+08,123.735,2009884,140,31,2.66786e+06,619,791,8.11412e+06,83,2743,20552
All properties solved without resorting to model-checking.
Total runtime 213366 ms.

BK_STOP 1749299838456

--------------------
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
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -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
++ 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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -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="ShieldPPPt-PT-004B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is ShieldPPPt-PT-004B, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r198-tall-174894533500839"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-004B.tgz
mv ShieldPPPt-PT-004B execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;