About the Execution of ITS-Tools for IOTPpurchase-PT-C12M10P15D17
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 817.079 | 103068.00 | 127949.00 | 533.00 | TTTFFTFFFF?TF??? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).

Trace from the execution
Formatting '/data/fkordon/mcc2026-input.r162-smll-177961107700132.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 IOTPpurchase-PT-C12M10P15D17, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r162-smll-177961107700132
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 7.7K Mar 7 17:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Mar 7 17:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Mar 7 17:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Mar 7 17:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.4K Mar 15 11:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 11:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Mar 15 11:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 15 11:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Mar 7 17:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K Mar 7 17:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Mar 7 17:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Mar 7 17:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Mar 15 11:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Mar 15 11:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 13 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rwxr-xr-x 1 mcc users 60K 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 IOTPpurchase-PT-C12M10P15D17-LTLFireability-00
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-LTLFireability-01
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-LTLFireability-02
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-LTLFireability-03
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-LTLFireability-04
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-LTLFireability-05
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-LTLFireability-06
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-LTLFireability-07
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-LTLFireability-08
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-LTLFireability-09
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-LTLFireability-10
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-LTLFireability-11
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-LTLFireability-12
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-LTLFireability-13
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-LTLFireability-14
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1779729103247
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=IOTPpurchase-PT-C12M10P15D17
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-25 17:11:45] [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 17:11:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 17:11:46] [INFO ] Load time of PNML (sax parser for PT used): 123 ms
[2026-05-25 17:11:46] [INFO ] Transformed 111 places.
[2026-05-25 17:11:46] [INFO ] Transformed 45 transitions.
[2026-05-25 17:11:46] [INFO ] Parsed PT model containing 111 places and 45 transitions and 224 arcs in 381 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 21 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 62 out of 111 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 45/45 transitions.
Ensure Unique test removed 15 places
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 93 transition count 45
Applied a total of 18 rules in 60 ms. Remains 93 /111 variables (removed 18) and now considering 45/45 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7292617857170393345.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16819602539246515913.kers'
[2026-05-25 17:11:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7292617857170393345.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16819602539246515913.kers]
Culling duplicate invariants (modulo rational): removing 34 columns.
Culled 34 columns in 0 ms.
// Phase 1: matrix 45 rows 59 cols 118 entries
Finished phase 1 with 35 SingleSign rule and 9 generalized
[2026-05-25 17:11:46] [INFO ] Computed 49 invariants in 0 ms
Computed 49 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-16819602539246515913.kers
Total runtime 2 ms.
[2026-05-25 17:11:46] [INFO ] Implicit Places using invariants in 398 ms returned [31, 41]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 474 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 91/111 places, 45/45 transitions.
Applied a total of 0 rules in 3 ms. Remains 91 /91 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 582 ms. Remains : 91/111 places, 45/45 transitions.
Starting structural reductions in LTL mode, iteration 0 : 91/91 places, 45/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 91 /91 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15895345108193428760.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16927450714005999251.kers'
[2026-05-25 17:11:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15895345108193428760.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16927450714005999251.kers]
Culling duplicate invariants (modulo rational): removing 34 columns.
Culled 34 columns in 0 ms.
// Phase 1: matrix 45 rows 57 cols 114 entries
Finished phase 1 with 37 SingleSign rule and 7 generalized
[2026-05-25 17:11:46] [INFO ] Computed 47 invariants in 0 ms
Computed 47 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16927450714005999251.kers
Total runtime 1 ms.
[2026-05-25 17:11:47] [INFO ] Implicit Places using invariants in 123 ms returned []
[2026-05-25 17:11:47] [INFO ] Invariant cache hit.
[2026-05-25 17:11:47] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 343 ms to find 0 implicit places.
Running 44 sub problems to find dead transitions.
[2026-05-25 17:11:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 30/45 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (OVERLAPS) 1/91 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (OVERLAPS) 45/136 variables, 91/138 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (OVERLAPS) 0/136 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 136/136 variables, and 138 constraints, problems are : Problem set: 0 solved, 44 unsolved in 3130 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 91/91 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 44 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 30/45 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (OVERLAPS) 1/91 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (OVERLAPS) 45/136 variables, 91/138 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 44/182 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (OVERLAPS) 0/136 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 136/136 variables, and 182 constraints, problems are : Problem set: 0 solved, 44 unsolved in 2945 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 91/91 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6131ms problems are : Problem set: 0 solved, 44 unsolved
Search for dead transitions found 0 dead transitions in 6152ms
Finished structural reductions in LTL mode , in 1 iterations and 6545 ms. Remains : 91/91 places, 45/45 transitions.
Support contains 62 out of 91 places after structural reductions.
[2026-05-25 17:11:53] [INFO ] Flatten gal took : 41 ms
[2026-05-25 17:11:53] [INFO ] Flatten gal took : 16 ms
[2026-05-25 17:11:53] [INFO ] Input system was already deterministic with 45 transitions.
Reduction of identical properties reduced properties to check from 28 to 25
RANDOM walk for 945 steps (0 resets) in 207 ms. (4 steps per ms) remains 0/25 properties
Computed a total of 0 stabilizing places and 0 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' '!((F(p0)||X((F(!p0)&&F(G(p1))))))'
Support contains 3 out of 91 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 91/91 places, 45/45 transitions.
Ensure Unique test removed 21 places
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 65 transition count 40
Reduce places removed 8 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 14 rules applied. Total rules applied 24 place count 57 transition count 34
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 30 place count 51 transition count 34
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 30 place count 51 transition count 22
Deduced a syphon composed of 12 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 60 place count 33 transition count 22
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 60 place count 33 transition count 19
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 66 place count 30 transition count 19
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 21 rules applied. Total rules applied 87 place count 17 transition count 11
Discarding 2 places :
Implicit places reduction removed 2 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 90 place count 15 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 91 place count 14 transition count 10
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 91 place count 14 transition count 9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 3 rules applied. Total rules applied 94 place count 12 transition count 9
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 95 place count 12 transition count 8
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 3 rules applied. Total rules applied 98 place count 10 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 99 place count 9 transition count 7
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 5 rules applied. Total rules applied 104 place count 6 transition count 5
Applied a total of 104 rules in 35 ms. Remains 6 /91 variables (removed 85) and now considering 5/45 (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-17158445630987420396.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-816333561263888545.kers'
[2026-05-25 17:11:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17158445630987420396.kers, --Pflows, --basisKERS=/tmp/petrispot-output-816333561263888545.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 5 rows 5 cols 10 entries
Finished phase 1 with 4 SingleSign rule and 0 generalized
[2026-05-25 17:11:54] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-816333561263888545.kers
Total runtime 1 ms.
[2026-05-25 17:11:54] [INFO ] Implicit Places using invariants in 32 ms returned []
[2026-05-25 17:11:54] [INFO ] Invariant cache hit.
[2026-05-25 17:11:54] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2026-05-25 17:11:54] [INFO ] Redundant transitions in 1 ms returned []
Running 4 sub problems to find dead transitions.
[2026-05-25 17:11:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 1/6 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 5/11 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/11 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/11 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 11/11 variables, and 8 constraints, problems are : Problem set: 0 solved, 4 unsolved in 111 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 1/6 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 5/11 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/11 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/11 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/11 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 11/11 variables, and 12 constraints, problems are : Problem set: 0 solved, 4 unsolved in 110 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 225ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 226ms
Starting structural reductions in SI_LTL mode, iteration 1 : 6/91 places, 5/45 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 333 ms. Remains : 6/91 places, 5/45 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((F(!p0)&&F(G(p1))))))'
Stuttering acceptance computed with spot in 249 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : IOTPpurchase-PT-C12M10P15D17-LTLFireability-00
Product exploration explored 100000 steps with 15102 reset in 520 ms.
Product exploration explored 100000 steps with 15135 reset in 218 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 6 factoid took 124 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
RANDOM walk for 82 steps (0 resets) in 6 ms. (11 steps per ms) remains 0/4 properties
Knowledge based reduction with 6 factoid took 151 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) (NOT p1))]
[2026-05-25 17:11:56] [INFO ] Invariant cache hit.
[2026-05-25 17:11:56] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-25 17:11:56] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2026-05-25 17:11:56] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 17:11:56] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2026-05-25 17:11:56] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2026-05-25 17:11:56] [INFO ] Computed and/alt/rep : 4/4/4 causal constraints (skipped 0 transitions) in 2 ms.
[2026-05-25 17:11:56] [INFO ] Added : 3 causal constraints over 1 iterations in 13 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Knowledge-based reduction took 460 ms.
Stuttering acceptance computed with spot in 49 ms :[(AND (NOT p0) (NOT p1))]
Support contains 3 out of 6 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6/6 places, 5/5 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2026-05-25 17:11:56] [INFO ] Invariant cache hit.
[2026-05-25 17:11:56] [INFO ] Implicit Places using invariants in 24 ms returned []
[2026-05-25 17:11:56] [INFO ] Invariant cache hit.
[2026-05-25 17:11:56] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2026-05-25 17:11:56] [INFO ] Redundant transitions in 0 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 84 ms. Remains : 6/6 places, 5/5 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 6 factoid took 156 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
RANDOM walk for 92 steps (0 resets) in 6 ms. (13 steps per ms) remains 0/4 properties
Knowledge based reduction with 6 factoid took 216 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(AND (NOT p0) (NOT p1))]
[2026-05-25 17:11:57] [INFO ] Invariant cache hit.
[2026-05-25 17:11:57] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-25 17:11:57] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2026-05-25 17:11:57] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 17:11:57] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-25 17:11:57] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2026-05-25 17:11:57] [INFO ] Computed and/alt/rep : 4/4/4 causal constraints (skipped 0 transitions) in 2 ms.
[2026-05-25 17:11:57] [INFO ] Added : 3 causal constraints over 1 iterations in 10 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Knowledge-based reduction took 520 ms.
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 52 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 15195 reset in 184 ms.
Product exploration explored 100000 steps with 15177 reset in 356 ms.
Built C files in :
/tmp/ltsmin6720628437686411989
[2026-05-25 17:11:57] [INFO ] Computing symmetric may disable matrix : 5 transitions.
[2026-05-25 17:11:57] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 17:11:57] [INFO ] Computing symmetric may enable matrix : 5 transitions.
[2026-05-25 17:11:57] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 17:11:57] [INFO ] Computing Do-Not-Accords matrix : 5 transitions.
[2026-05-25 17:11:57] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 17:11:57] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6720628437686411989
Running compilation step : cd /tmp/ltsmin6720628437686411989;'/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 290 ms.
Running link step : cd /tmp/ltsmin6720628437686411989;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin6720628437686411989;'/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/stateBased1278864314756795422.hoa' '--buchi-type=spotba'
LTSmin run took 80 ms.
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLFireability-00 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property IOTPpurchase-PT-C12M10P15D17-LTLFireability-00 finished in 3746 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(p0)||F((G(F(p1))||(!p1&&F(p1))))))'
Support contains 3 out of 91 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 91/91 places, 45/45 transitions.
Ensure Unique test removed 21 places
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 66 transition count 39
Reduce places removed 10 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 16 rules applied. Total rules applied 26 place count 56 transition count 33
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 33 place count 50 transition count 32
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 34 place count 49 transition count 32
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 11 Pre rules applied. Total rules applied 34 place count 49 transition count 21
Deduced a syphon composed of 11 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 27 rules applied. Total rules applied 61 place count 33 transition count 21
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 61 place count 33 transition count 18
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 67 place count 30 transition count 18
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 85 place count 19 transition count 11
Discarding 2 places :
Implicit places reduction removed 2 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 88 place count 17 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 89 place count 16 transition count 10
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 89 place count 16 transition count 9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 92 place count 14 transition count 9
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 93 place count 14 transition count 8
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 7 with 3 rules applied. Total rules applied 96 place count 12 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 97 place count 11 transition count 7
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 9 with 5 rules applied. Total rules applied 102 place count 8 transition count 5
Applied a total of 102 rules in 24 ms. Remains 8 /91 variables (removed 83) and now considering 5/45 (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-42922672882579633.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17819811030059631706.kers'
[2026-05-25 17:11:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-42922672882579633.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17819811030059631706.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 5 rows 7 cols 14 entries
Finished phase 1 with 4 SingleSign rule and 0 generalized
[2026-05-25 17:11:58] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17819811030059631706.kers
Total runtime 0 ms.
[2026-05-25 17:11:58] [INFO ] Implicit Places using invariants in 44 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 46 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/91 places, 5/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 5/5 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 72 ms. Remains : 7/91 places, 5/45 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)||F((G(F(p1))||(!p1&&F(p1))))))'
Stuttering acceptance computed with spot in 177 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : IOTPpurchase-PT-C12M10P15D17-LTLFireability-01
Product exploration explored 100000 steps with 50000 reset in 136 ms.
Product exploration explored 100000 steps with 50000 reset in 107 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 10 factoid took 23 ms. Proved property starting from automaton with 4 states, 9 edges and 2 AP (stutter insensitive
Knowledge-based reduction took 28 ms.
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property IOTPpurchase-PT-C12M10P15D17-LTLFireability-01 finished in 564 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((p0&&X((G(p1) U p0))))||(p0&&X((G(p1) U p0))&&F(p2))))'
Support contains 5 out of 91 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 91/91 places, 45/45 transitions.
Ensure Unique test removed 19 places
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 67 transition count 45
Applied a total of 24 rules in 6 ms. Remains 67 /91 variables (removed 24) and now considering 45/45 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4150509820824850408.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2535564257427052560.kers'
[2026-05-25 17:11:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4150509820824850408.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2535564257427052560.kers]
Culling duplicate invariants (modulo rational): removing 15 columns.
Culled 15 columns in 0 ms.
// Phase 1: matrix 45 rows 52 cols 104 entries
Finished phase 1 with 41 SingleSign rule and 3 generalized
[2026-05-25 17:11:58] [INFO ] Computed 23 invariants in 0 ms
Computed 23 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2535564257427052560.kers
Total runtime 1 ms.
[2026-05-25 17:11:59] [INFO ] Implicit Places using invariants in 99 ms returned [10, 14, 17]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 102 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 64/91 places, 45/45 transitions.
Applied a total of 0 rules in 5 ms. Remains 64 /64 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 113 ms. Remains : 64/91 places, 45/45 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&&X((G(p1) U p0))))||(p0&&X((G(p1) U p0))&&F(p2))))'
Stuttering acceptance computed with spot in 375 ms :[(NOT p0), true, (NOT p0), (AND (NOT p2) (NOT p0)), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : IOTPpurchase-PT-C12M10P15D17-LTLFireability-02
Product exploration explored 100000 steps with 50000 reset in 156 ms.
Product exploration explored 100000 steps with 50000 reset in 191 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 17 factoid took 16 ms. Proved property starting from automaton with 8 states, 18 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 19 ms.
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property IOTPpurchase-PT-C12M10P15D17-LTLFireability-02 finished in 914 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((F(p2)&&p1)) U p3)&&p0)))'
Support contains 7 out of 91 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 91/91 places, 45/45 transitions.
Ensure Unique test removed 21 places
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 66 transition count 38
Reduce places removed 11 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 19 rules applied. Total rules applied 30 place count 55 transition count 30
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 38 place count 47 transition count 30
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 38 place count 47 transition count 21
Deduced a syphon composed of 9 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 21 rules applied. Total rules applied 59 place count 35 transition count 21
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 59 place count 35 transition count 19
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 63 place count 33 transition count 19
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 75 place count 26 transition count 14
Applied a total of 75 rules in 17 ms. Remains 26 /91 variables (removed 65) and now considering 14/45 (removed 31) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1082260647816709388.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7685471497193960314.kers'
[2026-05-25 17:11:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1082260647816709388.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7685471497193960314.kers]
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 0 ms.
// Phase 1: matrix 14 rows 19 cols 38 entries
Finished phase 1 with 10 SingleSign rule and 3 generalized
[2026-05-25 17:11:59] [INFO ] Computed 13 invariants in 0 ms
Computed 13 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7685471497193960314.kers
Total runtime 0 ms.
[2026-05-25 17:11:59] [INFO ] Implicit Places using invariants in 64 ms returned [1, 4]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 65 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/91 places, 14/45 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 24 transition count 13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 23 transition count 13
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 7 place count 20 transition count 11
Applied a total of 7 rules in 5 ms. Remains 20 /24 variables (removed 4) and now considering 11/14 (removed 3) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12213355790238420.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15361583674565609284.kers'
[2026-05-25 17:11:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12213355790238420.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15361583674565609284.kers]
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 11 rows 16 cols 32 entries
Finished phase 1 with 8 SingleSign rule and 2 generalized
[2026-05-25 17:11:59] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15361583674565609284.kers
Total runtime 0 ms.
[2026-05-25 17:12:00] [INFO ] Implicit Places using invariants in 38 ms returned []
[2026-05-25 17:12:00] [INFO ] Invariant cache hit.
[2026-05-25 17:12:00] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 20/91 places, 11/45 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 175 ms. Remains : 20/91 places, 11/45 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((F(p2)&&p1)) U p3)&&p0)))'
Stuttering acceptance computed with spot in 255 ms :[(OR (NOT p0) (NOT p3)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2))), (NOT p3)]
Running random walk in product with property : IOTPpurchase-PT-C12M10P15D17-LTLFireability-03
Product exploration explored 100000 steps with 5941 reset in 323 ms.
Stack based approach found an accepted trace after 1124 steps with 64 reset with depth 12 and stack size 12 in 4 ms.
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property IOTPpurchase-PT-C12M10P15D17-LTLFireability-03 finished in 803 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' '!((((p0 U X(G(p1))) U X(p2))&&F(((p3&&X(F(!p4)))||G(F(!p4))))))'
Support contains 7 out of 91 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 91/91 places, 45/45 transitions.
Ensure Unique test removed 21 places
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 66 transition count 45
Applied a total of 25 rules in 5 ms. Remains 66 /91 variables (removed 25) and now considering 45/45 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10918647426361620533.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12253860059852597154.kers'
[2026-05-25 17:12:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10918647426361620533.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12253860059852597154.kers]
Culling duplicate invariants (modulo rational): removing 13 columns.
Culled 13 columns in 0 ms.
// Phase 1: matrix 45 rows 53 cols 106 entries
Finished phase 1 with 41 SingleSign rule and 3 generalized
[2026-05-25 17:12:00] [INFO ] Computed 22 invariants in 0 ms
Computed 22 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12253860059852597154.kers
Total runtime 1 ms.
[2026-05-25 17:12:00] [INFO ] Implicit Places using invariants in 91 ms returned [13, 16]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 92 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 64/91 places, 45/45 transitions.
Applied a total of 0 rules in 4 ms. Remains 64 /64 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 102 ms. Remains : 64/91 places, 45/45 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' '!((((p0 U X(G(p1))) U X(p2))&&F(((p3&&X(F(p4)))||G(F(p4))))))'
Stuttering acceptance computed with spot in 440 ms :[(OR (NOT p4) (NOT p2)), (NOT p4), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p4), (AND (NOT p1) (NOT p2)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : IOTPpurchase-PT-C12M10P15D17-LTLFireability-04
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C12M10P15D17-LTLFireability-04 finished in 664 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((((F(p1)&&p0) U (!p2 U p3))&&X(X(F(p2))))))'
Support contains 7 out of 91 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 91/91 places, 45/45 transitions.
Ensure Unique test removed 18 places
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 69 transition count 45
Applied a total of 22 rules in 5 ms. Remains 69 /91 variables (removed 22) and now considering 45/45 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-563959703297895945.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8256013329202981168.kers'
[2026-05-25 17:12:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-563959703297895945.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8256013329202981168.kers]
Culling duplicate invariants (modulo rational): removing 16 columns.
Culled 16 columns in 0 ms.
// Phase 1: matrix 45 rows 53 cols 106 entries
Finished phase 1 with 40 SingleSign rule and 4 generalized
[2026-05-25 17:12:01] [INFO ] Computed 25 invariants in 0 ms
Computed 25 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8256013329202981168.kers
Total runtime 1 ms.
[2026-05-25 17:12:01] [INFO ] Implicit Places using invariants in 86 ms returned [9, 13, 17]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 87 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 66/91 places, 45/45 transitions.
Applied a total of 0 rules in 5 ms. Remains 66 /66 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 97 ms. Remains : 66/91 places, 45/45 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((((F(p1)&&p0) U (!p2 U p3))&&X(X(F(p2))))))'
Stuttering acceptance computed with spot in 502 ms :[(OR (NOT p2) (NOT p3)), (NOT p3), (NOT p2), (AND (NOT p1) (NOT p3)), (NOT p3), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : IOTPpurchase-PT-C12M10P15D17-LTLFireability-05
Product exploration explored 100000 steps with 1122 reset in 500 ms.
Product exploration explored 100000 steps with 1118 reset in 313 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 31 factoid took 286 ms. Reduced automaton from 11 states, 27 edges and 4 AP (stutter sensitive) to 11 states, 27 edges and 4 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 17 to 11
RANDOM walk for 40000 steps (8 resets) in 513 ms. (77 steps per ms) remains 1/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 297 ms. (134 steps per ms) remains 1/1 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6117575168276856204.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8088824220638811510.kers'
[2026-05-25 17:12:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6117575168276856204.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8088824220638811510.kers]
Culling duplicate invariants (modulo rational): removing 16 columns.
Culled 16 columns in 0 ms.
// Phase 1: matrix 45 rows 50 cols 100 entries
Finished phase 1 with 41 SingleSign rule and 3 generalized
[2026-05-25 17:12:03] [INFO ] Computed 22 invariants in 0 ms
Computed 22 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8088824220638811510.kers
Total runtime 1 ms.
Problem apf7 is UNSAT
After SMT solving in domain Real declared 5/111 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 23 ms.
Refiners :[Positive P Invariants (semi-flows): 0/15 constraints, Generalized P Invariants (flows): 0/7 constraints, State Equation: 0/66 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 34ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 3 invariant AP formulas.
Knowledge based reduction with 34 factoid took 581 ms. Reduced automaton from 11 states, 27 edges and 4 AP (stutter sensitive) to 8 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 372 ms :[(OR (NOT p3) (NOT p2)), (NOT p3), (NOT p2), (NOT p3), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2))]
[2026-05-25 17:12:04] [INFO ] Invariant cache hit.
[2026-05-25 17:12:04] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2026-05-25 17:12:04] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 5 ms returned sat
[2026-05-25 17:12:04] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2026-05-25 17:12:04] [INFO ] Computed and/alt/rep : 44/49/44 causal constraints (skipped 0 transitions) in 7 ms.
[2026-05-25 17:12:04] [INFO ] Added : 11 causal constraints over 3 iterations in 48 ms. Result :sat
Could not prove EG (NOT p3)
[2026-05-25 17:12:04] [INFO ] Invariant cache hit.
[2026-05-25 17:12:04] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2026-05-25 17:12:04] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 7 ms returned sat
[2026-05-25 17:12:04] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2026-05-25 17:12:04] [INFO ] Computed and/alt/rep : 44/49/44 causal constraints (skipped 0 transitions) in 8 ms.
[2026-05-25 17:12:04] [INFO ] Added : 26 causal constraints over 6 iterations in 101 ms. Result :sat
Could not prove EG (NOT p2)
Knowledge-based reduction took 1994 ms.
Stuttering acceptance computed with spot in 406 ms :[(OR (NOT p3) (NOT p2)), (NOT p3), (NOT p2), (NOT p3), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2))]
Support contains 7 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 45/45 transitions.
Applied a total of 0 rules in 4 ms. Remains 66 /66 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2026-05-25 17:12:05] [INFO ] Invariant cache hit.
[2026-05-25 17:12:05] [INFO ] Implicit Places using invariants in 108 ms returned []
[2026-05-25 17:12:05] [INFO ] Invariant cache hit.
[2026-05-25 17:12:05] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 263 ms to find 0 implicit places.
Running 44 sub problems to find dead transitions.
[2026-05-25 17:12:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 6/21 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (OVERLAPS) 1/66 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (OVERLAPS) 45/111 variables, 66/88 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (OVERLAPS) 0/111 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 111/111 variables, and 88 constraints, problems are : Problem set: 0 solved, 44 unsolved in 1624 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 66/66 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 44 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 6/21 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (OVERLAPS) 1/66 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (OVERLAPS) 45/111 variables, 66/88 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 44/132 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (OVERLAPS) 0/111 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 111/111 variables, and 132 constraints, problems are : Problem set: 0 solved, 44 unsolved in 1561 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 66/66 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3193ms problems are : Problem set: 0 solved, 44 unsolved
Search for dead transitions found 0 dead transitions in 3194ms
Finished structural reductions in LTL mode , in 1 iterations and 3461 ms. Remains : 66/66 places, 45/45 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 14 factoid took 118 ms. Reduced automaton from 8 states, 14 edges and 3 AP (stutter sensitive) to 8 states, 14 edges and 3 AP (stutter sensitive).
RANDOM walk for 691 steps (0 resets) in 10 ms. (62 steps per ms) remains 0/8 properties
Knowledge based reduction with 14 factoid took 271 ms. Reduced automaton from 8 states, 14 edges and 3 AP (stutter sensitive) to 8 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 411 ms :[(OR (NOT p3) (NOT p2)), (NOT p3), (NOT p2), (NOT p3), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2))]
[2026-05-25 17:12:09] [INFO ] Invariant cache hit.
[2026-05-25 17:12:09] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2026-05-25 17:12:09] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 5 ms returned sat
[2026-05-25 17:12:09] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2026-05-25 17:12:09] [INFO ] Computed and/alt/rep : 44/49/44 causal constraints (skipped 0 transitions) in 6 ms.
[2026-05-25 17:12:09] [INFO ] Added : 11 causal constraints over 3 iterations in 41 ms. Result :sat
Could not prove EG (NOT p3)
[2026-05-25 17:12:09] [INFO ] Invariant cache hit.
[2026-05-25 17:12:09] [INFO ] [Real]Absence check using 15 positive place invariants in 7 ms returned sat
[2026-05-25 17:12:09] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 7 ms returned sat
[2026-05-25 17:12:09] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2026-05-25 17:12:09] [INFO ] Computed and/alt/rep : 44/49/44 causal constraints (skipped 0 transitions) in 6 ms.
[2026-05-25 17:12:09] [INFO ] Added : 26 causal constraints over 6 iterations in 99 ms. Result :sat
Could not prove EG (NOT p2)
Knowledge-based reduction took 1268 ms.
Stuttering acceptance computed with spot in 415 ms :[(OR (NOT p3) (NOT p2)), (NOT p3), (NOT p2), (NOT p3), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 423 ms :[(OR (NOT p3) (NOT p2)), (NOT p3), (NOT p2), (NOT p3), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 1150 reset in 259 ms.
Product exploration explored 100000 steps with 1119 reset in 294 ms.
Spot run failed in 159 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/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin4977823634073911453
[2026-05-25 17:12:11] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4977823634073911453
Running compilation step : cd /tmp/ltsmin4977823634073911453;'/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 251 ms.
Running link step : cd /tmp/ltsmin4977823634073911453;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin4977823634073911453;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased2470160258440799887.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 7 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 45/45 transitions.
Applied a total of 0 rules in 3 ms. Remains 66 /66 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2026-05-25 17:12:26] [INFO ] Invariant cache hit.
[2026-05-25 17:12:26] [INFO ] Implicit Places using invariants in 65 ms returned []
[2026-05-25 17:12:26] [INFO ] Invariant cache hit.
[2026-05-25 17:12:26] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 164 ms. Remains : 66/66 places, 45/45 transitions.
Built C files in :
/tmp/ltsmin13199689426652559748
[2026-05-25 17:12:26] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13199689426652559748
Running compilation step : cd /tmp/ltsmin13199689426652559748;'/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 159 ms.
Running link step : cd /tmp/ltsmin13199689426652559748;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin13199689426652559748;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased1978088434150226239.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-25 17:12:41] [INFO ] Flatten gal took : 8 ms
[2026-05-25 17:12:41] [INFO ] Flatten gal took : 10 ms
[2026-05-25 17:12:41] [INFO ] Time to serialize gal into /tmp/LTL12045040076010691230.gal : 3 ms
[2026-05-25 17:12:41] [INFO ] Time to serialize properties into /tmp/LTL16074188879059211953.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/LTL12045040076010691230.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12508511919654830286.hoa' '-atoms' '/tmp/LTL16074188879059211953.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...320
Loading property file /tmp/LTL16074188879059211953.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12508511919654830286.hoa
Detected timeout of ITS tools.
[2026-05-25 17:12:56] [INFO ] Flatten gal took : 5 ms
[2026-05-25 17:12:56] [INFO ] Flatten gal took : 5 ms
[2026-05-25 17:12:56] [INFO ] Time to serialize gal into /tmp/LTL10687498372651858213.gal : 3 ms
[2026-05-25 17:12:56] [INFO ] Time to serialize properties into /tmp/LTL6640204430272888516.ltl : 2 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/LTL10687498372651858213.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6640204430272888516.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...276
Read 1 LTL properties
Checking formula 0 : !((F(((("(((PayReceipt_p21_15>=1)&&(PaymentNote_p21_16>=1))&&((Status_p21_14>=1)&&(p3_10>=1)))")&&(F("((BrandSelection_p11_5>=1)&&(p4_...378
Formula 0 simplified : G(((!"(((PayReceipt_p21_15>=1)&&(PaymentNote_p21_16>=1))&&((Status_p21_14>=1)&&(p3_10>=1)))" | G!"((BrandSelection_p11_5>=1)&&(p4_3>...364
Detected timeout of ITS tools.
[2026-05-25 17:13:11] [INFO ] Flatten gal took : 5 ms
[2026-05-25 17:13:11] [INFO ] Applying decomposition
[2026-05-25 17:13:11] [INFO ] Flatten gal took : 5 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/graph4249659917185732733.txt' '-o' '/tmp/graph4249659917185732733.bin' '-w' '/tmp/graph4249659917185732733.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph4249659917185732733.bin' '-l' '-1' '-v' '-w' '/tmp/graph4249659917185732733.weights' '-q' '0' '-e' '0.001'
[2026-05-25 17:13:12] [INFO ] Decomposing Gal with order
[2026-05-25 17:13:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 17:13:12] [INFO ] Flatten gal took : 66 ms
[2026-05-25 17:13:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2026-05-25 17:13:12] [INFO ] Time to serialize gal into /tmp/LTL10103675959503980827.gal : 4 ms
[2026-05-25 17:13:12] [INFO ] Time to serialize properties into /tmp/LTL15193994770340020421.ltl : 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/LTL10103675959503980827.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15193994770340020421.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...256
Read 1 LTL properties
Checking formula 0 : !((F(((("(((i3.u22.PayReceipt_p21_15>=1)&&(i3.u22.PaymentNote_p21_16>=1))&&((i3.u22.Status_p21_14>=1)&&(i3.u22.p3_10>=1)))")&&(F("((i0...481
Formula 0 simplified : G(((!"(((i3.u22.PayReceipt_p21_15>=1)&&(i3.u22.PaymentNote_p21_16>=1))&&((i3.u22.Status_p21_14>=1)&&(i3.u22.p3_10>=1)))" | G!"((i0.u...467
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
118 unique states visited
0 strongly connected components in search stack
117 transitions explored
116 items max in DFS search stack
1188 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,11.9108,182144,1,0,309925,18599,650,851528,290,114661,147586
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property IOTPpurchase-PT-C12M10P15D17-LTLFireability-05 finished in 83734 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(!p0)&&F(G(p1)))))'
Support contains 5 out of 91 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 91/91 places, 45/45 transitions.
Ensure Unique test removed 19 places
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 67 transition count 39
Reduce places removed 10 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 17 rules applied. Total rules applied 28 place count 57 transition count 32
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 35 place count 50 transition count 32
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 35 place count 50 transition count 20
Deduced a syphon composed of 12 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 65 place count 32 transition count 20
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 65 place count 32 transition count 16
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 73 place count 28 transition count 16
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 89 place count 18 transition count 10
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 3 with 2 rules applied. Total rules applied 91 place count 16 transition count 10
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 91 place count 16 transition count 8
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 5 rules applied. Total rules applied 96 place count 13 transition count 8
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 97 place count 13 transition count 7
Reduce places removed 2 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 100 place count 11 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 101 place count 10 transition count 6
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 103 place count 9 transition count 5
Applied a total of 103 rules in 15 ms. Remains 9 /91 variables (removed 82) and now considering 5/45 (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-3419311251497896376.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11077426440745939790.kers'
[2026-05-25 17:13:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3419311251497896376.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11077426440745939790.kers]
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 5 rows 6 cols 12 entries
Finished phase 1 with 4 SingleSign rule and 0 generalized
[2026-05-25 17:13:25] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11077426440745939790.kers
Total runtime 0 ms.
[2026-05-25 17:13:25] [INFO ] Implicit Places using invariants in 40 ms returned []
[2026-05-25 17:13:25] [INFO ] Invariant cache hit.
[2026-05-25 17:13:25] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2026-05-25 17:13:25] [INFO ] Redundant transitions in 0 ms returned []
Running 4 sub problems to find dead transitions.
[2026-05-25 17:13:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1/9 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 5/14 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/14 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/14 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 14/14 variables, and 14 constraints, problems are : Problem set: 0 solved, 4 unsolved in 72 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 9/9 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1/9 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 5/14 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/14 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/14 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/14 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 14/14 variables, and 18 constraints, problems are : Problem set: 0 solved, 4 unsolved in 96 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 9/9 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 172ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 172ms
Starting structural reductions in SI_LTL mode, iteration 1 : 9/91 places, 5/45 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 262 ms. Remains : 9/91 places, 5/45 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : IOTPpurchase-PT-C12M10P15D17-LTLFireability-07
Product exploration explored 100000 steps with 0 reset in 184 ms.
Stack based approach found an accepted trace after 18 steps with 0 reset with depth 19 and stack size 19 in 1 ms.
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property IOTPpurchase-PT-C12M10P15D17-LTLFireability-07 finished in 598 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((p0&&G(!p1)))))))'
Support contains 9 out of 91 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 91/91 places, 45/45 transitions.
Ensure Unique test removed 15 places
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 71 transition count 45
Applied a total of 20 rules in 6 ms. Remains 71 /91 variables (removed 20) and now considering 45/45 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16573875307901067815.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17111821732395150972.kers'
[2026-05-25 17:13:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16573875307901067815.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17111821732395150972.kers]
Culling duplicate invariants (modulo rational): removing 19 columns.
Culled 19 columns in 0 ms.
// Phase 1: matrix 45 rows 52 cols 104 entries
Finished phase 1 with 41 SingleSign rule and 3 generalized
[2026-05-25 17:13:25] [INFO ] Computed 27 invariants in 0 ms
Computed 27 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17111821732395150972.kers
Total runtime 0 ms.
[2026-05-25 17:13:25] [INFO ] Implicit Places using invariants in 115 ms returned [10, 16, 20]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 119 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 68/91 places, 45/45 transitions.
Applied a total of 0 rules in 5 ms. Remains 68 /68 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 130 ms. Remains : 68/91 places, 45/45 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((G(p0)&&p1))))))'
Stuttering acceptance computed with spot in 324 ms :[true, (NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : IOTPpurchase-PT-C12M10P15D17-LTLFireability-09
Entered a terminal (fully accepting) state of product in 169 steps with 0 reset in 1 ms.
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C12M10P15D17-LTLFireability-09 finished in 496 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 91 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 91/91 places, 45/45 transitions.
Ensure Unique test removed 18 places
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 68 transition count 38
Reduce places removed 11 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 19 rules applied. Total rules applied 31 place count 57 transition count 30
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 39 place count 49 transition count 30
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 39 place count 49 transition count 19
Deduced a syphon composed of 11 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 27 rules applied. Total rules applied 66 place count 33 transition count 19
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 66 place count 33 transition count 16
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 72 place count 30 transition count 16
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 21 rules applied. Total rules applied 93 place count 17 transition count 8
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 3 with 2 rules applied. Total rules applied 95 place count 15 transition count 8
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 95 place count 15 transition count 6
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 99 place count 13 transition count 6
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Application raised an uncaught exception Index 15 out of bounds for length 9
java.lang.IndexOutOfBoundsException: Index 15 out of bounds for length 9
at java.base/jdk.internal.util.Preconditions.outOfBounds(Preconditions.java:100)
at java.base/jdk.internal.util.Preconditions.outOfBoundsCheckIndex(Preconditions.java:106)
at java.base/jdk.internal.util.Preconditions.checkIndex(Preconditions.java:302)
at java.base/java.util.Objects.checkIndex(Objects.java:385)
at java.base/java.util.ArrayList.get(ArrayList.java:427)
at fr.lip6.move.gal.structural.StructuralReduction.ensureUnique(StructuralReduction.java:964)
at fr.lip6.move.gal.structural.StructuralReduction.ruleReducePlaces(StructuralReduction.java:1124)
at fr.lip6.move.gal.structural.StructuralReduction.reduce(StructuralReduction.java:252)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:598)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.buildReduced(LTLPropertySolver.java:535)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.reduceForProperty(LTLPropertySolver.java:492)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:210)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Total runtime 100534 ms.
BK_STOP 1779729206315
--------------------
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="IOTPpurchase-PT-C12M10P15D17"
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 IOTPpurchase-PT-C12M10P15D17, 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 r162-smll-177961107700132"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/IOTPpurchase-PT-C12M10P15D17.tgz
mv IOTPpurchase-PT-C12M10P15D17 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 '
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 ;
