fond
Model Checking Contest 2026
16th edition, Hamburg, Germany, June 23, 2026
Execution of r194-tall-177969914000331
Last Updated
Jun 17, 2026

About the Execution of ITS-Tools for NoC3x3-PT-5B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
798.716 376462.00 479023.00 6081.50 FTTFFFTFFFFFFFTF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r194-tall-177969914000331.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5973
Executing tool itstools
Input is NoC3x3-PT-5B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r194-tall-177969914000331
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 968K
-rw-r--r-- 1 mcc users 6.8K Mar 8 06:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Mar 8 06:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Mar 8 06:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Mar 8 06:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Mar 16 08:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 16 08:15 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 16 08:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 16 08:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 8 06:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Mar 8 06:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Mar 8 06:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Mar 8 06:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 16 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 16 08:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 525K 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 NoC3x3-PT-5B-LTLCardinality-00
FORMULA_NAME NoC3x3-PT-5B-LTLCardinality-01
FORMULA_NAME NoC3x3-PT-5B-LTLCardinality-02
FORMULA_NAME NoC3x3-PT-5B-LTLCardinality-03
FORMULA_NAME NoC3x3-PT-5B-LTLCardinality-04
FORMULA_NAME NoC3x3-PT-5B-LTLCardinality-05
FORMULA_NAME NoC3x3-PT-5B-LTLCardinality-06
FORMULA_NAME NoC3x3-PT-5B-LTLCardinality-07
FORMULA_NAME NoC3x3-PT-5B-LTLCardinality-08
FORMULA_NAME NoC3x3-PT-5B-LTLCardinality-09
FORMULA_NAME NoC3x3-PT-5B-LTLCardinality-10
FORMULA_NAME NoC3x3-PT-5B-LTLCardinality-11
FORMULA_NAME NoC3x3-PT-5B-LTLCardinality-12
FORMULA_NAME NoC3x3-PT-5B-LTLCardinality-13
FORMULA_NAME NoC3x3-PT-5B-LTLCardinality-14
FORMULA_NAME NoC3x3-PT-5B-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779755604073

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-5B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-26 00:33:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-26 00:33:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-26 00:33:25] [INFO ] Load time of PNML (sax parser for PT used): 138 ms
[2026-05-26 00:33:25] [INFO ] Transformed 1571 places.
[2026-05-26 00:33:25] [INFO ] Transformed 2173 transitions.
[2026-05-26 00:33:25] [INFO ] Found NUPN structural information;
[2026-05-26 00:33:25] [INFO ] Parsed PT model containing 1571 places and 2173 transitions and 6109 arcs in 254 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA NoC3x3-PT-5B-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-5B-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-5B-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-5B-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-5B-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-5B-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-5B-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-5B-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-5B-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-5B-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-5B-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 20 out of 1571 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1571/1571 places, 2173/2173 transitions.
Discarding 432 places :
Symmetric choice reduction at 0 with 432 rule applications. Total rules 432 place count 1139 transition count 1741
Iterating global reduction 0 with 432 rules applied. Total rules applied 864 place count 1139 transition count 1741
Discarding 114 places :
Symmetric choice reduction at 0 with 114 rule applications. Total rules 978 place count 1025 transition count 1619
Iterating global reduction 0 with 114 rules applied. Total rules applied 1092 place count 1025 transition count 1619
Discarding 88 places :
Symmetric choice reduction at 0 with 88 rule applications. Total rules 1180 place count 937 transition count 1470
Iterating global reduction 0 with 88 rules applied. Total rules applied 1268 place count 937 transition count 1470
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 1290 place count 915 transition count 1426
Iterating global reduction 0 with 22 rules applied. Total rules applied 1312 place count 915 transition count 1426
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 1319 place count 908 transition count 1412
Iterating global reduction 0 with 7 rules applied. Total rules applied 1326 place count 908 transition count 1412
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 1333 place count 901 transition count 1405
Iterating global reduction 0 with 7 rules applied. Total rules applied 1340 place count 901 transition count 1405
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 1343 place count 898 transition count 1399
Iterating global reduction 0 with 3 rules applied. Total rules applied 1346 place count 898 transition count 1399
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 1349 place count 895 transition count 1390
Iterating global reduction 0 with 3 rules applied. Total rules applied 1352 place count 895 transition count 1390
Applied a total of 1352 rules in 429 ms. Remains 895 /1571 variables (removed 676) and now considering 1390/2173 (removed 783) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10629337844635623567.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18091068715614560271.kers'
[2026-05-26 00:33:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10629337844635623567.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18091068715614560271.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1390 rows 895 cols 4175 entries
Finished phase 1 with 829 SingleSign rule and 0 generalized
[2026-05-26 00:33:26] [INFO ] Computed 66 invariants in 10 ms
Computed 66 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-18091068715614560271.kers
Total runtime 12 ms.
[2026-05-26 00:33:26] [INFO ] Implicit Places using invariants in 626 ms returned []
[2026-05-26 00:33:26] [INFO ] Invariant cache hit.
[2026-05-26 00:33:27] [INFO ] Implicit Places using invariants and state equation in 935 ms returned []
Implicit Place search using SMT with State Equation took 1603 ms to find 0 implicit places.
Running 1389 sub problems to find dead transitions.
[2026-05-26 00:33:27] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 894/2285 variables, and 0 constraints, problems are : Problem set: 0 solved, 1389 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/895 constraints, PredecessorRefiner: 1389/1389 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1389 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 894/2285 variables, and 0 constraints, problems are : Problem set: 0 solved, 1389 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/895 constraints, PredecessorRefiner: 0/1389 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60482ms problems are : Problem set: 0 solved, 1389 unsolved
Search for dead transitions found 0 dead transitions in 60502ms
Starting structural reductions in LTL mode, iteration 1 : 895/1571 places, 1390/2173 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62574 ms. Remains : 895/1571 places, 1390/2173 transitions.
Starting structural reductions in LTL mode, iteration 0 : 895/895 places, 1390/1390 transitions.
Applied a total of 0 rules in 16 ms. Remains 895 /895 variables (removed 0) and now considering 1390/1390 (removed 0) transitions.
[2026-05-26 00:34:28] [INFO ] Invariant cache hit.
[2026-05-26 00:34:28] [INFO ] Implicit Places using invariants in 360 ms returned []
[2026-05-26 00:34:28] [INFO ] Invariant cache hit.
[2026-05-26 00:34:29] [INFO ] Implicit Places using invariants and state equation in 853 ms returned []
Implicit Place search using SMT with State Equation took 1215 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1233 ms. Remains : 895/895 places, 1390/1390 transitions.
Support contains 20 out of 895 places after structural reductions.
[2026-05-26 00:34:29] [INFO ] Flatten gal took : 114 ms
[2026-05-26 00:34:29] [INFO ] Flatten gal took : 66 ms
[2026-05-26 00:34:30] [INFO ] Input system was already deterministic with 1390 transitions.
RANDOM walk for 39984 steps (58 resets) in 1293 ms. (30 steps per ms) remains 0/10 properties
Computed a total of 65 stabilizing places and 65 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(p0)))'
Support contains 2 out of 895 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 895/895 places, 1390/1390 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 884 transition count 1377
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 884 transition count 1377
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 28 place count 878 transition count 1369
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 place count 878 transition count 1369
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 38 place count 874 transition count 1362
Iterating global reduction 0 with 4 rules applied. Total rules applied 42 place count 874 transition count 1362
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 873 transition count 1360
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 873 transition count 1360
Applied a total of 44 rules in 82 ms. Remains 873 /895 variables (removed 22) and now considering 1360/1390 (removed 30) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16548906660356680237.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17877417180106628922.kers'
[2026-05-26 00:34:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16548906660356680237.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17877417180106628922.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1360 rows 873 cols 4093 entries
Finished phase 1 with 807 SingleSign rule and 0 generalized
[2026-05-26 00:34:30] [INFO ] Computed 66 invariants in 8 ms
Computed 66 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-17877417180106628922.kers
Total runtime 10 ms.
[2026-05-26 00:34:31] [INFO ] Implicit Places using invariants in 370 ms returned []
[2026-05-26 00:34:31] [INFO ] Invariant cache hit.
[2026-05-26 00:34:31] [INFO ] Implicit Places using invariants and state equation in 867 ms returned []
Implicit Place search using SMT with State Equation took 1240 ms to find 0 implicit places.
Running 1359 sub problems to find dead transitions.
[2026-05-26 00:34:31] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 872/2233 variables, and 0 constraints, problems are : Problem set: 0 solved, 1359 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/873 constraints, PredecessorRefiner: 1359/1359 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1359 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 872/2233 variables, and 0 constraints, problems are : Problem set: 0 solved, 1359 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/873 constraints, PredecessorRefiner: 0/1359 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60333ms problems are : Problem set: 0 solved, 1359 unsolved
Search for dead transitions found 0 dead transitions in 60337ms
Starting structural reductions in LTL mode, iteration 1 : 873/895 places, 1360/1390 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61676 ms. Remains : 873/895 places, 1360/1390 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(p0)))'
Stuttering acceptance computed with spot in 252 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : NoC3x3-PT-5B-LTLCardinality-07
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 3 ms.
FORMULA NoC3x3-PT-5B-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-5B-LTLCardinality-07 finished in 62016 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 895 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 895/895 places, 1390/1390 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 894 transition count 1325
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 128 place count 830 transition count 1325
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 38 Pre rules applied. Total rules applied 128 place count 830 transition count 1287
Deduced a syphon composed of 38 places in 2 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 204 place count 792 transition count 1287
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 235 place count 761 transition count 1183
Iterating global reduction 2 with 31 rules applied. Total rules applied 266 place count 761 transition count 1183
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 271 place count 756 transition count 1175
Iterating global reduction 2 with 5 rules applied. Total rules applied 276 place count 756 transition count 1175
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 2 with 1 rules applied. Total rules applied 277 place count 756 transition count 1174
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 278 place count 755 transition count 1174
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 279 place count 754 transition count 1172
Iterating global reduction 4 with 1 rules applied. Total rules applied 280 place count 754 transition count 1172
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 281 place count 753 transition count 1169
Iterating global reduction 4 with 1 rules applied. Total rules applied 282 place count 753 transition count 1169
Performed 194 Post agglomeration using F-continuation condition.Transition count delta: 194
Deduced a syphon composed of 194 places in 1 ms
Reduce places removed 194 places and 0 transitions.
Iterating global reduction 4 with 388 rules applied. Total rules applied 670 place count 559 transition count 975
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 674 place count 559 transition count 971
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 677 place count 556 transition count 965
Iterating global reduction 5 with 3 rules applied. Total rules applied 680 place count 556 transition count 965
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 681 place count 555 transition count 963
Iterating global reduction 5 with 1 rules applied. Total rules applied 682 place count 555 transition count 963
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 5 with 202 rules applied. Total rules applied 884 place count 454 transition count 989
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 5 with 14 rules applied. Total rules applied 898 place count 454 transition count 975
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 6 with 72 rules applied. Total rules applied 970 place count 418 transition count 983
Drop transitions (Redundant composition of simpler transitions.) removed 61 transitions
Redundant transition composition rules discarded 61 transitions
Iterating global reduction 6 with 61 rules applied. Total rules applied 1031 place count 418 transition count 922
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 1040 place count 409 transition count 922
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 5 Pre rules applied. Total rules applied 1040 place count 409 transition count 917
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 1050 place count 404 transition count 917
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 7 with 38 rules applied. Total rules applied 1088 place count 385 transition count 898
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 1089 place count 384 transition count 897
Applied a total of 1089 rules in 338 ms. Remains 384 /895 variables (removed 511) and now considering 897/1390 (removed 493) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13745062535311702946.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8993690736818581837.kers'
[2026-05-26 00:35:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13745062535311702946.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8993690736818581837.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 897 rows 384 cols 3396 entries
Finished phase 1 with 310 SingleSign rule and 17 generalized
[2026-05-26 00:35:32] [INFO ] Computed 57 invariants in 2 ms
Computed 57 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-8993690736818581837.kers
Total runtime 4 ms.
[2026-05-26 00:35:33] [INFO ] Implicit Places using invariants in 180 ms returned []
[2026-05-26 00:35:33] [INFO ] Invariant cache hit.
[2026-05-26 00:35:33] [INFO ] State equation strengthened by 31 read => feed constraints.
[2026-05-26 00:35:33] [INFO ] Implicit Places using invariants and state equation in 494 ms returned []
Implicit Place search using SMT with State Equation took 676 ms to find 0 implicit places.
[2026-05-26 00:35:33] [INFO ] Redundant transitions in 51 ms returned []
Running 842 sub problems to find dead transitions.
[2026-05-26 00:35:33] [INFO ] Invariant cache hit.
[2026-05-26 00:35:33] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 842 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/384 variables, 13/70 constraints. Problems are: Problem set: 0 solved, 842 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 3/73 constraints. Problems are: Problem set: 0 solved, 842 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/384 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 842 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 384/1281 variables, and 74 constraints, problems are : Problem set: 0 solved, 842 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 0/384 constraints, ReadFeed: 0/31 constraints, PredecessorRefiner: 842/842 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 842 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 842 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/384 variables, 17/74 constraints. Problems are: Problem set: 0 solved, 842 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 842 unsolved
At refinement iteration 3 (OVERLAPS) 897/1281 variables, 384/458 constraints. Problems are: Problem set: 0 solved, 842 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1281 variables, 31/489 constraints. Problems are: Problem set: 0 solved, 842 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1281 variables, 842/1331 constraints. Problems are: Problem set: 0 solved, 842 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1281/1281 variables, and 1331 constraints, problems are : Problem set: 0 solved, 842 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 384/384 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 842/842 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60200ms problems are : Problem set: 0 solved, 842 unsolved
Search for dead transitions found 0 dead transitions in 60202ms
Starting structural reductions in SI_LTL mode, iteration 1 : 384/895 places, 897/1390 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61279 ms. Remains : 384/895 places, 897/1390 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-5B-LTLCardinality-09
Product exploration explored 100000 steps with 574 reset in 513 ms.
Stack based approach found an accepted trace after 4449 steps with 28 reset with depth 32 and stack size 32 in 23 ms.
FORMULA NoC3x3-PT-5B-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property NoC3x3-PT-5B-LTLCardinality-09 finished in 61992 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((X(X(!p0)) U ((!p1&&X(X(!p0)))||X(X(G(!p0))))))&&F((G(F(!p1))||(!p2&&F(!p1))))))'
Support contains 6 out of 895 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 895/895 places, 1390/1390 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 885 transition count 1379
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 885 transition count 1379
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 27 place count 878 transition count 1370
Iterating global reduction 0 with 7 rules applied. Total rules applied 34 place count 878 transition count 1370
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 38 place count 874 transition count 1363
Iterating global reduction 0 with 4 rules applied. Total rules applied 42 place count 874 transition count 1363
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 873 transition count 1361
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 873 transition count 1361
Applied a total of 44 rules in 91 ms. Remains 873 /895 variables (removed 22) and now considering 1361/1390 (removed 29) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8831001125446560051.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11893099415042946763.kers'
[2026-05-26 00:36:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8831001125446560051.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11893099415042946763.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 1361 rows 873 cols 4093 entries
Finished phase 1 with 807 SingleSign rule and 0 generalized
[2026-05-26 00:36:34] [INFO ] Computed 66 invariants in 7 ms
Computed 66 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-11893099415042946763.kers
Total runtime 8 ms.
[2026-05-26 00:36:35] [INFO ] Implicit Places using invariants in 332 ms returned []
[2026-05-26 00:36:35] [INFO ] Invariant cache hit.
[2026-05-26 00:36:35] [INFO ] Implicit Places using invariants and state equation in 806 ms returned []
Implicit Place search using SMT with State Equation took 1141 ms to find 0 implicit places.
Running 1360 sub problems to find dead transitions.
[2026-05-26 00:36:35] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 872/2234 variables, and 0 constraints, problems are : Problem set: 0 solved, 1360 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/873 constraints, PredecessorRefiner: 1360/1360 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1360 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 872/2234 variables, and 0 constraints, problems are : Problem set: 0 solved, 1360 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/873 constraints, PredecessorRefiner: 0/1360 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60267ms problems are : Problem set: 0 solved, 1360 unsolved
Search for dead transitions found 0 dead transitions in 60270ms
Starting structural reductions in LTL mode, iteration 1 : 873/895 places, 1361/1390 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61506 ms. Remains : 873/895 places, 1361/1390 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((X(X(!p0)) U ((!p1&&X(X(!p0)))||X(X(G(!p0))))))&&F((G(F(!p1))||(F(!p1)&&p2)))))'
Stuttering acceptance computed with spot in 273 ms :[(OR p1 p0), p1, p1, p0, p0, p0, true]
Running random walk in product with property : NoC3x3-PT-5B-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-5B-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-5B-LTLCardinality-10 finished in 61870 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((F(p0)&&X(X((X(X(G(p1))) U G(!p2))))))))'
Support contains 6 out of 895 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 895/895 places, 1390/1390 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 886 transition count 1379
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 886 transition count 1379
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 23 place count 881 transition count 1371
Iterating global reduction 0 with 5 rules applied. Total rules applied 28 place count 881 transition count 1371
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 880 transition count 1369
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 880 transition count 1369
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 879 transition count 1366
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 879 transition count 1366
Applied a total of 32 rules in 90 ms. Remains 879 /895 variables (removed 16) and now considering 1366/1390 (removed 24) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11445963231938009773.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5062911791866279244.kers'
[2026-05-26 00:37:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11445963231938009773.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5062911791866279244.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1366 rows 879 cols 4109 entries
Finished phase 1 with 813 SingleSign rule and 0 generalized
[2026-05-26 00:37:36] [INFO ] Computed 66 invariants in 12 ms
Computed 66 P flows in 14 ms.
Exported basis to /tmp/petrispot-output-5062911791866279244.kers
Total runtime 15 ms.
[2026-05-26 00:37:36] [INFO ] Implicit Places using invariants in 383 ms returned []
[2026-05-26 00:37:36] [INFO ] Invariant cache hit.
[2026-05-26 00:37:37] [INFO ] Implicit Places using invariants and state equation in 909 ms returned []
Implicit Place search using SMT with State Equation took 1295 ms to find 0 implicit places.
Running 1365 sub problems to find dead transitions.
[2026-05-26 00:37:37] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 878/2245 variables, and 0 constraints, problems are : Problem set: 0 solved, 1365 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/879 constraints, PredecessorRefiner: 1365/1365 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1365 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 878/2245 variables, and 0 constraints, problems are : Problem set: 0 solved, 1365 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/879 constraints, PredecessorRefiner: 0/1365 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60285ms problems are : Problem set: 0 solved, 1365 unsolved
Search for dead transitions found 0 dead transitions in 60289ms
Starting structural reductions in LTL mode, iteration 1 : 879/895 places, 1366/1390 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61682 ms. Remains : 879/895 places, 1366/1390 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((F(p0)&&X(X((X(X(G(p1))) U G(!p2))))))))'
Stuttering acceptance computed with spot in 435 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), (NOT p0), (AND (NOT p0) p2 (NOT p1)), p2, (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p2 p1)]
Running random walk in product with property : NoC3x3-PT-5B-LTLCardinality-11
Stuttering criterion allowed to conclude after 755 steps with 0 reset in 4 ms.
FORMULA NoC3x3-PT-5B-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-5B-LTLCardinality-11 finished in 62180 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 895 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 895/895 places, 1390/1390 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 894 transition count 1323
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 132 place count 828 transition count 1323
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 38 Pre rules applied. Total rules applied 132 place count 828 transition count 1285
Deduced a syphon composed of 38 places in 3 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 208 place count 790 transition count 1285
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 240 place count 758 transition count 1179
Iterating global reduction 2 with 32 rules applied. Total rules applied 272 place count 758 transition count 1179
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 276 place count 754 transition count 1173
Iterating global reduction 2 with 4 rules applied. Total rules applied 280 place count 754 transition count 1173
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 2 with 1 rules applied. Total rules applied 281 place count 754 transition count 1172
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 282 place count 753 transition count 1172
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 283 place count 752 transition count 1170
Iterating global reduction 4 with 1 rules applied. Total rules applied 284 place count 752 transition count 1170
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 285 place count 751 transition count 1167
Iterating global reduction 4 with 1 rules applied. Total rules applied 286 place count 751 transition count 1167
Performed 194 Post agglomeration using F-continuation condition.Transition count delta: 194
Deduced a syphon composed of 194 places in 0 ms
Reduce places removed 194 places and 0 transitions.
Iterating global reduction 4 with 388 rules applied. Total rules applied 674 place count 557 transition count 973
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 678 place count 557 transition count 969
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 681 place count 554 transition count 963
Iterating global reduction 5 with 3 rules applied. Total rules applied 684 place count 554 transition count 963
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 685 place count 553 transition count 961
Iterating global reduction 5 with 1 rules applied. Total rules applied 686 place count 553 transition count 961
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 5 with 202 rules applied. Total rules applied 888 place count 452 transition count 989
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 5 with 14 rules applied. Total rules applied 902 place count 452 transition count 975
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 6 with 70 rules applied. Total rules applied 972 place count 417 transition count 983
Drop transitions (Redundant composition of simpler transitions.) removed 62 transitions
Redundant transition composition rules discarded 62 transitions
Iterating global reduction 6 with 62 rules applied. Total rules applied 1034 place count 417 transition count 921
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 1043 place count 408 transition count 921
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 5 Pre rules applied. Total rules applied 1043 place count 408 transition count 916
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 1053 place count 403 transition count 916
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 7 with 38 rules applied. Total rules applied 1091 place count 384 transition count 897
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 1092 place count 383 transition count 896
Applied a total of 1092 rules in 201 ms. Remains 383 /895 variables (removed 512) and now considering 896/1390 (removed 494) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1100374704738701287.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18083260876290676711.kers'
[2026-05-26 00:38:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1100374704738701287.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18083260876290676711.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 896 rows 383 cols 3396 entries
Finished phase 1 with 310 SingleSign rule and 16 generalized
[2026-05-26 00:38:38] [INFO ] Computed 57 invariants in 2 ms
Computed 57 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-18083260876290676711.kers
Total runtime 4 ms.
[2026-05-26 00:38:39] [INFO ] Implicit Places using invariants in 173 ms returned []
[2026-05-26 00:38:39] [INFO ] Invariant cache hit.
[2026-05-26 00:38:39] [INFO ] State equation strengthened by 31 read => feed constraints.
[2026-05-26 00:38:39] [INFO ] Implicit Places using invariants and state equation in 418 ms returned []
Implicit Place search using SMT with State Equation took 591 ms to find 0 implicit places.
[2026-05-26 00:38:39] [INFO ] Redundant transitions in 12 ms returned []
Running 841 sub problems to find dead transitions.
[2026-05-26 00:38:39] [INFO ] Invariant cache hit.
[2026-05-26 00:38:39] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/383 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 841 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/383 variables, 15/72 constraints. Problems are: Problem set: 0 solved, 841 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/383 variables, 4/76 constraints. Problems are: Problem set: 0 solved, 841 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 3 (INCLUDED_ONLY) 0/383 variables, 10/86 constraints. Problems are: Problem set: 0 solved, 841 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 383/1279 variables, and 86 constraints, problems are : Problem set: 0 solved, 841 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 0/383 constraints, ReadFeed: 0/31 constraints, PredecessorRefiner: 841/841 constraints, Known Traps: 29/29 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 841 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/383 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 841 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/383 variables, 29/86 constraints. Problems are: Problem set: 0 solved, 841 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/383 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 841 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/383 variables, 7/94 constraints. Problems are: Problem set: 0 solved, 841 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/383 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 841 unsolved
At refinement iteration 5 (OVERLAPS) 896/1279 variables, 383/477 constraints. Problems are: Problem set: 0 solved, 841 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1279 variables, 31/508 constraints. Problems are: Problem set: 0 solved, 841 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1279 variables, 841/1349 constraints. Problems are: Problem set: 0 solved, 841 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1279/1279 variables, and 1349 constraints, problems are : Problem set: 0 solved, 841 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 383/383 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 841/841 constraints, Known Traps: 37/37 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60183ms problems are : Problem set: 0 solved, 841 unsolved
Search for dead transitions found 0 dead transitions in 60184ms
Starting structural reductions in SI_LTL mode, iteration 1 : 383/895 places, 896/1390 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61003 ms. Remains : 383/895 places, 896/1390 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-5B-LTLCardinality-13
Product exploration explored 100000 steps with 490 reset in 410 ms.
Stack based approach found an accepted trace after 58034 steps with 277 reset with depth 262 and stack size 262 in 327 ms.
FORMULA NoC3x3-PT-5B-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property NoC3x3-PT-5B-LTLCardinality-13 finished in 61822 ms.
All properties solved by simple procedures.
Total runtime 375215 ms.

BK_STOP 1779755980535

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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="NoC3x3-PT-5B"
export BK_EXAMINATION="LTLCardinality"
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 NoC3x3-PT-5B, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r194-tall-177969914000331"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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