Execution Chart

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

Trace from the execution

Formatting '/data/sdalzilio/mcc2026-input.r002-oct2-177944366200326.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/sdalzilio/mcc2026-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5973
Executing tool itstools
Input is ASLink-PT-03b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002-oct2-177944366200326
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 988K
-rw-r--r-- 1 mcc users 5.0K Mar 5 14:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 46K Mar 5 14:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Mar 5 14:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Mar 5 14:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Mar 15 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 15 07:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 07:08 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 07:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Mar 5 14:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 154K Mar 5 14:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Mar 5 14:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Mar 5 14:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 07:08 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 07:08 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 544K Mar 3 18:30 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 ASLink-PT-03b-ReachabilityCardinality-2024-00
FORMULA_NAME ASLink-PT-03b-ReachabilityCardinality-2024-01
FORMULA_NAME ASLink-PT-03b-ReachabilityCardinality-2024-02
FORMULA_NAME ASLink-PT-03b-ReachabilityCardinality-2024-03
FORMULA_NAME ASLink-PT-03b-ReachabilityCardinality-2024-04
FORMULA_NAME ASLink-PT-03b-ReachabilityCardinality-2024-05
FORMULA_NAME ASLink-PT-03b-ReachabilityCardinality-2024-06
FORMULA_NAME ASLink-PT-03b-ReachabilityCardinality-2024-07
FORMULA_NAME ASLink-PT-03b-ReachabilityCardinality-2024-08
FORMULA_NAME ASLink-PT-03b-ReachabilityCardinality-2024-09
FORMULA_NAME ASLink-PT-03b-ReachabilityCardinality-2024-10
FORMULA_NAME ASLink-PT-03b-ReachabilityCardinality-2024-11
FORMULA_NAME ASLink-PT-03b-ReachabilityCardinality-2024-12
FORMULA_NAME ASLink-PT-03b-ReachabilityCardinality-2024-13
FORMULA_NAME ASLink-PT-03b-ReachabilityCardinality-2024-14
FORMULA_NAME ASLink-PT-03b-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779473194327

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-03b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202604301425
[2026-05-22 18:06:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-22 18:06:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 18:06:35] [INFO ] Load time of PNML (sax parser for PT used): 166 ms
[2026-05-22 18:06:35] [INFO ] Transformed 1638 places.
[2026-05-22 18:06:35] [INFO ] Transformed 2094 transitions.
[2026-05-22 18:06:35] [INFO ] Found NUPN structural information;
[2026-05-22 18:06:35] [INFO ] Parsed PT model containing 1638 places and 2094 transitions and 6458 arcs in 328 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 34 ms.
Working with output stream class java.io.PrintStream
FORMULA ASLink-PT-03b-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-03b-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-03b-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-03b-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (114 resets) in 1544 ms. (25 steps per ms) remains 5/12 properties
FORMULA ASLink-PT-03b-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03b-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03b-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03b-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03b-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03b-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03b-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (18 resets) in 484 ms. (82 steps per ms) remains 4/5 properties
FORMULA ASLink-PT-03b-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40002 steps (18 resets) in 176 ms. (226 steps per ms) remains 4/4 properties
[2026-05-22 18:06:36] [INFO ] Flatten gal took : 315 ms
BEST_FIRST walk for 40003 steps (20 resets) in 514 ms. (77 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (14 resets) in 273 ms. (146 steps per ms) remains 4/4 properties
[2026-05-22 18:06:37] [INFO ] Flatten gal took : 219 ms
BEST_FIRST walk for 40003 steps (19 resets) in 211 ms. (188 steps per ms) remains 4/4 properties
[2026-05-22 18:06:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14147070352302054498.gal : 67 ms
[2026-05-22 18:06:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4252000264136136840.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14147070352302054498.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4252000264136136840.prop' '--nowitness' '--gen-order' 'FOLLOW'
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11894827312915112215.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13146534648486356272.kers'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
[2026-05-22 18:06:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11894827312915112215.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13146534648486356272.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 2094 rows 1638 cols 6458 entries
Finished phase 1 with 1093 SingleSign rule and 385 generalized
[2026-05-22 18:06:37] [INFO ] Computed 160 invariants in 17 ms
Computed 160 P flows in 19 ms.
Exported basis to /tmp/petrispot-output-13146534648486356272.kers
Total runtime 21 ms.
Excessive predecessor constraint size, skipping predecessor.
Loading property file /tmp/ReachabilityCardinality4252000264136136840.prop.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 110/110 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 558/668 variables, 29/139 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/668 variables, 558/697 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/668 variables, 0/697 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 22/690 variables, 3/700 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/690 variables, 22/722 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/690 variables, 0/722 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 895/1585 variables, 110/832 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :5 after 9
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :9 after 15
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :15 after 48
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :48 after 195
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :195 after 415
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :415 after 576
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :576 after 28824
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :28824 after 618138
At refinement iteration 9 (INCLUDED_ONLY) 0/1585 variables, 895/1727 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :618138 after 1.55917e+08
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :1.55917e+08 after 3.8973e+11
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :3.8973e+11 after 3.42095e+15
At refinement iteration 10 (INCLUDED_ONLY) 0/1585 variables, 0/1727 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 53/1638 variables, 18/1745 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1638 variables, 53/1798 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1638/3732 variables, and 1798 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5039 ms.
Refiners :[Domain max(s): 1638/1638 constraints, Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 128/128 constraints, State Equation: 0/1638 constraints, PredecessorRefiner: 4/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 110/110 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 558/668 variables, 29/139 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/668 variables, 558/697 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/668 variables, 2/699 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/668 variables, 2/701 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/668 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 22/690 variables, 3/704 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/690 variables, 22/726 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/690 variables, 0/726 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 895/1585 variables, 110/836 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1585 variables, 895/1731 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SMT process timed out in 10826ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 110 out of 1638 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1638/1638 places, 2094/2094 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 282 transitions
Trivial Post-agglo rules discarded 282 transitions
Performed 282 trivial Post agglomeration. Transition count delta: 282
Iterating post reduction 0 with 282 rules applied. Total rules applied 282 place count 1638 transition count 1812
Reduce places removed 282 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Iterating post reduction 1 with 317 rules applied. Total rules applied 599 place count 1356 transition count 1777
Reduce places removed 31 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 35 rules applied. Total rules applied 634 place count 1325 transition count 1773
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 635 place count 1324 transition count 1773
Performed 334 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 334 Pre rules applied. Total rules applied 635 place count 1324 transition count 1439
Deduced a syphon composed of 334 places in 4 ms
Ensure Unique test removed 18 places
Reduce places removed 352 places and 0 transitions.
Iterating global reduction 4 with 686 rules applied. Total rules applied 1321 place count 972 transition count 1439
Discarding 7 places :
Implicit places reduction removed 7 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 4 with 21 rules applied. Total rules applied 1342 place count 965 transition count 1425
Reduce places removed 14 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 15 rules applied. Total rules applied 1357 place count 951 transition count 1424
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1358 place count 950 transition count 1424
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 5 Pre rules applied. Total rules applied 1358 place count 950 transition count 1419
Deduced a syphon composed of 5 places in 6 ms
Ensure Unique test removed 2 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 7 with 12 rules applied. Total rules applied 1370 place count 943 transition count 1419
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 2 Pre rules applied. Total rules applied 1370 place count 943 transition count 1417
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 1374 place count 941 transition count 1417
Discarding 48 places :
Symmetric choice reduction at 7 with 48 rule applications. Total rules 1422 place count 893 transition count 1369
Iterating global reduction 7 with 48 rules applied. Total rules applied 1470 place count 893 transition count 1369
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1471 place count 893 transition count 1368
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 10 Pre rules applied. Total rules applied 1471 place count 893 transition count 1358
Deduced a syphon composed of 10 places in 5 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 8 with 20 rules applied. Total rules applied 1491 place count 883 transition count 1358
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1495 place count 879 transition count 1331
Iterating global reduction 8 with 4 rules applied. Total rules applied 1499 place count 879 transition count 1331
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 2 Pre rules applied. Total rules applied 1499 place count 879 transition count 1329
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 1503 place count 877 transition count 1329
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1504 place count 876 transition count 1321
Iterating global reduction 8 with 1 rules applied. Total rules applied 1505 place count 876 transition count 1321
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1506 place count 875 transition count 1313
Iterating global reduction 8 with 1 rules applied. Total rules applied 1507 place count 875 transition count 1313
Performed 94 Post agglomeration using F-continuation condition.Transition count delta: 94
Deduced a syphon composed of 94 places in 3 ms
Ensure Unique test removed 4 places
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 8 with 192 rules applied. Total rules applied 1699 place count 777 transition count 1219
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1700 place count 776 transition count 1218
Ensure Unique test removed 1 places
Iterating global reduction 8 with 2 rules applied. Total rules applied 1702 place count 775 transition count 1218
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1703 place count 774 transition count 1217
Iterating global reduction 8 with 1 rules applied. Total rules applied 1704 place count 774 transition count 1217
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1705 place count 774 transition count 1216
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 1709 place count 772 transition count 1228
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 1711 place count 772 transition count 1226
Free-agglomeration rule applied 13 times.
Iterating global reduction 9 with 13 rules applied. Total rules applied 1724 place count 772 transition count 1213
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 9 with 13 rules applied. Total rules applied 1737 place count 759 transition count 1213
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 10 with 6 rules applied. Total rules applied 1743 place count 759 transition count 1207
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 1749 place count 753 transition count 1207
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 1750 place count 753 transition count 1207
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1751 place count 752 transition count 1206
Applied a total of 1751 rules in 890 ms. Remains 752 /1638 variables (removed 886) and now considering 1206/2094 (removed 888) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 898 ms. Remains : 752/1638 places, 1206/2094 transitions.
RANDOM walk for 40000 steps (338 resets) in 481 ms. (82 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (73 resets) in 132 ms. (300 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (72 resets) in 202 ms. (197 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (61 resets) in 331 ms. (120 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (78 resets) in 222 ms. (179 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 222123 steps, run timeout after 3001 ms. (steps per millisecond=74 ) properties seen :0 out of 4
Probabilistic random walk after 222123 steps, saw 57711 distinct states, run finished after 3029 ms. (steps per millisecond=73 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17725009868099906854.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9644138757455813022.kers'
[2026-05-22 18:06:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17725009868099906854.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9644138757455813022.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 1206 rows 747 cols 4555 entries
Finished phase 1 with 238 SingleSign rule and 386 generalized
[2026-05-22 18:06:52] [INFO ] Computed 128 invariants in 8 ms
Computed 128 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-9644138757455813022.kers
Total runtime 10 ms.
[2026-05-22 18:06:52] [INFO ] State equation strengthened by 8 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 286/396 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/396 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 31/427 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/427 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 307/734 variables, 80/116 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/734 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 1/735 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/735 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 17/752 variables, 11/128 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/752 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 1206/1958 variables, 752/880 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1958 variables, 8/888 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1958 variables, 0/888 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/1958 variables, 0/888 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1958/1958 variables, and 888 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2125 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 91/91 constraints, State Equation: 752/752 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 4/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 286/396 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/396 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 31/427 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/427 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/427 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 307/734 variables, 80/117 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/734 variables, 3/120 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/734 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 1/735 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/735 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 17/752 variables, 11/132 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/752 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 1206/1958 variables, 752/884 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1958 variables, 8/892 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1958 variables, 3/895 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1958 variables, 1/896 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1958 variables, 3/899 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1958 variables, 1/900 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1958 variables, 1/901 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1958 variables, 0/901 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 0/1958 variables, 0/901 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1958/1958 variables, and 901 constraints, problems are : Problem set: 0 solved, 4 unsolved in 16707 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 91/91 constraints, State Equation: 752/752 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 4/3 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 18917ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 8855 ms.
Support contains 110 out of 752 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 752/752 places, 1206/1206 transitions.
Applied a total of 0 rules in 24 ms. Remains 752 /752 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 752/752 places, 1206/1206 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 752/752 places, 1206/1206 transitions.
Applied a total of 0 rules in 22 ms. Remains 752 /752 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
[2026-05-22 18:07:20] [INFO ] Invariant cache hit.
[2026-05-22 18:07:20] [INFO ] Implicit Places using invariants in 577 ms returned [1, 21, 26, 40, 59, 80, 142, 143, 158, 173, 203, 204, 205, 206, 207, 230, 248, 315, 339, 374, 379, 419, 480, 498, 512, 513, 538, 549, 550, 553, 595, 599, 618, 619, 626, 641, 647, 653, 659, 665, 671, 677, 683, 689, 695, 701, 731, 732, 751]
[2026-05-22 18:07:20] [INFO ] Actually due to overlaps returned [751, 40, 59, 230, 379, 599, 205, 206, 207, 374, 553, 595, 618, 1, 80, 203, 248, 419, 549, 671, 689, 701, 21, 26, 142, 158, 204, 339, 498, 512, 538, 550, 619, 626, 641, 647, 653, 659, 665, 677, 683, 695, 731]
Discarding 43 places :
Implicit Place search using SMT only with invariants took 599 ms to find 43 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 709/752 places, 1206/1206 transitions.
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 703 transition count 1185
Reduce places removed 21 places and 0 transitions.
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Iterating post reduction 1 with 47 rules applied. Total rules applied 74 place count 682 transition count 1159
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 2 with 26 rules applied. Total rules applied 100 place count 656 transition count 1159
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 100 place count 656 transition count 1151
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 116 place count 648 transition count 1151
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 4 rules applied. Total rules applied 120 place count 646 transition count 1149
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 122 place count 644 transition count 1149
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 122 place count 644 transition count 1148
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 124 place count 643 transition count 1148
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 133 place count 634 transition count 1139
Iterating global reduction 5 with 9 rules applied. Total rules applied 142 place count 634 transition count 1139
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 145 place count 631 transition count 1136
Iterating global reduction 5 with 3 rules applied. Total rules applied 148 place count 631 transition count 1136
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 151 place count 628 transition count 1130
Iterating global reduction 5 with 3 rules applied. Total rules applied 154 place count 628 transition count 1130
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 2 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 5 with 36 rules applied. Total rules applied 190 place count 610 transition count 1112
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 191 place count 609 transition count 1111
Iterating global reduction 5 with 1 rules applied. Total rules applied 192 place count 609 transition count 1111
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 193 place count 609 transition count 1110
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 6 with 16 rules applied. Total rules applied 209 place count 609 transition count 1094
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 6 with 16 rules applied. Total rules applied 225 place count 593 transition count 1094
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 229 place count 593 transition count 1094
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 230 place count 593 transition count 1094
Applied a total of 230 rules in 251 ms. Remains 593 /709 variables (removed 116) and now considering 1094/1206 (removed 112) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3155463644734660978.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1070152629615071234.kers'
[2026-05-22 18:07:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3155463644734660978.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1070152629615071234.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 1094 rows 591 cols 4116 entries
Finished phase 1 with 257 SingleSign rule and 259 generalized
[2026-05-22 18:07:21] [INFO ] Computed 77 invariants in 6 ms
Computed 77 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-1070152629615071234.kers
Total runtime 10 ms.
[2026-05-22 18:07:21] [INFO ] Implicit Places using invariants in 342 ms returned [89, 266, 434]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 346 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 590/752 places, 1094/1206 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 589 transition count 1093
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 589 transition count 1092
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 588 transition count 1092
Applied a total of 4 rules in 67 ms. Remains 588 /590 variables (removed 2) and now considering 1092/1094 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1638453876441605228.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1718248434797861594.kers'
[2026-05-22 18:07:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1638453876441605228.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1718248434797861594.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 1092 rows 586 cols 4120 entries
Finished phase 1 with 239 SingleSign rule and 275 generalized
[2026-05-22 18:07:21] [INFO ] Computed 74 invariants in 6 ms
Computed 74 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-1718248434797861594.kers
Total runtime 7 ms.
[2026-05-22 18:07:21] [INFO ] Implicit Places using invariants in 313 ms returned []
[2026-05-22 18:07:21] [INFO ] Invariant cache hit.
[2026-05-22 18:07:22] [INFO ] State equation strengthened by 4 read => feed constraints.
[2026-05-22 18:07:23] [INFO ] Implicit Places using invariants and state equation in 1591 ms returned []
Implicit Place search using SMT with State Equation took 1907 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 588/752 places, 1092/1206 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 3196 ms. Remains : 588/752 places, 1092/1206 transitions.
RANDOM walk for 40000 steps (377 resets) in 239 ms. (166 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (84 resets) in 69 ms. (571 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (76 resets) in 105 ms. (377 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (70 resets) in 125 ms. (317 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (105 resets) in 99 ms. (400 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 297812 steps, run timeout after 3001 ms. (steps per millisecond=99 ) properties seen :0 out of 4
Probabilistic random walk after 297812 steps, saw 156995 distinct states, run finished after 3001 ms. (steps per millisecond=99 ) properties seen :0
[2026-05-22 18:07:26] [INFO ] Invariant cache hit.
[2026-05-22 18:07:26] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 180/290 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/290 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 30/320 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/320 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 264/584 variables, 50/72 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/584 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 4/588 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/588 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 1092/1680 variables, 588/662 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1680 variables, 4/666 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1680 variables, 0/666 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/1680 variables, 0/666 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1680/1680 variables, and 666 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1565 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 52/52 constraints, State Equation: 588/588 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 180/290 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/290 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/290 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 30/320 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/320 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 264/584 variables, 50/73 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/584 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/584 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 4/588 variables, 2/76 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/588 variables, 3/79 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/588 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 1092/1680 variables, 588/667 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1680 variables, 4/671 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1680 variables, 3/674 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1680 variables, 3/677 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1680 variables, 0/677 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/1680 variables, 1/678 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1680 variables, 0/678 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 0/1680 variables, 0/678 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1680/1680 variables, and 678 constraints, problems are : Problem set: 0 solved, 4 unsolved in 29895 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 52/52 constraints, State Equation: 588/588 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/3 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 31495ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 30129 ms.
Support contains 110 out of 588 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 588/588 places, 1092/1092 transitions.
Applied a total of 0 rules in 18 ms. Remains 588 /588 variables (removed 0) and now considering 1092/1092 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 588/588 places, 1092/1092 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 588/588 places, 1092/1092 transitions.
Applied a total of 0 rules in 15 ms. Remains 588 /588 variables (removed 0) and now considering 1092/1092 (removed 0) transitions.
[2026-05-22 18:08:28] [INFO ] Invariant cache hit.
[2026-05-22 18:08:28] [INFO ] Implicit Places using invariants in 310 ms returned []
[2026-05-22 18:08:28] [INFO ] Invariant cache hit.
[2026-05-22 18:08:28] [INFO ] State equation strengthened by 4 read => feed constraints.
[2026-05-22 18:08:30] [INFO ] Implicit Places using invariants and state equation in 1598 ms returned []
Implicit Place search using SMT with State Equation took 1914 ms to find 0 implicit places.
[2026-05-22 18:08:30] [INFO ] Redundant transitions in 102 ms returned []
Running 1078 sub problems to find dead transitions.
[2026-05-22 18:08:30] [INFO ] Invariant cache hit.
[2026-05-22 18:08:30] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/583 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1078 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/583 variables, 36/45 constraints. Problems are: Problem set: 0 solved, 1078 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/583 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 1078 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 583/1680 variables, and 46 constraints, problems are : Problem set: 0 solved, 1078 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 9/22 constraints, Generalized P Invariants (flows): 36/52 constraints, State Equation: 0/588 constraints, ReadFeed: 0/4 constraints, PredecessorRefiner: 1078/1078 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1078 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/583 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1078 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/583 variables, 36/45 constraints. Problems are: Problem set: 0 solved, 1078 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/583 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 1078 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 583/1680 variables, and 46 constraints, problems are : Problem set: 0 solved, 1078 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 9/22 constraints, Generalized P Invariants (flows): 36/52 constraints, State Equation: 0/588 constraints, ReadFeed: 0/4 constraints, PredecessorRefiner: 0/1078 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60434ms problems are : Problem set: 0 solved, 1078 unsolved
Search for dead transitions found 0 dead transitions in 60466ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62545 ms. Remains : 588/588 places, 1092/1092 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 588 transition count 1088
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 584 transition count 1088
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 584 transition count 1087
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 10 place count 583 transition count 1087
Applied a total of 10 rules in 51 ms. Remains 583 /588 variables (removed 5) and now considering 1087/1092 (removed 5) transitions.
Running SMT prover for 4 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11722707510523829517.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5700739411845469261.kers'
[2026-05-22 18:09:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11722707510523829517.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5700739411845469261.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 1087 rows 581 cols 4110 entries
Finished phase 1 with 233 SingleSign rule and 276 generalized
[2026-05-22 18:09:30] [INFO ] Computed 74 invariants in 9 ms
Computed 74 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-5700739411845469261.kers
Total runtime 11 ms.
[2026-05-22 18:09:31] [INFO ] After 101ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2026-05-22 18:09:31] [INFO ] [Nat]Absence check using 24 positive place invariants in 6 ms returned sat
[2026-05-22 18:09:31] [INFO ] [Nat]Absence check using 24 positive and 50 generalized place invariants in 15 ms returned sat
[2026-05-22 18:09:32] [INFO ] After 1066ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2026-05-22 18:09:34] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2205 ms
[2026-05-22 18:09:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 376 ms
TRAPS : Iteration 1
[2026-05-22 18:09:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 404 ms
TRAPS : Iteration 2
[2026-05-22 18:09:38] [INFO ] After 7637ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2026-05-22 18:09:39] [INFO ] After 8709ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2026-05-22 18:09:39] [INFO ] Flatten gal took : 44 ms
[2026-05-22 18:09:39] [INFO ] Flatten gal took : 38 ms
[2026-05-22 18:09:39] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality747977448270676273.gal : 9 ms
[2026-05-22 18:09:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7659618148704804516.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.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality747977448270676273.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7659618148704804516.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.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...327
Loading property file /tmp/ReachabilityCardinality7659618148704804516.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :2 after 7
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :7 after 8
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :8 after 12
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :12 after 43
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :43 after 110
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :110 after 3323
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :3323 after 275781
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :275781 after 2.29442e+07
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :2.29442e+07 after 2.63907e+07
Detected timeout of ITS tools.
[2026-05-22 18:09:54] [INFO ] Flatten gal took : 71 ms
[2026-05-22 18:09:54] [INFO ] Applying decomposition
[2026-05-22 18:09:55] [INFO ] Flatten gal took : 44 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph10945510019799864452.txt' '-o' '/tmp/graph10945510019799864452.bin' '-w' '/tmp/graph10945510019799864452.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10945510019799864452.bin' '-l' '-1' '-v' '-w' '/tmp/graph10945510019799864452.weights' '-q' '0' '-e' '0.001'
[2026-05-22 18:09:55] [INFO ] Decomposing Gal with order
[2026-05-22 18:09:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 18:09:55] [INFO ] Removed a total of 1637 redundant transitions.
[2026-05-22 18:09:55] [INFO ] Flatten gal took : 145 ms
[2026-05-22 18:09:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 79 labels/synchronizations in 48 ms.
[2026-05-22 18:09:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11972603693240689440.gal : 17 ms
[2026-05-22 18:09:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9750389857485226393.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.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11972603693240689440.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9750389857485226393.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality9750389857485226393.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :1 after 3
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :3 after 47
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :47 after 551
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :551 after 2945
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :2945 after 3.54529e+08
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :3.54529e+08 after 5.54472e+08
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :5.54472e+08 after 1.45767e+09
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :1.45767e+09 after 4.31584e+09
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :4.31584e+09 after 1.04544e+10
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :1.04544e+10 after 1.11536e+10
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :1.11536e+10 after 2.56359e+10
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 39884 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-22 18:10:10] [INFO ] Flatten gal took : 46 ms
[2026-05-22 18:10:10] [INFO ] Applying decomposition
[2026-05-22 18:10:10] [INFO ] Flatten gal took : 42 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph3527693181965895346.txt' '-o' '/tmp/graph3527693181965895346.bin' '-w' '/tmp/graph3527693181965895346.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph3527693181965895346.bin' '-l' '-1' '-v' '-w' '/tmp/graph3527693181965895346.weights' '-q' '0' '-e' '0.001'
[2026-05-22 18:10:10] [INFO ] Decomposing Gal with order
[2026-05-22 18:10:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 18:10:11] [INFO ] Removed a total of 1626 redundant transitions.
[2026-05-22 18:10:11] [INFO ] Flatten gal took : 82 ms
[2026-05-22 18:10:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 23 labels/synchronizations in 24 ms.
[2026-05-22 18:10:11] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17995794024608571775.gal : 19 ms
[2026-05-22 18:10:11] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1490893711410279025.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17995794024608571775.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1490893711410279025.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality1490893711410279025.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :1 after 2217
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :2217 after 2.55132e+10
Detected timeout of ITS tools.
[2026-05-22 18:40:11] [INFO ] Flatten gal took : 26 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4726438414332002733
[2026-05-22 18:40:11] [INFO ] Applying decomposition
[2026-05-22 18:40:11] [INFO ] Computing symmetric may disable matrix : 1092 transitions.
[2026-05-22 18:40:11] [INFO ] Flatten gal took : 24 ms
[2026-05-22 18:40:11] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 18:40:11] [INFO ] Computing symmetric may enable matrix : 1092 transitions.
[2026-05-22 18:40:11] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph4035288867853840479.txt' '-o' '/tmp/graph4035288867853840479.bin' '-w' '/tmp/graph4035288867853840479.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph4035288867853840479.bin' '-l' '-1' '-v' '-w' '/tmp/graph4035288867853840479.weights' '-q' '0' '-e' '0.001'
[2026-05-22 18:40:11] [INFO ] Decomposing Gal with order
[2026-05-22 18:40:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 18:40:11] [INFO ] Removed a total of 1639 redundant transitions.
[2026-05-22 18:40:11] [INFO ] Flatten gal took : 51 ms
[2026-05-22 18:40:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 68 labels/synchronizations in 23 ms.
[2026-05-22 18:40:11] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17067403484611902357.gal : 15 ms
[2026-05-22 18:40:11] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10563811951282650838.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17067403484611902357.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10563811951282650838.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
[2026-05-22 18:40:11] [INFO ] Computing Do-Not-Accords matrix : 1092 transitions.
[2026-05-22 18:40:11] [INFO ] Computation of Completed DNA matrix. took 36 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 18:40:11] [INFO ] Built C files in 385ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4726438414332002733
Running compilation step : cd /tmp/ltsmin4726438414332002733;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '180' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Loading property file /tmp/ReachabilityCardinality10563811951282650838.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :4 after 15
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :15 after 35
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :35 after 1548
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :1548 after 3.54245e+08
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :3.54245e+08 after 7.77116e+08
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :7.77116e+08 after 1.47714e+09
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :1.47714e+09 after 1.48468e+09
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :1.48468e+09 after 1.55911e+09
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :1.55911e+09 after 9.13771e+09
Compilation finished in 3491 ms.
Running link step : cd /tmp/ltsmin4726438414332002733;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 86 ms.
Running LTSmin : cd /tmp/ltsmin4726438414332002733;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '-i' 'ASLinkPT03bReachabilityCardinality202401==true'
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :9.13771e+09 after 5.79314e+10
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :5.79314e+10 after 7.15089e+10
SDD proceeding with computation,4 properties remain. new max is 32768
SDD size :7.15089e+10 after 5.51886e+11
SDD proceeding with computation,4 properties remain. new max is 65536
SDD size :5.51886e+11 after 2.56738e+13
SDD proceeding with computation,4 properties remain. new max is 131072
SDD size :2.56738e+13 after 2.71281e+13
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin4726438414332002733;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '-i' 'ASLinkPT03bReachabilityCardinality202401==true'
Running LTSmin : cd /tmp/ltsmin4726438414332002733;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '-i' 'ASLinkPT03bReachabilityCardinality202410==true'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin4726438414332002733;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '-i' 'ASLinkPT03bReachabilityCardinality202410==true'
Running LTSmin : cd /tmp/ltsmin4726438414332002733;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '-i' 'ASLinkPT03bReachabilityCardinality202413==true'
Reachability property ASLink-PT-03b-ReachabilityCardinality-2024-13 is true.
FORMULA ASLink-PT-03b-ReachabilityCardinality-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Invariant property ASLink-PT-03b-ReachabilityCardinality-2024-01 does not hold.
FORMULA ASLink-PT-03b-ReachabilityCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :5.1857e+15 after 5.32851e+15
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin4726438414332002733;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '-i' 'ASLinkPT03bReachabilityCardinality202413==true'
Running LTSmin : cd /tmp/ltsmin4726438414332002733;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '-i' 'ASLinkPT03bReachabilityCardinality202415==true'
SDD proceeding with computation,2 properties remain. new max is 262144
SDD size :5.32851e+15 after 7.03689e+15
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin4726438414332002733;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '-i' 'ASLinkPT03bReachabilityCardinality202415==true'
Retrying LTSmin with larger timeout 7200 s
Running LTSmin : cd /tmp/ltsmin4726438414332002733;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '-i' 'ASLinkPT03bReachabilityCardinality202410==true'

BK_TIME_CONFINEMENT_REACHED

--------------------
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
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -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
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
++ sed s/.jar//
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -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="ASLink-PT-03b"
export BK_EXAMINATION="ReachabilityCardinality"
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-5973"
echo " Executing tool itstools"
echo " Input is ASLink-PT-03b, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r002-oct2-177944366200326"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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