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-177944366200351.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-05a, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002-oct2-177944366200351
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1008K
-rw-r--r-- 1 mcc users 7.4K Mar 5 14:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Mar 5 14:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Mar 5 14:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Mar 5 14:02 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.7K Mar 15 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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 18K Mar 15 07:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 5 14:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Mar 5 14:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 5 14:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 104K 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 516K 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-05a-ReachabilityFireability-2024-00
FORMULA_NAME ASLink-PT-05a-ReachabilityFireability-2024-01
FORMULA_NAME ASLink-PT-05a-ReachabilityFireability-2024-02
FORMULA_NAME ASLink-PT-05a-ReachabilityFireability-2024-03
FORMULA_NAME ASLink-PT-05a-ReachabilityFireability-2024-04
FORMULA_NAME ASLink-PT-05a-ReachabilityFireability-2024-05
FORMULA_NAME ASLink-PT-05a-ReachabilityFireability-2024-06
FORMULA_NAME ASLink-PT-05a-ReachabilityFireability-2024-07
FORMULA_NAME ASLink-PT-05a-ReachabilityFireability-2024-08
FORMULA_NAME ASLink-PT-05a-ReachabilityFireability-2024-09
FORMULA_NAME ASLink-PT-05a-ReachabilityFireability-2024-10
FORMULA_NAME ASLink-PT-05a-ReachabilityFireability-2024-11
FORMULA_NAME ASLink-PT-05a-ReachabilityFireability-2024-12
FORMULA_NAME ASLink-PT-05a-ReachabilityFireability-2024-13
FORMULA_NAME ASLink-PT-05a-ReachabilityFireability-2024-14
FORMULA_NAME ASLink-PT-05a-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779476350753

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-05a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202604301425
[2026-05-22 18:59:12] [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]
[2026-05-22 18:59:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 18:59:12] [INFO ] Load time of PNML (sax parser for PT used): 170 ms
[2026-05-22 18:59:12] [INFO ] Transformed 1211 places.
[2026-05-22 18:59:12] [INFO ] Transformed 1827 transitions.
[2026-05-22 18:59:12] [INFO ] Found NUPN structural information;
[2026-05-22 18:59:12] [INFO ] Parsed PT model containing 1211 places and 1827 transitions and 6877 arcs in 281 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 19 transitions
Reduce redundant transitions removed 19 transitions.
RANDOM walk for 40000 steps (248 resets) in 1619 ms. (24 steps per ms) remains 11/16 properties
FORMULA ASLink-PT-05a-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-05a-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-05a-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-05a-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-05a-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (35 resets) in 834 ms. (47 steps per ms) remains 10/11 properties
FORMULA ASLink-PT-05a-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2026-05-22 18:59:13] [INFO ] Flatten gal took : 349 ms
[2026-05-22 18:59:13] [INFO ] Flatten gal took : 244 ms
BEST_FIRST walk for 40002 steps (39 resets) in 1058 ms. (37 steps per ms) remains 10/10 properties
[2026-05-22 18:59:13] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7843327933109102104.gal : 78 ms
BEST_FIRST walk for 40004 steps (37 resets) in 304 ms. (131 steps per ms) remains 10/10 properties
[2026-05-22 18:59:13] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1552847217811898297.prop : 9 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/ReachabilityCardinality7843327933109102104.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1552847217811898297.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 ...328
BEST_FIRST walk for 40004 steps (38 resets) in 304 ms. (131 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (30 resets) in 341 ms. (116 steps per ms) remains 10/10 properties
Loading property file /tmp/ReachabilityCardinality1552847217811898297.prop.
BEST_FIRST walk for 40004 steps (39 resets) in 336 ms. (118 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (34 resets) in 196 ms. (203 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (36 resets) in 204 ms. (195 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (36 resets) in 236 ms. (168 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (40 resets) in 336 ms. (118 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (38 resets) in 150 ms. (264 steps per ms) remains 10/10 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9893618873833274674.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14147305251718926807.kers'
[2026-05-22 18:59:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9893618873833274674.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14147305251718926807.kers]
Culling duplicate invariants (modulo rational): removing 20 columns.
Culled 20 columns in 1 ms.
// Phase 1: matrix 1808 rows 1191 cols 6799 entries
Finished phase 1 with 452 SingleSign rule and 527 generalized
[2026-05-22 18:59:14] [INFO ] Computed 232 invariants in 13 ms
Computed 232 P flows in 14 ms.
Exported basis to /tmp/petrispot-output-14147305251718926807.kers
Total runtime 16 ms.
Excessive predecessor constraint size, skipping predecessor.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/345 variables, 345/345 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/345 variables, 6/351 constraints. Problems are: Problem set: 0 solved, 10 unsolved
SDD proceeding with computation,10 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,10 properties remain. new max is 8
SDD size :6 after 13
SDD proceeding with computation,10 properties remain. new max is 16
SDD size :13 after 20
SDD proceeding with computation,10 properties remain. new max is 32
SDD size :20 after 38
At refinement iteration 2 (INCLUDED_ONLY) 0/345 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 10 unsolved
SDD proceeding with computation,10 properties remain. new max is 64
SDD size :38 after 64
SDD proceeding with computation,10 properties remain. new max is 128
SDD size :64 after 267
At refinement iteration 3 (OVERLAPS) 265/610 variables, 43/394 constraints. Problems are: Problem set: 0 solved, 10 unsolved
SDD proceeding with computation,10 properties remain. new max is 256
SDD size :267 after 29550
At refinement iteration 4 (INCLUDED_ONLY) 0/610 variables, 265/659 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/610 variables, 1/660 constraints. Problems are: Problem set: 0 solved, 10 unsolved
SDD proceeding with computation,10 properties remain. new max is 512
SDD size :29550 after 6.17793e+06
At refinement iteration 6 (INCLUDED_ONLY) 0/610 variables, 0/660 constraints. Problems are: Problem set: 0 solved, 10 unsolved
SDD proceeding with computation,10 properties remain. new max is 1024
SDD size :6.17793e+06 after 4.47131e+11
At refinement iteration 7 (OVERLAPS) 33/643 variables, 9/669 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/643 variables, 33/702 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/643 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem ASLink-PT-05a-ReachabilityFireability-2024-12 is UNSAT
FORMULA ASLink-PT-05a-ReachabilityFireability-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 10 (OVERLAPS) 542/1185 variables, 159/861 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1185 variables, 542/1403 constraints. Problems are: Problem set: 1 solved, 9 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1185/3019 variables, and 1403 constraints, problems are : Problem set: 1 solved, 9 unsolved in 5045 ms.
Refiners :[Domain max(s): 1185/1211 constraints, Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 166/180 constraints, State Equation: 0/1211 constraints, PredecessorRefiner: 10/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 6/316 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 0/316 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 282/592 variables, 42/358 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/592 variables, 282/640 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/592 variables, 1/641 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/592 variables, 1/642 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/592 variables, 0/642 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 36/628 variables, 10/652 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/628 variables, 36/688 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/628 variables, 0/688 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 557/1185 variables, 159/847 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1185 variables, 557/1404 constraints. Problems are: Problem set: 1 solved, 9 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1185/3019 variables, and 1406 constraints, problems are : Problem set: 1 solved, 9 unsolved in 5013 ms.
Refiners :[Domain max(s): 1185/1211 constraints, Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 166/180 constraints, State Equation: 0/1211 constraints, PredecessorRefiner: 7/2 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10239ms problems are : Problem set: 1 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 310 out of 1211 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1211/1211 places, 1808/1808 transitions.
Ensure Unique test removed 15 places
Discarding 9 places :
Implicit places reduction removed 9 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 0 with 83 rules applied. Total rules applied 83 place count 1187 transition count 1749
Reduce places removed 59 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 1 with 70 rules applied. Total rules applied 153 place count 1128 transition count 1738
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 164 place count 1117 transition count 1738
Performed 83 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 83 Pre rules applied. Total rules applied 164 place count 1117 transition count 1655
Deduced a syphon composed of 83 places in 6 ms
Ensure Unique test removed 24 places
Reduce places removed 107 places and 0 transitions.
Iterating global reduction 3 with 190 rules applied. Total rules applied 354 place count 1010 transition count 1655
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 3 with 1 rules applied. Total rules applied 355 place count 1010 transition count 1654
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 356 place count 1009 transition count 1654
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 357 place count 1008 transition count 1653
Iterating global reduction 5 with 1 rules applied. Total rules applied 358 place count 1008 transition count 1653
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 361 place count 1007 transition count 1651
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 362 place count 1006 transition count 1651
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 6 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 7 with 46 rules applied. Total rules applied 408 place count 983 transition count 1628
Free-agglomeration rule applied 2 times.
Iterating global reduction 7 with 2 rules applied. Total rules applied 410 place count 983 transition count 1626
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 412 place count 981 transition count 1626
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 8 with 12 rules applied. Total rules applied 424 place count 981 transition count 1614
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 8 with 12 rules applied. Total rules applied 436 place count 969 transition count 1614
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 437 place count 969 transition count 1614
Applied a total of 437 rules in 470 ms. Remains 969 /1211 variables (removed 242) and now considering 1614/1808 (removed 194) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 483 ms. Remains : 969/1211 places, 1614/1808 transitions.
RANDOM walk for 40000 steps (316 resets) in 790 ms. (50 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (61 resets) in 349 ms. (114 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (61 resets) in 304 ms. (131 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (61 resets) in 334 ms. (119 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (65 resets) in 314 ms. (126 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (61 resets) in 263 ms. (151 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (59 resets) in 152 ms. (261 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (64 resets) in 98 ms. (404 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (60 resets) in 177 ms. (224 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (64 resets) in 104 ms. (380 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 129138 steps, run timeout after 3001 ms. (steps per millisecond=43 ) properties seen :1 out of 9
Probabilistic random walk after 129138 steps, saw 59961 distinct states, run finished after 3013 ms. (steps per millisecond=42 ) properties seen :1
FORMULA ASLink-PT-05a-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2294598282758384474.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10261444930112534311.kers'
[2026-05-22 18:59:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2294598282758384474.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10261444930112534311.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 1 ms.
// Phase 1: matrix 1614 rows 961 cols 6313 entries
Finished phase 1 with 272 SingleSign rule and 514 generalized
[2026-05-22 18:59:28] [INFO ] Computed 183 invariants in 24 ms
Computed 183 P flows in 24 ms.
Exported basis to /tmp/petrispot-output-10261444930112534311.kers
Total runtime 26 ms.
[2026-05-22 18:59:28] [INFO ] State equation strengthened by 21 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/298 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/298 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 264/562 variables, 40/46 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/562 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 11/573 variables, 7/53 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/573 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 387/960 variables, 122/175 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/960 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 9/969 variables, 8/183 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/969 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 1614/2583 variables, 969/1152 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2583 variables, 21/1173 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2583 variables, 0/1173 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 0/2583 variables, 0/1173 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2583/2583 variables, and 1173 constraints, problems are : Problem set: 0 solved, 8 unsolved in 6777 ms.
Refiners :[Positive P Invariants (semi-flows): 47/47 constraints, Generalized P Invariants (flows): 136/136 constraints, State Equation: 969/969 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 8/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/298 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/298 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 264/562 variables, 40/46 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/562 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 11/573 variables, 7/53 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/573 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/573 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 387/960 variables, 122/176 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/960 variables, 4/180 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/960 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 9/969 variables, 8/188 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/969 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/969 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/969 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem ASLink-PT-05a-ReachabilityFireability-2024-03 is UNSAT
FORMULA ASLink-PT-05a-ReachabilityFireability-2024-03 TRUE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-05a-ReachabilityFireability-2024-05 is UNSAT
FORMULA ASLink-PT-05a-ReachabilityFireability-2024-05 TRUE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-05a-ReachabilityFireability-2024-07 is UNSAT
FORMULA ASLink-PT-05a-ReachabilityFireability-2024-07 FALSE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-05a-ReachabilityFireability-2024-10 is UNSAT
FORMULA ASLink-PT-05a-ReachabilityFireability-2024-10 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 14 (OVERLAPS) 1614/2583 variables, 969/1159 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2583 variables, 21/1180 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2583 variables, 1/1181 constraints. Problems are: Problem set: 4 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2583/2583 variables, and 1181 constraints, problems are : Problem set: 4 solved, 4 unsolved in 45023 ms.
Refiners :[Positive P Invariants (semi-flows): 47/47 constraints, Generalized P Invariants (flows): 136/136 constraints, State Equation: 969/969 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 7/2 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 51870ms problems are : Problem set: 4 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 116 out of 969 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 969/969 places, 1614/1614 transitions.
Ensure Unique test removed 3 places
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 965 transition count 1599
Reduce places removed 15 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 16 rules applied. Total rules applied 35 place count 950 transition count 1598
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 36 place count 949 transition count 1598
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 26 Pre rules applied. Total rules applied 36 place count 949 transition count 1572
Deduced a syphon composed of 26 places in 2 ms
Ensure Unique test removed 15 places
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 67 rules applied. Total rules applied 103 place count 908 transition count 1572
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 104 place count 907 transition count 1566
Iterating global reduction 3 with 1 rules applied. Total rules applied 105 place count 907 transition count 1566
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 4 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 119 place count 900 transition count 1559
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 120 place count 900 transition count 1558
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 121 place count 899 transition count 1558
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 122 place count 899 transition count 1557
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 123 place count 898 transition count 1557
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 126 place count 898 transition count 1557
Applied a total of 126 rules in 296 ms. Remains 898 /969 variables (removed 71) and now considering 1557/1614 (removed 57) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 296 ms. Remains : 898/969 places, 1557/1614 transitions.
RANDOM walk for 40000 steps (380 resets) in 485 ms. (82 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (82 resets) in 149 ms. (266 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (72 resets) in 181 ms. (219 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (78 resets) in 104 ms. (380 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (72 resets) in 86 ms. (459 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 133255 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :0 out of 4
Probabilistic random walk after 133255 steps, saw 53900 distinct states, run finished after 3001 ms. (steps per millisecond=44 ) 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-17742162645058850130.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17080839822666437457.kers'
[2026-05-22 19:00:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17742162645058850130.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17080839822666437457.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 1 ms.
// Phase 1: matrix 1557 rows 890 cols 6152 entries
Finished phase 1 with 213 SingleSign rule and 521 generalized
[2026-05-22 19:00:24] [INFO ] Computed 164 invariants in 11 ms
Computed 164 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-17080839822666437457.kers
Total runtime 13 ms.
[2026-05-22 19:00:24] [INFO ] State equation strengthened by 27 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 278/394 variables, 30/32 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/394 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 95/489 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/489 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 389/878 variables, 98/150 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/878 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 20/898 variables, 14/164 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/898 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 1557/2455 variables, 898/1062 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2455 variables, 27/1089 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2455 variables, 0/1089 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/2455 variables, 0/1089 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2455/2455 variables, and 1089 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2303 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, Generalized P Invariants (flows): 114/114 constraints, State Equation: 898/898 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 4/1 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/116 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 278/394 variables, 30/32 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/394 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/394 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 95/489 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/489 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 389/878 variables, 98/151 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/878 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/878 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 20/898 variables, 14/166 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/898 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/898 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 1557/2455 variables, 898/1065 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2455 variables, 27/1092 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2455 variables, 1/1093 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2455 variables, 0/1093 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/2455 variables, 0/1093 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2455/2455 variables, and 1093 constraints, problems are : Problem set: 0 solved, 4 unsolved in 26223 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, Generalized P Invariants (flows): 114/114 constraints, State Equation: 898/898 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 4/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 28574ms problems are : Problem set: 0 solved, 4 unsolved
FORMULA ASLink-PT-05a-ReachabilityFireability-2024-04 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 11825 ms.
Support contains 70 out of 898 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 898/898 places, 1557/1557 transitions.
Ensure Unique test removed 1 places
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 0 with 2 rules applied. Total rules applied 2 place count 897 transition count 1556
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 896 transition count 1556
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 3 place count 896 transition count 1553
Deduced a syphon composed of 3 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 11 place count 891 transition count 1553
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 13 place count 889 transition count 1541
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 889 transition count 1541
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 19 place count 887 transition count 1539
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 887 transition count 1538
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 21 place count 886 transition count 1538
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 23 place count 886 transition count 1538
Applied a total of 23 rules in 185 ms. Remains 886 /898 variables (removed 12) and now considering 1538/1557 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 185 ms. Remains : 886/898 places, 1538/1557 transitions.
RANDOM walk for 40000 steps (406 resets) in 332 ms. (120 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (70 resets) in 210 ms. (189 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (71 resets) in 194 ms. (205 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (76 resets) in 189 ms. (210 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 165487 steps, run timeout after 3001 ms. (steps per millisecond=55 ) properties seen :0 out of 3
Probabilistic random walk after 165487 steps, saw 67289 distinct states, run finished after 3001 ms. (steps per millisecond=55 ) 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-16909781536954120621.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11062763559121947159.kers'
[2026-05-22 19:01:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16909781536954120621.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11062763559121947159.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 1 ms.
// Phase 1: matrix 1538 rows 878 cols 6087 entries
Finished phase 1 with 201 SingleSign rule and 524 generalized
[2026-05-22 19:01:08] [INFO ] Computed 161 invariants in 12 ms
Computed 161 P flows in 12 ms.
Exported basis to /tmp/petrispot-output-11062763559121947159.kers
Total runtime 14 ms.
[2026-05-22 19:01:08] [INFO ] State equation strengthened by 28 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 224/294 variables, 24/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/294 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 145/439 variables, 24/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/439 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 418/857 variables, 92/141 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/857 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 29/886 variables, 20/161 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/886 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1538/2424 variables, 886/1047 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2424 variables, 28/1075 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2424 variables, 0/1075 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/2424 variables, 0/1075 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2424/2424 variables, and 1075 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1889 ms.
Refiners :[Positive P Invariants (semi-flows): 48/48 constraints, Generalized P Invariants (flows): 113/113 constraints, State Equation: 886/886 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 3/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 224/294 variables, 24/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/294 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 145/439 variables, 24/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/439 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 418/857 variables, 92/141 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/857 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 29/886 variables, 20/161 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/886 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1538/2424 variables, 886/1047 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2424 variables, 28/1075 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2424 variables, 1/1076 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2424 variables, 0/1076 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/2424 variables, 0/1076 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2424/2424 variables, and 1076 constraints, problems are : Problem set: 0 solved, 3 unsolved in 6793 ms.
Refiners :[Positive P Invariants (semi-flows): 48/48 constraints, Generalized P Invariants (flows): 113/113 constraints, State Equation: 886/886 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 3/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8746ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2889 ms.
Support contains 70 out of 886 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 886/886 places, 1538/1538 transitions.
Applied a total of 0 rules in 33 ms. Remains 886 /886 variables (removed 0) and now considering 1538/1538 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 886/886 places, 1538/1538 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 886/886 places, 1538/1538 transitions.
Applied a total of 0 rules in 36 ms. Remains 886 /886 variables (removed 0) and now considering 1538/1538 (removed 0) transitions.
[2026-05-22 19:01:20] [INFO ] Invariant cache hit.
[2026-05-22 19:01:20] [INFO ] Implicit Places using invariants in 823 ms returned [1, 21, 24, 35, 53, 71, 139, 167, 170, 171, 172, 190, 208, 289, 302, 303, 304, 305, 325, 343, 425, 440, 441, 442, 443, 479, 559, 573, 574, 575, 576, 596, 614, 676, 697, 702, 713, 714, 715, 716, 717, 752, 754, 757, 775, 776, 777, 778, 790, 796, 808, 814, 820, 826, 832, 838, 844, 850]
[2026-05-22 19:01:20] [INFO ] Actually due to overlaps returned [752, 717, 35, 53, 172, 190, 325, 443, 596, 757, 171, 305, 442, 576, 716, 776, 170, 304, 441, 575, 715, 754, 775, 1, 21, 289, 303, 425, 440, 559, 574, 697, 714, 71, 167, 208, 302, 343, 479, 573, 614, 713, 778, 820, 838, 850, 24, 702, 777, 790, 796, 808, 814, 826, 832, 844]
Discarding 56 places :
Implicit Place search using SMT only with invariants took 844 ms to find 56 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 830/886 places, 1538/1538 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 75 transitions
Trivial Post-agglo rules discarded 75 transitions
Performed 75 trivial Post agglomeration. Transition count delta: 75
Iterating post reduction 0 with 77 rules applied. Total rules applied 77 place count 828 transition count 1463
Reduce places removed 75 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 78 rules applied. Total rules applied 155 place count 753 transition count 1460
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 158 place count 750 transition count 1460
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 37 Pre rules applied. Total rules applied 158 place count 750 transition count 1423
Deduced a syphon composed of 37 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 75 rules applied. Total rules applied 233 place count 712 transition count 1423
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 10 rules applied. Total rules applied 243 place count 706 transition count 1419
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 4 with 6 rules applied. Total rules applied 249 place count 702 transition count 1417
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 251 place count 700 transition count 1417
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 262 place count 689 transition count 1406
Iterating global reduction 6 with 11 rules applied. Total rules applied 273 place count 689 transition count 1406
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 273 place count 689 transition count 1405
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 275 place count 688 transition count 1405
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 278 place count 685 transition count 1402
Iterating global reduction 6 with 3 rules applied. Total rules applied 281 place count 685 transition count 1402
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 1 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 6 with 92 rules applied. Total rules applied 373 place count 639 transition count 1356
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 375 place count 637 transition count 1354
Iterating global reduction 6 with 2 rules applied. Total rules applied 377 place count 637 transition count 1354
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 379 place count 637 transition count 1352
Free-agglomeration rule applied 3 times.
Iterating global reduction 7 with 3 rules applied. Total rules applied 382 place count 637 transition count 1349
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 386 place count 634 transition count 1348
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 8 with 12 rules applied. Total rules applied 398 place count 634 transition count 1336
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 8 with 12 rules applied. Total rules applied 410 place count 622 transition count 1336
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 411 place count 621 transition count 1335
Iterating global reduction 9 with 1 rules applied. Total rules applied 412 place count 621 transition count 1335
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 413 place count 621 transition count 1334
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 414 place count 621 transition count 1333
Partial Free-agglomeration rule applied 18 times.
Drop transitions (Partial Free agglomeration) removed 18 transitions
Iterating global reduction 10 with 18 rules applied. Total rules applied 432 place count 621 transition count 1333
Applied a total of 432 rules in 281 ms. Remains 621 /830 variables (removed 209) and now considering 1333/1538 (removed 205) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11773328871475472188.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2649421991456021069.kers'
[2026-05-22 19:01:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11773328871475472188.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2649421991456021069.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 1333 rows 620 cols 5442 entries
Finished phase 1 with 202 SingleSign rule and 323 generalized
[2026-05-22 19:01:21] [INFO ] Computed 96 invariants in 9 ms
Computed 96 P flows in 12 ms.
Exported basis to /tmp/petrispot-output-2649421991456021069.kers
Total runtime 13 ms.
[2026-05-22 19:01:21] [INFO ] Implicit Places using invariants in 435 ms returned [98, 104, 106, 115, 123, 124, 178, 195, 201, 203, 206, 212, 217, 274, 298, 304, 307, 309, 316, 380, 401, 409, 415, 424, 500, 511, 514, 515, 521, 606, 609, 612, 615, 618]
[2026-05-22 19:01:21] [INFO ] Actually due to overlaps returned [212, 316, 521, 98, 104, 195, 201, 206, 298, 304, 309, 401, 500, 514, 606, 609, 612, 615, 618, 106, 115, 178, 274, 380, 409, 415, 515]
Discarding 27 places :
Implicit Place search using SMT only with invariants took 438 ms to find 27 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 594/886 places, 1333/1538 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 594 transition count 1328
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 589 transition count 1328
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 28 place count 571 transition count 1307
Iterating global reduction 2 with 18 rules applied. Total rules applied 46 place count 571 transition count 1307
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 49 place count 571 transition count 1304
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 53 place count 567 transition count 1300
Iterating global reduction 3 with 4 rules applied. Total rules applied 57 place count 567 transition count 1300
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
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 73 place count 559 transition count 1292
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 74 place count 558 transition count 1290
Iterating global reduction 3 with 1 rules applied. Total rules applied 75 place count 558 transition count 1290
Free-agglomeration rule applied 12 times.
Iterating global reduction 3 with 12 rules applied. Total rules applied 87 place count 558 transition count 1278
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 99 place count 546 transition count 1278
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 101 place count 546 transition count 1276
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 103 place count 544 transition count 1276
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 104 place count 544 transition count 1276
Applied a total of 104 rules in 153 ms. Remains 544 /594 variables (removed 50) and now considering 1276/1333 (removed 57) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6207446129616109990.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9153542097537075064.kers'
[2026-05-22 19:01:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6207446129616109990.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9153542097537075064.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 1 ms.
// Phase 1: matrix 1276 rows 543 cols 5182 entries
Finished phase 1 with 220 SingleSign rule and 255 generalized
[2026-05-22 19:01:21] [INFO ] Computed 69 invariants in 7 ms
Computed 69 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-9153542097537075064.kers
Total runtime 9 ms.
[2026-05-22 19:01:22] [INFO ] Implicit Places using invariants in 315 ms returned [112, 113, 190, 371]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 317 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 540/886 places, 1276/1538 transitions.
Applied a total of 0 rules in 14 ms. Remains 540 /540 variables (removed 0) and now considering 1276/1276 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 2087 ms. Remains : 540/886 places, 1276/1538 transitions.
RANDOM walk for 40000 steps (629 resets) in 300 ms. (132 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (135 resets) in 187 ms. (212 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (141 resets) in 163 ms. (243 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (143 resets) in 113 ms. (350 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 331108 steps, run timeout after 3001 ms. (steps per millisecond=110 ) properties seen :0 out of 3
Probabilistic random walk after 331108 steps, saw 78235 distinct states, run finished after 3001 ms. (steps per millisecond=110 ) 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-1537675444876906853.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17986258659897850823.kers'
[2026-05-22 19:01:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1537675444876906853.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17986258659897850823.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 1276 rows 539 cols 5129 entries
Finished phase 1 with 213 SingleSign rule and 262 generalized
[2026-05-22 19:01:25] [INFO ] Computed 65 invariants in 7 ms
Computed 65 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-17986258659897850823.kers
Total runtime 8 ms.
[2026-05-22 19:01:25] [INFO ] State equation strengthened by 6 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 270/340 variables, 22/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/340 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 200/540 variables, 42/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/540 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 1276/1816 variables, 540/605 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1816 variables, 6/611 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1816 variables, 0/611 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/1816 variables, 0/611 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1816/1816 variables, and 611 constraints, problems are : Problem set: 0 solved, 3 unsolved in 941 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 540/540 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 3/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 270/340 variables, 22/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/340 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 200/540 variables, 42/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/540 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/540 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/540 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1276/1816 variables, 540/607 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1816 variables, 6/613 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1816 variables, 1/614 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1816 variables, 0/614 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/1816 variables, 0/614 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1816/1816 variables, and 614 constraints, problems are : Problem set: 0 solved, 3 unsolved in 7771 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 540/540 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 3/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8736ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 425 ms.
Support contains 70 out of 540 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 540/540 places, 1276/1276 transitions.
Applied a total of 0 rules in 14 ms. Remains 540 /540 variables (removed 0) and now considering 1276/1276 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 540/540 places, 1276/1276 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 540/540 places, 1276/1276 transitions.
Applied a total of 0 rules in 13 ms. Remains 540 /540 variables (removed 0) and now considering 1276/1276 (removed 0) transitions.
[2026-05-22 19:01:34] [INFO ] Invariant cache hit.
[2026-05-22 19:01:34] [INFO ] Implicit Places using invariants in 283 ms returned []
[2026-05-22 19:01:34] [INFO ] Invariant cache hit.
[2026-05-22 19:01:35] [INFO ] State equation strengthened by 6 read => feed constraints.
[2026-05-22 19:01:36] [INFO ] Implicit Places using invariants and state equation in 1606 ms returned []
Implicit Place search using SMT with State Equation took 1903 ms to find 0 implicit places.
[2026-05-22 19:01:36] [INFO ] Redundant transitions in 88 ms returned []
Running 1275 sub problems to find dead transitions.
[2026-05-22 19:01:36] [INFO ] Invariant cache hit.
[2026-05-22 19:01:36] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/539 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 1275 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 539/1816 variables, and 38 constraints, problems are : Problem set: 0 solved, 1275 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 0/22 constraints, Generalized P Invariants (flows): 38/43 constraints, State Equation: 0/540 constraints, ReadFeed: 0/6 constraints, PredecessorRefiner: 1275/1275 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1275 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/539 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 1275 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 539/1816 variables, and 38 constraints, problems are : Problem set: 0 solved, 1275 unsolved in 30061 ms.
Refiners :[Positive P Invariants (semi-flows): 0/22 constraints, Generalized P Invariants (flows): 38/43 constraints, State Equation: 0/540 constraints, ReadFeed: 0/6 constraints, PredecessorRefiner: 0/1275 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60489ms problems are : Problem set: 0 solved, 1275 unsolved
Search for dead transitions found 0 dead transitions in 60495ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62523 ms. Remains : 540/540 places, 1276/1276 transitions.
Attempting over-approximation, by ignoring read arcs.
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 540 transition count 1275
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 539 transition count 1275
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 538 transition count 1275
Applied a total of 3 rules in 34 ms. Remains 538 /540 variables (removed 2) and now considering 1275/1276 (removed 1) transitions.
Running SMT prover for 3 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7948321011254544412.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-85402450126881935.kers'
[2026-05-22 19:02:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7948321011254544412.kers, --Pflows, --basisKERS=/tmp/petrispot-output-85402450126881935.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 1275 rows 537 cols 5125 entries
Finished phase 1 with 214 SingleSign rule and 260 generalized
[2026-05-22 19:02:37] [INFO ] Computed 64 invariants in 7 ms
Computed 64 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-85402450126881935.kers
Total runtime 9 ms.
[2026-05-22 19:02:37] [INFO ] After 106ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2026-05-22 19:02:37] [INFO ] [Nat]Absence check using 21 positive place invariants in 5 ms returned sat
[2026-05-22 19:02:37] [INFO ] [Nat]Absence check using 21 positive and 43 generalized place invariants in 11 ms returned sat
[2026-05-22 19:02:39] [INFO ] After 2131ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2026-05-22 19:02:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 220 ms
TRAPS : Iteration 1
[2026-05-22 19:02:41] [INFO ] After 4075ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2026-05-22 19:02:42] [INFO ] After 5207ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2026-05-22 19:02:42] [INFO ] Flatten gal took : 63 ms
[2026-05-22 19:02:42] [INFO ] Flatten gal took : 45 ms
[2026-05-22 19:02:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7554964751765079458.gal : 10 ms
[2026-05-22 19:02:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9081903282277577199.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/ReachabilityCardinality7554964751765079458.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9081903282277577199.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 ...328
Loading property file /tmp/ReachabilityCardinality9081903282277577199.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :6 after 12
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :12 after 45
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :45 after 130
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :130 after 775
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :775 after 6975
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :6975 after 1.70394e+06
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :1.70394e+06 after 1.9266e+06
Invariant property ASLink-PT-05a-ReachabilityFireability-2024-13 does not hold.
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1.9266e+06 after 1.93012e+06
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1.93012e+06 after 2.31477e+06
Reachability property ASLink-PT-05a-ReachabilityFireability-2024-11 is true.
Detected timeout of ITS tools.
[2026-05-22 19:02:57] [INFO ] Flatten gal took : 32 ms
[2026-05-22 19:02:57] [INFO ] Applying decomposition
[2026-05-22 19:02:57] [INFO ] Flatten gal took : 32 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/graph14719535730944884932.txt' '-o' '/tmp/graph14719535730944884932.bin' '-w' '/tmp/graph14719535730944884932.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph14719535730944884932.bin' '-l' '-1' '-v' '-w' '/tmp/graph14719535730944884932.weights' '-q' '0' '-e' '0.001'
[2026-05-22 19:02:58] [INFO ] Decomposing Gal with order
[2026-05-22 19:02:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 19:02:58] [INFO ] Removed a total of 2419 redundant transitions.
[2026-05-22 19:02:58] [INFO ] Flatten gal took : 163 ms
[2026-05-22 19:02:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 86 labels/synchronizations in 60 ms.
[2026-05-22 19:02:58] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4429978713835280149.gal : 11 ms
[2026-05-22 19:02:58] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16613487355018083934.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/ReachabilityCardinality4429978713835280149.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16613487355018083934.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/ReachabilityCardinality16613487355018083934.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1 after 177
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :177 after 370028
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :370028 after 2.41559e+07
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :2.41559e+07 after 2.7238e+07
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2.7238e+07 after 5.46014e+07
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :5.46014e+07 after 7.19666e+07
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :7.19666e+07 after 1.61774e+08
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1.61774e+08 after 8.73975e+08
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :8.73975e+08 after 2.31205e+09
Reachability property ASLink-PT-05a-ReachabilityFireability-2024-02 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 16385 fixpoint passes
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,6.95823e+10,4.75548,115740,3188,2851,33114,270746,1781,52441,569,1.00494e+06,0
Total reachable state count : 69582259311

Verifying 1 reachability properties.
Reachability property ASLink-PT-05a-ReachabilityFireability-2024-02 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ASLink-PT-05a-ReachabilityFireability-2024-02,2.30172e+07,4.91854,115740,447,774,33114,270746,2049,52441,610,1.00494e+06,0
Over-approximation ignoring read arcs solved 0 properties in 26284 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-22 19:03:03] [INFO ] Flatten gal took : 75 ms
[2026-05-22 19:03:03] [INFO ] Applying decomposition
[2026-05-22 19:03:03] [INFO ] Flatten gal took : 46 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/graph2722884295754939001.txt' '-o' '/tmp/graph2722884295754939001.bin' '-w' '/tmp/graph2722884295754939001.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph2722884295754939001.bin' '-l' '-1' '-v' '-w' '/tmp/graph2722884295754939001.weights' '-q' '0' '-e' '0.001'
[2026-05-22 19:03:03] [INFO ] Decomposing Gal with order
[2026-05-22 19:03:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 19:03:03] [INFO ] Removed a total of 2495 redundant transitions.
[2026-05-22 19:03:03] [INFO ] Flatten gal took : 98 ms
[2026-05-22 19:03:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 41 labels/synchronizations in 29 ms.
[2026-05-22 19:03:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5190149426327833681.gal : 12 ms
[2026-05-22 19:03:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality812735718725984953.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/ReachabilityCardinality5190149426327833681.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality812735718725984953.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 ...306
Loading property file /tmp/ReachabilityCardinality812735718725984953.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :8 after 99
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :99 after 2.06676e+12
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :2.06676e+12 after 2.59252e+15
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :2.59252e+15 after 7.47148e+16
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :7.47148e+16 after 8.04806e+16
Invariant property ASLink-PT-05a-ReachabilityFireability-2024-13 does not hold.
FORMULA ASLink-PT-05a-ReachabilityFireability-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property ASLink-PT-05a-ReachabilityFireability-2024-11 is true.
FORMULA ASLink-PT-05a-ReachabilityFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :8.04806e+16 after 4.15219e+17
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :4.15219e+17 after 8.32983e+17
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :8.32983e+17 after 1.79301e+18
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1.43007e+19 after 2.56627e+19
Detected timeout of ITS tools.
[2026-05-22 19:33:04] [INFO ] Flatten gal took : 26 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9362345654559965830
[2026-05-22 19:33:04] [INFO ] Applying decomposition
[2026-05-22 19:33:04] [INFO ] Computing symmetric may disable matrix : 1276 transitions.
[2026-05-22 19:33:04] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 19:33:04] [INFO ] Computing symmetric may enable matrix : 1276 transitions.
[2026-05-22 19:33:04] [INFO ] Flatten gal took : 27 ms
[2026-05-22 19:33:04] [INFO ] Computation of Complete enable matrix. took 4 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/graph6812148018980405489.txt' '-o' '/tmp/graph6812148018980405489.bin' '-w' '/tmp/graph6812148018980405489.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph6812148018980405489.bin' '-l' '-1' '-v' '-w' '/tmp/graph6812148018980405489.weights' '-q' '0' '-e' '0.001'
[2026-05-22 19:33:04] [INFO ] Decomposing Gal with order
[2026-05-22 19:33:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 19:33:04] [INFO ] Removed a total of 2556 redundant transitions.
[2026-05-22 19:33:04] [INFO ] Flatten gal took : 66 ms
[2026-05-22 19:33:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 82 labels/synchronizations in 14 ms.
[2026-05-22 19:33:04] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability14955479917984777217.gal : 7 ms
[2026-05-22 19:33:04] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability1216961508616871123.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/ReachabilityFireability14955479917984777217.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability1216961508616871123.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/ReachabilityFireability1216961508616871123.prop.
[2026-05-22 19:33:04] [INFO ] Computing Do-Not-Accords matrix : 1276 transitions.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 9
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :9 after 1033
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1033 after 9805
[2026-05-22 19:33:04] [INFO ] Computation of Completed DNA matrix. took 44 ms. Total solver calls (SAT/UNSAT): 0(0/0)
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :3.9419e+06 after 1.61906e+07
[2026-05-22 19:33:04] [INFO ] Built C files in 415ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9362345654559965830
Running compilation step : cd /tmp/ltsmin9362345654559965830;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '720' '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'
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1.61906e+07 after 9.53047e+07
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :9.53047e+07 after 3.36658e+08
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :3.36658e+08 after 1.2627e+09
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1.2627e+09 after 6.88266e+09
Compilation finished in 4504 ms.
Running link step : cd /tmp/ltsmin9362345654559965830;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 134 ms.
Running LTSmin : cd /tmp/ltsmin9362345654559965830;'/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' 'ASLinkPT05aReachabilityFireability202402==true'
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1.94298e+11 after 3.15902e+11
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :7.83113e+12 after 8.95702e+12
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :3.76638e+13 after 7.03084e+13
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin9362345654559965830;'/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' 'ASLinkPT05aReachabilityFireability202402==true'
Retrying LTSmin with larger timeout 28800 s
Running LTSmin : cd /tmp/ltsmin9362345654559965830;'/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' 'ASLinkPT05aReachabilityFireability202402==true'
Reachability property ASLink-PT-05a-ReachabilityFireability-2024-02 is true.
FORMULA ASLink-PT-05a-ReachabilityFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 8193 fixpoint passes
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,1.0312e+15,1539.76,14083856,104489,3207,9.46726e+06,173529,1891,1.63531e+08,440,1.5893e+06,0
Total reachable state count : 1031204297760967

Verifying 1 reachability properties.

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
+ [[ 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.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /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="ASLink-PT-05a"
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-5973"
echo " Executing tool itstools"
echo " Input is ASLink-PT-05a, 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 r002-oct2-177944366200351"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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