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-177969914000324.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-5A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r194-tall-177969914000324
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 672K
-rw-r--r-- 1 mcc users 6.5K Mar 8 06:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Mar 8 06:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Mar 8 06:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Mar 8 06:40 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.4K Mar 16 08:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 16 08:14 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 16 08:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 16 08:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K Mar 8 06:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 101K Mar 8 06:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Mar 8 06:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Mar 8 06:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 16 08:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 16 08:14 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 248K 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-5A-LTLFireability-00
FORMULA_NAME NoC3x3-PT-5A-LTLFireability-01
FORMULA_NAME NoC3x3-PT-5A-LTLFireability-02
FORMULA_NAME NoC3x3-PT-5A-LTLFireability-03
FORMULA_NAME NoC3x3-PT-5A-LTLFireability-04
FORMULA_NAME NoC3x3-PT-5A-LTLFireability-05
FORMULA_NAME NoC3x3-PT-5A-LTLFireability-06
FORMULA_NAME NoC3x3-PT-5A-LTLFireability-07
FORMULA_NAME NoC3x3-PT-5A-LTLFireability-08
FORMULA_NAME NoC3x3-PT-5A-LTLFireability-09
FORMULA_NAME NoC3x3-PT-5A-LTLFireability-10
FORMULA_NAME NoC3x3-PT-5A-LTLFireability-11
FORMULA_NAME NoC3x3-PT-5A-LTLFireability-12
FORMULA_NAME NoC3x3-PT-5A-LTLFireability-13
FORMULA_NAME NoC3x3-PT-5A-LTLFireability-14
FORMULA_NAME NoC3x3-PT-5A-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779753013798

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-5A
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-25 23:50:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 23:50:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 23:50:15] [INFO ] Load time of PNML (sax parser for PT used): 102 ms
[2026-05-25 23:50:15] [INFO ] Transformed 417 places.
[2026-05-25 23:50:15] [INFO ] Transformed 933 transitions.
[2026-05-25 23:50:15] [INFO ] Found NUPN structural information;
[2026-05-25 23:50:15] [INFO ] Parsed PT model containing 417 places and 933 transitions and 3585 arcs in 202 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA NoC3x3-PT-5A-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-5A-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-5A-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 48 out of 417 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 417/417 places, 933/933 transitions.
Discarding 71 places :
Symmetric choice reduction at 0 with 71 rule applications. Total rules 71 place count 346 transition count 769
Iterating global reduction 0 with 71 rules applied. Total rules applied 142 place count 346 transition count 769
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 144 place count 344 transition count 761
Iterating global reduction 0 with 2 rules applied. Total rules applied 146 place count 344 transition count 761
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 150 place count 344 transition count 757
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 1 with 19 rules applied. Total rules applied 169 place count 344 transition count 738
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 171 place count 342 transition count 738
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 172 place count 341 transition count 735
Iterating global reduction 2 with 1 rules applied. Total rules applied 173 place count 341 transition count 735
Applied a total of 173 rules in 93 ms. Remains 341 /417 variables (removed 76) and now considering 735/933 (removed 198) transitions.
[2026-05-25 23:50:15] [INFO ] Flow matrix only has 733 transitions (discarded 2 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4618808337383498496.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6788506066934580287.kers'
[2026-05-25 23:50:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4618808337383498496.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6788506066934580287.kers]
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 0 ms.
// Phase 1: matrix 733 rows 334 cols 2746 entries
Finished phase 1 with 277 SingleSign rule and 0 generalized
[2026-05-25 23:50:15] [INFO ] Computed 64 invariants in 3 ms
Computed 64 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-6788506066934580287.kers
Total runtime 4 ms.
[2026-05-25 23:50:15] [INFO ] Implicit Places using invariants in 417 ms returned [39, 75, 107, 156, 221, 258, 290]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 450 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 334/417 places, 735/933 transitions.
Applied a total of 0 rules in 6 ms. Remains 334 /334 variables (removed 0) and now considering 735/735 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 562 ms. Remains : 334/417 places, 735/933 transitions.
Starting structural reductions in LTL mode, iteration 0 : 334/334 places, 735/735 transitions.
Applied a total of 0 rules in 10 ms. Remains 334 /334 variables (removed 0) and now considering 735/735 (removed 0) transitions.
[2026-05-25 23:50:15] [INFO ] Flow matrix only has 733 transitions (discarded 2 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13071607744004855142.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11808620711307644678.kers'
[2026-05-25 23:50:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13071607744004855142.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11808620711307644678.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 733 rows 334 cols 2746 entries
Finished phase 1 with 277 SingleSign rule and 0 generalized
[2026-05-25 23:50:15] [INFO ] Computed 57 invariants in 2 ms
Computed 57 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-11808620711307644678.kers
Total runtime 3 ms.
[2026-05-25 23:50:16] [INFO ] Implicit Places using invariants in 165 ms returned []
[2026-05-25 23:50:16] [INFO ] Flow matrix only has 733 transitions (discarded 2 similar events)
[2026-05-25 23:50:16] [INFO ] Invariant cache hit.
[2026-05-25 23:50:16] [INFO ] State equation strengthened by 18 read => feed constraints.
[2026-05-25 23:50:16] [INFO ] Implicit Places using invariants and state equation in 341 ms returned []
Implicit Place search using SMT with State Equation took 509 ms to find 0 implicit places.
Running 734 sub problems to find dead transitions.
[2026-05-25 23:50:16] [INFO ] Flow matrix only has 733 transitions (discarded 2 similar events)
[2026-05-25 23:50:16] [INFO ] Invariant cache hit.
[2026-05-25 23:50:16] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/333 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 734 unsolved
At refinement iteration 1 (OVERLAPS) 1/334 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 734 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/334 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 734 unsolved
At refinement iteration 3 (OVERLAPS) 733/1067 variables, 334/391 constraints. Problems are: Problem set: 0 solved, 734 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1067 variables, 18/409 constraints. Problems are: Problem set: 0 solved, 734 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1067/1067 variables, and 409 constraints, problems are : Problem set: 0 solved, 734 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 334/334 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 734/734 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 734 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/333 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 734 unsolved
At refinement iteration 1 (OVERLAPS) 1/334 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 734 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/334 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 734 unsolved
At refinement iteration 3 (OVERLAPS) 733/1067 variables, 334/391 constraints. Problems are: Problem set: 0 solved, 734 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1067 variables, 18/409 constraints. Problems are: Problem set: 0 solved, 734 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1067 variables, 734/1143 constraints. Problems are: Problem set: 0 solved, 734 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1067/1067 variables, and 1143 constraints, problems are : Problem set: 0 solved, 734 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 334/334 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 734/734 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60327ms problems are : Problem set: 0 solved, 734 unsolved
Search for dead transitions found 0 dead transitions in 60342ms
Finished structural reductions in LTL mode , in 1 iterations and 60890 ms. Remains : 334/334 places, 735/735 transitions.
Support contains 48 out of 334 places after structural reductions.
[2026-05-25 23:51:16] [INFO ] Flatten gal took : 86 ms
[2026-05-25 23:51:17] [INFO ] Flatten gal took : 47 ms
[2026-05-25 23:51:17] [INFO ] Input system was already deterministic with 735 transitions.
Support contains 46 out of 334 places (down from 48) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 1329 ms. (30 steps per ms) remains 2/31 properties
BEST_FIRST walk for 40004 steps (8 resets) in 134 ms. (296 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 182 ms. (218 steps per ms) remains 2/2 properties
[2026-05-25 23:51:17] [INFO ] Flow matrix only has 733 transitions (discarded 2 similar events)
[2026-05-25 23:51:17] [INFO ] Invariant cache hit.
[2026-05-25 23:51:17] [INFO ] State equation strengthened by 18 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 16/22 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 312/334 variables, 54/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/334 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 733/1067 variables, 334/391 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1067 variables, 18/409 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1067 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1067 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1067/1067 variables, and 409 constraints, problems are : Problem set: 0 solved, 2 unsolved in 338 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 334/334 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp26 is UNSAT
At refinement iteration 1 (OVERLAPS) 16/22 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 312/334 variables, 54/57 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/334 variables, 1/58 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/334 variables, 0/58 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 733/1067 variables, 334/392 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1067 variables, 18/410 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1067 variables, 1/411 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1067 variables, 0/411 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1067 variables, 0/411 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1067/1067 variables, and 411 constraints, problems are : Problem set: 1 solved, 1 unsolved in 430 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 334/334 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 777ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 91 ms.
Support contains 2 out of 334 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 334/334 places, 735/735 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 326 transition count 711
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 326 transition count 711
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 325 transition count 707
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 325 transition count 707
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 325 transition count 705
Partial Free-agglomeration rule applied 71 times.
Drop transitions (Partial Free agglomeration) removed 71 transitions
Iterating global reduction 1 with 71 rules applied. Total rules applied 91 place count 325 transition count 705
Applied a total of 91 rules in 108 ms. Remains 325 /334 variables (removed 9) and now considering 705/735 (removed 30) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 125 ms. Remains : 325/334 places, 705/735 transitions.
RANDOM walk for 27779 steps (5 resets) in 383 ms. (72 steps per ms) remains 0/1 properties
FORMULA NoC3x3-PT-5A-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
FORMULA NoC3x3-PT-5A-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 1 stabilizing places and 1 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' '!(((G(p0) U p1)||X(p2)))'
Support contains 6 out of 334 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 334/334 places, 735/735 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 327 transition count 714
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 327 transition count 714
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 325 transition count 706
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 325 transition count 706
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 22 place count 325 transition count 702
Applied a total of 22 rules in 11 ms. Remains 325 /334 variables (removed 9) and now considering 702/735 (removed 33) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7854748705239918194.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-739247331744427680.kers'
[2026-05-25 23:51:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7854748705239918194.kers, --Pflows, --basisKERS=/tmp/petrispot-output-739247331744427680.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 702 rows 325 cols 2634 entries
Finished phase 1 with 268 SingleSign rule and 0 generalized
[2026-05-25 23:51:19] [INFO ] Computed 57 invariants in 2 ms
Computed 57 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-739247331744427680.kers
Total runtime 6 ms.
[2026-05-25 23:51:19] [INFO ] Implicit Places using invariants in 164 ms returned []
[2026-05-25 23:51:19] [INFO ] Invariant cache hit.
[2026-05-25 23:51:19] [INFO ] State equation strengthened by 18 read => feed constraints.
[2026-05-25 23:51:19] [INFO ] Implicit Places using invariants and state equation in 327 ms returned []
Implicit Place search using SMT with State Equation took 493 ms to find 0 implicit places.
Running 701 sub problems to find dead transitions.
[2026-05-25 23:51:19] [INFO ] Invariant cache hit.
[2026-05-25 23:51:19] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/324 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 701 unsolved
At refinement iteration 1 (OVERLAPS) 1/325 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 701 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/325 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 701 unsolved
At refinement iteration 3 (OVERLAPS) 702/1027 variables, 325/382 constraints. Problems are: Problem set: 0 solved, 701 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1027 variables, 18/400 constraints. Problems are: Problem set: 0 solved, 701 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1027/1027 variables, and 400 constraints, problems are : Problem set: 0 solved, 701 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 325/325 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 701/701 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 701 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/324 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 701 unsolved
At refinement iteration 1 (OVERLAPS) 1/325 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 701 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/325 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 701 unsolved
At refinement iteration 3 (OVERLAPS) 702/1027 variables, 325/382 constraints. Problems are: Problem set: 0 solved, 701 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1027 variables, 18/400 constraints. Problems are: Problem set: 0 solved, 701 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1027 variables, 701/1101 constraints. Problems are: Problem set: 0 solved, 701 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1027/1027 variables, and 1101 constraints, problems are : Problem set: 0 solved, 701 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 325/325 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 701/701 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60187ms problems are : Problem set: 0 solved, 701 unsolved
Search for dead transitions found 0 dead transitions in 60190ms
Starting structural reductions in LTL mode, iteration 1 : 325/334 places, 702/735 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60699 ms. Remains : 325/334 places, 702/735 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(p0) U p1)||X(p2)))'
Stuttering acceptance computed with spot in 314 ms :[(NOT p0), true, (AND (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-5A-LTLFireability-00
Product exploration explored 100000 steps with 50000 reset in 914 ms.
Product exploration explored 100000 steps with 50000 reset in 783 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 11 factoid took 14 ms. Proved property starting from automaton with 6 states, 12 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 23 ms.
FORMULA NoC3x3-PT-5A-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NoC3x3-PT-5A-LTLFireability-00 finished in 62816 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(p0))&&F(p1)))'
Support contains 2 out of 334 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 334/334 places, 735/735 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 326 transition count 711
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 326 transition count 711
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 324 transition count 703
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 324 transition count 703
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 24 place count 324 transition count 699
Applied a total of 24 rules in 13 ms. Remains 324 /334 variables (removed 10) and now considering 699/735 (removed 36) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5833460724486466600.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10773033538436637457.kers'
[2026-05-25 23:52:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5833460724486466600.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10773033538436637457.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 699 rows 324 cols 2624 entries
Finished phase 1 with 267 SingleSign rule and 0 generalized
[2026-05-25 23:52:22] [INFO ] Computed 57 invariants in 4 ms
Computed 57 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-10773033538436637457.kers
Total runtime 5 ms.
[2026-05-25 23:52:22] [INFO ] Implicit Places using invariants in 175 ms returned []
[2026-05-25 23:52:22] [INFO ] Invariant cache hit.
[2026-05-25 23:52:22] [INFO ] State equation strengthened by 18 read => feed constraints.
[2026-05-25 23:52:22] [INFO ] Implicit Places using invariants and state equation in 334 ms returned []
Implicit Place search using SMT with State Equation took 515 ms to find 0 implicit places.
Running 698 sub problems to find dead transitions.
[2026-05-25 23:52:22] [INFO ] Invariant cache hit.
[2026-05-25 23:52:22] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/323 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 698 unsolved
At refinement iteration 1 (OVERLAPS) 1/324 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 698 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/324 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 698 unsolved
At refinement iteration 3 (OVERLAPS) 699/1023 variables, 324/381 constraints. Problems are: Problem set: 0 solved, 698 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1023 variables, 18/399 constraints. Problems are: Problem set: 0 solved, 698 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1023/1023 variables, and 399 constraints, problems are : Problem set: 0 solved, 698 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 324/324 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 698/698 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 698 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/323 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 698 unsolved
At refinement iteration 1 (OVERLAPS) 1/324 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 698 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/324 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 698 unsolved
At refinement iteration 3 (OVERLAPS) 699/1023 variables, 324/381 constraints. Problems are: Problem set: 0 solved, 698 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1023 variables, 18/399 constraints. Problems are: Problem set: 0 solved, 698 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1023 variables, 698/1097 constraints. Problems are: Problem set: 0 solved, 698 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1023/1023 variables, and 1098 constraints, problems are : Problem set: 0 solved, 698 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 324/324 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 698/698 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60147ms problems are : Problem set: 0 solved, 698 unsolved
Search for dead transitions found 0 dead transitions in 60149ms
Starting structural reductions in LTL mode, iteration 1 : 324/334 places, 699/735 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60679 ms. Remains : 324/334 places, 699/735 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))&&F(p1)))'
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), true]
Running random walk in product with property : NoC3x3-PT-5A-LTLFireability-03
Product exploration explored 100000 steps with 38 reset in 270 ms.
Stack based approach found an accepted trace after 5884 steps with 5 reset with depth 2237 and stack size 2237 in 27 ms.
FORMULA NoC3x3-PT-5A-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property NoC3x3-PT-5A-LTLFireability-03 finished in 61147 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)))'
Support contains 2 out of 334 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 334/334 places, 735/735 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 324 transition count 707
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 324 transition count 707
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 322 transition count 699
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 322 transition count 699
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 26 place count 322 transition count 695
Applied a total of 26 rules in 31 ms. Remains 322 /334 variables (removed 12) and now considering 695/735 (removed 40) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16992944889037472965.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6298638663883655995.kers'
[2026-05-25 23:53:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16992944889037472965.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6298638663883655995.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 695 rows 322 cols 2556 entries
Finished phase 1 with 265 SingleSign rule and 0 generalized
[2026-05-25 23:53:23] [INFO ] Computed 57 invariants in 2 ms
Computed 57 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-6298638663883655995.kers
Total runtime 2 ms.
[2026-05-25 23:53:23] [INFO ] Implicit Places using invariants in 132 ms returned []
[2026-05-25 23:53:23] [INFO ] Invariant cache hit.
[2026-05-25 23:53:23] [INFO ] State equation strengthened by 18 read => feed constraints.
[2026-05-25 23:53:23] [INFO ] Implicit Places using invariants and state equation in 328 ms returned []
Implicit Place search using SMT with State Equation took 462 ms to find 0 implicit places.
[2026-05-25 23:53:23] [INFO ] Redundant transitions in 34 ms returned []
Running 664 sub problems to find dead transitions.
[2026-05-25 23:53:23] [INFO ] Invariant cache hit.
[2026-05-25 23:53:23] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 664 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 664 unsolved
At refinement iteration 2 (OVERLAPS) 695/1017 variables, 322/379 constraints. Problems are: Problem set: 0 solved, 664 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1017 variables, 18/397 constraints. Problems are: Problem set: 0 solved, 664 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1017 variables, 1/398 constraints. Problems are: Problem set: 0 solved, 664 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1017 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 664 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1017/1017 variables, and 399 constraints, problems are : Problem set: 0 solved, 664 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 322/322 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 664/664 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 664 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 664 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 664 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 664 unsolved
At refinement iteration 3 (OVERLAPS) 695/1017 variables, 322/381 constraints. Problems are: Problem set: 0 solved, 664 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1017 variables, 18/399 constraints. Problems are: Problem set: 0 solved, 664 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1017 variables, 664/1063 constraints. Problems are: Problem set: 0 solved, 664 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1017/1017 variables, and 1063 constraints, problems are : Problem set: 0 solved, 664 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 322/322 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 664/664 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60135ms problems are : Problem set: 0 solved, 664 unsolved
Search for dead transitions found 0 dead transitions in 60137ms
Starting structural reductions in SI_LTL mode, iteration 1 : 322/334 places, 695/735 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60672 ms. Remains : 322/334 places, 695/735 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)))'
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-5A-LTLFireability-04
Product exploration explored 100000 steps with 6 reset in 233 ms.
Stack based approach found an accepted trace after 643 steps with 0 reset with depth 644 and stack size 644 in 4 ms.
FORMULA NoC3x3-PT-5A-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property NoC3x3-PT-5A-LTLFireability-04 finished in 61008 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((G(p1)&&p0)) U X(X(p2)))))'
Support contains 5 out of 334 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 334/334 places, 735/735 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 326 transition count 711
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 326 transition count 711
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 325 transition count 707
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 325 transition count 707
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 325 transition count 705
Applied a total of 20 rules in 13 ms. Remains 325 /334 variables (removed 9) and now considering 705/735 (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-17585698355844581640.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7118026684765738337.kers'
[2026-05-25 23:54:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17585698355844581640.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7118026684765738337.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 705 rows 325 cols 2648 entries
Finished phase 1 with 268 SingleSign rule and 0 generalized
[2026-05-25 23:54:24] [INFO ] Computed 57 invariants in 3 ms
Computed 57 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-7118026684765738337.kers
Total runtime 5 ms.
[2026-05-25 23:54:24] [INFO ] Implicit Places using invariants in 148 ms returned []
[2026-05-25 23:54:24] [INFO ] Invariant cache hit.
[2026-05-25 23:54:24] [INFO ] State equation strengthened by 18 read => feed constraints.
[2026-05-25 23:54:24] [INFO ] Implicit Places using invariants and state equation in 343 ms returned []
Implicit Place search using SMT with State Equation took 493 ms to find 0 implicit places.
Running 704 sub problems to find dead transitions.
[2026-05-25 23:54:24] [INFO ] Invariant cache hit.
[2026-05-25 23:54:24] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/324 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 704 unsolved
At refinement iteration 1 (OVERLAPS) 1/325 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 704 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/325 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 704 unsolved
At refinement iteration 3 (OVERLAPS) 705/1030 variables, 325/382 constraints. Problems are: Problem set: 0 solved, 704 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1030 variables, 18/400 constraints. Problems are: Problem set: 0 solved, 704 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1030/1030 variables, and 400 constraints, problems are : Problem set: 0 solved, 704 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 325/325 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 704/704 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 704 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/324 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 704 unsolved
At refinement iteration 1 (OVERLAPS) 1/325 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 704 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/325 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 704 unsolved
At refinement iteration 3 (OVERLAPS) 705/1030 variables, 325/382 constraints. Problems are: Problem set: 0 solved, 704 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1030 variables, 18/400 constraints. Problems are: Problem set: 0 solved, 704 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1030 variables, 704/1104 constraints. Problems are: Problem set: 0 solved, 704 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1030/1030 variables, and 1105 constraints, problems are : Problem set: 0 solved, 704 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 325/325 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 704/704 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60144ms problems are : Problem set: 0 solved, 704 unsolved
Search for dead transitions found 0 dead transitions in 60150ms
Starting structural reductions in LTL mode, iteration 1 : 325/334 places, 705/735 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60659 ms. Remains : 325/334 places, 705/735 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((G(p1)&&p0)) U X(X(p2)))))'
Stuttering acceptance computed with spot in 433 ms :[(NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-5A-LTLFireability-05
Product exploration explored 100000 steps with 0 reset in 343 ms.
Stack based approach found an accepted trace after 3647 steps with 0 reset with depth 3648 and stack size 3648 in 31 ms.
FORMULA NoC3x3-PT-5A-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property NoC3x3-PT-5A-LTLFireability-05 finished in 61526 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((G(p1)||p0))))'
Support contains 3 out of 334 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 334/334 places, 735/735 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 325 transition count 708
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 325 transition count 708
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 323 transition count 700
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 323 transition count 700
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 26 place count 323 transition count 696
Applied a total of 26 rules in 26 ms. Remains 323 /334 variables (removed 11) and now considering 696/735 (removed 39) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4118771797672139086.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1129260223028644987.kers'
[2026-05-25 23:55:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4118771797672139086.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1129260223028644987.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 696 rows 323 cols 2614 entries
Finished phase 1 with 266 SingleSign rule and 0 generalized
[2026-05-25 23:55:25] [INFO ] Computed 57 invariants in 2 ms
Computed 57 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1129260223028644987.kers
Total runtime 3 ms.
[2026-05-25 23:55:25] [INFO ] Implicit Places using invariants in 148 ms returned []
[2026-05-25 23:55:25] [INFO ] Invariant cache hit.
[2026-05-25 23:55:26] [INFO ] State equation strengthened by 18 read => feed constraints.
[2026-05-25 23:55:26] [INFO ] Implicit Places using invariants and state equation in 351 ms returned []
Implicit Place search using SMT with State Equation took 501 ms to find 0 implicit places.
[2026-05-25 23:55:26] [INFO ] Redundant transitions in 6 ms returned []
Running 695 sub problems to find dead transitions.
[2026-05-25 23:55:26] [INFO ] Invariant cache hit.
[2026-05-25 23:55:26] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 1 (OVERLAPS) 1/323 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/323 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 3 (OVERLAPS) 696/1019 variables, 323/380 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1019 variables, 18/398 constraints. Problems are: Problem set: 0 solved, 695 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 Real declared 1019/1019 variables, and 398 constraints, problems are : Problem set: 0 solved, 695 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 323/323 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 695/695 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 695 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 1 (OVERLAPS) 1/323 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/323 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 3 (OVERLAPS) 696/1019 variables, 323/380 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1019 variables, 18/398 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1019 variables, 695/1093 constraints. Problems are: Problem set: 0 solved, 695 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1019/1019 variables, and 1093 constraints, problems are : Problem set: 0 solved, 695 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 323/323 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 695/695 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60145ms problems are : Problem set: 0 solved, 695 unsolved
Search for dead transitions found 0 dead transitions in 60147ms
Starting structural reductions in SI_LTL mode, iteration 1 : 323/334 places, 696/735 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60686 ms. Remains : 323/334 places, 696/735 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((G(p1)||p0))))'
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : NoC3x3-PT-5A-LTLFireability-06
Product exploration explored 100000 steps with 25 reset in 266 ms.
Product exploration explored 100000 steps with 2 reset in 322 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge based reduction with 7 factoid took 95 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
RANDOM walk for 823 steps (0 resets) in 16 ms. (48 steps per ms) remains 0/4 properties
Knowledge based reduction with 7 factoid took 158 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 363 ms.
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 323 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 323/323 places, 696/696 transitions.
Applied a total of 0 rules in 18 ms. Remains 323 /323 variables (removed 0) and now considering 696/696 (removed 0) transitions.
[2026-05-25 23:56:27] [INFO ] Invariant cache hit.
[2026-05-25 23:56:27] [INFO ] Implicit Places using invariants in 133 ms returned []
[2026-05-25 23:56:27] [INFO ] Invariant cache hit.
[2026-05-25 23:56:27] [INFO ] State equation strengthened by 18 read => feed constraints.
[2026-05-25 23:56:28] [INFO ] Implicit Places using invariants and state equation in 341 ms returned []
Implicit Place search using SMT with State Equation took 475 ms to find 0 implicit places.
[2026-05-25 23:56:28] [INFO ] Redundant transitions in 7 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 504 ms. Remains : 323/323 places, 696/696 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge based reduction with 7 factoid took 85 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
RANDOM walk for 4223 steps (1 resets) in 30 ms. (136 steps per ms) remains 0/4 properties
Knowledge based reduction with 7 factoid took 133 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 321 ms.
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 31 reset in 288 ms.
Product exploration explored 100000 steps with 23 reset in 375 ms.
Built C files in :
/tmp/ltsmin17119723598808277124
[2026-05-25 23:56:29] [INFO ] Computing symmetric may disable matrix : 696 transitions.
[2026-05-25 23:56:29] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 23:56:29] [INFO ] Computing symmetric may enable matrix : 696 transitions.
[2026-05-25 23:56:29] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 23:56:29] [INFO ] Computing Do-Not-Accords matrix : 696 transitions.
[2026-05-25 23:56:29] [INFO ] Computation of Completed DNA matrix. took 21 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 23:56:29] [INFO ] Built C files in 146ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17119723598808277124
Running compilation step : cd /tmp/ltsmin17119723598808277124;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' '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'
Compilation finished in 1841 ms.
Running link step : cd /tmp/ltsmin17119723598808277124;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin17119723598808277124;'/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' '--hoa' '/tmp/stateBased889180484272271101.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 323 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 323/323 places, 696/696 transitions.
Applied a total of 0 rules in 11 ms. Remains 323 /323 variables (removed 0) and now considering 696/696 (removed 0) transitions.
[2026-05-25 23:56:44] [INFO ] Invariant cache hit.
[2026-05-25 23:56:44] [INFO ] Implicit Places using invariants in 131 ms returned []
[2026-05-25 23:56:44] [INFO ] Invariant cache hit.
[2026-05-25 23:56:44] [INFO ] State equation strengthened by 18 read => feed constraints.
[2026-05-25 23:56:44] [INFO ] Implicit Places using invariants and state equation in 315 ms returned []
Implicit Place search using SMT with State Equation took 447 ms to find 0 implicit places.
[2026-05-25 23:56:44] [INFO ] Redundant transitions in 7 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 472 ms. Remains : 323/323 places, 696/696 transitions.
Built C files in :
/tmp/ltsmin16874398049098441702
[2026-05-25 23:56:44] [INFO ] Computing symmetric may disable matrix : 696 transitions.
[2026-05-25 23:56:44] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 23:56:44] [INFO ] Computing symmetric may enable matrix : 696 transitions.
[2026-05-25 23:56:44] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 23:56:44] [INFO ] Computing Do-Not-Accords matrix : 696 transitions.
[2026-05-25 23:56:44] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 23:56:44] [INFO ] Built C files in 99ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16874398049098441702
Running compilation step : cd /tmp/ltsmin16874398049098441702;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' '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'
Compilation finished in 1679 ms.
Running link step : cd /tmp/ltsmin16874398049098441702;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin16874398049098441702;'/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' '--hoa' '/tmp/stateBased1873290034269580244.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-25 23:56:59] [INFO ] Flatten gal took : 69 ms
[2026-05-25 23:56:59] [INFO ] Flatten gal took : 61 ms
[2026-05-25 23:56:59] [INFO ] Time to serialize gal into /tmp/LTL8581729694189762735.gal : 7 ms
[2026-05-25 23:56:59] [INFO ] Time to serialize properties into /tmp/LTL8515425188842915538.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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8581729694189762735.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8441340109103524390.hoa' '-atoms' '/tmp/LTL8515425188842915538.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL8515425188842915538.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8441340109103524390.hoa
Detected timeout of ITS tools.
[2026-05-25 23:57:15] [INFO ] Flatten gal took : 29 ms
[2026-05-25 23:57:15] [INFO ] Flatten gal took : 28 ms
[2026-05-25 23:57:15] [INFO ] Time to serialize gal into /tmp/LTL4945648073255625582.gal : 7 ms
[2026-05-25 23:57:15] [INFO ] Time to serialize properties into /tmp/LTL3695799152389474351.ltl : 3 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4945648073255625582.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3695799152389474351.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F(("((p256==0)||(p295==0))")||(G("(p67==0)"))))))
Formula 0 simplified : G(F!"(p67==0)" & FG!"((p256==0)||(p295==0))")
Detected timeout of ITS tools.
[2026-05-25 23:57:30] [INFO ] Flatten gal took : 22 ms
[2026-05-25 23:57:30] [INFO ] Applying decomposition
[2026-05-25 23:57:30] [INFO ] Flatten gal took : 20 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/graph1907813608906092722.txt' '-o' '/tmp/graph1907813608906092722.bin' '-w' '/tmp/graph1907813608906092722.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph1907813608906092722.bin' '-l' '-1' '-v' '-w' '/tmp/graph1907813608906092722.weights' '-q' '0' '-e' '0.001'
[2026-05-25 23:57:30] [INFO ] Decomposing Gal with order
[2026-05-25 23:57:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 23:57:30] [INFO ] Removed a total of 496 redundant transitions.
[2026-05-25 23:57:30] [INFO ] Flatten gal took : 99 ms
[2026-05-25 23:57:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 423 labels/synchronizations in 15 ms.
[2026-05-25 23:57:30] [INFO ] Time to serialize gal into /tmp/LTL1379262992874044306.gal : 6 ms
[2026-05-25 23:57:30] [INFO ] Time to serialize properties into /tmp/LTL2656940697979544891.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1379262992874044306.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2656940697979544891.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(F(("((i5.i0.u28.p256==0)||(i5.i0.u28.p295==0))")||(G("(i1.u6.p67==0)"))))))
Formula 0 simplified : G(F!"(i1.u6.p67==0)" & FG!"((i5.i0.u28.p256==0)||(i5.i0.u28.p295==0))")
Detected timeout of ITS tools.
Treatment of property NoC3x3-PT-5A-LTLFireability-06 finished in 139865 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))&&(X(p1)||(p2 U p1))))'
Support contains 4 out of 334 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 334/334 places, 735/735 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 326 transition count 711
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 326 transition count 711
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 324 transition count 703
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 324 transition count 703
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 24 place count 324 transition count 699
Applied a total of 24 rules in 14 ms. Remains 324 /334 variables (removed 10) and now considering 699/735 (removed 36) transitions.
[2026-05-25 23:57:45] [INFO ] Flow matrix only has 697 transitions (discarded 2 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16625310684335143739.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-938364078152033424.kers'
[2026-05-25 23:57:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16625310684335143739.kers, --Pflows, --basisKERS=/tmp/petrispot-output-938364078152033424.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 697 rows 324 cols 2618 entries
Finished phase 1 with 267 SingleSign rule and 0 generalized
[2026-05-25 23:57:45] [INFO ] Computed 57 invariants in 4 ms
Computed 57 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-938364078152033424.kers
Total runtime 6 ms.
[2026-05-25 23:57:45] [INFO ] Implicit Places using invariants in 180 ms returned []
[2026-05-25 23:57:45] [INFO ] Flow matrix only has 697 transitions (discarded 2 similar events)
[2026-05-25 23:57:45] [INFO ] Invariant cache hit.
[2026-05-25 23:57:46] [INFO ] State equation strengthened by 18 read => feed constraints.
[2026-05-25 23:57:46] [INFO ] Implicit Places using invariants and state equation in 350 ms returned []
Implicit Place search using SMT with State Equation took 531 ms to find 0 implicit places.
Running 698 sub problems to find dead transitions.
[2026-05-25 23:57:46] [INFO ] Flow matrix only has 697 transitions (discarded 2 similar events)
[2026-05-25 23:57:46] [INFO ] Invariant cache hit.
[2026-05-25 23:57:46] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/323 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 698 unsolved
At refinement iteration 1 (OVERLAPS) 1/324 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 698 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/324 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 698 unsolved
At refinement iteration 3 (OVERLAPS) 697/1021 variables, 324/381 constraints. Problems are: Problem set: 0 solved, 698 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1021 variables, 18/399 constraints. Problems are: Problem set: 0 solved, 698 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1021/1021 variables, and 399 constraints, problems are : Problem set: 0 solved, 698 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 324/324 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 698/698 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 698 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/323 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 698 unsolved
At refinement iteration 1 (OVERLAPS) 1/324 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 698 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/324 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 698 unsolved
At refinement iteration 3 (OVERLAPS) 697/1021 variables, 324/381 constraints. Problems are: Problem set: 0 solved, 698 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1021 variables, 18/399 constraints. Problems are: Problem set: 0 solved, 698 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1021 variables, 698/1097 constraints. Problems are: Problem set: 0 solved, 698 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1021/1021 variables, and 1098 constraints, problems are : Problem set: 0 solved, 698 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 324/324 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 698/698 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60161ms problems are : Problem set: 0 solved, 698 unsolved
Search for dead transitions found 0 dead transitions in 60163ms
Starting structural reductions in LTL mode, iteration 1 : 324/334 places, 699/735 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60710 ms. Remains : 324/334 places, 699/735 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))&&(X(p1)||(p2 U p1))))'
Stuttering acceptance computed with spot in 202 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), true]
Running random walk in product with property : NoC3x3-PT-5A-LTLFireability-08
Entered a terminal (fully accepting) state of product in 27 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-5A-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-5A-LTLFireability-08 finished in 60951 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((F(p0)&&(G(p0)||p1)))) U G(p2))) U p1))'
Support contains 6 out of 334 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 334/334 places, 735/735 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 325 transition count 708
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 325 transition count 708
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 323 transition count 700
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 323 transition count 700
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 26 place count 323 transition count 696
Applied a total of 26 rules in 15 ms. Remains 323 /334 variables (removed 11) and now considering 696/735 (removed 39) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6637304020544577522.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13358159817733534030.kers'
[2026-05-25 23:58:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6637304020544577522.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13358159817733534030.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 696 rows 323 cols 2614 entries
Finished phase 1 with 266 SingleSign rule and 0 generalized
[2026-05-25 23:58:46] [INFO ] Computed 57 invariants in 4 ms
Computed 57 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-13358159817733534030.kers
Total runtime 6 ms.
[2026-05-25 23:58:46] [INFO ] Implicit Places using invariants in 139 ms returned []
[2026-05-25 23:58:46] [INFO ] Invariant cache hit.
[2026-05-25 23:58:46] [INFO ] State equation strengthened by 18 read => feed constraints.
[2026-05-25 23:58:47] [INFO ] Implicit Places using invariants and state equation in 335 ms returned []
Implicit Place search using SMT with State Equation took 476 ms to find 0 implicit places.
Running 695 sub problems to find dead transitions.
[2026-05-25 23:58:47] [INFO ] Invariant cache hit.
[2026-05-25 23:58:47] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 1 (OVERLAPS) 1/323 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/323 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 3 (OVERLAPS) 696/1019 variables, 323/380 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1019 variables, 18/398 constraints. Problems are: Problem set: 0 solved, 695 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1019/1019 variables, and 398 constraints, problems are : Problem set: 0 solved, 695 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 323/323 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 695/695 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 695 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 1 (OVERLAPS) 1/323 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/323 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 3 (OVERLAPS) 696/1019 variables, 323/380 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1019 variables, 18/398 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1019 variables, 695/1093 constraints. Problems are: Problem set: 0 solved, 695 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1019/1019 variables, and 1093 constraints, problems are : Problem set: 0 solved, 695 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 323/323 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 695/695 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60151ms problems are : Problem set: 0 solved, 695 unsolved
Search for dead transitions found 0 dead transitions in 60152ms
Starting structural reductions in LTL mode, iteration 1 : 323/334 places, 696/735 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60647 ms. Remains : 323/334 places, 696/735 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((F(p0)&&(G(p0)||p1)))) U G(p2))) U p1))'
Stuttering acceptance computed with spot in 517 ms :[(NOT p1), (OR (NOT p1) (NOT p2)), (NOT p0), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p0), true, (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : NoC3x3-PT-5A-LTLFireability-10
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-5A-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-5A-LTLFireability-10 finished in 61219 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((X(p1)&&p0)))||G(p2))))'
Support contains 5 out of 334 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 334/334 places, 735/735 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 326 transition count 711
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 326 transition count 711
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 324 transition count 703
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 324 transition count 703
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 24 place count 324 transition count 699
Applied a total of 24 rules in 12 ms. Remains 324 /334 variables (removed 10) and now considering 699/735 (removed 36) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5265573432682239863.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15447324413502519881.kers'
[2026-05-25 23:59:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5265573432682239863.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15447324413502519881.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 699 rows 324 cols 2624 entries
Finished phase 1 with 267 SingleSign rule and 0 generalized
[2026-05-25 23:59:47] [INFO ] Computed 57 invariants in 5 ms
Computed 57 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-15447324413502519881.kers
Total runtime 6 ms.
[2026-05-25 23:59:47] [INFO ] Implicit Places using invariants in 156 ms returned []
[2026-05-25 23:59:47] [INFO ] Invariant cache hit.
[2026-05-25 23:59:48] [INFO ] State equation strengthened by 18 read => feed constraints.
[2026-05-25 23:59:48] [INFO ] Implicit Places using invariants and state equation in 361 ms returned []
Implicit Place search using SMT with State Equation took 517 ms to find 0 implicit places.
Running 698 sub problems to find dead transitions.
[2026-05-25 23:59:48] [INFO ] Invariant cache hit.
[2026-05-25 23:59:48] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/323 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 698 unsolved
At refinement iteration 1 (OVERLAPS) 1/324 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 698 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/324 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 698 unsolved
At refinement iteration 3 (OVERLAPS) 699/1023 variables, 324/381 constraints. Problems are: Problem set: 0 solved, 698 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1023 variables, 18/399 constraints. Problems are: Problem set: 0 solved, 698 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1023/1023 variables, and 399 constraints, problems are : Problem set: 0 solved, 698 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 324/324 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 698/698 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 698 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/323 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 698 unsolved
At refinement iteration 1 (OVERLAPS) 1/324 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 698 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/324 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 698 unsolved
At refinement iteration 3 (OVERLAPS) 699/1023 variables, 324/381 constraints. Problems are: Problem set: 0 solved, 698 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1023 variables, 18/399 constraints. Problems are: Problem set: 0 solved, 698 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1023 variables, 698/1097 constraints. Problems are: Problem set: 0 solved, 698 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1023/1023 variables, and 1098 constraints, problems are : Problem set: 0 solved, 698 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 324/324 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 698/698 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60149ms problems are : Problem set: 0 solved, 698 unsolved
Search for dead transitions found 0 dead transitions in 60151ms
Starting structural reductions in LTL mode, iteration 1 : 324/334 places, 699/735 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60683 ms. Remains : 324/334 places, 699/735 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((X(p1)&&p0)))||G(p2))))'
Stuttering acceptance computed with spot in 371 ms :[(NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p0) (NOT p1)), true, (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p2)]
Running random walk in product with property : NoC3x3-PT-5A-LTLFireability-11
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-5A-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-5A-LTLFireability-11 finished in 61098 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(p0)&&X(X(X(X(X(p1)))))))'
Support contains 4 out of 334 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 334/334 places, 735/735 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 326 transition count 711
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 326 transition count 711
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 324 transition count 703
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 324 transition count 703
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 24 place count 324 transition count 699
Applied a total of 24 rules in 9 ms. Remains 324 /334 variables (removed 10) and now considering 699/735 (removed 36) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13067695896314450023.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6868378422256251604.kers'
[2026-05-26 00:00:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13067695896314450023.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6868378422256251604.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 699 rows 324 cols 2624 entries
Finished phase 1 with 267 SingleSign rule and 0 generalized
[2026-05-26 00:00:48] [INFO ] Computed 57 invariants in 6 ms
Computed 57 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-6868378422256251604.kers
Total runtime 8 ms.
[2026-05-26 00:00:49] [INFO ] Implicit Places using invariants in 152 ms returned []
[2026-05-26 00:00:49] [INFO ] Invariant cache hit.
[2026-05-26 00:00:49] [INFO ] State equation strengthened by 18 read => feed constraints.
[2026-05-26 00:00:49] [INFO ] Implicit Places using invariants and state equation in 347 ms returned []
Implicit Place search using SMT with State Equation took 501 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 324/334 places, 699/735 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 511 ms. Remains : 324/334 places, 699/735 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(p0)&&X(X(X(X(X(p1)))))))'
Stuttering acceptance computed with spot in 269 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : NoC3x3-PT-5A-LTLFireability-12
Entered a terminal (fully accepting) state of product in 36 steps with 1 reset in 1 ms.
FORMULA NoC3x3-PT-5A-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-5A-LTLFireability-12 finished in 805 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(G(((G(X(p0)) U p1)||(F(p1) U p2)))))'
Support contains 5 out of 334 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 334/334 places, 735/735 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 325 transition count 708
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 325 transition count 708
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 323 transition count 700
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 323 transition count 700
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 26 place count 323 transition count 696
Applied a total of 26 rules in 12 ms. Remains 323 /334 variables (removed 11) and now considering 696/735 (removed 39) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11668671745564849515.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11144043478590103988.kers'
[2026-05-26 00:00:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11668671745564849515.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11144043478590103988.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 696 rows 323 cols 2614 entries
Finished phase 1 with 266 SingleSign rule and 0 generalized
[2026-05-26 00:00:49] [INFO ] Computed 57 invariants in 2 ms
Computed 57 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-11144043478590103988.kers
Total runtime 4 ms.
[2026-05-26 00:00:49] [INFO ] Implicit Places using invariants in 138 ms returned []
[2026-05-26 00:00:49] [INFO ] Invariant cache hit.
[2026-05-26 00:00:50] [INFO ] State equation strengthened by 18 read => feed constraints.
[2026-05-26 00:00:50] [INFO ] Implicit Places using invariants and state equation in 357 ms returned []
Implicit Place search using SMT with State Equation took 496 ms to find 0 implicit places.
Running 695 sub problems to find dead transitions.
[2026-05-26 00:00:50] [INFO ] Invariant cache hit.
[2026-05-26 00:00:50] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 1 (OVERLAPS) 1/323 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/323 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 3 (OVERLAPS) 696/1019 variables, 323/380 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1019 variables, 18/398 constraints. Problems are: Problem set: 0 solved, 695 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1019/1019 variables, and 398 constraints, problems are : Problem set: 0 solved, 695 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 323/323 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 695/695 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 695 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 1 (OVERLAPS) 1/323 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/323 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 3 (OVERLAPS) 696/1019 variables, 323/380 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1019 variables, 18/398 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1019 variables, 695/1093 constraints. Problems are: Problem set: 0 solved, 695 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1019/1019 variables, and 1093 constraints, problems are : Problem set: 0 solved, 695 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 323/323 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 695/695 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60131ms problems are : Problem set: 0 solved, 695 unsolved
Search for dead transitions found 0 dead transitions in 60133ms
Starting structural reductions in LTL mode, iteration 1 : 323/334 places, 696/735 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60643 ms. Remains : 323/334 places, 696/735 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(G(((G(X(p0)) U p1)||(F(p1) U p2)))))'
Stuttering acceptance computed with spot in 290 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : NoC3x3-PT-5A-LTLFireability-13
Product exploration explored 100000 steps with 14 reset in 267 ms.
Stack based approach found an accepted trace after 4543 steps with 0 reset with depth 4544 and stack size 4544 in 21 ms.
FORMULA NoC3x3-PT-5A-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property NoC3x3-PT-5A-LTLFireability-13 finished in 61263 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((p0||G(p1)))&&(F(p0) U p2)))'
Support contains 5 out of 334 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 334/334 places, 735/735 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 326 transition count 711
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 326 transition count 711
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 324 transition count 703
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 324 transition count 703
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 24 place count 324 transition count 699
Applied a total of 24 rules in 15 ms. Remains 324 /334 variables (removed 10) and now considering 699/735 (removed 36) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10917664658390344275.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8284246892512917858.kers'
[2026-05-26 00:01:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10917664658390344275.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8284246892512917858.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 699 rows 324 cols 2624 entries
Finished phase 1 with 267 SingleSign rule and 0 generalized
[2026-05-26 00:01:50] [INFO ] Computed 57 invariants in 2 ms
Computed 57 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-8284246892512917858.kers
Total runtime 3 ms.
[2026-05-26 00:01:51] [INFO ] Implicit Places using invariants in 133 ms returned []
[2026-05-26 00:01:51] [INFO ] Invariant cache hit.
[2026-05-26 00:01:51] [INFO ] State equation strengthened by 18 read => feed constraints.
[2026-05-26 00:01:51] [INFO ] Implicit Places using invariants and state equation in 332 ms returned []
Implicit Place search using SMT with State Equation took 469 ms to find 0 implicit places.
Running 698 sub problems to find dead transitions.
[2026-05-26 00:01:51] [INFO ] Invariant cache hit.
[2026-05-26 00:01:51] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/323 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 698 unsolved
At refinement iteration 1 (OVERLAPS) 1/324 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 698 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/324 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 698 unsolved
At refinement iteration 3 (OVERLAPS) 699/1023 variables, 324/381 constraints. Problems are: Problem set: 0 solved, 698 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1023 variables, 18/399 constraints. Problems are: Problem set: 0 solved, 698 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1023/1023 variables, and 400 constraints, problems are : Problem set: 0 solved, 698 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 324/324 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 698/698 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 698 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/323 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 698 unsolved
At refinement iteration 1 (OVERLAPS) 1/324 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 698 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/324 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 698 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/324 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 698 unsolved
At refinement iteration 4 (OVERLAPS) 699/1023 variables, 324/382 constraints. Problems are: Problem set: 0 solved, 698 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1023 variables, 18/400 constraints. Problems are: Problem set: 0 solved, 698 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1023 variables, 698/1098 constraints. Problems are: Problem set: 0 solved, 698 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1023/1023 variables, and 1099 constraints, problems are : Problem set: 0 solved, 698 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 324/324 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 698/698 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60136ms problems are : Problem set: 0 solved, 698 unsolved
Search for dead transitions found 0 dead transitions in 60138ms
Starting structural reductions in LTL mode, iteration 1 : 324/334 places, 699/735 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60625 ms. Remains : 324/334 places, 699/735 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((p0||G(p1)))&&(F(p0) U p2)))'
Stuttering acceptance computed with spot in 207 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p2), true, (NOT p1)]
Running random walk in product with property : NoC3x3-PT-5A-LTLFireability-15
Entered a terminal (fully accepting) state of product in 20654 steps with 5 reset in 78 ms.
FORMULA NoC3x3-PT-5A-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-5A-LTLFireability-15 finished in 60954 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((G(p1)||p0))))'
Spot run failed in 62 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
[2026-05-26 00:02:52] [INFO ] Flatten gal took : 19 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6584709170450574599
[2026-05-26 00:02:52] [INFO ] Computing symmetric may disable matrix : 735 transitions.
[2026-05-26 00:02:52] [INFO ] Applying decomposition
[2026-05-26 00:02:52] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 00:02:52] [INFO ] Computing symmetric may enable matrix : 735 transitions.
[2026-05-26 00:02:52] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 00:02:52] [INFO ] Flatten gal took : 23 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/graph16927011257392637106.txt' '-o' '/tmp/graph16927011257392637106.bin' '-w' '/tmp/graph16927011257392637106.weights'
[2026-05-26 00:02:52] [INFO ] Computing Do-Not-Accords matrix : 735 transitions.
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph16927011257392637106.bin' '-l' '-1' '-v' '-w' '/tmp/graph16927011257392637106.weights' '-q' '0' '-e' '0.001'
[2026-05-26 00:02:52] [INFO ] Decomposing Gal with order
[2026-05-26 00:02:52] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 00:02:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 00:02:52] [INFO ] Built C files in 117ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6584709170450574599
Running compilation step : cd /tmp/ltsmin6584709170450574599;'/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'
[2026-05-26 00:02:52] [INFO ] Removed a total of 471 redundant transitions.
[2026-05-26 00:02:52] [INFO ] Flatten gal took : 43 ms
[2026-05-26 00:02:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 394 labels/synchronizations in 9 ms.
[2026-05-26 00:02:52] [INFO ] Time to serialize gal into /tmp/LTLFireability5510342107560649762.gal : 4 ms
[2026-05-26 00:02:52] [INFO ] Time to serialize properties into /tmp/LTLFireability2884964177117064439.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability5510342107560649762.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2884964177117064439.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F(("((i6.u30.p256==0)||(i6.u30.p295==0))")||(G("(i1.u7.p67==0)"))))))
Formula 0 simplified : G(F!"(i1.u7.p67==0)" & FG!"((i6.u30.p256==0)||(i6.u30.p295==0))")
Compilation finished in 1844 ms.
Running link step : cd /tmp/ltsmin6584709170450574599;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin6584709170450574599;'/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' '--ltl' '[](<>(([]((LTLAPp1==true))||(LTLAPp0==true))))' '--buchi-type=spotba'
LTSmin run took 64787 ms.
FORMULA NoC3x3-PT-5A-LTLFireability-06 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 824284 ms.

BK_STOP 1779753839258

--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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-5A"
export BK_EXAMINATION="LTLFireability"
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-5A, examination is LTLFireability"
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-177969914000324"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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