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-177955808800004.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-COL-L00010M0001C001P001G001, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r130-smll-177955808800004
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 640K
-rw-r--r-- 1 mcc users 9.2K Mar 6 05:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 101K Mar 6 05:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Mar 6 05:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K 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 3.8K Mar 15 09:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 09:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Mar 15 09:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 09:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 6 05:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K Mar 6 05:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 6 05:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Mar 6 05:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Mar 15 09:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Mar 15 09:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 equiv_pt
-rw-r--r-- 1 mcc users 24 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 134K 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-COL-L00010M0001C001P001G001-LTLFireability-00
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-01
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-02
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-03
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-04
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-05
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-06
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-07
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-08
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-09
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-10
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-11
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-12
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-13
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-14
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779611601235

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FamilyReunion-COL-L00010M0001C001P001G001
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202604301425
[2026-05-24 08:33:23] [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-24 08:33:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 08:33:24] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2026-05-24 08:33:25] [WARNING] Using fallBack plugin, rng conformance not checked
[2026-05-24 08:33:25] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1694 ms
[2026-05-24 08:33:25] [INFO ] Detected 5 constant HL places corresponding to 10 PT places.
[2026-05-24 08:33:25] [INFO ] Imported 104 HL places and 66 HL transitions for a total of 1486 PT places and 1245.0 transition bindings in 70 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 26 ms.
Working with output stream class java.io.PrintStream
[2026-05-24 08:33:26] [INFO ] Built PT skeleton of HLPN with 104 places and 66 transitions 198 arcs in 12 ms.
[2026-05-24 08:33:26] [INFO ] Skeletonized 16 HLPN properties in 3 ms.
Initial state reduction rules removed 3 formulas.
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 104 stabilizing places and 66 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 104 transition count 66
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 13 properties that can be checked using skeleton over-approximation.
Reduce places removed 5 places and 0 transitions.
Computed a total of 99 stabilizing places and 66 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 99 transition count 66
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
RANDOM walk for 2820 steps (0 resets) in 204 ms. (13 steps per ms) remains 0/25 properties
[2026-05-24 08:33:26] [INFO ] Flatten gal took : 66 ms
[2026-05-24 08:33:26] [INFO ] Flatten gal took : 21 ms
Transition Gate2ANDJoin forces synchronizations/join behavior on parameter l of sort LegalResident
Symmetric sort wr.t. initial and guards and successors and join/free detected :Response
Symmetric sort wr.t. initial detected :Response
Transition SendClearanceToRel : guard parameter $r(Response:2) in guard (EQ $r 0)introduces in Response(2) partition with 2 elements
Symmetric sort wr.t. initial and guards and successors and join/free detected :CINFORMI
Symmetric sort wr.t. initial detected :CINFORMI
Symmetric sort wr.t. initial and guards detected :CINFORMI
Applying symmetric unfolding of full symmetric sort :CINFORMI domain size was 2
Symmetric sort wr.t. initial and guards and successors and join/free detected :GovernmentCommission
Symmetric sort wr.t. initial detected :GovernmentCommission
Symmetric sort wr.t. initial and guards detected :GovernmentCommission
Applying symmetric unfolding of full symmetric sort :GovernmentCommission domain size was 2
Transition Gate1ANDJoin forces synchronizations/join behavior on parameter p of sort PublicAdminOffice
Transition ReceiveLangChoice forces synchronizations/join behavior on parameter m of sort MICSystem
[2026-05-24 08:33:26] [INFO ] Unfolded HLPN to a Petri net with 1379 places and 1069 transitions 3062 arcs in 95 ms.
[2026-05-24 08:33:26] [INFO ] Unfolded 13 HLPN properties in 1 ms.
[2026-05-24 08:33:26] [INFO ] Reduced 11 identical enabling conditions.
[2026-05-24 08:33:26] [INFO ] Reduced 11 identical enabling conditions.
Deduced a syphon composed of 11 places in 27 ms
Reduce places removed 19 places and 0 transitions.
Support contains 498 out of 1360 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1360/1360 places, 1069/1069 transitions.
Reduce places removed 42 places and 0 transitions.
Discarding 99 places :
Implicit places reduction removed 99 places
Iterating post reduction 0 with 141 rules applied. Total rules applied 141 place count 1219 transition count 1069
Discarding 54 places :
Symmetric choice reduction at 1 with 54 rule applications. Total rules 195 place count 1165 transition count 1015
Iterating global reduction 1 with 54 rules applied. Total rules applied 249 place count 1165 transition count 1015
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 250 place count 1164 transition count 1004
Iterating global reduction 1 with 1 rules applied. Total rules applied 251 place count 1164 transition count 1004
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 1 with 11 rules applied. Total rules applied 262 place count 1153 transition count 1004
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 273 place count 1142 transition count 993
Iterating global reduction 2 with 11 rules applied. Total rules applied 284 place count 1142 transition count 993
Applied a total of 284 rules in 422 ms. Remains 1142 /1360 variables (removed 218) and now considering 993/1069 (removed 76) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8018805819574201778.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10762158973903294252.kers'
[2026-05-24 08:33:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8018805819574201778.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10762158973903294252.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 993 rows 1142 cols 2511 entries
Finished phase 1 with 818 SingleSign rule and 132 generalized
[2026-05-24 08:33:27] [INFO ] Computed 192 invariants in 8 ms
Computed 192 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-10762158973903294252.kers
Total runtime 11 ms.
[2026-05-24 08:33:28] [INFO ] Implicit Places using invariants in 1075 ms returned [110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 231, 597, 598, 599, 600, 601, 602, 603, 604, 605, 606, 607, 743, 744, 745, 746, 747, 748, 749, 750, 751, 752, 753, 831, 832, 833, 834, 835, 836, 837, 838, 839, 840, 841, 1009]
Discarding 46 places :
Implicit Place search using SMT only with invariants took 1127 ms to find 46 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1096/1360 places, 993/1069 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1086 transition count 983
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1086 transition count 983
Applied a total of 20 rules in 76 ms. Remains 1086 /1096 variables (removed 10) and now considering 983/993 (removed 10) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16837324215843550507.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-902536823910404309.kers'
[2026-05-24 08:33:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16837324215843550507.kers, --Pflows, --basisKERS=/tmp/petrispot-output-902536823910404309.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 983 rows 1086 cols 2337 entries
Finished phase 1 with 819 SingleSign rule and 121 generalized
[2026-05-24 08:33:28] [INFO ] Computed 146 invariants in 9 ms
Computed 146 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-902536823910404309.kers
Total runtime 11 ms.
[2026-05-24 08:33:29] [INFO ] Implicit Places using invariants in 477 ms returned []
[2026-05-24 08:33:29] [INFO ] Invariant cache hit.
[2026-05-24 08:33:30] [INFO ] Implicit Places using invariants and state equation in 1746 ms returned []
Implicit Place search using SMT with State Equation took 2233 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1086/1360 places, 983/1069 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3874 ms. Remains : 1086/1360 places, 983/1069 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1086/1086 places, 983/983 transitions.
Applied a total of 0 rules in 22 ms. Remains 1086 /1086 variables (removed 0) and now considering 983/983 (removed 0) transitions.
[2026-05-24 08:33:30] [INFO ] Invariant cache hit.
[2026-05-24 08:33:31] [INFO ] Implicit Places using invariants in 427 ms returned []
[2026-05-24 08:33:31] [INFO ] Invariant cache hit.
[2026-05-24 08:33:33] [INFO ] Implicit Places using invariants and state equation in 2026 ms returned []
Implicit Place search using SMT with State Equation took 2457 ms to find 0 implicit places.
Running 972 sub problems to find dead transitions.
[2026-05-24 08:33:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1075 variables, 142/142 constraints. Problems are: Problem set: 0 solved, 972 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1075/2069 variables, and 142 constraints, problems are : Problem set: 0 solved, 972 unsolved in 30078 ms.
Refiners :[Generalized P Invariants (flows): 142/146 constraints, State Equation: 0/1086 constraints, PredecessorRefiner: 972/972 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 972 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1075 variables, 142/142 constraints. Problems are: Problem set: 0 solved, 972 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1075/2069 variables, and 142 constraints, problems are : Problem set: 0 solved, 972 unsolved in 30059 ms.
Refiners :[Generalized P Invariants (flows): 142/146 constraints, State Equation: 0/1086 constraints, PredecessorRefiner: 0/972 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60530ms problems are : Problem set: 0 solved, 972 unsolved
Search for dead transitions found 0 dead transitions in 60566ms
Finished structural reductions in LTL mode , in 1 iterations and 63084 ms. Remains : 1086/1086 places, 983/983 transitions.
Support contains 498 out of 1086 places after structural reductions.
[2026-05-24 08:34:34] [INFO ] Flatten gal took : 143 ms
[2026-05-24 08:34:34] [INFO ] Flatten gal took : 148 ms
[2026-05-24 08:34:34] [INFO ] Input system was already deterministic with 983 transitions.
RANDOM walk for 2281 steps (0 resets) in 256 ms. (8 steps per ms) remains 0/24 properties
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 1086 stabilizing places and 983 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1086 transition count 983
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 1086 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1086/1086 places, 983/983 transitions.
Graph (complete) has 1354 edges and 1086 vertex of which 739 are kept as prefixes of interest. Removing 347 places using SCC suffix rule.8 ms
Discarding 347 places :
Also discarding 301 output transitions
Drop transitions (Output transitions of discarded places.) removed 301 transitions
Reduce places removed 11 places and 11 transitions.
Discarding 66 places :
Implicit places reduction removed 66 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 462 transitions
Trivial Post-agglo rules discarded 462 transitions
Performed 462 trivial Post agglomeration. Transition count delta: 462
Iterating post reduction 0 with 528 rules applied. Total rules applied 529 place count 662 transition count 209
Reduce places removed 462 places and 0 transitions.
Iterating post reduction 1 with 462 rules applied. Total rules applied 991 place count 200 transition count 209
Performed 88 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 88 Pre rules applied. Total rules applied 991 place count 200 transition count 121
Deduced a syphon composed of 88 places in 0 ms
Ensure Unique test removed 22 places
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 2 with 198 rules applied. Total rules applied 1189 place count 90 transition count 121
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 1201 place count 78 transition count 99
Iterating global reduction 2 with 12 rules applied. Total rules applied 1213 place count 78 transition count 99
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 2 with 33 rules applied. Total rules applied 1246 place count 78 transition count 66
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 1257 place count 67 transition count 66
Reduce places removed 11 places and 11 transitions.
Iterating global reduction 4 with 11 rules applied. Total rules applied 1268 place count 56 transition count 55
Applied a total of 1268 rules in 80 ms. Remains 56 /1086 variables (removed 1030) and now considering 55/983 (removed 928) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2033747322979464494.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18076621270677870745.kers'
[2026-05-24 08:34:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2033747322979464494.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18076621270677870745.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 55 rows 56 cols 110 entries
Finished phase 1 with 44 SingleSign rule and 11 generalized
[2026-05-24 08:34:35] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-18076621270677870745.kers
Total runtime 0 ms.
[2026-05-24 08:34:35] [INFO ] Implicit Places using invariants in 51 ms returned [11]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 52 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 55/1086 places, 55/983 transitions.
Reduce places removed 11 places and 11 transitions.
Applied a total of 0 rules in 2 ms. Remains 44 /55 variables (removed 11) and now considering 44/55 (removed 11) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 135 ms. Remains : 44/1086 places, 44/983 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 411 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-00
Product exploration explored 100000 steps with 2231 reset in 670 ms.
Product exploration explored 100000 steps with 2230 reset in 287 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 35 ms. Proved property starting from automaton with 3 states, 6 edges and 2 AP (stutter insensitive
Knowledge-based reduction took 102 ms.
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-00 finished in 1717 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 44 out of 1086 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1086/1086 places, 983/983 transitions.
Graph (complete) has 1354 edges and 1086 vertex of which 783 are kept as prefixes of interest. Removing 303 places using SCC suffix rule.5 ms
Discarding 303 places :
Also discarding 257 output transitions
Drop transitions (Output transitions of discarded places.) removed 257 transitions
Reduce places removed 11 places and 11 transitions.
Discarding 66 places :
Implicit places reduction removed 66 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 473 transitions
Trivial Post-agglo rules discarded 473 transitions
Performed 473 trivial Post agglomeration. Transition count delta: 473
Iterating post reduction 0 with 539 rules applied. Total rules applied 540 place count 706 transition count 242
Reduce places removed 473 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 1 with 484 rules applied. Total rules applied 1024 place count 233 transition count 231
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 1035 place count 222 transition count 231
Performed 88 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 88 Pre rules applied. Total rules applied 1035 place count 222 transition count 143
Deduced a syphon composed of 88 places in 0 ms
Ensure Unique test removed 22 places
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 3 with 198 rules applied. Total rules applied 1233 place count 112 transition count 143
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1245 place count 100 transition count 121
Iterating global reduction 3 with 12 rules applied. Total rules applied 1257 place count 100 transition count 121
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 3 with 33 rules applied. Total rules applied 1290 place count 100 transition count 88
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 1301 place count 89 transition count 88
Reduce places removed 11 places and 11 transitions.
Iterating global reduction 5 with 11 rules applied. Total rules applied 1312 place count 78 transition count 77
Applied a total of 1312 rules in 48 ms. Remains 78 /1086 variables (removed 1008) and now considering 77/983 (removed 906) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12982617236246133319.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2633626825872087345.kers'
[2026-05-24 08:34:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12982617236246133319.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2633626825872087345.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 77 rows 78 cols 154 entries
Finished phase 1 with 66 SingleSign rule and 11 generalized
[2026-05-24 08:34:36] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2633626825872087345.kers
Total runtime 1 ms.
[2026-05-24 08:34:37] [INFO ] Implicit Places using invariants in 47 ms returned [11]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 54 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 77/1086 places, 77/983 transitions.
Reduce places removed 11 places and 11 transitions.
Applied a total of 0 rules in 2 ms. Remains 66 /77 variables (removed 11) and now considering 66/77 (removed 11) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 105 ms. Remains : 66/1086 places, 66/983 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 120 ms :[(AND p0 (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) p0 (NOT p1))]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-04
Product exploration explored 100000 steps with 13573 reset in 511 ms.
Product exploration explored 100000 steps with 13488 reset in 289 ms.
Computed a total of 66 stabilizing places and 66 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 66 transition count 66
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 247 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 280 steps (1 resets) in 8 ms. (31 steps per ms) remains 0/7 properties
Knowledge based reduction with 15 factoid took 402 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 168 ms :[(AND p0 (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) p0 (NOT p1))]
Knowledge-based reduction took 904 ms.
Stuttering acceptance computed with spot in 170 ms :[(AND p0 (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) p0 (NOT p1))]
Support contains 44 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 66/66 transitions.
Applied a total of 0 rules in 4 ms. Remains 66 /66 variables (removed 0) and now considering 66/66 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1270791925196885191.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10202530121389255537.kers'
[2026-05-24 08:34:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1270791925196885191.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10202530121389255537.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 66 rows 66 cols 121 entries
Finished phase 1 with 66 SingleSign rule and 0 generalized
[2026-05-24 08:34:39] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10202530121389255537.kers
Total runtime 1 ms.
[2026-05-24 08:34:39] [INFO ] Implicit Places using invariants in 57 ms returned []
[2026-05-24 08:34:39] [INFO ] Invariant cache hit.
[2026-05-24 08:34:39] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
[2026-05-24 08:34:39] [INFO ] Redundant transitions in 2 ms returned []
Running 55 sub problems to find dead transitions.
[2026-05-24 08:34:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (OVERLAPS) 66/121 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (OVERLAPS) 11/132 variables, 11/66 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (OVERLAPS) 0/132 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 66 constraints, problems are : Problem set: 0 solved, 55 unsolved in 2553 ms.
Refiners :[State Equation: 66/66 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 55 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (OVERLAPS) 66/121 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 55/110 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (OVERLAPS) 11/132 variables, 11/121 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (OVERLAPS) 0/132 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Int declared 132/132 variables, and 121 constraints, problems are : Problem set: 0 solved, 55 unsolved in 2067 ms.
Refiners :[State Equation: 66/66 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4629ms problems are : Problem set: 0 solved, 55 unsolved
Search for dead transitions found 0 dead transitions in 4631ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 4795 ms. Remains : 66/66 places, 66/66 transitions.
Computed a total of 66 stabilizing places and 66 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 66 transition count 66
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 209 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 392 steps (3 resets) in 10 ms. (35 steps per ms) remains 0/7 properties
Knowledge based reduction with 15 factoid took 391 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 844 ms.
Stuttering acceptance computed with spot in 168 ms :[(AND p0 (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) p0 (NOT p1))]
Stuttering acceptance computed with spot in 167 ms :[(AND p0 (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) p0 (NOT p1))]
Product exploration explored 100000 steps with 13551 reset in 378 ms.
Product exploration explored 100000 steps with 13634 reset in 338 ms.
Built C files in :
/tmp/ltsmin3030664556284463984
[2026-05-24 08:34:45] [INFO ] Computing symmetric may disable matrix : 66 transitions.
[2026-05-24 08:34:45] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 08:34:45] [INFO ] Computing symmetric may enable matrix : 66 transitions.
[2026-05-24 08:34:45] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 08:34:45] [INFO ] Computing Do-Not-Accords matrix : 66 transitions.
[2026-05-24 08:34:45] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 08:34:45] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3030664556284463984
Running compilation step : cd /tmp/ltsmin3030664556284463984;'/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 518 ms.
Running link step : cd /tmp/ltsmin3030664556284463984;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 82 ms.
Running LTSmin : cd /tmp/ltsmin3030664556284463984;'/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/stateBased8346421064030002014.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 44 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 66/66 transitions.
Applied a total of 0 rules in 3 ms. Remains 66 /66 variables (removed 0) and now considering 66/66 (removed 0) transitions.
[2026-05-24 08:35:00] [INFO ] Invariant cache hit.
[2026-05-24 08:35:00] [INFO ] Implicit Places using invariants in 24 ms returned []
[2026-05-24 08:35:00] [INFO ] Invariant cache hit.
[2026-05-24 08:35:00] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
[2026-05-24 08:35:00] [INFO ] Redundant transitions in 1 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 99 ms. Remains : 66/66 places, 66/66 transitions.
Built C files in :
/tmp/ltsmin3269067525935071575
[2026-05-24 08:35:00] [INFO ] Computing symmetric may disable matrix : 66 transitions.
[2026-05-24 08:35:00] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 08:35:00] [INFO ] Computing symmetric may enable matrix : 66 transitions.
[2026-05-24 08:35:00] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 08:35:00] [INFO ] Computing Do-Not-Accords matrix : 66 transitions.
[2026-05-24 08:35:00] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 08:35:00] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3269067525935071575
Running compilation step : cd /tmp/ltsmin3269067525935071575;'/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 206 ms.
Running link step : cd /tmp/ltsmin3269067525935071575;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin3269067525935071575;'/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/stateBased4776287913193228000.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-24 08:35:16] [INFO ] Flatten gal took : 8 ms
[2026-05-24 08:35:16] [INFO ] Flatten gal took : 5 ms
[2026-05-24 08:35:16] [INFO ] Time to serialize gal into /tmp/LTL651684165097841807.gal : 3 ms
[2026-05-24 08:35:16] [INFO ] Time to serialize properties into /tmp/LTL11473504789412126320.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/LTL651684165097841807.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3214441770108805500.hoa' '-atoms' '/tmp/LTL11473504789412126320.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL11473504789412126320.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3214441770108805500.hoa
Reverse transition relation is NOT exact ! Due to transitions t961, t962, t963, t964, t965, t966, t967, t968, t969, t970, t971, Intersection with reachabl...226
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
952 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,9.57143,263748,1,0,4170,1.01952e+06,177,2663,1695,2.4803e+06,8268
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-04 finished in 50832 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 55 out of 1086 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1086/1086 places, 983/983 transitions.
Discarding 66 places :
Implicit places reduction removed 66 places
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 1020 transition count 983
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 90 place count 996 transition count 959
Iterating global reduction 1 with 24 rules applied. Total rules applied 114 place count 996 transition count 959
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 147 place count 963 transition count 926
Iterating global reduction 1 with 33 rules applied. Total rules applied 180 place count 963 transition count 926
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 191 place count 952 transition count 905
Iterating global reduction 1 with 11 rules applied. Total rules applied 202 place count 952 transition count 905
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 223 place count 931 transition count 874
Iterating global reduction 1 with 21 rules applied. Total rules applied 244 place count 931 transition count 874
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 265 place count 910 transition count 853
Iterating global reduction 1 with 21 rules applied. Total rules applied 286 place count 910 transition count 853
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 307 place count 889 transition count 832
Iterating global reduction 1 with 21 rules applied. Total rules applied 328 place count 889 transition count 832
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 349 place count 868 transition count 811
Iterating global reduction 1 with 21 rules applied. Total rules applied 370 place count 868 transition count 811
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 391 place count 847 transition count 790
Iterating global reduction 1 with 21 rules applied. Total rules applied 412 place count 847 transition count 790
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 1 with 1 rules applied. Total rules applied 413 place count 846 transition count 790
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 434 place count 825 transition count 769
Iterating global reduction 2 with 21 rules applied. Total rules applied 455 place count 825 transition count 769
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 476 place count 804 transition count 748
Iterating global reduction 2 with 21 rules applied. Total rules applied 497 place count 804 transition count 748
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 508 place count 793 transition count 737
Iterating global reduction 2 with 11 rules applied. Total rules applied 519 place count 793 transition count 737
Applied a total of 519 rules in 529 ms. Remains 793 /1086 variables (removed 293) and now considering 737/983 (removed 246) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-708355364576471998.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7343706763518382556.kers'
[2026-05-24 08:35:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-708355364576471998.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7343706763518382556.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 737 rows 793 cols 1661 entries
Finished phase 1 with 648 SingleSign rule and 66 generalized
[2026-05-24 08:35:28] [INFO ] Computed 79 invariants in 7 ms
Computed 79 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-7343706763518382556.kers
Total runtime 9 ms.
[2026-05-24 08:35:28] [INFO ] Implicit Places using invariants in 485 ms returned [396]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 489 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 792/1086 places, 737/983 transitions.
Applied a total of 0 rules in 50 ms. Remains 792 /792 variables (removed 0) and now considering 737/737 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1068 ms. Remains : 792/1086 places, 737/983 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 484 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-COL-L00010M0001C001P001G001-LTLFireability-06
Product exploration explored 100000 steps with 18192 reset in 586 ms.
Product exploration explored 100000 steps with 18190 reset in 452 ms.
Computed a total of 792 stabilizing places and 737 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 792 transition count 737
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 120 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 40004 steps (8 resets) in 761 ms. (52 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 228 ms. (174 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-2234845039108498488.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16034061238373952220.kers'
[2026-05-24 08:35:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2234845039108498488.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16034061238373952220.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 737 rows 792 cols 1639 entries
Finished phase 1 with 659 SingleSign rule and 55 generalized
[2026-05-24 08:35:31] [INFO ] Computed 78 invariants in 7 ms
Computed 78 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-16034061238373952220.kers
Total runtime 8 ms.
Excessive predecessor constraint size, skipping predecessor.
Problem apf1 is UNSAT
Problem apf3 is UNSAT
After SMT solving in domain Real declared 55/1529 variables, and 0 constraints, problems are : Problem set: 2 solved, 0 unsolved in 37 ms.
Refiners :[Generalized P Invariants (flows): 0/78 constraints, State Equation: 0/792 constraints, PredecessorRefiner: 0/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 86ms 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 193 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 327 ms :[(NOT p0), (NOT p0), p2, (AND (NOT p0) (NOT p1) p2), p2, true, (AND p2 (NOT p0) (NOT p1))]
[2026-05-24 08:35:32] [INFO ] Invariant cache hit.
[2026-05-24 08:35:33] [INFO ] [Real]Absence check using 0 positive and 78 generalized place invariants in 75 ms returned sat
[2026-05-24 08:35:36] [INFO ] [Real]Absence check using state equation in 3171 ms returned sat
[2026-05-24 08:35:36] [INFO ] Computed and/alt/rep : 724/824/724 causal constraints (skipped 2 transitions) in 60 ms.
[2026-05-24 08:35:42] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 08:35:42] [INFO ] [Nat]Absence check using 0 positive and 78 generalized place invariants in 58 ms returned sat
[2026-05-24 08:35:46] [INFO ] [Nat]Absence check using state equation in 3104 ms returned sat
[2026-05-24 08:35:46] [INFO ] Computed and/alt/rep : 724/824/724 causal constraints (skipped 2 transitions) in 52 ms.
[2026-05-24 08:35:57] [INFO ] Added : 180 causal constraints over 36 iterations in 11146 ms. Result :unknown
Could not prove EG (NOT p0)
Knowledge-based reduction took 26890 ms.
Stuttering acceptance computed with spot in 349 ms :[(NOT p0), (NOT p0), p2, (AND (NOT p0) (NOT p1) p2), p2, true, (AND p2 (NOT p0) (NOT p1))]
Support contains 55 out of 792 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 792/792 places, 737/737 transitions.
Applied a total of 0 rules in 48 ms. Remains 792 /792 variables (removed 0) and now considering 737/737 (removed 0) transitions.
[2026-05-24 08:35:57] [INFO ] Invariant cache hit.
[2026-05-24 08:35:58] [INFO ] Implicit Places using invariants in 448 ms returned []
[2026-05-24 08:35:58] [INFO ] Invariant cache hit.
[2026-05-24 08:35:59] [INFO ] Implicit Places using invariants and state equation in 934 ms returned []
Implicit Place search using SMT with State Equation took 1401 ms to find 0 implicit places.
Running 726 sub problems to find dead transitions.
[2026-05-24 08:35:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/781 variables, 74/74 constraints. Problems are: Problem set: 0 solved, 726 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 781/1529 variables, and 74 constraints, problems are : Problem set: 0 solved, 726 unsolved in 30036 ms.
Refiners :[Generalized P Invariants (flows): 74/78 constraints, State Equation: 0/792 constraints, PredecessorRefiner: 726/726 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 726 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/781 variables, 74/74 constraints. Problems are: Problem set: 0 solved, 726 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 781/1529 variables, and 74 constraints, problems are : Problem set: 0 solved, 726 unsolved in 30035 ms.
Refiners :[Generalized P Invariants (flows): 74/78 constraints, State Equation: 0/792 constraints, PredecessorRefiner: 0/726 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60195ms problems are : Problem set: 0 solved, 726 unsolved
Search for dead transitions found 0 dead transitions in 60202ms
Finished structural reductions in LTL mode , in 1 iterations and 61656 ms. Remains : 792/792 places, 737/737 transitions.
Computed a total of 792 stabilizing places and 737 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 792 transition count 737
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 119 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 1943 steps (0 resets) in 21 ms. (88 steps per ms) remains 0/5 properties
Knowledge based reduction with 11 factoid took 181 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 311 ms :[(NOT p0), (NOT p0), p2, (AND (NOT p0) (NOT p1) p2), p2, true, (AND p2 (NOT p0) (NOT p1))]
[2026-05-24 08:37:00] [INFO ] Invariant cache hit.
[2026-05-24 08:37:01] [INFO ] [Real]Absence check using 0 positive and 78 generalized place invariants in 53 ms returned sat
[2026-05-24 08:37:04] [INFO ] [Real]Absence check using state equation in 3011 ms returned sat
[2026-05-24 08:37:04] [INFO ] Computed and/alt/rep : 724/824/724 causal constraints (skipped 2 transitions) in 72 ms.
[2026-05-24 08:37:09] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 08:37:10] [INFO ] [Nat]Absence check using 0 positive and 78 generalized place invariants in 66 ms returned sat
[2026-05-24 08:37:13] [INFO ] [Nat]Absence check using state equation in 3277 ms returned sat
[2026-05-24 08:37:13] [INFO ] Computed and/alt/rep : 724/824/724 causal constraints (skipped 2 transitions) in 82 ms.
[2026-05-24 08:37:24] [INFO ] Added : 170 causal constraints over 34 iterations in 10817 ms. Result :unknown
Could not prove EG (NOT p0)
Knowledge-based reduction took 25262 ms.
Stuttering acceptance computed with spot in 350 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 344 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 18230 reset in 605 ms.
Product exploration explored 100000 steps with 18138 reset in 696 ms.
Spot run failed in 152 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/ltsmin14374745607708578390
[2026-05-24 08:37:26] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14374745607708578390
Running compilation step : cd /tmp/ltsmin14374745607708578390;'/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 2078 ms.
Running link step : cd /tmp/ltsmin14374745607708578390;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin14374745607708578390;'/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/stateBased6602747591282482578.hoa' '--buchi-type=spotba'
LTSmin run took 654 ms.
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-06 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-06 finished in 121843 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 1086 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1086/1086 places, 983/983 transitions.
Graph (complete) has 1354 edges and 1086 vertex of which 497 are kept as prefixes of interest. Removing 589 places using SCC suffix rule.7 ms
Discarding 589 places :
Also discarding 532 output transitions
Drop transitions (Output transitions of discarded places.) removed 532 transitions
Reduce places removed 11 places and 11 transitions.
Discarding 66 places :
Implicit places reduction removed 66 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 352 transitions
Trivial Post-agglo rules discarded 352 transitions
Performed 352 trivial Post agglomeration. Transition count delta: 352
Iterating post reduction 0 with 418 rules applied. Total rules applied 419 place count 420 transition count 88
Reduce places removed 352 places and 0 transitions.
Iterating post reduction 1 with 352 rules applied. Total rules applied 771 place count 68 transition count 88
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 771 place count 68 transition count 66
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 815 place count 46 transition count 66
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 816 place count 45 transition count 55
Iterating global reduction 2 with 1 rules applied. Total rules applied 817 place count 45 transition count 55
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 828 place count 45 transition count 44
Reduce places removed 11 places and 11 transitions.
Iterating global reduction 3 with 11 rules applied. Total rules applied 839 place count 34 transition count 33
Applied a total of 839 rules in 35 ms. Remains 34 /1086 variables (removed 1052) and now considering 33/983 (removed 950) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11655738903477045356.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15497038323808339663.kers'
[2026-05-24 08:37:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11655738903477045356.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15497038323808339663.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 33 rows 34 cols 66 entries
Finished phase 1 with 22 SingleSign rule and 11 generalized
[2026-05-24 08:37:29] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15497038323808339663.kers
Total runtime 1 ms.
[2026-05-24 08:37:29] [INFO ] Implicit Places using invariants in 63 ms returned [22]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 74 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 33/1086 places, 33/983 transitions.
Reduce places removed 11 places and 11 transitions.
Applied a total of 0 rules in 3 ms. Remains 22 /33 variables (removed 11) and now considering 22/33 (removed 11) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 112 ms. Remains : 22/1086 places, 22/983 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 97 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-07
Product exploration explored 100000 steps with 4883 reset in 179 ms.
Product exploration explored 100000 steps with 4875 reset in 209 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 11 ms. Proved property starting from automaton with 2 states, 3 edges and 1 AP (stutter insensitive
Knowledge-based reduction took 38 ms.
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-07 finished in 675 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)&&F((!p0 U (p1||G(!p0))))))'
Support contains 66 out of 1086 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1086/1086 places, 983/983 transitions.
Graph (complete) has 1354 edges and 1086 vertex of which 860 are kept as prefixes of interest. Removing 226 places using SCC suffix rule.5 ms
Discarding 226 places :
Also discarding 213 output transitions
Drop transitions (Output transitions of discarded places.) removed 213 transitions
Reduce places removed 11 places and 11 transitions.
Discarding 66 places :
Implicit places reduction removed 66 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 495 transitions
Trivial Post-agglo rules discarded 495 transitions
Performed 495 trivial Post agglomeration. Transition count delta: 495
Iterating post reduction 0 with 561 rules applied. Total rules applied 562 place count 783 transition count 264
Reduce places removed 495 places and 0 transitions.
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Iterating post reduction 1 with 517 rules applied. Total rules applied 1079 place count 288 transition count 242
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 1101 place count 266 transition count 242
Performed 77 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 77 Pre rules applied. Total rules applied 1101 place count 266 transition count 165
Deduced a syphon composed of 77 places in 0 ms
Ensure Unique test removed 22 places
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 3 with 176 rules applied. Total rules applied 1277 place count 167 transition count 165
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 1299 place count 167 transition count 143
Reduce places removed 22 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 4 with 33 rules applied. Total rules applied 1332 place count 145 transition count 132
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1333 place count 144 transition count 121
Iterating global reduction 5 with 1 rules applied. Total rules applied 1334 place count 144 transition count 121
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 5 with 11 rules applied. Total rules applied 1345 place count 144 transition count 110
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 1356 place count 133 transition count 110
Applied a total of 1356 rules in 48 ms. Remains 133 /1086 variables (removed 953) and now considering 110/983 (removed 873) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7366736153952813362.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18037602939245225871.kers'
[2026-05-24 08:37:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7366736153952813362.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18037602939245225871.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 110 rows 133 cols 308 entries
Finished phase 1 with 77 SingleSign rule and 22 generalized
[2026-05-24 08:37:30] [INFO ] Computed 34 invariants in 0 ms
Computed 34 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-18037602939245225871.kers
Total runtime 1 ms.
[2026-05-24 08:37:30] [INFO ] Implicit Places using invariants in 83 ms returned [44]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 84 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 132/1086 places, 110/983 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 22 place count 121 transition count 99
Applied a total of 22 rules in 6 ms. Remains 121 /132 variables (removed 11) and now considering 99/110 (removed 11) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1917207535529713126.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7718785156892326485.kers'
[2026-05-24 08:37:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1917207535529713126.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7718785156892326485.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 99 rows 121 cols 286 entries
Finished phase 1 with 77 SingleSign rule and 11 generalized
[2026-05-24 08:37:30] [INFO ] Computed 33 invariants in 0 ms
Computed 33 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7718785156892326485.kers
Total runtime 1 ms.
[2026-05-24 08:37:30] [INFO ] Implicit Places using invariants in 47 ms returned []
[2026-05-24 08:37:30] [INFO ] Invariant cache hit.
[2026-05-24 08:37:30] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 121/1086 places, 99/983 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 305 ms. Remains : 121/1086 places, 99/983 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)&&F((!p0 U (p1||G(!p0))))))'
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (AND p0 (NOT p1))]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-08
Product exploration explored 100000 steps with 50000 reset in 247 ms.
Product exploration explored 100000 steps with 50000 reset in 266 ms.
Computed a total of 121 stabilizing places and 99 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 121 transition count 99
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 8 factoid took 19 ms. Proved property starting from automaton with 3 states, 5 edges and 2 AP (stutter insensitive
Knowledge-based reduction took 95 ms.
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-08 finished in 1055 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((X(X(F(p0)))&&(F(p1)||G(p2)))))'
Support contains 88 out of 1086 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1086/1086 places, 983/983 transitions.
Discarding 55 places :
Implicit places reduction removed 55 places
Iterating post reduction 0 with 55 rules applied. Total rules applied 55 place count 1031 transition count 983
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 68 place count 1018 transition count 970
Iterating global reduction 1 with 13 rules applied. Total rules applied 81 place count 1018 transition count 970
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 103 place count 996 transition count 948
Iterating global reduction 1 with 22 rules applied. Total rules applied 125 place count 996 transition count 948
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 126 place count 995 transition count 937
Iterating global reduction 1 with 1 rules applied. Total rules applied 127 place count 995 transition count 937
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 138 place count 984 transition count 926
Iterating global reduction 1 with 11 rules applied. Total rules applied 149 place count 984 transition count 926
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 160 place count 973 transition count 915
Iterating global reduction 1 with 11 rules applied. Total rules applied 171 place count 973 transition count 915
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 182 place count 962 transition count 904
Iterating global reduction 1 with 11 rules applied. Total rules applied 193 place count 962 transition count 904
Applied a total of 193 rules in 285 ms. Remains 962 /1086 variables (removed 124) and now considering 904/983 (removed 79) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15728694411405838716.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9022518422692934886.kers'
[2026-05-24 08:37:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15728694411405838716.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9022518422692934886.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 904 rows 962 cols 2038 entries
Finished phase 1 with 783 SingleSign rule and 88 generalized
[2026-05-24 08:37:31] [INFO ] Computed 91 invariants in 5 ms
Computed 91 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-9022518422692934886.kers
Total runtime 7 ms.
[2026-05-24 08:37:32] [INFO ] Implicit Places using invariants in 505 ms returned [474, 554]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 507 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 960/1086 places, 904/983 transitions.
Applied a total of 0 rules in 38 ms. Remains 960 /960 variables (removed 0) and now considering 904/904 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 830 ms. Remains : 960/1086 places, 904/983 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((X(X(F(p0)))&&(F(p1)||G(p2)))))'
Stuttering acceptance computed with spot in 324 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-09
Product exploration explored 100000 steps with 323 reset in 662 ms.
Product exploration explored 100000 steps with 328 reset in 434 ms.
Computed a total of 960 stabilizing places and 904 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 960 transition count 904
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 13 factoid took 70 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
RANDOM walk for 3082 steps (1 resets) in 29 ms. (102 steps per ms) remains 0/6 properties
Knowledge based reduction with 13 factoid took 154 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 318 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17923931730348200410.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2062394185177056220.kers'
[2026-05-24 08:37:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17923931730348200410.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2062394185177056220.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 904 rows 960 cols 1994 entries
Finished phase 1 with 805 SingleSign rule and 66 generalized
[2026-05-24 08:37:34] [INFO ] Computed 89 invariants in 4 ms
Computed 89 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-2062394185177056220.kers
Total runtime 6 ms.
[2026-05-24 08:37:36] [INFO ] [Real]Absence check using 0 positive and 89 generalized place invariants in 108 ms returned sat
[2026-05-24 08:37:48] [INFO ] [Real]Absence check using state equation in 12792 ms returned sat
[2026-05-24 08:37:48] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 08:37:49] [INFO ] [Nat]Absence check using 0 positive and 89 generalized place invariants in 81 ms returned sat
[2026-05-24 08:38:03] [INFO ] [Nat]Absence check using state equation in 14030 ms returned unknown
Could not prove EG (NOT p0)
[2026-05-24 08:38:03] [INFO ] Invariant cache hit.
[2026-05-24 08:38:04] [INFO ] [Real]Absence check using 0 positive and 89 generalized place invariants in 53 ms returned sat
[2026-05-24 08:38:18] [INFO ] [Real]Absence check using state equation in 14190 ms returned unknown
Could not prove EG (AND (NOT p1) (NOT p2))
Knowledge-based reduction took 45311 ms.
Stuttering acceptance computed with spot in 258 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 88 out of 960 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 960/960 places, 904/904 transitions.
Applied a total of 0 rules in 43 ms. Remains 960 /960 variables (removed 0) and now considering 904/904 (removed 0) transitions.
[2026-05-24 08:38:19] [INFO ] Invariant cache hit.
[2026-05-24 08:38:19] [INFO ] Implicit Places using invariants in 322 ms returned []
[2026-05-24 08:38:19] [INFO ] Invariant cache hit.
[2026-05-24 08:38:20] [INFO ] Implicit Places using invariants and state equation in 1171 ms returned []
Implicit Place search using SMT with State Equation took 1495 ms to find 0 implicit places.
Running 893 sub problems to find dead transitions.
[2026-05-24 08:38:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/949 variables, 85/85 constraints. Problems are: Problem set: 0 solved, 893 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 949/1864 variables, and 85 constraints, problems are : Problem set: 0 solved, 893 unsolved in 30026 ms.
Refiners :[Generalized P Invariants (flows): 85/89 constraints, State Equation: 0/960 constraints, PredecessorRefiner: 893/893 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 893 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/949 variables, 85/85 constraints. Problems are: Problem set: 0 solved, 893 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/949 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 893 unsolved
SMT process timed out in 60134ms, After SMT, problems are : Problem set: 0 solved, 893 unsolved
Search for dead transitions found 0 dead transitions in 60138ms
Finished structural reductions in LTL mode , in 1 iterations and 61678 ms. Remains : 960/960 places, 904/904 transitions.
Computed a total of 960 stabilizing places and 904 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 960 transition count 904
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 13 factoid took 78 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 2276 steps (0 resets) in 27 ms. (81 steps per ms) remains 0/6 properties
Knowledge based reduction with 13 factoid took 141 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 256 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
[2026-05-24 08:39:21] [INFO ] Invariant cache hit.
[2026-05-24 08:39:22] [INFO ] [Real]Absence check using 0 positive and 89 generalized place invariants in 74 ms returned sat
[2026-05-24 08:39:34] [INFO ] [Real]Absence check using state equation in 12078 ms returned sat
[2026-05-24 08:39:34] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 08:39:35] [INFO ] [Nat]Absence check using 0 positive and 89 generalized place invariants in 86 ms returned sat
[2026-05-24 08:39:49] [INFO ] [Nat]Absence check using state equation in 13989 ms returned unknown
Could not prove EG (NOT p0)
[2026-05-24 08:39:49] [INFO ] Invariant cache hit.
[2026-05-24 08:39:50] [INFO ] [Real]Absence check using 0 positive and 89 generalized place invariants in 56 ms returned sat
[2026-05-24 08:40:04] [INFO ] [Real]Absence check using state equation in 14181 ms returned unknown
Could not prove EG (AND (NOT p1) (NOT p2))
Knowledge-based reduction took 43981 ms.
Stuttering acceptance computed with spot in 263 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 246 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 367 reset in 410 ms.
Product exploration explored 100000 steps with 331 reset in 432 ms.
Spot run failed in 55 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/ltsmin9004600136388129185
[2026-05-24 08:40:06] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9004600136388129185
Running compilation step : cd /tmp/ltsmin9004600136388129185;'/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 2267 ms.
Running link step : cd /tmp/ltsmin9004600136388129185;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin9004600136388129185;'/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/stateBased15414469803244466749.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 88 out of 960 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 960/960 places, 904/904 transitions.
Applied a total of 0 rules in 37 ms. Remains 960 /960 variables (removed 0) and now considering 904/904 (removed 0) transitions.
[2026-05-24 08:40:21] [INFO ] Invariant cache hit.
[2026-05-24 08:40:21] [INFO ] Implicit Places using invariants in 326 ms returned []
[2026-05-24 08:40:21] [INFO ] Invariant cache hit.
[2026-05-24 08:40:22] [INFO ] Implicit Places using invariants and state equation in 1131 ms returned []
Implicit Place search using SMT with State Equation took 1468 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1506 ms. Remains : 960/960 places, 904/904 transitions.
Built C files in :
/tmp/ltsmin9047261734848827587
[2026-05-24 08:40:22] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9047261734848827587
Running compilation step : cd /tmp/ltsmin9047261734848827587;'/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 2192 ms.
Running link step : cd /tmp/ltsmin9047261734848827587;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin9047261734848827587;'/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/stateBased6236242482930308416.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-24 08:40:37] [INFO ] Flatten gal took : 44 ms
[2026-05-24 08:40:37] [INFO ] Flatten gal took : 46 ms
[2026-05-24 08:40:38] [INFO ] Time to serialize gal into /tmp/LTL14418041160790593342.gal : 11 ms
[2026-05-24 08:40:38] [INFO ] Time to serialize properties into /tmp/LTL549658695693595648.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14418041160790593342.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6842037690836686099.hoa' '-atoms' '/tmp/LTL549658695693595648.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL549658695693595648.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6842037690836686099.hoa
Detected timeout of ITS tools.
[2026-05-24 08:40:53] [INFO ] Flatten gal took : 39 ms
[2026-05-24 08:40:53] [INFO ] Flatten gal took : 37 ms
[2026-05-24 08:40:53] [INFO ] Time to serialize gal into /tmp/LTL13916704669624801196.gal : 8 ms
[2026-05-24 08:40:53] [INFO ] Time to serialize properties into /tmp/LTL7743913649064281715.ltl : 7 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/LTL13916704669624801196.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7743913649064281715.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((X(X(F("((((((((l5_9>=1)&&(ml2_9>=1))||((l5_17>=1)&&(ml2_17>=1)))||(((l5_12>=1)&&(ml2_12>=1))||((l5_14>=1)&&(ml2_14>=1))))||((((l...1270
Formula 0 simplified : G(XXG!"((((((((l5_9>=1)&&(ml2_9>=1))||((l5_17>=1)&&(ml2_17>=1)))||(((l5_12>=1)&&(ml2_12>=1))||((l5_14>=1)&&(ml2_14>=1))))||((((l5_20...1256
Detected timeout of ITS tools.
[2026-05-24 08:41:08] [INFO ] Flatten gal took : 30 ms
[2026-05-24 08:41:08] [INFO ] Applying decomposition
[2026-05-24 08:41:08] [INFO ] Flatten gal took : 31 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/graph18112131915835616534.txt' '-o' '/tmp/graph18112131915835616534.bin' '-w' '/tmp/graph18112131915835616534.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph18112131915835616534.bin' '-l' '-1' '-v' '-w' '/tmp/graph18112131915835616534.weights' '-q' '0' '-e' '0.001'
[2026-05-24 08:41:08] [INFO ] Decomposing Gal with order
[2026-05-24 08:41:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 08:41:08] [INFO ] Removed a total of 47 redundant transitions.
[2026-05-24 08:41:08] [INFO ] Flatten gal took : 124 ms
[2026-05-24 08:41:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 9 ms.
[2026-05-24 08:41:08] [INFO ] Time to serialize gal into /tmp/LTL2942092049153912257.gal : 17 ms
[2026-05-24 08:41:08] [INFO ] Time to serialize properties into /tmp/LTL9067517400753502988.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2942092049153912257.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9067517400753502988.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((F((X(X(F("((((((((i21.i1.i1.u169.l5_9>=1)&&(i21.i1.i0.u128.ml2_9>=1))||((i2.u121.l5_17>=1)&&(i2.u132.ml2_17>=1)))||(((i24.i0.i1.u90...2291
Formula 0 simplified : G(XXG!"((((((((i21.i1.i1.u169.l5_9>=1)&&(i21.i1.i0.u128.ml2_9>=1))||((i2.u121.l5_17>=1)&&(i2.u132.ml2_17>=1)))||(((i24.i0.i1.u90.l5_...2277
Detected timeout of ITS tools.
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-09 finished in 232546 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(F((G(!p0)||(!p1&&X((X(!p0)&&(!p1 U (!p2||G(!p1))))))))) U p2)))'
Support contains 24 out of 1086 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1086/1086 places, 983/983 transitions.
Discarding 77 places :
Implicit places reduction removed 77 places
Iterating post reduction 0 with 77 rules applied. Total rules applied 77 place count 1009 transition count 983
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 99 place count 987 transition count 961
Iterating global reduction 1 with 22 rules applied. Total rules applied 121 place count 987 transition count 961
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 143 place count 965 transition count 939
Iterating global reduction 1 with 22 rules applied. Total rules applied 165 place count 965 transition count 939
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 176 place count 954 transition count 918
Iterating global reduction 1 with 11 rules applied. Total rules applied 187 place count 954 transition count 918
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 208 place count 933 transition count 887
Iterating global reduction 1 with 21 rules applied. Total rules applied 229 place count 933 transition count 887
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 250 place count 912 transition count 866
Iterating global reduction 1 with 21 rules applied. Total rules applied 271 place count 912 transition count 866
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 292 place count 891 transition count 845
Iterating global reduction 1 with 21 rules applied. Total rules applied 313 place count 891 transition count 845
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 334 place count 870 transition count 824
Iterating global reduction 1 with 21 rules applied. Total rules applied 355 place count 870 transition count 824
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 376 place count 849 transition count 803
Iterating global reduction 1 with 21 rules applied. Total rules applied 397 place count 849 transition count 803
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 1 with 1 rules applied. Total rules applied 398 place count 848 transition count 803
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 419 place count 827 transition count 782
Iterating global reduction 2 with 21 rules applied. Total rules applied 440 place count 827 transition count 782
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 461 place count 806 transition count 761
Iterating global reduction 2 with 21 rules applied. Total rules applied 482 place count 806 transition count 761
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 493 place count 795 transition count 750
Iterating global reduction 2 with 11 rules applied. Total rules applied 504 place count 795 transition count 750
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 515 place count 784 transition count 739
Iterating global reduction 2 with 11 rules applied. Total rules applied 526 place count 784 transition count 739
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 537 place count 773 transition count 728
Iterating global reduction 2 with 11 rules applied. Total rules applied 548 place count 773 transition count 728
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 559 place count 762 transition count 717
Iterating global reduction 2 with 11 rules applied. Total rules applied 570 place count 762 transition count 717
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 581 place count 751 transition count 706
Iterating global reduction 2 with 11 rules applied. Total rules applied 592 place count 751 transition count 706
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 603 place count 740 transition count 695
Iterating global reduction 2 with 11 rules applied. Total rules applied 614 place count 740 transition count 695
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 625 place count 740 transition count 684
Applied a total of 625 rules in 879 ms. Remains 740 /1086 variables (removed 346) and now considering 684/983 (removed 299) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16999328751801698905.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9638242956297345056.kers'
[2026-05-24 08:41:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16999328751801698905.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9638242956297345056.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 684 rows 740 cols 1542 entries
Finished phase 1 with 617 SingleSign rule and 55 generalized
[2026-05-24 08:41:24] [INFO ] Computed 68 invariants in 8 ms
Computed 68 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-9638242956297345056.kers
Total runtime 11 ms.
[2026-05-24 08:41:25] [INFO ] Implicit Places using invariants in 484 ms returned [330]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 486 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 739/1086 places, 684/983 transitions.
Applied a total of 0 rules in 43 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 1410 ms. Remains : 739/1086 places, 684/983 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(F((G(!p0)||(!p1&&X((X(!p0)&&(!p1 U (!p2||G(!p1))))))))) U p2)))'
Stuttering acceptance computed with spot in 449 ms :[(NOT p2), (NOT p2), p0, p0, p0, p0, p0, (AND p2 p1 p0)]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-10
Product exploration explored 100000 steps with 18168 reset in 639 ms.
Product exploration explored 100000 steps with 18226 reset in 465 ms.
Computed a total of 739 stabilizing places and 684 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 739 transition count 684
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 23 factoid took 102 ms. Reduced automaton from 8 states, 30 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 825 steps (0 resets) in 6 ms. (117 steps per ms) remains 0/1 properties
Knowledge based reduction with 23 factoid took 86 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p2), (NOT p2)]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8092397008923623017.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11426599392561964243.kers'
[2026-05-24 08:41:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8092397008923623017.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11426599392561964243.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 684 rows 739 cols 1520 entries
Finished phase 1 with 628 SingleSign rule and 44 generalized
[2026-05-24 08:41:27] [INFO ] Computed 67 invariants in 5 ms
Computed 67 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-11426599392561964243.kers
Total runtime 6 ms.
[2026-05-24 08:41:28] [INFO ] [Real]Absence check using 0 positive and 67 generalized place invariants in 50 ms returned sat
[2026-05-24 08:41:29] [INFO ] [Real]Absence check using state equation in 938 ms returned sat
[2026-05-24 08:41:29] [INFO ] Computed and/alt/rep : 670/748/670 causal constraints (skipped 3 transitions) in 48 ms.
[2026-05-24 08:41:34] [INFO ] Added : 264 causal constraints over 53 iterations in 5653 ms. Result :sat
Could not prove EG (NOT p2)
Knowledge-based reduction took 7952 ms.
Stuttering acceptance computed with spot in 101 ms :[(NOT p2), (NOT p2)]
Support contains 11 out of 739 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 739/739 places, 684/684 transitions.
Graph (complete) has 836 edges and 739 vertex of which 475 are kept as prefixes of interest. Removing 264 places using SCC suffix rule.9 ms
Discarding 264 places :
Also discarding 220 output transitions
Drop transitions (Output transitions of discarded places.) removed 220 transitions
Reduce places removed 11 places and 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 286 transitions
Trivial Post-agglo rules discarded 286 transitions
Performed 286 trivial Post agglomeration. Transition count delta: 286
Iterating post reduction 0 with 286 rules applied. Total rules applied 287 place count 464 transition count 167
Reduce places removed 286 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 1 with 297 rules applied. Total rules applied 584 place count 178 transition count 156
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 595 place count 167 transition count 156
Performed 77 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 77 Pre rules applied. Total rules applied 595 place count 167 transition count 79
Deduced a syphon composed of 77 places in 0 ms
Ensure Unique test removed 22 places
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 3 with 176 rules applied. Total rules applied 771 place count 68 transition count 79
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 791 place count 48 transition count 59
Iterating global reduction 3 with 20 rules applied. Total rules applied 811 place count 48 transition count 59
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 821 place count 38 transition count 39
Iterating global reduction 3 with 10 rules applied. Total rules applied 831 place count 38 transition count 39
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 833 place count 37 transition count 48
Applied a total of 833 rules in 37 ms. Remains 37 /739 variables (removed 702) and now considering 48/684 (removed 636) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6881286536793840597.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6689118440632865537.kers'
[2026-05-24 08:41:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6881286536793840597.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6689118440632865537.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 48 rows 37 cols 94 entries
Finished phase 1 with 37 SingleSign rule and 0 generalized
[2026-05-24 08:41:35] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6689118440632865537.kers
Total runtime 1 ms.
[2026-05-24 08:41:35] [INFO ] Implicit Places using invariants in 31 ms returned []
[2026-05-24 08:41:35] [INFO ] Invariant cache hit.
[2026-05-24 08:41:35] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
[2026-05-24 08:41:35] [INFO ] Redundant transitions in 1 ms returned []
Running 37 sub problems to find dead transitions.
[2026-05-24 08:41:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (OVERLAPS) 48/74 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 3 (OVERLAPS) 11/85 variables, 11/37 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (OVERLAPS) 0/85 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Real declared 85/85 variables, and 37 constraints, problems are : Problem set: 0 solved, 37 unsolved in 1207 ms.
Refiners :[State Equation: 37/37 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 37 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (OVERLAPS) 48/74 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 37/63 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (OVERLAPS) 11/85 variables, 11/74 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (OVERLAPS) 0/85 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Int declared 85/85 variables, and 74 constraints, problems are : Problem set: 0 solved, 37 unsolved in 1240 ms.
Refiners :[State Equation: 37/37 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2451ms problems are : Problem set: 0 solved, 37 unsolved
Search for dead transitions found 0 dead transitions in 2452ms
Starting structural reductions in SI_LTL mode, iteration 1 : 37/739 places, 48/684 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2607 ms. Remains : 37/739 places, 48/684 transitions.
Computed a total of 37 stabilizing places and 48 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 37 transition count 48
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 3 factoid took 100 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 18 steps (0 resets) in 4 ms. (3 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 113 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[(NOT p2), (NOT p2)]
[2026-05-24 08:41:37] [INFO ] Invariant cache hit.
[2026-05-24 08:41:38] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2026-05-24 08:41:38] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 08:41:38] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2026-05-24 08:41:38] [INFO ] Computed and/alt/rep : 35/35/35 causal constraints (skipped 2 transitions) in 5 ms.
[2026-05-24 08:41:38] [INFO ] Added : 0 causal constraints over 0 iterations in 15 ms. Result :sat
Could not prove EG (NOT p2)
Knowledge-based reduction took 573 ms.
Stuttering acceptance computed with spot in 101 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 100 ms :[(NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 17028 reset in 257 ms.
Product exploration explored 100000 steps with 17077 reset in 298 ms.
Built C files in :
/tmp/ltsmin16370419051839806134
[2026-05-24 08:41:38] [INFO ] Computing symmetric may disable matrix : 48 transitions.
[2026-05-24 08:41:38] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 08:41:38] [INFO ] Computing symmetric may enable matrix : 48 transitions.
[2026-05-24 08:41:38] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 08:41:38] [INFO ] Computing Do-Not-Accords matrix : 48 transitions.
[2026-05-24 08:41:38] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 08:41:38] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16370419051839806134
Running compilation step : cd /tmp/ltsmin16370419051839806134;'/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 256 ms.
Running link step : cd /tmp/ltsmin16370419051839806134;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin16370419051839806134;'/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/stateBased9265971368840103056.hoa' '--buchi-type=spotba'
LTSmin run took 31 ms.
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-10 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-10 finished in 15459 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||F(p1)||G(p2))))'
Support contains 110 out of 1086 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1086/1086 places, 983/983 transitions.
Discarding 33 places :
Implicit places reduction removed 33 places
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 1053 transition count 983
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 57 place count 1029 transition count 959
Iterating global reduction 1 with 24 rules applied. Total rules applied 81 place count 1029 transition count 959
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 103 place count 1007 transition count 937
Iterating global reduction 1 with 22 rules applied. Total rules applied 125 place count 1007 transition count 937
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 136 place count 996 transition count 916
Iterating global reduction 1 with 11 rules applied. Total rules applied 147 place count 996 transition count 916
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 168 place count 975 transition count 885
Iterating global reduction 1 with 21 rules applied. Total rules applied 189 place count 975 transition count 885
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 210 place count 954 transition count 864
Iterating global reduction 1 with 21 rules applied. Total rules applied 231 place count 954 transition count 864
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 252 place count 933 transition count 843
Iterating global reduction 1 with 21 rules applied. Total rules applied 273 place count 933 transition count 843
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 294 place count 912 transition count 822
Iterating global reduction 1 with 21 rules applied. Total rules applied 315 place count 912 transition count 822
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 336 place count 891 transition count 801
Iterating global reduction 1 with 21 rules applied. Total rules applied 357 place count 891 transition count 801
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 1 with 1 rules applied. Total rules applied 358 place count 890 transition count 801
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 368 place count 880 transition count 791
Iterating global reduction 2 with 10 rules applied. Total rules applied 378 place count 880 transition count 791
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 388 place count 870 transition count 781
Iterating global reduction 2 with 10 rules applied. Total rules applied 398 place count 870 transition count 781
Applied a total of 398 rules in 506 ms. Remains 870 /1086 variables (removed 216) and now considering 781/983 (removed 202) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17973052168495673095.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5287122066605600093.kers'
[2026-05-24 08:41:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17973052168495673095.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5287122066605600093.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 781 rows 870 cols 1826 entries
Finished phase 1 with 659 SingleSign rule and 99 generalized
[2026-05-24 08:41:39] [INFO ] Computed 112 invariants in 5 ms
Computed 112 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-5287122066605600093.kers
Total runtime 6 ms.
[2026-05-24 08:41:40] [INFO ] Implicit Places using invariants in 360 ms returned [462]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 361 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 869/1086 places, 781/983 transitions.
Applied a total of 0 rules in 29 ms. Remains 869 /869 variables (removed 0) and now considering 781/781 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 897 ms. Remains : 869/1086 places, 781/983 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)||G(p1)||p2)))'
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-11
Product exploration explored 100000 steps with 50000 reset in 424 ms.
Product exploration explored 100000 steps with 50000 reset in 445 ms.
Computed a total of 869 stabilizing places and 781 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 869 transition count 781
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 13 factoid took 12 ms. Proved property starting from automaton with 4 states, 6 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 324 ms.
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-11 finished in 2276 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))'
Support contains 12 out of 1086 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1086/1086 places, 983/983 transitions.
Graph (complete) has 1354 edges and 1086 vertex of which 1038 are kept as prefixes of interest. Removing 48 places using SCC suffix rule.3 ms
Discarding 48 places :
Also discarding 59 output transitions
Drop transitions (Output transitions of discarded places.) removed 59 transitions
Reduce places removed 11 places and 11 transitions.
Discarding 77 places :
Implicit places reduction removed 77 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 605 transitions
Trivial Post-agglo rules discarded 605 transitions
Performed 605 trivial Post agglomeration. Transition count delta: 605
Iterating post reduction 0 with 682 rules applied. Total rules applied 683 place count 950 transition count 308
Reduce places removed 605 places and 0 transitions.
Iterating post reduction 1 with 605 rules applied. Total rules applied 1288 place count 345 transition count 308
Performed 165 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 165 Pre rules applied. Total rules applied 1288 place count 345 transition count 143
Deduced a syphon composed of 165 places in 0 ms
Ensure Unique test removed 66 places
Reduce places removed 231 places and 0 transitions.
Iterating global reduction 2 with 396 rules applied. Total rules applied 1684 place count 114 transition count 143
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 2 with 22 rules applied. Total rules applied 1706 place count 114 transition count 121
Reduce places removed 22 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 3 with 44 rules applied. Total rules applied 1750 place count 92 transition count 99
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 1761 place count 81 transition count 99
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 11 Pre rules applied. Total rules applied 1761 place count 81 transition count 88
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 1783 place count 70 transition count 88
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1784 place count 69 transition count 77
Iterating global reduction 5 with 1 rules applied. Total rules applied 1785 place count 69 transition count 77
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 1796 place count 69 transition count 66
Reduce places removed 11 places and 11 transitions.
Iterating global reduction 6 with 11 rules applied. Total rules applied 1807 place count 58 transition count 55
Applied a total of 1807 rules in 33 ms. Remains 58 /1086 variables (removed 1028) and now considering 55/983 (removed 928) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13693136116093324580.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8258875403117007611.kers'
[2026-05-24 08:41:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13693136116093324580.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8258875403117007611.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 55 rows 58 cols 143 entries
Finished phase 1 with 33 SingleSign rule and 22 generalized
[2026-05-24 08:41:41] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8258875403117007611.kers
Total runtime 0 ms.
[2026-05-24 08:41:41] [INFO ] Implicit Places using invariants in 50 ms returned [46]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 61 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 57/1086 places, 55/983 transitions.
Reduce places removed 11 places and 11 transitions.
Applied a total of 0 rules in 1 ms. Remains 46 /57 variables (removed 11) and now considering 44/55 (removed 11) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 95 ms. Remains : 46/1086 places, 44/983 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))'
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-12
Product exploration explored 100000 steps with 18195 reset in 162 ms.
Product exploration explored 100000 steps with 18225 reset in 177 ms.
Computed a total of 46 stabilizing places and 44 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 46 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)...)
Knowledge based reduction with 4 factoid took 47 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
RANDOM walk for 19 steps (0 resets) in 4 ms. (3 steps per ms) remains 0/1 properties
Knowledge based reduction with 4 factoid took 57 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16721104955849428424.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8557936063798897977.kers'
[2026-05-24 08:41:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16721104955849428424.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8557936063798897977.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 44 rows 46 cols 110 entries
Finished phase 1 with 22 SingleSign rule and 22 generalized
[2026-05-24 08:41:42] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8557936063798897977.kers
Total runtime 1 ms.
[2026-05-24 08:41:42] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-24 08:41:42] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2026-05-24 08:41:42] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 08:41:42] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-24 08:41:42] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2026-05-24 08:41:42] [INFO ] Computed and/alt/rep : 22/22/22 causal constraints (skipped 11 transitions) in 3 ms.
[2026-05-24 08:41:42] [INFO ] Added : 2 causal constraints over 1 iterations in 19 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 419 ms.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Support contains 12 out of 46 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 46/46 places, 44/44 transitions.
Applied a total of 0 rules in 1 ms. Remains 46 /46 variables (removed 0) and now considering 44/44 (removed 0) transitions.
[2026-05-24 08:41:42] [INFO ] Invariant cache hit.
[2026-05-24 08:41:42] [INFO ] Implicit Places using invariants in 33 ms returned []
[2026-05-24 08:41:42] [INFO ] Invariant cache hit.
[2026-05-24 08:41:42] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
[2026-05-24 08:41:42] [INFO ] Redundant transitions in 1 ms returned []
Running 33 sub problems to find dead transitions.
[2026-05-24 08:41:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (OVERLAPS) 44/78 variables, 34/35 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (OVERLAPS) 12/90 variables, 12/47 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (OVERLAPS) 0/90 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Real declared 90/90 variables, and 48 constraints, problems are : Problem set: 0 solved, 33 unsolved in 860 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 46/46 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/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (OVERLAPS) 44/78 variables, 34/35 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 33/68 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (OVERLAPS) 12/90 variables, 12/80 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/90 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (OVERLAPS) 0/90 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Int declared 90/90 variables, and 81 constraints, problems are : Problem set: 0 solved, 33 unsolved in 1200 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 46/46 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2065ms problems are : Problem set: 0 solved, 33 unsolved
Search for dead transitions found 0 dead transitions in 2065ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2165 ms. Remains : 46/46 places, 44/44 transitions.
Computed a total of 46 stabilizing places and 44 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 46 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)...)
Knowledge based reduction with 4 factoid took 45 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
RANDOM walk for 18 steps (0 resets) in 4 ms. (3 steps per ms) remains 0/1 properties
Knowledge based reduction with 4 factoid took 54 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
[2026-05-24 08:41:44] [INFO ] Invariant cache hit.
[2026-05-24 08:41:44] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-24 08:41:44] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2026-05-24 08:41:44] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 08:41:45] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-24 08:41:45] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2026-05-24 08:41:45] [INFO ] Computed and/alt/rep : 22/22/22 causal constraints (skipped 11 transitions) in 3 ms.
[2026-05-24 08:41:45] [INFO ] Added : 2 causal constraints over 1 iterations in 15 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 388 ms.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Product exploration explored 100000 steps with 18234 reset in 150 ms.
Product exploration explored 100000 steps with 18222 reset in 169 ms.
Built C files in :
/tmp/ltsmin15495950689707141491
[2026-05-24 08:41:45] [INFO ] Computing symmetric may disable matrix : 44 transitions.
[2026-05-24 08:41:45] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 08:41:45] [INFO ] Computing symmetric may enable matrix : 44 transitions.
[2026-05-24 08:41:45] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 08:41:45] [INFO ] Computing Do-Not-Accords matrix : 44 transitions.
[2026-05-24 08:41:45] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 08:41:45] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15495950689707141491
Running compilation step : cd /tmp/ltsmin15495950689707141491;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 159 ms.
Running link step : cd /tmp/ltsmin15495950689707141491;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin15495950689707141491;'/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/stateBased6226847288991423371.hoa' '--buchi-type=spotba'
LTSmin run took 23 ms.
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-12 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-12 finished in 4147 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 11 out of 1086 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1086/1086 places, 983/983 transitions.
Graph (complete) has 1354 edges and 1086 vertex of which 981 are kept as prefixes of interest. Removing 105 places using SCC suffix rule.2 ms
Discarding 105 places :
Also discarding 114 output transitions
Drop transitions (Output transitions of discarded places.) removed 114 transitions
Reduce places removed 11 places and 11 transitions.
Discarding 77 places :
Implicit places reduction removed 77 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 594 transitions
Trivial Post-agglo rules discarded 594 transitions
Performed 594 trivial Post agglomeration. Transition count delta: 594
Iterating post reduction 0 with 671 rules applied. Total rules applied 672 place count 893 transition count 264
Reduce places removed 594 places and 0 transitions.
Iterating post reduction 1 with 594 rules applied. Total rules applied 1266 place count 299 transition count 264
Performed 143 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 143 Pre rules applied. Total rules applied 1266 place count 299 transition count 121
Deduced a syphon composed of 143 places in 0 ms
Ensure Unique test removed 66 places
Reduce places removed 209 places and 0 transitions.
Iterating global reduction 2 with 352 rules applied. Total rules applied 1618 place count 90 transition count 121
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 2 with 22 rules applied. Total rules applied 1640 place count 90 transition count 99
Reduce places removed 22 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 3 with 44 rules applied. Total rules applied 1684 place count 68 transition count 77
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 1695 place count 57 transition count 77
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 11 Pre rules applied. Total rules applied 1695 place count 57 transition count 66
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 1717 place count 46 transition count 66
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1718 place count 45 transition count 55
Iterating global reduction 5 with 1 rules applied. Total rules applied 1719 place count 45 transition count 55
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 1730 place count 45 transition count 44
Reduce places removed 11 places and 11 transitions.
Iterating global reduction 6 with 11 rules applied. Total rules applied 1741 place count 34 transition count 33
Applied a total of 1741 rules in 24 ms. Remains 34 /1086 variables (removed 1052) and now considering 33/983 (removed 950) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2518578768382964873.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11132645430334053269.kers'
[2026-05-24 08:41:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2518578768382964873.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11132645430334053269.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 33 rows 34 cols 66 entries
Finished phase 1 with 22 SingleSign rule and 11 generalized
[2026-05-24 08:41:45] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11132645430334053269.kers
Total runtime 1 ms.
[2026-05-24 08:41:45] [INFO ] Implicit Places using invariants in 35 ms returned [22]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 36 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 33/1086 places, 33/983 transitions.
Reduce places removed 11 places and 11 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /33 variables (removed 11) and now considering 22/33 (removed 11) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 62 ms. Remains : 22/1086 places, 22/983 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-13
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 0 ms.
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-13 finished in 123 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((F(p0)&&X(X(X(F(!p1))))))))'
Support contains 33 out of 1086 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1086/1086 places, 983/983 transitions.
Discarding 77 places :
Implicit places reduction removed 77 places
Iterating post reduction 0 with 77 rules applied. Total rules applied 77 place count 1009 transition count 983
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 90 place count 996 transition count 970
Iterating global reduction 1 with 13 rules applied. Total rules applied 103 place count 996 transition count 970
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 125 place count 974 transition count 948
Iterating global reduction 1 with 22 rules applied. Total rules applied 147 place count 974 transition count 948
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 157 place count 964 transition count 938
Iterating global reduction 1 with 10 rules applied. Total rules applied 167 place count 964 transition count 938
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 177 place count 954 transition count 918
Iterating global reduction 1 with 10 rules applied. Total rules applied 187 place count 954 transition count 918
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 197 place count 944 transition count 908
Iterating global reduction 1 with 10 rules applied. Total rules applied 207 place count 944 transition count 908
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 217 place count 934 transition count 898
Iterating global reduction 1 with 10 rules applied. Total rules applied 227 place count 934 transition count 898
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 237 place count 924 transition count 888
Iterating global reduction 1 with 10 rules applied. Total rules applied 247 place count 924 transition count 888
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 257 place count 914 transition count 878
Iterating global reduction 1 with 10 rules applied. Total rules applied 267 place count 914 transition count 878
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 1 with 1 rules applied. Total rules applied 268 place count 913 transition count 878
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 278 place count 903 transition count 868
Iterating global reduction 2 with 10 rules applied. Total rules applied 288 place count 903 transition count 868
Applied a total of 288 rules in 397 ms. Remains 903 /1086 variables (removed 183) and now considering 868/983 (removed 115) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12446863019132487085.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17521958293029310925.kers'
[2026-05-24 08:41:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12446863019132487085.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17521958293029310925.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 868 rows 903 cols 1923 entries
Finished phase 1 with 780 SingleSign rule and 55 generalized
[2026-05-24 08:41:46] [INFO ] Computed 68 invariants in 5 ms
Computed 68 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-17521958293029310925.kers
Total runtime 6 ms.
[2026-05-24 08:41:46] [INFO ] Implicit Places using invariants in 316 ms returned []
[2026-05-24 08:41:46] [INFO ] Invariant cache hit.
[2026-05-24 08:41:47] [INFO ] Implicit Places using invariants and state equation in 1295 ms returned []
Implicit Place search using SMT with State Equation took 1613 ms to find 0 implicit places.
Running 857 sub problems to find dead transitions.
[2026-05-24 08:41:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/892 variables, 64/64 constraints. Problems are: Problem set: 0 solved, 857 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 892/1771 variables, and 64 constraints, problems are : Problem set: 0 solved, 857 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 64/68 constraints, State Equation: 0/903 constraints, PredecessorRefiner: 857/857 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 857 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/892 variables, 64/64 constraints. Problems are: Problem set: 0 solved, 857 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/892 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 857 unsolved
At refinement iteration 2 (OVERLAPS) 11/903 variables, 4/68 constraints. Problems are: Problem set: 0 solved, 857 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 903/1771 variables, and 68 constraints, problems are : Problem set: 0 solved, 857 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 68/68 constraints, State Equation: 0/903 constraints, PredecessorRefiner: 0/857 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60130ms problems are : Problem set: 0 solved, 857 unsolved
Search for dead transitions found 0 dead transitions in 60133ms
Starting structural reductions in LTL mode, iteration 1 : 903/1086 places, 868/983 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62147 ms. Remains : 903/1086 places, 868/983 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((F(p0)&&X(X(X(F(p1))))))))'
Stuttering acceptance computed with spot in 247 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-15
Product exploration explored 100000 steps with 16666 reset in 232 ms.
Product exploration explored 100000 steps with 16666 reset in 256 ms.
Computed a total of 903 stabilizing places and 868 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 903 transition count 868
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 4 factoid took 15 ms. Proved property starting from automaton with 7 states, 8 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 325 ms.
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-15 finished in 63245 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((X(X(F(p0)))&&(F(p1)||G(p2)))))'
Spot run failed in 57 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
[2026-05-24 08:42:49] [INFO ] Flatten gal took : 28 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12913978224034973986
[2026-05-24 08:42:49] [INFO ] Computing symmetric may disable matrix : 983 transitions.
[2026-05-24 08:42:49] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 08:42:49] [INFO ] Computing symmetric may enable matrix : 983 transitions.
[2026-05-24 08:42:49] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 08:42:49] [INFO ] Applying decomposition
[2026-05-24 08:42:49] [INFO ] Flatten gal took : 27 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/graph8727415933215921963.txt' '-o' '/tmp/graph8727415933215921963.bin' '-w' '/tmp/graph8727415933215921963.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8727415933215921963.bin' '-l' '-1' '-v' '-w' '/tmp/graph8727415933215921963.weights' '-q' '0' '-e' '0.001'
[2026-05-24 08:42:49] [INFO ] Decomposing Gal with order
[2026-05-24 08:42:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 08:42:49] [INFO ] Computing Do-Not-Accords matrix : 983 transitions.
[2026-05-24 08:42:49] [INFO ] Removed a total of 128 redundant transitions.
[2026-05-24 08:42:49] [INFO ] Flatten gal took : 68 ms
[2026-05-24 08:42:49] [INFO ] Computation of Completed DNA matrix. took 51 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 08:42:49] [INFO ] Built C files in 293ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12913978224034973986
Running compilation step : cd /tmp/ltsmin12913978224034973986;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2026-05-24 08:42:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 16 ms.
[2026-05-24 08:42:49] [INFO ] Time to serialize gal into /tmp/LTLFireability10763364472785893131.gal : 13 ms
[2026-05-24 08:42:49] [INFO ] Time to serialize properties into /tmp/LTLFireability6264126065352674079.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability10763364472785893131.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability6264126065352674079.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...277
Read 1 LTL properties
Checking formula 0 : !((F((X(X(F("((((((((i0.u113.l5_9>=1)&&(i0.u135.ml2_9>=1))||((i8.u116.l5_17>=1)&&(i8.u156.ml2_17>=1)))||(((i7.u95.l5_12>=1)&&(i7.u153....2191
Formula 0 simplified : G(XXG!"((((((((i0.u113.l5_9>=1)&&(i0.u135.ml2_9>=1))||((i8.u116.l5_17>=1)&&(i8.u156.ml2_17>=1)))||(((i7.u95.l5_12>=1)&&(i7.u153.ml2_...2177
Compilation finished in 4675 ms.
Running link step : cd /tmp/ltsmin12913978224034973986;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 64 ms.
Running LTSmin : cd /tmp/ltsmin12913978224034973986;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '<>((X(X(<>((LTLAPp0==true))))&&(<>((LTLAPp1==true))||[]((LTLAPp2==true)))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2026-05-24 09:06:01] [INFO ] Applying decomposition
[2026-05-24 09:06:01] [INFO ] Flatten gal took : 413 ms
[2026-05-24 09:06:01] [INFO ] Decomposing Gal with order
[2026-05-24 09:06:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 09:06:02] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.lang.RuntimeException: Could not find partition element corresponding to g0 in partition [gl1_0, l37_0, l39_0],[gl1_1, l37_1],[gl1_2, l37_2, l39_2],[gl1_4, l37_4, l39_4],[gl1_6, l37_6, l39_6],[gl1_8, l37_8, l39_8],[gl1_10, l37_10, l39_10],[gl1_12, l37_12, l39_12],[gl1_14, l37_14, l39_14],[gl1_16, l37_16, l39_16],[gl1_18, l37_18, l39_18],[gl1_20, l37_20, l39_20],[lm0_0, l12_0, l0_0, l30_0, l31_0, lc1_0, l32_0, lc2_0, l33_0, lc3_0, cg0_0, l35_0, lg0_0, l8_0, l9_0, lm4_0, l11_0, l13_0, l14_0, l15_0, l17_0, lp0_0, l19_0, lp1_0, l21_0, l22_0, l24_0, l25_0, l23_0, l28_0, l26_0, l27_0, l29_0],[lm0_1, l12_1, l0_1, l30_1, l31_1, lc1_1, l32_1, lc2_1, l33_1, lc3_1, cg0_1, l35_1, lg0_1, l8_1, l9_1, lm4_1, l11_1, l13_1, l14_1, l15_1, l17_1, lp0_1, l19_1, lp1_1, l21_1, l22_1, l24_1, l25_1, l23_1, l28_1, l26_1, l27_1, l29_1],[lm0_2, l12_2, l0_2, l30_2, l31_2, lc1_2, l32_2, lc2_2, l33_2, lc3_2, cg0_2, l35_2, lg0_2, l8_2, l9_2, lm4_2, l11_2, l13_2, l14_2, l15_2, l17_2, lp0_2, l19_2, lp1_2, l21_2, l22_2, l24_2, l25_2, l23_2, l28_2, l26_2, l27_2, l29_2],[lm0_3, l12_3, l0_3, l30_3, l31_3, lc1_3, l32_3, lc2_3, l33_3, lc3_3, cg0_3, l35_3, lg0_3, l8_3, l9_3, lm4_3, l11_3, l13_3, l14_3, l15_3, l17_3, lp0_3, l19_3, lp1_3, l21_3, l22_3, l24_3, l25_3, l23_3, l28_3, l26_3, l27_3, l29_3],[lm0_4, l12_4, l0_4, l30_4, l31_4, lc1_4, l32_4, lc2_4, l33_4, lc3_4, cg0_4, l35_4, lg0_4, l8_4, l9_4, lm4_4, l11_4, l13_4, l14_4, l15_4, l17_4, lp0_4, l19_4, lp1_4, l21_4, l22_4, l24_4, l25_4, l23_4, l28_4, l26_4, l27_4, l29_4],[lm0_5, l12_5, l0_5, l30_5, l31_5, lc1_5, l32_5, lc2_5, l33_5, lc3_5, cg0_5, l35_5, lg0_5, l8_5, l9_5, lm4_5, l11_5, l13_5, l14_5, l15_5, l17_5, lp0_5, l19_5, lp1_5, l21_5, l22_5, l24_5, l25_5, l23_5, l28_5, l26_5, l27_5, l29_5],[lm0_6, l12_6, l0_6, l30_6, l31_6, lc1_6, l32_6, lc2_6, l33_6, lc3_6, cg0_6, l35_6, lg0_6, l8_6, l9_6, lm4_6, l11_6, l13_6, l14_6, l15_6, l17_6, lp0_6, l19_6, lp1_6, l21_6, l22_6, l24_6, l25_6, l23_6, l28_6, l26_6, l27_6, l29_6],[lm0_7, l12_7, l0_7, l30_7, l31_7, lc1_7, l32_7, lc2_7, l33_7, lc3_7, cg0_7, l35_7, lg0_7, l8_7, l9_7, lm4_7, l11_7, l13_7, l14_7, l15_7, l17_7, lp0_7, l19_7, lp1_7, l21_7, l22_7, l24_7, l25_7, l23_7, l28_7, l26_7, l27_7, l29_7],[lm0_8, l12_8, l0_8, l30_8, l31_8, lc1_8, l32_8, lc2_8, l33_8, lc3_8, cg0_8, l35_8, lg0_8, l8_8, l9_8, lm4_8, l11_8, l13_8, l14_8, l15_8, l17_8, lp0_8, l19_8, lp1_8, l21_8, l22_8, l24_8, l25_8, l23_8, l28_8, l26_8, l27_8, l29_8],[lm0_9, l12_9, l0_9, l30_9, l31_9, lc1_9, l32_9, lc2_9, l33_9, lc3_9, cg0_9, l35_9, lg0_9, l8_9, l9_9, lm4_9, l11_9, l13_9, l14_9, l15_9, l17_9, lp0_9, l19_9, lp1_9, l21_9, l22_9, l24_9, l25_9, l23_9, l28_9, l26_9, l27_9, l29_9],[lm0_10, l12_10, l0_10, l30_10, l31_10, lc1_10, l32_10, lc2_10, l33_10, lc3_10, cg0_10, l35_10, lg0_10, l8_10, l9_10, lm4_10, l11_10, l13_10, l14_10, l15_10, l17_10, lp0_10, l19_10, lp1_10, l21_10, l22_10, l24_10, l25_10, l23_10, l28_10, l26_10, l27_10, l29_10],[p7_0],[p7_1],[g1_0, gl0_0, g3_0],[g1_1, gl0_1, g3_1],[g1_2, gl0_2, g3_2],[g1_3, gl0_3, g3_3],[g1_4, gl0_4, g3_4],[g1_5, gl0_5, g3_5],[g1_6, gl0_6, g3_6],[g1_7, gl0_7, g3_7],[g1_8, gl0_8, g3_8],[g1_9, gl0_9, g3_9],[g1_10, gl0_10, g3_10],[m8_0],[m8_1],[p1_0, p3_0, p2_0, p5_0, p4_0, p6_0, p9_0, pl0_0, pl1_0],[p1_1, p3_1, p2_1, p5_1, p4_1, p6_1],[p1_2, p3_2, p2_2, p5_2, p4_2, p6_2, p9_2, pl0_2, pl1_2],[p1_3, p3_3, p2_3, p5_3, p4_3, p6_3],[p1_4, p3_4, p2_4, p5_4, p4_4, p6_4, p9_4, pl0_4, pl1_4],[p1_5, p3_5, p2_5, p5_5, p4_5, p6_5],[p1_6, p3_6, p2_6, p5_6, p4_6, p6_6, p9_6, pl0_6, pl1_6],[p1_7, p3_7, p2_7, p5_7, p4_7, p6_7],[p1_8, p3_8, p2_8, p5_8, p4_8, p6_8, p9_8, pl0_8, pl1_8],[p1_9, p3_9, p2_9, p5_9, p4_9, p6_9],[p1_10, p3_10, p2_10, p5_10, p4_10, p6_10, p9_10, pl0_10, pl1_10],[p1_11, p3_11, p2_11, p5_11, p4_11, p6_11],[p1_12, p3_12, p2_12, p5_12, p4_12, p6_12, p9_12, pl0_12, pl1_12],[p1_13, p3_13, p2_13, p5_13, p4_13, p6_13],[p1_14, p3_14, p2_14, p5_14, p4_14, p6_14, p9_14, pl0_14, pl1_14],[p1_15, p3_15, p2_15, p5_15, p4_15, p6_15],[p1_16, p3_16, p2_16, p5_16, p4_16, p6_16, p9_16, pl0_16, pl1_16],[p1_17, p3_17, p2_17, p5_17, p4_17, p6_17],[p1_18, p3_18, p2_18, p5_18, p4_18, p6_18, p9_18, pl0_18, pl1_18],[p1_19, p3_19, p2_19, p5_19, p4_19, p6_19],[p1_20, p3_20, p2_20, p5_20, p4_20, p6_20, p9_20, pl0_20, pl1_20],[p1_21, p3_21, p2_21, p5_21, p4_21, p6_21],[m1_0, ml0_0, l2_0, m2_0, lm1_0, m3_0, ml1_0, l4_0, lm2_0, m4_0, m5_0, l5_0, ml2_0, l6_0, lm3_0, m7_0, ml3_0, m9_0, m10_0, ml4_0],[m1_1, ml0_1, l2_1, m2_1, lm1_1, m3_1, ml1_1, l4_1, lm2_1, m4_1, m5_1, l5_1, ml2_1, l6_1, lm3_1, m7_1, m9_1, m10_1],[m1_2, ml0_2, l2_2, m2_2, lm1_2, m3_2, ml1_2, l4_2, lm2_2, m4_2, m5_2, l5_2, ml2_2, l6_2, lm3_2, m7_2, ml3_2, m9_2, m10_2, ml4_2],[m1_3, ml0_3, l2_3, m2_3, lm1_3, m3_3, ml1_3, l4_3, lm2_3, m4_3, m5_3, l5_3, ml2_3, l6_3, lm3_3, m7_3, m9_3, m10_3],[m1_4, ml0_4, l2_4, m2_4, lm1_4, m3_4, ml1_4, l4_4, lm2_4, m4_4, m5_4, l5_4, ml2_4, l6_4, lm3_4, m7_4, ml3_4, m9_4, m10_4, ml4_4],[m1_5, ml0_5, l2_5, m2_5, lm1_5, m3_5, ml1_5, l4_5, lm2_5, m4_5, m5_5, l5_5, ml2_5, l6_5, lm3_5, m7_5, m9_5, m10_5],[m1_6, ml0_6, l2_6, m2_6, lm1_6, m3_6, ml1_6, l4_6, lm2_6, m4_6, m5_6, l5_6, ml2_6, l6_6, lm3_6, m7_6, ml3_6, m9_6, m10_6, ml4_6],[m1_7, ml0_7, l2_7, m2_7, lm1_7, m3_7, ml1_7, l4_7, lm2_7, m4_7, m5_7, l5_7, ml2_7, l6_7, lm3_7, m7_7, m9_7, m10_7],[m1_8, ml0_8, l2_8, m2_8, lm1_8, m3_8, ml1_8, l4_8, lm2_8, m4_8, m5_8, l5_8, ml2_8, l6_8, lm3_8, m7_8, ml3_8, m9_8, m10_8, ml4_8],[m1_9, ml0_9, l2_9, m2_9, lm1_9, m3_9, ml1_9, l4_9, lm2_9, m4_9, m5_9, l5_9, ml2_9, l6_9, lm3_9, m7_9, m9_9, m10_9],[m1_10, ml0_10, l2_10, m2_10, lm1_10, m3_10, ml1_10, l4_10, lm2_10, m4_10, m5_10, l5_10, ml2_10, l6_10, lm3_10, m7_10, ml3_10, m9_10, m10_10, ml4_10],[m1_11, ml0_11, l2_11, m2_11, lm1_11, m3_11, ml1_11, l4_11, lm2_11, m4_11, m5_11, l5_11, ml2_11, l6_11, lm3_11, m7_11, m9_11, m10_11],[m1_12, ml0_12, l2_12, m2_12, lm1_12, m3_12, ml1_12, l4_12, lm2_12, m4_12, m5_12, l5_12, ml2_12, l6_12, lm3_12, m7_12, ml3_12, m9_12, m10_12, ml4_12],[m1_13, ml0_13, l2_13, m2_13, lm1_13, m3_13, ml1_13, l4_13, lm2_13, m4_13, m5_13, l5_13, ml2_13, l6_13, lm3_13, m7_13, m9_13, m10_13],[m1_14, ml0_14, l2_14, m2_14, lm1_14, m3_14, ml1_14, l4_14, lm2_14, m4_14, m5_14, l5_14, ml2_14, l6_14, lm3_14, m7_14, ml3_14, m9_14, m10_14, ml4_14],[m1_15, ml0_15, l2_15, m2_15, lm1_15, m3_15, ml1_15, l4_15, lm2_15, m4_15, m5_15, l5_15, ml2_15, l6_15, lm3_15, m7_15, m9_15, m10_15],[m1_16, ml0_16, l2_16, m2_16, lm1_16, m3_16, ml1_16, l4_16, lm2_16, m4_16, m5_16, l5_16, ml2_16, l6_16, lm3_16, m7_16, ml3_16, m9_16, m10_16, ml4_16],[m1_17, ml0_17, l2_17, m2_17, lm1_17, m3_17, ml1_17, l4_17, lm2_17, m4_17, m5_17, l5_17, ml2_17, l6_17, lm3_17, m7_17, m9_17, m10_17],[m1_18, ml0_18, l2_18, m2_18, lm1_18, m3_18, ml1_18, l4_18, lm2_18, m4_18, m5_18, l5_18, ml2_18, l6_18, lm3_18, m7_18, ml3_18, m9_18, m10_18, ml4_18],[m1_19, ml0_19, l2_19, m2_19, lm1_19, m3_19, ml1_19, l4_19, lm2_19, m4_19, m5_19, l5_19, ml2_19, l6_19, lm3_19, m7_19, m9_19, m10_19],[m1_20, ml0_20, l2_20, m2_20, lm1_20, m3_20, ml1_20, l4_20, lm2_20, m4_20, m5_20, l5_20, ml2_20, l6_20, lm3_20, m7_20, ml3_20, m9_20, m10_20, ml4_20],[m1_21, ml0_21, l2_21, m2_21, lm1_21, m3_21, ml1_21, l4_21, lm2_21, m4_21, m5_21, l5_21, ml2_21, l6_21, lm3_21, m7_21, m9_21, m10_21],[c3_0, cl2_0, c5_0, c6_0, cl0_0, cl1_0],[c3_1, cl2_1, c5_1, c6_1, cl0_1, cl1_1],[c3_2, cl2_2, c5_2, c6_2, cl0_2, cl1_2],[c3_3, cl2_3, c5_3, c6_3, cl0_3, cl1_3],[c3_4, cl2_4, c5_4, c6_4, cl0_4, cl1_4],[c3_5, cl2_5, c5_5, c6_5, cl0_5, cl1_5],[c3_6, cl2_6, c5_6, c6_6, cl0_6, cl1_6],[c3_7, cl2_7, c5_7, c6_7, cl0_7, cl1_7],[c3_8, cl2_8, c5_8, c6_8, cl0_8, cl1_8],[c3_9, cl2_9, c5_9, c6_9, cl0_9, cl1_9],[c3_10, cl2_10, c5_10, c6_10, cl0_10, cl1_10],

at fr.lip6.move.gal.instantiate.CompositeBuilder$Partition.getIndex(CompositeBuilder.java:1421)
at fr.lip6.move.gal.instantiate.CompositeBuilder.galToCompositeWithPartition(CompositeBuilder.java:556)
at fr.lip6.move.gal.instantiate.CompositeBuilder.decomposeWithOrder(CompositeBuilder.java:147)
at fr.lip6.move.gal.application.mcc.MccTranslator.applyOrder(MccTranslator.java:133)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:230)
at fr.lip6.move.gal.application.runner.its.MultiOrderRunner.runMultiITS(MultiOrderRunner.java:124)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
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)
[2026-05-24 09:06:02] [INFO ] Flatten gal took : 342 ms
[2026-05-24 09:06:02] [INFO ] Time to serialize gal into /tmp/LTLFireability7560353640227500570.gal : 37 ms
[2026-05-24 09:06:02] [INFO ] Time to serialize properties into /tmp/LTLFireability2439075566285355219.ltl : 10 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/LTLFireability7560353640227500570.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2439075566285355219.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...297
Read 1 LTL properties
Checking formula 0 : !((F((X(X(F("((((((((l5_9>=1)&&(ml2_9>=1))||((l5_17>=1)&&(ml2_17>=1)))||(((l5_12>=1)&&(ml2_12>=1))||((l5_14>=1)&&(ml2_14>=1))))||((((l...1270
Formula 0 simplified : G(XXG!"((((((((l5_9>=1)&&(ml2_9>=1))||((l5_17>=1)&&(ml2_17>=1)))||(((l5_12>=1)&&(ml2_12>=1))||((l5_14>=1)&&(ml2_14>=1))))||((((l5_20...1256
Detected timeout of ITS tools.
[2026-05-24 09:29:17] [INFO ] Flatten gal took : 1908 ms
[2026-05-24 09:29:27] [INFO ] Input system was already deterministic with 983 transitions.
[2026-05-24 09:29:28] [INFO ] Transformed 1086 places.
[2026-05-24 09:29:28] [INFO ] Transformed 983 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2026-05-24 09:29:29] [INFO ] Time to serialize gal into /tmp/LTLFireability17552783129282942845.gal : 132 ms
[2026-05-24 09:29:29] [INFO ] Time to serialize properties into /tmp/LTLFireability7854085724568144821.ltl : 49 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/LTLFireability17552783129282942845.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability7854085724568144821.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--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...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F((X(X(F("((((((((l5_9>=1)&&(ml2_9>=1))||((l5_17>=1)&&(ml2_17>=1)))||(((l5_12>=1)&&(ml2_12>=1))||((l5_14>=1)&&(ml2_14>=1))))||((((l...1270
Formula 0 simplified : G(XXG!"((((((((l5_9>=1)&&(ml2_9>=1))||((l5_17>=1)&&(ml2_17>=1)))||(((l5_12>=1)&&(ml2_12>=1))||((l5_14>=1)&&(ml2_14>=1))))||((((l5_20...1256

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ 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-COL-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-COL-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-177955808800004"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FamilyReunion-COL-L00010M0001C001P001G001.tgz
mv FamilyReunion-COL-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 ;