fond
Model Checking Contest 2026
16th edition, Hamburg, Germany, June 23, 2026
Execution of r130-smll-177955808900100
Last Updated
Jun 17, 2026

About the Execution of ITS-Tools for FamilyReunion-PT-L00010M0001C001P001G001

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
924.023 273156.00 345459.00 1172.40 TFFFTFFTFFFTFTFF 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.r130-smll-177955808900100.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 FamilyReunion-PT-L00010M0001C001P001G001, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r130-smll-177955808900100
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 29K Mar 6 05:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 224K Mar 6 05:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 33K Mar 6 05:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 133K Mar 6 05:11 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 7.0K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 7.9K Mar 15 09:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 44K Mar 15 09:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 14K Mar 15 09:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 46K Mar 15 09:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 45K Mar 6 05:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 346K Mar 6 05:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 76K Mar 6 05:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 311K Mar 6 05:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.9K Mar 15 09:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.1K Mar 15 09:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 24 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 552K 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 FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-00
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-01
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-02
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-03
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-04
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-05
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-06
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-07
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-08
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-09
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-10
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-11
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-12
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-13
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-14
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779735274368

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FamilyReunion-PT-L00010M0001C001P001G001
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-25 18:54:36] [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 18:54:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 18:54:37] [INFO ] Load time of PNML (sax parser for PT used): 320 ms
[2026-05-25 18:54:37] [INFO ] Transformed 1475 places.
[2026-05-25 18:54:37] [INFO ] Transformed 1234 transitions.
[2026-05-25 18:54:37] [INFO ] Parsed PT model containing 1475 places and 1234 transitions and 3799 arcs in 556 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Reduce places removed 10 places and 0 transitions.
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 251 out of 1465 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1465/1465 places, 1234/1234 transitions.
Reduce places removed 45 places and 0 transitions.
Discarding 128 places :
Implicit places reduction removed 128 places
Iterating post reduction 0 with 173 rules applied. Total rules applied 173 place count 1292 transition count 1234
Discarding 106 places :
Symmetric choice reduction at 1 with 106 rule applications. Total rules 279 place count 1186 transition count 1117
Iterating global reduction 1 with 106 rules applied. Total rules applied 385 place count 1186 transition count 1117
Discarding 10 places :
Implicit places reduction removed 10 places
Iterating post reduction 1 with 10 rules applied. Total rules applied 395 place count 1176 transition count 1117
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 424 place count 1147 transition count 1088
Iterating global reduction 2 with 29 rules applied. Total rules applied 453 place count 1147 transition count 1088
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 465 place count 1135 transition count 1066
Iterating global reduction 2 with 12 rules applied. Total rules applied 477 place count 1135 transition count 1066
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 478 place count 1134 transition count 1055
Iterating global reduction 2 with 1 rules applied. Total rules applied 479 place count 1134 transition count 1055
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 2 with 11 rules applied. Total rules applied 490 place count 1123 transition count 1055
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 500 place count 1113 transition count 1045
Iterating global reduction 3 with 10 rules applied. Total rules applied 510 place count 1113 transition count 1045
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 518 place count 1105 transition count 1037
Iterating global reduction 3 with 8 rules applied. Total rules applied 526 place count 1105 transition count 1037
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 533 place count 1098 transition count 1030
Iterating global reduction 3 with 7 rules applied. Total rules applied 540 place count 1098 transition count 1030
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 547 place count 1091 transition count 1023
Iterating global reduction 3 with 7 rules applied. Total rules applied 554 place count 1091 transition count 1023
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 560 place count 1085 transition count 1017
Iterating global reduction 3 with 6 rules applied. Total rules applied 566 place count 1085 transition count 1017
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 572 place count 1079 transition count 1011
Iterating global reduction 3 with 6 rules applied. Total rules applied 578 place count 1079 transition count 1011
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 584 place count 1073 transition count 1005
Iterating global reduction 3 with 6 rules applied. Total rules applied 590 place count 1073 transition count 1005
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 596 place count 1067 transition count 999
Iterating global reduction 3 with 6 rules applied. Total rules applied 602 place count 1067 transition count 999
Applied a total of 602 rules in 1620 ms. Remains 1067 /1465 variables (removed 398) and now considering 999/1234 (removed 235) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-503082515325702643.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4880607657556393457.kers'
[2026-05-25 18:54:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-503082515325702643.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4880607657556393457.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 999 rows 1067 cols 2513 entries
Finished phase 1 with 779 SingleSign rule and 135 generalized
[2026-05-25 18:54:39] [INFO ] Computed 153 invariants in 13 ms
Computed 153 P flows in 15 ms.
Exported basis to /tmp/petrispot-output-4880607657556393457.kers
Total runtime 17 ms.
[2026-05-25 18:54:41] [INFO ] Implicit Places using invariants in 1573 ms returned [77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 220, 341, 342, 343, 344, 345, 346, 347, 348, 349, 350, 351, 524, 525, 526, 527, 528, 529, 530, 531, 532, 533, 534, 558, 710, 711, 712, 713, 714, 715, 716, 717, 718, 719, 720, 776, 777, 778, 779, 780, 781, 782, 783, 784, 785, 786, 978, 979, 981, 982, 983, 984, 985, 986, 987]
Discarding 66 places :
Implicit Place search using SMT only with invariants took 1641 ms to find 66 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1001/1465 places, 999/1234 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 983 transition count 981
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 983 transition count 981
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 43 place count 976 transition count 967
Iterating global reduction 0 with 7 rules applied. Total rules applied 50 place count 976 transition count 967
Applied a total of 50 rules in 134 ms. Remains 976 /1001 variables (removed 25) and now considering 967/999 (removed 32) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16065416394324351362.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13776690456259052448.kers'
[2026-05-25 18:54:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16065416394324351362.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13776690456259052448.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 967 rows 976 cols 2243 entries
Finished phase 1 with 808 SingleSign rule and 81 generalized
[2026-05-25 18:54:41] [INFO ] Computed 87 invariants in 9 ms
Computed 87 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-13776690456259052448.kers
Total runtime 12 ms.
[2026-05-25 18:54:41] [INFO ] Implicit Places using invariants in 575 ms returned []
[2026-05-25 18:54:41] [INFO ] Invariant cache hit.
[2026-05-25 18:54:43] [INFO ] Implicit Places using invariants and state equation in 1747 ms returned []
Implicit Place search using SMT with State Equation took 2327 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 976/1465 places, 967/1234 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5750 ms. Remains : 976/1465 places, 967/1234 transitions.
Starting structural reductions in LTL mode, iteration 0 : 976/976 places, 967/967 transitions.
Applied a total of 0 rules in 22 ms. Remains 976 /976 variables (removed 0) and now considering 967/967 (removed 0) transitions.
[2026-05-25 18:54:43] [INFO ] Invariant cache hit.
[2026-05-25 18:54:43] [INFO ] Implicit Places using invariants in 303 ms returned []
[2026-05-25 18:54:43] [INFO ] Invariant cache hit.
[2026-05-25 18:54:45] [INFO ] Implicit Places using invariants and state equation in 1417 ms returned []
Implicit Place search using SMT with State Equation took 1735 ms to find 0 implicit places.
Running 956 sub problems to find dead transitions.
[2026-05-25 18:54:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/965 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 956 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 965/1943 variables, and 84 constraints, problems are : Problem set: 0 solved, 956 unsolved in 30082 ms.
Refiners :[Generalized P Invariants (flows): 84/87 constraints, State Equation: 0/976 constraints, PredecessorRefiner: 956/956 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 956 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/965 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 956 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 965/1943 variables, and 84 constraints, problems are : Problem set: 0 solved, 956 unsolved in 30050 ms.
Refiners :[Generalized P Invariants (flows): 84/87 constraints, State Equation: 0/976 constraints, PredecessorRefiner: 0/956 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60432ms problems are : Problem set: 0 solved, 956 unsolved
Search for dead transitions found 0 dead transitions in 60465ms
Finished structural reductions in LTL mode , in 1 iterations and 62264 ms. Remains : 976/976 places, 967/967 transitions.
Support contains 251 out of 976 places after structural reductions.
[2026-05-25 18:55:46] [INFO ] Flatten gal took : 208 ms
[2026-05-25 18:55:46] [INFO ] Flatten gal took : 76 ms
[2026-05-25 18:55:46] [INFO ] Input system was already deterministic with 967 transitions.
Support contains 238 out of 976 places (down from 251) after GAL structural reductions.
RANDOM walk for 38385 steps (57 resets) in 2008 ms. (19 steps per ms) remains 0/32 properties
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 976 stabilizing places and 967 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 976 transition count 967
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
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 22 out of 976 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 976/976 places, 967/967 transitions.
Graph (complete) has 1229 edges and 976 vertex of which 620 are kept as prefixes of interest. Removing 356 places using SCC suffix rule.10 ms
Discarding 356 places :
Also discarding 341 output transitions
Drop transitions (Output transitions of discarded places.) removed 341 transitions
Reduce places removed 11 places and 11 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 416 transitions
Trivial Post-agglo rules discarded 416 transitions
Performed 416 trivial Post agglomeration. Transition count delta: 416
Iterating post reduction 0 with 420 rules applied. Total rules applied 421 place count 605 transition count 199
Reduce places removed 416 places and 0 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 1 with 473 rules applied. Total rules applied 894 place count 188 transition count 143
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 2 with 34 rules applied. Total rules applied 928 place count 154 transition count 143
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 66 Pre rules applied. Total rules applied 928 place count 154 transition count 77
Deduced a syphon composed of 66 places in 1 ms
Ensure Unique test removed 22 places
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 3 with 154 rules applied. Total rules applied 1082 place count 66 transition count 77
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 1093 place count 55 transition count 66
Iterating global reduction 3 with 11 rules applied. Total rules applied 1104 place count 55 transition count 66
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 3 with 22 rules applied. Total rules applied 1126 place count 55 transition count 44
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 1137 place count 44 transition count 44
Applied a total of 1137 rules in 88 ms. Remains 44 /976 variables (removed 932) and now considering 44/967 (removed 923) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-69361331843570329.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14042340956886370867.kers'
[2026-05-25 18:55:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-69361331843570329.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14042340956886370867.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 44 rows 44 cols 77 entries
Finished phase 1 with 44 SingleSign rule and 0 generalized
[2026-05-25 18:55:48] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14042340956886370867.kers
Total runtime 1 ms.
[2026-05-25 18:55:48] [INFO ] Implicit Places using invariants in 42 ms returned []
[2026-05-25 18:55:48] [INFO ] Invariant cache hit.
[2026-05-25 18:55:48] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
[2026-05-25 18:55:48] [INFO ] Redundant transitions in 1 ms returned []
Running 33 sub problems to find dead transitions.
[2026-05-25 18:55:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 44/77 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (OVERLAPS) 11/88 variables, 11/44 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (OVERLAPS) 0/88 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Real declared 88/88 variables, and 44 constraints, problems are : Problem set: 0 solved, 33 unsolved in 1173 ms.
Refiners :[State Equation: 44/44 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 33 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 44/77 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 33/66 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (OVERLAPS) 11/88 variables, 11/77 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (OVERLAPS) 0/88 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Int declared 88/88 variables, and 77 constraints, problems are : Problem set: 0 solved, 33 unsolved in 993 ms.
Refiners :[State Equation: 44/44 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2172ms problems are : Problem set: 0 solved, 33 unsolved
Search for dead transitions found 0 dead transitions in 2173ms
Starting structural reductions in SI_LTL mode, iteration 1 : 44/976 places, 44/967 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2390 ms. Remains : 44/976 places, 44/967 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 448 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-00
Product exploration explored 100000 steps with 2234 reset in 596 ms.
Product exploration explored 100000 steps with 2231 reset in 268 ms.
Computed a total of 44 stabilizing places and 44 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 44 transition count 44
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 6 factoid took 14 ms. Proved property starting from automaton with 3 states, 6 edges and 2 AP (stutter insensitive
Knowledge-based reduction took 75 ms.
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-00 finished in 4030 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 (p1||G(!p0)))||(F(p2)&&F(p0))) U (G(((!p0 U (p1||G(!p0)))||(F(p2)&&F(p0))))||(p3&&((!p0 U (p1||G(!p0)))||(F(p2)&&F(p0)))))))'
Support contains 55 out of 976 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 976/976 places, 967/967 transitions.
Graph (complete) has 1229 edges and 976 vertex of which 670 are kept as prefixes of interest. Removing 306 places using SCC suffix rule.4 ms
Discarding 306 places :
Also discarding 284 output transitions
Drop transitions (Output transitions of discarded places.) removed 284 transitions
Reduce places removed 11 places and 11 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 416 transitions
Trivial Post-agglo rules discarded 416 transitions
Performed 416 trivial Post agglomeration. Transition count delta: 416
Iterating post reduction 0 with 420 rules applied. Total rules applied 421 place count 655 transition count 256
Reduce places removed 416 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 438 rules applied. Total rules applied 859 place count 239 transition count 234
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 870 place count 228 transition count 234
Performed 75 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 75 Pre rules applied. Total rules applied 870 place count 228 transition count 159
Deduced a syphon composed of 75 places in 0 ms
Ensure Unique test removed 22 places
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 172 rules applied. Total rules applied 1042 place count 131 transition count 159
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 3 with 22 rules applied. Total rules applied 1064 place count 131 transition count 137
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 4 with 22 rules applied. Total rules applied 1086 place count 109 transition count 137
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1088 place count 107 transition count 135
Iterating global reduction 5 with 2 rules applied. Total rules applied 1090 place count 107 transition count 135
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1091 place count 106 transition count 124
Iterating global reduction 5 with 1 rules applied. Total rules applied 1092 place count 106 transition count 124
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 5 with 13 rules applied. Total rules applied 1105 place count 104 transition count 113
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 1105 place count 104 transition count 111
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 1109 place count 102 transition count 111
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 6 with 20 rules applied. Total rules applied 1129 place count 92 transition count 101
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1130 place count 91 transition count 100
Applied a total of 1130 rules in 62 ms. Remains 91 /976 variables (removed 885) and now considering 100/967 (removed 867) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17645817013636039022.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16675018791534804656.kers'
[2026-05-25 18:55:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17645817013636039022.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16675018791534804656.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 100 rows 91 cols 222 entries
Finished phase 1 with 77 SingleSign rule and 12 generalized
[2026-05-25 18:55:52] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16675018791534804656.kers
Total runtime 1 ms.
[2026-05-25 18:55:52] [INFO ] Implicit Places using invariants in 67 ms returned [11, 46]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 69 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 89/976 places, 100/967 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 0 with 1 rules applied. Total rules applied 1 place count 89 transition count 99
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 88 transition count 99
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 2 place count 88 transition count 88
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 24 place count 77 transition count 88
Applied a total of 24 rules in 13 ms. Remains 77 /89 variables (removed 12) and now considering 88/100 (removed 12) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1061232685838292209.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2008915974904825731.kers'
[2026-05-25 18:55:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1061232685838292209.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2008915974904825731.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 88 rows 77 cols 165 entries
Finished phase 1 with 77 SingleSign rule and 0 generalized
[2026-05-25 18:55:52] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2008915974904825731.kers
Total runtime 1 ms.
[2026-05-25 18:55:52] [INFO ] Implicit Places using invariants in 42 ms returned []
[2026-05-25 18:55:52] [INFO ] Invariant cache hit.
[2026-05-25 18:55:52] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 77/976 places, 88/967 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 290 ms. Remains : 77/976 places, 88/967 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 (p1||G(!p0)))||(F(p2)&&F(p0))) U (G(((!p0 U (p1||G(!p0)))||(F(p2)&&F(p0))))||(p3&&((!p0 U (p1||G(!p0)))||(F(p2)&&F(p0)))))))'
Stuttering acceptance computed with spot in 174 ms :[(AND p0 (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) p0 (NOT p1))]
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-04
Product exploration explored 100000 steps with 13524 reset in 583 ms.
Product exploration explored 100000 steps with 13478 reset in 506 ms.
Computed a total of 77 stabilizing places and 88 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 77 transition count 88
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 15 factoid took 232 ms. Reduced automaton from 3 states, 6 edges and 4 AP (stutter insensitive) to 3 states, 6 edges and 4 AP (stutter insensitive).
RANDOM walk for 276 steps (1 resets) in 6 ms. (39 steps per ms) remains 0/7 properties
Knowledge based reduction with 15 factoid took 339 ms. Reduced automaton from 3 states, 6 edges and 4 AP (stutter insensitive) to 3 states, 6 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 170 ms :[(AND p0 (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) p0 (NOT p1))]
Knowledge-based reduction took 819 ms.
Stuttering acceptance computed with spot in 175 ms :[(AND p0 (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) p0 (NOT p1))]
Support contains 55 out of 77 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 77/77 places, 88/88 transitions.
Applied a total of 0 rules in 4 ms. Remains 77 /77 variables (removed 0) and now considering 88/88 (removed 0) transitions.
[2026-05-25 18:55:54] [INFO ] Invariant cache hit.
[2026-05-25 18:55:54] [INFO ] Implicit Places using invariants in 36 ms returned []
[2026-05-25 18:55:54] [INFO ] Invariant cache hit.
[2026-05-25 18:55:54] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
[2026-05-25 18:55:54] [INFO ] Redundant transitions in 3 ms returned []
Running 77 sub problems to find dead transitions.
[2026-05-25 18:55:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (OVERLAPS) 88/154 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (OVERLAPS) 11/165 variables, 11/77 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (OVERLAPS) 0/165 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Real declared 165/165 variables, and 77 constraints, problems are : Problem set: 0 solved, 77 unsolved in 3241 ms.
Refiners :[State Equation: 77/77 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 77 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (OVERLAPS) 88/154 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 77/143 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (OVERLAPS) 11/165 variables, 11/154 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/165 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (OVERLAPS) 0/165 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Int declared 165/165 variables, and 154 constraints, problems are : Problem set: 0 solved, 77 unsolved in 3408 ms.
Refiners :[State Equation: 77/77 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6659ms problems are : Problem set: 0 solved, 77 unsolved
Search for dead transitions found 0 dead transitions in 6660ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 6811 ms. Remains : 77/77 places, 88/88 transitions.
Computed a total of 77 stabilizing places and 88 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 77 transition count 88
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 15 factoid took 261 ms. Reduced automaton from 3 states, 6 edges and 4 AP (stutter insensitive) to 3 states, 6 edges and 4 AP (stutter insensitive).
RANDOM walk for 216 steps (0 resets) in 7 ms. (27 steps per ms) remains 0/7 properties
Knowledge based reduction with 15 factoid took 372 ms. Reduced automaton from 3 states, 6 edges and 4 AP (stutter insensitive) to 3 states, 6 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 174 ms :[(AND p0 (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) p0 (NOT p1))]
Knowledge-based reduction took 906 ms.
Stuttering acceptance computed with spot in 170 ms :[(AND p0 (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) p0 (NOT p1))]
Stuttering acceptance computed with spot in 168 ms :[(AND p0 (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) p0 (NOT p1))]
Product exploration explored 100000 steps with 13584 reset in 508 ms.
Product exploration explored 100000 steps with 13532 reset in 474 ms.
Built C files in :
/tmp/ltsmin3626458053894381710
[2026-05-25 18:56:03] [INFO ] Computing symmetric may disable matrix : 88 transitions.
[2026-05-25 18:56:03] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 18:56:03] [INFO ] Computing symmetric may enable matrix : 88 transitions.
[2026-05-25 18:56:03] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 18:56:03] [INFO ] Computing Do-Not-Accords matrix : 88 transitions.
[2026-05-25 18:56:03] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 18:56:03] [INFO ] Built C files in 54ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3626458053894381710
Running compilation step : cd /tmp/ltsmin3626458053894381710;'/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 624 ms.
Running link step : cd /tmp/ltsmin3626458053894381710;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 72 ms.
Running LTSmin : cd /tmp/ltsmin3626458053894381710;'/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/stateBased13701541285157038928.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 55 out of 77 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 77/77 places, 88/88 transitions.
Applied a total of 0 rules in 3 ms. Remains 77 /77 variables (removed 0) and now considering 88/88 (removed 0) transitions.
[2026-05-25 18:56:18] [INFO ] Invariant cache hit.
[2026-05-25 18:56:18] [INFO ] Implicit Places using invariants in 25 ms returned []
[2026-05-25 18:56:18] [INFO ] Invariant cache hit.
[2026-05-25 18:56:18] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2026-05-25 18:56:18] [INFO ] Redundant transitions in 2 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 99 ms. Remains : 77/77 places, 88/88 transitions.
Built C files in :
/tmp/ltsmin6663108949916712671
[2026-05-25 18:56:18] [INFO ] Computing symmetric may disable matrix : 88 transitions.
[2026-05-25 18:56:18] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 18:56:18] [INFO ] Computing symmetric may enable matrix : 88 transitions.
[2026-05-25 18:56:18] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 18:56:18] [INFO ] Computing Do-Not-Accords matrix : 88 transitions.
[2026-05-25 18:56:18] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 18:56:18] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6663108949916712671
Running compilation step : cd /tmp/ltsmin6663108949916712671;'/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 245 ms.
Running link step : cd /tmp/ltsmin6663108949916712671;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin6663108949916712671;'/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/stateBased18408675920904061962.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-25 18:56:33] [INFO ] Flatten gal took : 5 ms
[2026-05-25 18:56:33] [INFO ] Flatten gal took : 5 ms
[2026-05-25 18:56:33] [INFO ] Time to serialize gal into /tmp/LTL16591994180178382073.gal : 2 ms
[2026-05-25 18:56:33] [INFO ] Time to serialize properties into /tmp/LTL3377726598066153857.prop : 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/LTL16591994180178382073.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17895866207848618272.hoa' '-atoms' '/tmp/LTL3377726598066153857.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...319
Loading property file /tmp/LTL3377726598066153857.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17895866207848618272.hoa
Reverse transition relation is NOT exact ! Due to transitions t945, t946, t947, t948, t949, t950, t951, t952, t953, t954, t955, Intersection with reachabl...226
Computing Next relation with stutter on 1 deadlock states
Detected timeout of ITS tools.
[2026-05-25 18:56:49] [INFO ] Flatten gal took : 5 ms
[2026-05-25 18:56:49] [INFO ] Flatten gal took : 5 ms
[2026-05-25 18:56:49] [INFO ] Time to serialize gal into /tmp/LTL8515280022698743186.gal : 2 ms
[2026-05-25 18:56:49] [INFO ] Time to serialize properties into /tmp/LTL13398861391970197850.ltl : 11 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/LTL8515280022698743186.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13398861391970197850.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 : !(((((!("((((((l14_10>=1)||(l14_3>=1))||((l14_8>=1)||(l14_5>=1)))||(((l14_7>=1)||(l14_2>=1))||((l14_2>=1)||(l14_0>=1))))||((((l14_0>=1...4696
Formula 0 simplified : !"(((((l21_9>=1)||(l21_8>=1))||((l21_10>=1)||(l21_5>=1)))||(((l21_4>=1)||(l21_7>=1))||((l21_6>=1)||(l21_1>=1))))||(((l21_0>=1)||(l21...1424
Reverse transition relation is NOT exact ! Due to transitions t945, t946, t947, t948, t949, t950, t951, t952, t953, t954, t955, Intersection with reachabl...226
Computing Next relation with stutter on 1 deadlock states
Detected timeout of ITS tools.
[2026-05-25 18:57:04] [INFO ] Flatten gal took : 5 ms
[2026-05-25 18:57:04] [INFO ] Applying decomposition
[2026-05-25 18:57:04] [INFO ] Flatten gal took : 4 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/graph2779047315182472882.txt' '-o' '/tmp/graph2779047315182472882.bin' '-w' '/tmp/graph2779047315182472882.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph2779047315182472882.bin' '-l' '-1' '-v' '-w' '/tmp/graph2779047315182472882.weights' '-q' '0' '-e' '0.001'
[2026-05-25 18:57:04] [INFO ] Decomposing Gal with order
[2026-05-25 18:57:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 18:57:04] [INFO ] Flatten gal took : 85 ms
[2026-05-25 18:57:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2026-05-25 18:57:04] [INFO ] Time to serialize gal into /tmp/LTL1231629556946134519.gal : 3 ms
[2026-05-25 18:57:04] [INFO ] Time to serialize properties into /tmp/LTL12691087198295009390.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1231629556946134519.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12691087198295009390.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...255
Read 1 LTL properties
Checking formula 0 : !(((((!("((((((i1.u10.l14_10>=1)||(i8.u4.l14_3>=1))||((i10.u8.l14_8>=1)||(i3.u5.l14_5>=1)))||(((i6.u7.l14_7>=1)||(i5.u0.l14_2>=1))||((...6694
Formula 0 simplified : !"(((((i4.u27.l21_9>=1)||(i10.u32.l21_8>=1))||((i1.u28.l21_10>=1)||(i3.u25.l21_5>=1)))||(((i2.u30.l21_4>=1)||(i6.u26.l21_7>=1))||((i...2038
Reverse transition relation is NOT exact ! Due to transitions i0.u22.t945, i1.u28.t955, i2.u30.t949, i3.u25.t950, i4.u27.t954, i5.u24.t947, i6.u26.t952, i7...304
Computing Next relation with stutter on 1 deadlock states
67 unique states visited
0 strongly connected components in search stack
67 transitions explored
35 items max in DFS search stack
253 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,2.54684,111364,1,0,208580,69,704,195003,93,201,192715
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-04 finished in 75459 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(((p0 U p1)||X(X(!p2)))) U p0)))'
Support contains 66 out of 976 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 976/976 places, 967/967 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 972 transition count 967
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 34 place count 942 transition count 927
Iterating global reduction 1 with 30 rules applied. Total rules applied 64 place count 942 transition count 927
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 76 place count 941 transition count 916
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 103 place count 914 transition count 879
Iterating global reduction 2 with 27 rules applied. Total rules applied 130 place count 914 transition count 879
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 2 with 2 rules applied. Total rules applied 132 place count 912 transition count 879
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 159 place count 885 transition count 841
Iterating global reduction 3 with 27 rules applied. Total rules applied 186 place count 885 transition count 841
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 212 place count 859 transition count 813
Iterating global reduction 3 with 26 rules applied. Total rules applied 238 place count 859 transition count 813
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 252 place count 845 transition count 799
Iterating global reduction 3 with 14 rules applied. Total rules applied 266 place count 845 transition count 799
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 280 place count 831 transition count 785
Iterating global reduction 3 with 14 rules applied. Total rules applied 294 place count 831 transition count 785
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 300 place count 825 transition count 779
Iterating global reduction 3 with 6 rules applied. Total rules applied 306 place count 825 transition count 779
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 310 place count 821 transition count 775
Iterating global reduction 3 with 4 rules applied. Total rules applied 314 place count 821 transition count 775
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 315 place count 820 transition count 775
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 318 place count 817 transition count 772
Iterating global reduction 4 with 3 rules applied. Total rules applied 321 place count 817 transition count 772
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 323 place count 815 transition count 770
Iterating global reduction 4 with 2 rules applied. Total rules applied 325 place count 815 transition count 770
Applied a total of 325 rules in 426 ms. Remains 815 /976 variables (removed 161) and now considering 770/967 (removed 197) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13106442808893380880.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10542429135348513010.kers'
[2026-05-25 18:57:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13106442808893380880.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10542429135348513010.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 770 rows 815 cols 1738 entries
Finished phase 1 with 670 SingleSign rule and 66 generalized
[2026-05-25 18:57:07] [INFO ] Computed 79 invariants in 6 ms
Computed 79 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-10542429135348513010.kers
Total runtime 8 ms.
[2026-05-25 18:57:08] [INFO ] Implicit Places using invariants in 526 ms returned [715]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 528 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 814/976 places, 770/967 transitions.
Applied a total of 0 rules in 41 ms. Remains 814 /814 variables (removed 0) and now considering 770/770 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 995 ms. Remains : 814/976 places, 770/967 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(((p0 U p1)||X(X(!p2)))) U p0)))'
Stuttering acceptance computed with spot in 458 ms :[(NOT p0), (NOT p0), p2, (AND (NOT p1) p2), p2, true, (AND (NOT p1) p2), (AND (NOT p1) p2), (NOT p1)]
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-06
Product exploration explored 100000 steps with 18168 reset in 478 ms.
Product exploration explored 100000 steps with 18217 reset in 447 ms.
Computed a total of 814 stabilizing places and 770 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 814 transition count 770
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 11 factoid took 123 ms. Reduced automaton from 9 states, 16 edges and 3 AP (stutter sensitive) to 9 states, 16 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (60 resets) in 821 ms. (48 steps per ms) remains 2/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 698 ms. (57 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 929 ms. (43 steps per ms) remains 2/2 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8493128429696514082.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4420481400332247928.kers'
[2026-05-25 18:57:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8493128429696514082.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4420481400332247928.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 770 rows 814 cols 1716 entries
Finished phase 1 with 681 SingleSign rule and 55 generalized
[2026-05-25 18:57:11] [INFO ] Computed 78 invariants in 6 ms
Computed 78 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-4420481400332247928.kers
Total runtime 7 ms.
Excessive predecessor constraint size, skipping predecessor.
Problem apf1 is UNSAT
Problem apf2 is UNSAT
After SMT solving in domain Real declared 66/1584 variables, and 0 constraints, problems are : Problem set: 2 solved, 0 unsolved in 39 ms.
Refiners :[Generalized P Invariants (flows): 0/78 constraints, State Equation: 0/814 constraints, PredecessorRefiner: 0/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 71ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge based reduction with 13 factoid took 166 ms. Reduced automaton from 9 states, 16 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 321 ms :[(NOT p0), (NOT p0), p2, (AND (NOT p0) (NOT p1) p2), p2, true, (AND p2 (NOT p0) (NOT p1))]
[2026-05-25 18:57:11] [INFO ] Invariant cache hit.
[2026-05-25 18:57:12] [INFO ] [Real]Absence check using 0 positive and 78 generalized place invariants in 52 ms returned sat
[2026-05-25 18:57:15] [INFO ] [Real]Absence check using state equation in 2633 ms returned sat
[2026-05-25 18:57:15] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 18:57:16] [INFO ] [Nat]Absence check using 0 positive and 78 generalized place invariants in 78 ms returned sat
[2026-05-25 18:57:20] [INFO ] [Nat]Absence check using state equation in 3803 ms returned sat
[2026-05-25 18:57:20] [INFO ] Computed and/alt/rep : 757/879/757 causal constraints (skipped 2 transitions) in 59 ms.
[2026-05-25 18:57:30] [INFO ] Added : 155 causal constraints over 31 iterations in 10097 ms. Result :unknown
Could not prove EG (NOT p0)
Knowledge-based reduction took 20387 ms.
Stuttering acceptance computed with spot in 316 ms :[(NOT p0), (NOT p0), p2, (AND (NOT p0) (NOT p1) p2), p2, true, (AND p2 (NOT p0) (NOT p1))]
Support contains 66 out of 814 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 814/814 places, 770/770 transitions.
Applied a total of 0 rules in 39 ms. Remains 814 /814 variables (removed 0) and now considering 770/770 (removed 0) transitions.
[2026-05-25 18:57:30] [INFO ] Invariant cache hit.
[2026-05-25 18:57:31] [INFO ] Implicit Places using invariants in 464 ms returned []
[2026-05-25 18:57:31] [INFO ] Invariant cache hit.
[2026-05-25 18:57:32] [INFO ] Implicit Places using invariants and state equation in 1237 ms returned []
Implicit Place search using SMT with State Equation took 1707 ms to find 0 implicit places.
Running 759 sub problems to find dead transitions.
[2026-05-25 18:57:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/803 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 759 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 803/1584 variables, and 76 constraints, problems are : Problem set: 0 solved, 759 unsolved in 30033 ms.
Refiners :[Generalized P Invariants (flows): 76/78 constraints, State Equation: 0/814 constraints, PredecessorRefiner: 759/759 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 759 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/803 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 759 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/803 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 759 unsolved
SMT process timed out in 60121ms, After SMT, problems are : Problem set: 0 solved, 759 unsolved
Search for dead transitions found 0 dead transitions in 60125ms
Finished structural reductions in LTL mode , in 1 iterations and 61874 ms. Remains : 814/814 places, 770/770 transitions.
Computed a total of 814 stabilizing places and 770 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 814 transition count 770
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 11 factoid took 80 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
RANDOM walk for 1938 steps (0 resets) in 19 ms. (96 steps per ms) remains 0/5 properties
Knowledge based reduction with 11 factoid took 123 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 232 ms :[(NOT p0), (NOT p0), p2, (AND (NOT p0) (NOT p1) p2), p2, true, (AND p2 (NOT p0) (NOT p1))]
[2026-05-25 18:58:33] [INFO ] Invariant cache hit.
[2026-05-25 18:58:34] [INFO ] [Real]Absence check using 0 positive and 78 generalized place invariants in 55 ms returned sat
[2026-05-25 18:58:36] [INFO ] [Real]Absence check using state equation in 2503 ms returned sat
[2026-05-25 18:58:36] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 18:58:37] [INFO ] [Nat]Absence check using 0 positive and 78 generalized place invariants in 52 ms returned sat
[2026-05-25 18:58:41] [INFO ] [Nat]Absence check using state equation in 3458 ms returned sat
[2026-05-25 18:58:41] [INFO ] Computed and/alt/rep : 757/879/757 causal constraints (skipped 2 transitions) in 83 ms.
[2026-05-25 18:58:51] [INFO ] Added : 145 causal constraints over 29 iterations in 10713 ms. Result :unknown
Could not prove EG (NOT p0)
Knowledge-based reduction took 19328 ms.
Stuttering acceptance computed with spot in 347 ms :[(NOT p0), (NOT p0), p2, (AND (NOT p0) (NOT p1) p2), p2, true, (AND p2 (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 339 ms :[(NOT p0), (NOT p0), p2, (AND (NOT p0) (NOT p1) p2), p2, true, (AND p2 (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 18243 reset in 460 ms.
Product exploration explored 100000 steps with 18156 reset in 447 ms.
Spot run failed in 107 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/ltsmin16991464809043585012
[2026-05-25 18:58:53] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16991464809043585012
Running compilation step : cd /tmp/ltsmin16991464809043585012;'/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 1866 ms.
Running link step : cd /tmp/ltsmin16991464809043585012;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin16991464809043585012;'/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/stateBased5290514362338324068.hoa' '--buchi-type=spotba'
LTSmin run took 582 ms.
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-06 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-06 finished in 108631 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 11 out of 976 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 976/976 places, 967/967 transitions.
Graph (complete) has 1229 edges and 976 vertex of which 355 are kept as prefixes of interest. Removing 621 places using SCC suffix rule.6 ms
Discarding 621 places :
Also discarding 605 output transitions
Drop transitions (Output transitions of discarded places.) removed 605 transitions
Reduce places removed 11 places and 11 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 296 transitions
Trivial Post-agglo rules discarded 296 transitions
Performed 296 trivial Post agglomeration. Transition count delta: 296
Iterating post reduction 0 with 300 rules applied. Total rules applied 301 place count 340 transition count 55
Reduce places removed 296 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 318 rules applied. Total rules applied 619 place count 44 transition count 33
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 630 place count 33 transition count 33
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 630 place count 33 transition count 22
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 652 place count 22 transition count 22
Applied a total of 652 rules in 26 ms. Remains 22 /976 variables (removed 954) and now considering 22/967 (removed 945) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13163943437874600711.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13992101775519022868.kers'
[2026-05-25 18:58:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13163943437874600711.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13992101775519022868.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 22 rows 22 cols 33 entries
Finished phase 1 with 22 SingleSign rule and 0 generalized
[2026-05-25 18:58:56] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13992101775519022868.kers
Total runtime 0 ms.
[2026-05-25 18:58:56] [INFO ] Implicit Places using invariants in 28 ms returned []
[2026-05-25 18:58:56] [INFO ] Invariant cache hit.
[2026-05-25 18:58:56] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
[2026-05-25 18:58:56] [INFO ] Redundant transitions in 0 ms returned []
Running 11 sub problems to find dead transitions.
[2026-05-25 18:58:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 22/33 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 11/44 variables, 11/22 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 0/44 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 44/44 variables, and 22 constraints, problems are : Problem set: 0 solved, 11 unsolved in 280 ms.
Refiners :[State Equation: 22/22 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 22/33 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 11/22 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 11/44 variables, 11/33 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 0/44 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 44/44 variables, and 33 constraints, problems are : Problem set: 0 solved, 11 unsolved in 210 ms.
Refiners :[State Equation: 22/22 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 493ms problems are : Problem set: 0 solved, 11 unsolved
Search for dead transitions found 0 dead transitions in 493ms
Starting structural reductions in SI_LTL mode, iteration 1 : 22/976 places, 22/967 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 620 ms. Remains : 22/976 places, 22/967 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-07
Product exploration explored 100000 steps with 4871 reset in 112 ms.
Product exploration explored 100000 steps with 4851 reset in 142 ms.
Computed a total of 22 stabilizing places and 22 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 22 transition count 22
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 3 factoid took 13 ms. Proved property starting from automaton with 2 states, 3 edges and 1 AP (stutter insensitive
Knowledge-based reduction took 44 ms.
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-07 finished in 1012 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0)) U (G(p1)||X(G(!p0))))))'
Support contains 3 out of 976 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 976/976 places, 967/967 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 972 transition count 967
Discarding 46 places :
Symmetric choice reduction at 1 with 46 rule applications. Total rules 50 place count 926 transition count 911
Iterating global reduction 1 with 46 rules applied. Total rules applied 96 place count 926 transition count 911
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 108 place count 925 transition count 900
Discarding 43 places :
Symmetric choice reduction at 2 with 43 rule applications. Total rules 151 place count 882 transition count 857
Iterating global reduction 2 with 43 rules applied. Total rules applied 194 place count 882 transition count 857
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 2 with 22 rules applied. Total rules applied 216 place count 871 transition count 846
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 238 place count 849 transition count 813
Iterating global reduction 3 with 22 rules applied. Total rules applied 260 place count 849 transition count 813
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 281 place count 828 transition count 790
Iterating global reduction 3 with 21 rules applied. Total rules applied 302 place count 828 transition count 790
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 323 place count 807 transition count 769
Iterating global reduction 3 with 21 rules applied. Total rules applied 344 place count 807 transition count 769
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 350 place count 807 transition count 763
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 365 place count 792 transition count 748
Iterating global reduction 4 with 15 rules applied. Total rules applied 380 place count 792 transition count 748
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 388 place count 784 transition count 740
Iterating global reduction 4 with 8 rules applied. Total rules applied 396 place count 784 transition count 740
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 404 place count 776 transition count 732
Iterating global reduction 4 with 8 rules applied. Total rules applied 412 place count 776 transition count 732
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 413 place count 775 transition count 732
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 421 place count 767 transition count 724
Iterating global reduction 5 with 8 rules applied. Total rules applied 429 place count 767 transition count 724
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 430 place count 767 transition count 723
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 436 place count 761 transition count 717
Iterating global reduction 6 with 6 rules applied. Total rules applied 442 place count 761 transition count 717
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 445 place count 758 transition count 714
Iterating global reduction 6 with 3 rules applied. Total rules applied 448 place count 758 transition count 714
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 449 place count 758 transition count 713
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 451 place count 756 transition count 711
Iterating global reduction 7 with 2 rules applied. Total rules applied 453 place count 756 transition count 711
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 455 place count 756 transition count 709
Applied a total of 455 rules in 384 ms. Remains 756 /976 variables (removed 220) and now considering 709/967 (removed 258) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6414138837058345063.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8403700610358389195.kers'
[2026-05-25 18:58:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6414138837058345063.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8403700610358389195.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 709 rows 756 cols 1621 entries
Finished phase 1 with 631 SingleSign rule and 55 generalized
[2026-05-25 18:58:57] [INFO ] Computed 70 invariants in 4 ms
Computed 70 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-8403700610358389195.kers
Total runtime 5 ms.
[2026-05-25 18:58:57] [INFO ] Implicit Places using invariants in 330 ms returned [676]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 332 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 755/976 places, 709/967 transitions.
Applied a total of 0 rules in 22 ms. Remains 755 /755 variables (removed 0) and now considering 709/709 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 738 ms. Remains : 755/976 places, 709/967 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0)) U (G(p1)||X(G(!p0))))))'
Stuttering acceptance computed with spot in 271 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), false, false, (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-08
Product exploration explored 100000 steps with 155 reset in 355 ms.
Product exploration explored 100000 steps with 155 reset in 333 ms.
Computed a total of 755 stabilizing places and 709 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 755 transition count 709
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Property proved to be false by K+ with min(phi)
Knowledge based reduction with 15 factoid took 27 ms. Proved property starting from automaton with 6 states, 15 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 386 ms.
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-08 FALSE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-08 finished in 2134 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0))&&F(((X(!p0)&&G(p1))||G(!p0)))))'
Support contains 3 out of 976 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 976/976 places, 967/967 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 973 transition count 967
Discarding 46 places :
Symmetric choice reduction at 1 with 46 rule applications. Total rules 49 place count 927 transition count 911
Iterating global reduction 1 with 46 rules applied. Total rules applied 95 place count 927 transition count 911
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 107 place count 926 transition count 900
Discarding 43 places :
Symmetric choice reduction at 2 with 43 rule applications. Total rules 150 place count 883 transition count 847
Iterating global reduction 2 with 43 rules applied. Total rules applied 193 place count 883 transition count 847
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 13 places :
Implicit places reduction removed 13 places
Iterating post reduction 2 with 24 rules applied. Total rules applied 217 place count 870 transition count 836
Discarding 31 places :
Symmetric choice reduction at 3 with 31 rule applications. Total rules 248 place count 839 transition count 794
Iterating global reduction 3 with 31 rules applied. Total rules applied 279 place count 839 transition count 794
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 309 place count 809 transition count 762
Iterating global reduction 3 with 30 rules applied. Total rules applied 339 place count 809 transition count 762
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 358 place count 790 transition count 743
Iterating global reduction 3 with 19 rules applied. Total rules applied 377 place count 790 transition count 743
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 383 place count 790 transition count 737
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 396 place count 777 transition count 724
Iterating global reduction 4 with 13 rules applied. Total rules applied 409 place count 777 transition count 724
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 415 place count 771 transition count 718
Iterating global reduction 4 with 6 rules applied. Total rules applied 421 place count 771 transition count 718
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 427 place count 765 transition count 712
Iterating global reduction 4 with 6 rules applied. Total rules applied 433 place count 765 transition count 712
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 434 place count 764 transition count 712
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 440 place count 758 transition count 706
Iterating global reduction 5 with 6 rules applied. Total rules applied 446 place count 758 transition count 706
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 447 place count 758 transition count 705
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 451 place count 754 transition count 701
Iterating global reduction 6 with 4 rules applied. Total rules applied 455 place count 754 transition count 701
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 457 place count 752 transition count 699
Iterating global reduction 6 with 2 rules applied. Total rules applied 459 place count 752 transition count 699
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 461 place count 750 transition count 697
Iterating global reduction 6 with 2 rules applied. Total rules applied 463 place count 750 transition count 697
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 464 place count 750 transition count 696
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 465 place count 749 transition count 695
Iterating global reduction 7 with 1 rules applied. Total rules applied 466 place count 749 transition count 695
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 467 place count 749 transition count 694
Applied a total of 467 rules in 363 ms. Remains 749 /976 variables (removed 227) and now considering 694/967 (removed 273) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7652940337717377306.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14368571574788811423.kers'
[2026-05-25 18:58:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7652940337717377306.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14368571574788811423.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 694 rows 749 cols 1555 entries
Finished phase 1 with 624 SingleSign rule and 56 generalized
[2026-05-25 18:58:59] [INFO ] Computed 69 invariants in 7 ms
Computed 69 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-14368571574788811423.kers
Total runtime 8 ms.
[2026-05-25 18:59:00] [INFO ] Implicit Places using invariants in 453 ms returned [649]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 460 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 748/976 places, 694/967 transitions.
Applied a total of 0 rules in 37 ms. Remains 748 /748 variables (removed 0) and now considering 694/694 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 860 ms. Remains : 748/976 places, 694/967 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0))&&F(((X(!p0)&&G(p1))||G(!p0)))))'
Stuttering acceptance computed with spot in 335 ms :[true, (NOT p0), p0, p0, (AND (NOT p1) p0), (NOT p0), true]
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-09
Entered a terminal (fully accepting) state of product in 1387 steps with 7 reset in 7 ms.
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-09 finished in 1249 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((X((F(p0)&&G(p1))) U (F(G(p2)) U p3))))'
Support contains 5 out of 976 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 976/976 places, 967/967 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 972 transition count 967
Discarding 45 places :
Symmetric choice reduction at 1 with 45 rule applications. Total rules 49 place count 927 transition count 912
Iterating global reduction 1 with 45 rules applied. Total rules applied 94 place count 927 transition count 912
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 105 place count 927 transition count 901
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 147 place count 885 transition count 849
Iterating global reduction 2 with 42 rules applied. Total rules applied 189 place count 885 transition count 849
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 13 places :
Implicit places reduction removed 13 places
Iterating post reduction 2 with 24 rules applied. Total rules applied 213 place count 872 transition count 838
Discarding 31 places :
Symmetric choice reduction at 3 with 31 rule applications. Total rules 244 place count 841 transition count 796
Iterating global reduction 3 with 31 rules applied. Total rules applied 275 place count 841 transition count 796
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 305 place count 811 transition count 764
Iterating global reduction 3 with 30 rules applied. Total rules applied 335 place count 811 transition count 764
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 354 place count 792 transition count 745
Iterating global reduction 3 with 19 rules applied. Total rules applied 373 place count 792 transition count 745
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 379 place count 792 transition count 739
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 392 place count 779 transition count 726
Iterating global reduction 4 with 13 rules applied. Total rules applied 405 place count 779 transition count 726
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 411 place count 773 transition count 720
Iterating global reduction 4 with 6 rules applied. Total rules applied 417 place count 773 transition count 720
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 423 place count 767 transition count 714
Iterating global reduction 4 with 6 rules applied. Total rules applied 429 place count 767 transition count 714
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 430 place count 766 transition count 714
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 436 place count 760 transition count 708
Iterating global reduction 5 with 6 rules applied. Total rules applied 442 place count 760 transition count 708
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 447 place count 755 transition count 703
Iterating global reduction 5 with 5 rules applied. Total rules applied 452 place count 755 transition count 703
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 455 place count 752 transition count 700
Iterating global reduction 5 with 3 rules applied. Total rules applied 458 place count 752 transition count 700
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 459 place count 752 transition count 699
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 461 place count 750 transition count 697
Iterating global reduction 6 with 2 rules applied. Total rules applied 463 place count 750 transition count 697
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 465 place count 750 transition count 695
Applied a total of 465 rules in 392 ms. Remains 750 /976 variables (removed 226) and now considering 695/967 (removed 272) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15177047907410193274.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11140243645971950082.kers'
[2026-05-25 18:59:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15177047907410193274.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11140243645971950082.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 695 rows 750 cols 1557 entries
Finished phase 1 with 625 SingleSign rule and 56 generalized
[2026-05-25 18:59:00] [INFO ] Computed 69 invariants in 4 ms
Computed 69 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-11140243645971950082.kers
Total runtime 5 ms.
[2026-05-25 18:59:01] [INFO ] Implicit Places using invariants in 303 ms returned [650]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 305 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 749/976 places, 695/967 transitions.
Applied a total of 0 rules in 21 ms. Remains 749 /749 variables (removed 0) and now considering 695/695 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 719 ms. Remains : 749/976 places, 695/967 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((X((F(p0)&&G(p1))) U (F(G(p2)) U p3))))'
Stuttering acceptance computed with spot in 233 ms :[(NOT p3), (OR (NOT p3) (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND p1 (NOT p3))]
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-10
Stuttering criterion allowed to conclude after 649 steps with 1 reset in 2 ms.
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-10 finished in 1033 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||X((!p1&&(!p0 U (p2||G(!p0)))))) U X(p3)))'
Support contains 8 out of 976 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 976/976 places, 967/967 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 973 transition count 967
Discarding 46 places :
Symmetric choice reduction at 1 with 46 rule applications. Total rules 49 place count 927 transition count 911
Iterating global reduction 1 with 46 rules applied. Total rules applied 95 place count 927 transition count 911
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 107 place count 926 transition count 900
Discarding 43 places :
Symmetric choice reduction at 2 with 43 rule applications. Total rules 150 place count 883 transition count 847
Iterating global reduction 2 with 43 rules applied. Total rules applied 193 place count 883 transition count 847
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 13 places :
Implicit places reduction removed 13 places
Iterating post reduction 2 with 24 rules applied. Total rules applied 217 place count 870 transition count 836
Discarding 31 places :
Symmetric choice reduction at 3 with 31 rule applications. Total rules 248 place count 839 transition count 794
Iterating global reduction 3 with 31 rules applied. Total rules applied 279 place count 839 transition count 794
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 309 place count 809 transition count 763
Iterating global reduction 3 with 30 rules applied. Total rules applied 339 place count 809 transition count 763
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 358 place count 790 transition count 744
Iterating global reduction 3 with 19 rules applied. Total rules applied 377 place count 790 transition count 744
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 383 place count 790 transition count 738
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 396 place count 777 transition count 725
Iterating global reduction 4 with 13 rules applied. Total rules applied 409 place count 777 transition count 725
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 415 place count 771 transition count 719
Iterating global reduction 4 with 6 rules applied. Total rules applied 421 place count 771 transition count 719
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 427 place count 765 transition count 713
Iterating global reduction 4 with 6 rules applied. Total rules applied 433 place count 765 transition count 713
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 439 place count 759 transition count 707
Iterating global reduction 4 with 6 rules applied. Total rules applied 445 place count 759 transition count 707
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 446 place count 759 transition count 706
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 450 place count 755 transition count 702
Iterating global reduction 5 with 4 rules applied. Total rules applied 454 place count 755 transition count 702
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 457 place count 752 transition count 699
Iterating global reduction 5 with 3 rules applied. Total rules applied 460 place count 752 transition count 699
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 461 place count 752 transition count 698
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 463 place count 750 transition count 696
Iterating global reduction 6 with 2 rules applied. Total rules applied 465 place count 750 transition count 696
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 466 place count 750 transition count 695
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 467 place count 749 transition count 694
Iterating global reduction 7 with 1 rules applied. Total rules applied 468 place count 749 transition count 694
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 469 place count 749 transition count 693
Applied a total of 469 rules in 375 ms. Remains 749 /976 variables (removed 227) and now considering 693/967 (removed 274) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12170551119356362962.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8862695260633086159.kers'
[2026-05-25 18:59:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12170551119356362962.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8862695260633086159.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 693 rows 749 cols 1557 entries
Finished phase 1 with 621 SingleSign rule and 58 generalized
[2026-05-25 18:59:01] [INFO ] Computed 70 invariants in 4 ms
Computed 70 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-8862695260633086159.kers
Total runtime 5 ms.
[2026-05-25 18:59:02] [INFO ] Implicit Places using invariants in 355 ms returned [308, 649]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 357 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 747/976 places, 693/967 transitions.
Applied a total of 0 rules in 36 ms. Remains 747 /747 variables (removed 0) and now considering 693/693 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 769 ms. Remains : 747/976 places, 693/967 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||X((!p1&&(!p0 U (p2||G(!p0)))))) U X(p3)))'
Stuttering acceptance computed with spot in 184 ms :[(NOT p3), (NOT p3), (OR (AND p0 (NOT p2) (NOT p3)) (AND p1 (NOT p3))), true, (AND p0 (NOT p2))]
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-11
Product exploration explored 100000 steps with 50000 reset in 347 ms.
Product exploration explored 100000 steps with 50000 reset in 369 ms.
Computed a total of 747 stabilizing places and 693 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 747 transition count 693
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 21 factoid took 11 ms. Proved property starting from automaton with 5 states, 9 edges and 4 AP (stutter sensitive
Knowledge-based reduction took 345 ms.
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-11 finished in 2052 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 976 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 976/976 places, 967/967 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 973 transition count 967
Discarding 46 places :
Symmetric choice reduction at 1 with 46 rule applications. Total rules 49 place count 927 transition count 911
Iterating global reduction 1 with 46 rules applied. Total rules applied 95 place count 927 transition count 911
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 107 place count 926 transition count 900
Discarding 43 places :
Symmetric choice reduction at 2 with 43 rule applications. Total rules 150 place count 883 transition count 847
Iterating global reduction 2 with 43 rules applied. Total rules applied 193 place count 883 transition count 847
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 13 places :
Implicit places reduction removed 13 places
Iterating post reduction 2 with 24 rules applied. Total rules applied 217 place count 870 transition count 836
Discarding 32 places :
Symmetric choice reduction at 3 with 32 rule applications. Total rules 249 place count 838 transition count 793
Iterating global reduction 3 with 32 rules applied. Total rules applied 281 place count 838 transition count 793
Discarding 31 places :
Symmetric choice reduction at 3 with 31 rule applications. Total rules 312 place count 807 transition count 760
Iterating global reduction 3 with 31 rules applied. Total rules applied 343 place count 807 transition count 760
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 363 place count 787 transition count 740
Iterating global reduction 3 with 20 rules applied. Total rules applied 383 place count 787 transition count 740
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 389 place count 787 transition count 734
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 403 place count 773 transition count 720
Iterating global reduction 4 with 14 rules applied. Total rules applied 417 place count 773 transition count 720
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 424 place count 766 transition count 713
Iterating global reduction 4 with 7 rules applied. Total rules applied 431 place count 766 transition count 713
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 438 place count 759 transition count 706
Iterating global reduction 4 with 7 rules applied. Total rules applied 445 place count 759 transition count 706
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 446 place count 758 transition count 706
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 453 place count 751 transition count 699
Iterating global reduction 5 with 7 rules applied. Total rules applied 460 place count 751 transition count 699
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 461 place count 751 transition count 698
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 466 place count 746 transition count 693
Iterating global reduction 6 with 5 rules applied. Total rules applied 471 place count 746 transition count 693
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 474 place count 743 transition count 690
Iterating global reduction 6 with 3 rules applied. Total rules applied 477 place count 743 transition count 690
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 478 place count 743 transition count 689
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 480 place count 741 transition count 687
Iterating global reduction 7 with 2 rules applied. Total rules applied 482 place count 741 transition count 687
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 483 place count 741 transition count 686
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 484 place count 740 transition count 685
Iterating global reduction 8 with 1 rules applied. Total rules applied 485 place count 740 transition count 685
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 486 place count 740 transition count 684
Applied a total of 486 rules in 627 ms. Remains 740 /976 variables (removed 236) and now considering 684/967 (removed 283) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12798028681001610125.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8680986430205566450.kers'
[2026-05-25 18:59:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12798028681001610125.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8680986430205566450.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 684 rows 740 cols 1535 entries
Finished phase 1 with 615 SingleSign rule and 56 generalized
[2026-05-25 18:59:04] [INFO ] Computed 69 invariants in 3 ms
Computed 69 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-8680986430205566450.kers
Total runtime 5 ms.
[2026-05-25 18:59:04] [INFO ] Implicit Places using invariants in 338 ms returned [640]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 340 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 739/976 places, 684/967 transitions.
Applied a total of 0 rules in 22 ms. Remains 739 /739 variables (removed 0) and now considering 684/684 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1002 ms. Remains : 739/976 places, 684/967 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-12
Stuttering criterion allowed to conclude after 795 steps with 1 reset in 1 ms.
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-12 finished in 1115 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)||G(p1))))'
Support contains 2 out of 976 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 976/976 places, 967/967 transitions.
Graph (complete) has 1229 edges and 976 vertex of which 964 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.4 ms
Discarding 12 places :
Also discarding 15 output transitions
Drop transitions (Output transitions of discarded places.) removed 15 transitions
Reduce places removed 11 places and 11 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 533 transitions
Trivial Post-agglo rules discarded 533 transitions
Performed 533 trivial Post agglomeration. Transition count delta: 533
Iterating post reduction 0 with 537 rules applied. Total rules applied 538 place count 949 transition count 408
Reduce places removed 533 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 1 with 589 rules applied. Total rules applied 1127 place count 415 transition count 353
Reduce places removed 34 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 35 rules applied. Total rules applied 1162 place count 381 transition count 352
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1163 place count 380 transition count 352
Performed 152 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 152 Pre rules applied. Total rules applied 1163 place count 380 transition count 200
Deduced a syphon composed of 152 places in 0 ms
Ensure Unique test removed 66 places
Reduce places removed 218 places and 0 transitions.
Iterating global reduction 4 with 370 rules applied. Total rules applied 1533 place count 162 transition count 200
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 4 with 33 rules applied. Total rules applied 1566 place count 162 transition count 167
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 5 with 33 rules applied. Total rules applied 1599 place count 129 transition count 167
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 11 Pre rules applied. Total rules applied 1599 place count 129 transition count 156
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 6 with 22 rules applied. Total rules applied 1621 place count 118 transition count 156
Discarding 23 places :
Symmetric choice reduction at 6 with 23 rule applications. Total rules 1644 place count 95 transition count 123
Iterating global reduction 6 with 23 rules applied. Total rules applied 1667 place count 95 transition count 123
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 11 places :
Implicit places reduction removed 11 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 6 with 46 rules applied. Total rules applied 1713 place count 84 transition count 88
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 7 with 24 rules applied. Total rules applied 1737 place count 60 transition count 88
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 11 Pre rules applied. Total rules applied 1737 place count 60 transition count 77
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 8 with 22 rules applied. Total rules applied 1759 place count 49 transition count 77
Discarding 9 places :
Symmetric choice reduction at 8 with 9 rule applications. Total rules 1768 place count 40 transition count 48
Iterating global reduction 8 with 9 rules applied. Total rules applied 1777 place count 40 transition count 48
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 8 with 11 rules applied. Total rules applied 1788 place count 40 transition count 37
Discarding 7 places :
Symmetric choice reduction at 9 with 7 rule applications. Total rules 1795 place count 33 transition count 30
Iterating global reduction 9 with 7 rules applied. Total rules applied 1802 place count 33 transition count 30
Discarding 7 places :
Symmetric choice reduction at 9 with 7 rule applications. Total rules 1809 place count 26 transition count 23
Iterating global reduction 9 with 7 rules applied. Total rules applied 1816 place count 26 transition count 23
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 9 with 8 rules applied. Total rules applied 1824 place count 22 transition count 19
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 9 with 3 rules applied. Total rules applied 1827 place count 19 transition count 16
Applied a total of 1827 rules in 57 ms. Remains 19 /976 variables (removed 957) and now considering 16/967 (removed 951) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10186083483075258363.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14836842859076653797.kers'
[2026-05-25 18:59:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10186083483075258363.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14836842859076653797.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 16 rows 19 cols 50 entries
Finished phase 1 with 8 SingleSign rule and 6 generalized
[2026-05-25 18:59:04] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-14836842859076653797.kers
Total runtime 2 ms.
[2026-05-25 18:59:04] [INFO ] Implicit Places using invariants in 48 ms returned [5, 8, 11, 12]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 49 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 15/976 places, 16/967 transitions.
Graph (complete) has 15 edges and 15 vertex of which 14 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 3 places and 3 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 11 transition count 11
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 3 place count 10 transition count 11
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 5 place count 8 transition count 9
Iterating global reduction 0 with 2 rules applied. Total rules applied 7 place count 8 transition count 9
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 0 with 2 rules applied. Total rules applied 9 place count 7 transition count 8
Applied a total of 9 rules in 2 ms. Remains 7 /15 variables (removed 8) and now considering 8/16 (removed 8) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14173545080017398079.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8877099872232631289.kers'
[2026-05-25 18:59:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14173545080017398079.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8877099872232631289.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 8 rows 7 cols 16 entries
Finished phase 1 with 4 SingleSign rule and 2 generalized
[2026-05-25 18:59:04] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8877099872232631289.kers
Total runtime 0 ms.
[2026-05-25 18:59:04] [INFO ] Implicit Places using invariants in 22 ms returned []
[2026-05-25 18:59:04] [INFO ] Invariant cache hit.
[2026-05-25 18:59:04] [INFO ] Implicit Places using invariants and state equation in 25 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 49 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 6/976 places, 8/967 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 158 ms. Remains : 6/976 places, 8/967 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Stuttering acceptance computed with spot in 45 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-13
Product exploration explored 100000 steps with 18582 reset in 165 ms.
Product exploration explored 100000 steps with 18564 reset in 202 ms.
Computed a total of 6 stabilizing places and 8 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 6 transition count 8
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 7 factoid took 11 ms. Proved property starting from automaton with 1 states, 4 edges and 2 AP (stutter insensitive
Knowledge-based reduction took 42 ms.
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-13 finished in 642 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U X(p1)))'
Support contains 4 out of 976 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 976/976 places, 967/967 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 973 transition count 967
Discarding 45 places :
Symmetric choice reduction at 1 with 45 rule applications. Total rules 48 place count 928 transition count 912
Iterating global reduction 1 with 45 rules applied. Total rules applied 93 place count 928 transition count 912
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 105 place count 927 transition count 901
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 147 place count 885 transition count 849
Iterating global reduction 2 with 42 rules applied. Total rules applied 189 place count 885 transition count 849
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 13 places :
Implicit places reduction removed 13 places
Iterating post reduction 2 with 24 rules applied. Total rules applied 213 place count 872 transition count 838
Discarding 31 places :
Symmetric choice reduction at 3 with 31 rule applications. Total rules 244 place count 841 transition count 797
Iterating global reduction 3 with 31 rules applied. Total rules applied 275 place count 841 transition count 797
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 305 place count 811 transition count 765
Iterating global reduction 3 with 30 rules applied. Total rules applied 335 place count 811 transition count 765
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 354 place count 792 transition count 746
Iterating global reduction 3 with 19 rules applied. Total rules applied 373 place count 792 transition count 746
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 379 place count 792 transition count 740
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 392 place count 779 transition count 727
Iterating global reduction 4 with 13 rules applied. Total rules applied 405 place count 779 transition count 727
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 411 place count 773 transition count 721
Iterating global reduction 4 with 6 rules applied. Total rules applied 417 place count 773 transition count 721
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 423 place count 767 transition count 715
Iterating global reduction 4 with 6 rules applied. Total rules applied 429 place count 767 transition count 715
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 435 place count 761 transition count 709
Iterating global reduction 4 with 6 rules applied. Total rules applied 441 place count 761 transition count 709
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 442 place count 761 transition count 708
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 447 place count 756 transition count 703
Iterating global reduction 5 with 5 rules applied. Total rules applied 452 place count 756 transition count 703
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 455 place count 753 transition count 700
Iterating global reduction 5 with 3 rules applied. Total rules applied 458 place count 753 transition count 700
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 459 place count 753 transition count 699
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 461 place count 751 transition count 697
Iterating global reduction 6 with 2 rules applied. Total rules applied 463 place count 751 transition count 697
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 464 place count 751 transition count 696
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 465 place count 750 transition count 695
Iterating global reduction 7 with 1 rules applied. Total rules applied 466 place count 750 transition count 695
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 467 place count 750 transition count 694
Applied a total of 467 rules in 367 ms. Remains 750 /976 variables (removed 226) and now considering 694/967 (removed 273) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9479391972951657807.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18070771633854369396.kers'
[2026-05-25 18:59:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9479391972951657807.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18070771633854369396.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 694 rows 750 cols 1560 entries
Finished phase 1 with 622 SingleSign rule and 58 generalized
[2026-05-25 18:59:05] [INFO ] Computed 70 invariants in 4 ms
Computed 70 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-18070771633854369396.kers
Total runtime 5 ms.
[2026-05-25 18:59:06] [INFO ] Implicit Places using invariants in 359 ms returned [309, 650]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 360 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 748/976 places, 694/967 transitions.
Applied a total of 0 rules in 22 ms. Remains 748 /748 variables (removed 0) and now considering 694/694 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 749 ms. Remains : 748/976 places, 694/967 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) U X(p1)))'
Stuttering acceptance computed with spot in 151 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-14
Stuttering criterion allowed to conclude after 643 steps with 0 reset in 2 ms.
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-14 finished in 936 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((((p0||X(X(p1))) U p2) U (p1&&((p0||X(X(p1))) U p2)))))'
Support contains 4 out of 976 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 976/976 places, 967/967 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 972 transition count 967
Discarding 45 places :
Symmetric choice reduction at 1 with 45 rule applications. Total rules 49 place count 927 transition count 912
Iterating global reduction 1 with 45 rules applied. Total rules applied 94 place count 927 transition count 912
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 106 place count 926 transition count 901
Discarding 43 places :
Symmetric choice reduction at 2 with 43 rule applications. Total rules 149 place count 883 transition count 858
Iterating global reduction 2 with 43 rules applied. Total rules applied 192 place count 883 transition count 858
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 2 with 22 rules applied. Total rules applied 214 place count 872 transition count 847
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 236 place count 850 transition count 814
Iterating global reduction 3 with 22 rules applied. Total rules applied 258 place count 850 transition count 814
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 279 place count 829 transition count 791
Iterating global reduction 3 with 21 rules applied. Total rules applied 300 place count 829 transition count 791
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 321 place count 808 transition count 770
Iterating global reduction 3 with 21 rules applied. Total rules applied 342 place count 808 transition count 770
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 348 place count 808 transition count 764
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 363 place count 793 transition count 749
Iterating global reduction 4 with 15 rules applied. Total rules applied 378 place count 793 transition count 749
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 386 place count 785 transition count 741
Iterating global reduction 4 with 8 rules applied. Total rules applied 394 place count 785 transition count 741
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 402 place count 777 transition count 733
Iterating global reduction 4 with 8 rules applied. Total rules applied 410 place count 777 transition count 733
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 411 place count 776 transition count 733
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 419 place count 768 transition count 725
Iterating global reduction 5 with 8 rules applied. Total rules applied 427 place count 768 transition count 725
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 428 place count 768 transition count 724
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 434 place count 762 transition count 718
Iterating global reduction 6 with 6 rules applied. Total rules applied 440 place count 762 transition count 718
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 444 place count 758 transition count 714
Iterating global reduction 6 with 4 rules applied. Total rules applied 448 place count 758 transition count 714
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 449 place count 758 transition count 713
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 452 place count 755 transition count 710
Iterating global reduction 7 with 3 rules applied. Total rules applied 455 place count 755 transition count 710
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 457 place count 755 transition count 708
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 458 place count 754 transition count 707
Iterating global reduction 8 with 1 rules applied. Total rules applied 459 place count 754 transition count 707
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 460 place count 754 transition count 706
Applied a total of 460 rules in 379 ms. Remains 754 /976 variables (removed 222) and now considering 706/967 (removed 261) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-919194857075203356.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-817415218186992687.kers'
[2026-05-25 18:59:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-919194857075203356.kers, --Pflows, --basisKERS=/tmp/petrispot-output-817415218186992687.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 706 rows 754 cols 1614 entries
Finished phase 1 with 629 SingleSign rule and 55 generalized
[2026-05-25 18:59:06] [INFO ] Computed 70 invariants in 4 ms
Computed 70 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-817415218186992687.kers
Total runtime 5 ms.
[2026-05-25 18:59:06] [INFO ] Implicit Places using invariants in 302 ms returned [675]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 304 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 753/976 places, 706/967 transitions.
Applied a total of 0 rules in 21 ms. Remains 753 /753 variables (removed 0) and now considering 706/706 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 704 ms. Remains : 753/976 places, 706/967 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((((X(X(p0))||p1) U p2) U (p0&&((p1||X(X(p0))) U p2)))))'
Stuttering acceptance computed with spot in 206 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2), (NOT p0), true]
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-15
Entered a terminal (fully accepting) state of product in 331 steps with 0 reset in 1 ms.
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-15 finished in 945 ms.
All properties solved by simple procedures.
Total runtime 270215 ms.

BK_STOP 1779735547524

--------------------
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="FamilyReunion-PT-L00010M0001C001P001G001"
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 FamilyReunion-PT-L00010M0001C001P001G001, 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 r130-smll-177955808900100"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FamilyReunion-PT-L00010M0001C001P001G001.tgz
mv FamilyReunion-PT-L00010M0001C001P001G001 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;