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

About the Execution of ITS-Tools for FamilyReunion-COL-L00020M0002C001P001G001

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16201.615 3600000.00 6490657.00 199777.60 TFFTTFTFFFFT?TFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r130-smll-177955808800011.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-L00020M0002C001P001G001, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r130-smll-177955808800011
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 8.3K Mar 6 07:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Mar 6 07:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Mar 6 07:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Mar 6 07:46 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 4.0K Mar 15 10:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 10:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Mar 15 10:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 10:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.0K Mar 6 07:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 60K Mar 6 07:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Mar 6 07:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Mar 6 07:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Mar 15 10:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Mar 15 10:00 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 135K 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-L00020M0002C001P001G001-LTLCardinality-00
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-01
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-02
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-03
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-04
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-05
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-06
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-07
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-08
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-09
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-10
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-11
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-12
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-13
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-14
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779618939102

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FamilyReunion-COL-L00020M0002C001P001G001
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202604301425
[2026-05-24 10:35:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-24 10:35:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 10:35:41] [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 10:35:42] [WARNING] Using fallBack plugin, rng conformance not checked
[2026-05-24 10:35:44] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 2111 ms
[2026-05-24 10:35:44] [INFO ] Detected 5 constant HL places corresponding to 11 PT places.
[2026-05-24 10:35:44] [INFO ] Imported 104 HL places and 66 HL transitions for a total of 3292 PT places and 2774.0 transition bindings in 72 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 33 ms.
Working with output stream class java.io.PrintStream
[2026-05-24 10:35:44] [INFO ] Built PT skeleton of HLPN with 104 places and 66 transitions 198 arcs in 14 ms.
[2026-05-24 10:35:44] [INFO ] Skeletonized 16 HLPN properties in 4 ms.
Initial state reduction rules removed 4 formulas.
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-11 TRUE 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 12 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 40026 steps (28 resets) in 534 ms. (74 steps per ms) remains 4/30 properties
BEST_FIRST walk for 40004 steps (8 resets) in 343 ms. (116 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 306 ms. (130 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 269 ms. (148 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 345 ms. (115 steps per ms) remains 4/4 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2251071656870764398.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16913252319942782619.kers'
[2026-05-24 10:35:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2251071656870764398.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16913252319942782619.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 66 rows 99 cols 188 entries
Finished phase 1 with 45 SingleSign rule and 21 generalized
[2026-05-24 10:35:45] [INFO ] Computed 33 invariants in 1 ms
Computed 33 P flows in 32 ms.
Exported basis to /tmp/petrispot-output-16913252319942782619.kers
Total runtime 32 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp8 is UNSAT
At refinement iteration 1 (OVERLAPS) 48/56 variables, 8/8 constraints. Problems are: Problem set: 2 solved, 2 unsolved
Problem AtomicPropp13 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 1/9 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/9 constraints. Problems are: Problem set: 3 solved, 1 unsolved
Problem AtomicPropp19 is UNSAT
After SMT solving in domain Real declared 94/165 variables, and 30 constraints, problems are : Problem set: 4 solved, 0 unsolved in 317 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 22/25 constraints, State Equation: 0/99 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 480ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 4 atomic propositions for a total of 12 simplifications.
[2026-05-24 10:35:45] [INFO ] Flatten gal took : 52 ms
[2026-05-24 10:35:45] [INFO ] Flatten gal took : 17 ms
Transition Gate2ANDJoin forces synchronizations/join behavior on parameter l of sort LegalResident
Transition ReceiveLangChoice forces synchronizations/join behavior on parameter m of sort MICSystem
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
[2026-05-24 10:35:46] [INFO ] Unfolded HLPN to a Petri net with 3095 places and 2438 transitions 6997 arcs in 110 ms.
[2026-05-24 10:35:46] [INFO ] Unfolded 12 HLPN properties in 1 ms.
Deduced a syphon composed of 21 places in 34 ms
Reduce places removed 30 places and 0 transitions.
Support contains 1264 out of 3065 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3065/3065 places, 2438/2438 transitions.
Reduce places removed 29 places and 0 transitions.
Discarding 189 places :
Implicit places reduction removed 189 places
Iterating post reduction 0 with 218 rules applied. Total rules applied 218 place count 2847 transition count 2438
Discarding 63 places :
Symmetric choice reduction at 1 with 63 rule applications. Total rules 281 place count 2784 transition count 2375
Iterating global reduction 1 with 63 rules applied. Total rules applied 344 place count 2784 transition count 2375
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 345 place count 2783 transition count 2354
Iterating global reduction 1 with 1 rules applied. Total rules applied 346 place count 2783 transition count 2354
Applied a total of 346 rules in 785 ms. Remains 2783 /3065 variables (removed 282) and now considering 2354/2438 (removed 84) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1827634959225343575.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11633745262335349910.kers'
[2026-05-24 10:35:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1827634959225343575.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11633745262335349910.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 2354 rows 2783 cols 6218 entries
Finished phase 1 with 1852 SingleSign rule and 399 generalized
[2026-05-24 10:35:47] [INFO ] Computed 532 invariants in 24 ms
Computed 532 P flows in 24 ms.
Exported basis to /tmp/petrispot-output-11633745262335349910.kers
Total runtime 27 ms.
[2026-05-24 10:35:50] [INFO ] Implicit Places using invariants in 3324 ms returned [231, 232, 233, 234, 235, 236, 237, 238, 239, 240, 241, 242, 243, 244, 245, 246, 247, 248, 249, 250, 251, 525, 1430, 1578, 1579, 1580, 1581, 1582, 1583, 1584, 1585, 1586, 1587, 1588, 1589, 1590, 1591, 1592, 1593, 1594, 1595, 1596, 1597, 1598, 2129, 2130, 2131, 2132, 2133, 2134, 2135, 2136, 2137, 2138, 2139, 2140, 2141, 2142, 2143, 2144, 2145, 2146, 2147, 2148, 2149, 2509]
Discarding 66 places :
Implicit Place search using SMT only with invariants took 3354 ms to find 66 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2717/3065 places, 2354/2438 transitions.
Applied a total of 0 rules in 220 ms. Remains 2717 /2717 variables (removed 0) and now considering 2354/2354 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 4369 ms. Remains : 2717/3065 places, 2354/2438 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2717/2717 places, 2354/2354 transitions.
Applied a total of 0 rules in 190 ms. Remains 2717 /2717 variables (removed 0) and now considering 2354/2354 (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-5494592041003624823.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1905426430781780505.kers'
[2026-05-24 10:35:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5494592041003624823.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1905426430781780505.kers]
Culled 0 columns in 4 ms.
// Phase 1: matrix 2354 rows 2717 cols 5861 entries
Finished phase 1 with 1936 SingleSign rule and 315 generalized
[2026-05-24 10:35:50] [INFO ] Computed 466 invariants in 35 ms
Computed 466 P flows in 35 ms.
Exported basis to /tmp/petrispot-output-1905426430781780505.kers
Total runtime 40 ms.
[2026-05-24 10:35:52] [INFO ] Implicit Places using invariants in 2078 ms returned []
[2026-05-24 10:35:52] [INFO ] Invariant cache hit.
[2026-05-24 10:35:59] [INFO ] Implicit Places using invariants and state equation in 6216 ms returned []
Implicit Place search using SMT with State Equation took 8299 ms to find 0 implicit places.
Running 2333 sub problems to find dead transitions.
[2026-05-24 10:35:59] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/2652 variables, 419/419 constraints. Problems are: Problem set: 0 solved, 2333 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2652/5071 variables, and 419 constraints, problems are : Problem set: 0 solved, 2333 unsolved in 30131 ms.
Refiners :[Positive P Invariants (semi-flows): 0/43 constraints, Generalized P Invariants (flows): 419/423 constraints, State Equation: 0/2717 constraints, PredecessorRefiner: 2333/2333 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2333 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2652 variables, 419/419 constraints. Problems are: Problem set: 0 solved, 2333 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2652/5071 variables, and 419 constraints, problems are : Problem set: 0 solved, 2333 unsolved in 30078 ms.
Refiners :[Positive P Invariants (semi-flows): 0/43 constraints, Generalized P Invariants (flows): 419/423 constraints, State Equation: 0/2717 constraints, PredecessorRefiner: 0/2333 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61650ms problems are : Problem set: 0 solved, 2333 unsolved
Search for dead transitions found 0 dead transitions in 61701ms
Finished structural reductions in LTL mode , in 1 iterations and 70270 ms. Remains : 2717/2717 places, 2354/2354 transitions.
Support contains 1264 out of 2717 places after structural reductions.
[2026-05-24 10:37:01] [INFO ] Flatten gal took : 194 ms
[2026-05-24 10:37:01] [INFO ] Flatten gal took : 164 ms
[2026-05-24 10:37:01] [INFO ] Input system was already deterministic with 2354 transitions.
RANDOM walk for 40000 steps (32 resets) in 3304 ms. (12 steps per ms) remains 4/30 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 172 ms. (231 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 335 ms. (119 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 305 ms. (130 steps per ms) remains 4/4 properties
[2026-05-24 10:37:03] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/232 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp8 is UNSAT
At refinement iteration 1 (OVERLAPS) 1716/1948 variables, 43/43 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1948 variables, 0/43 constraints. Problems are: Problem set: 2 solved, 2 unsolved
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp19 is UNSAT
After SMT solving in domain Real declared 2668/5071 variables, and 463 constraints, problems are : Problem set: 4 solved, 0 unsolved in 1005 ms.
Refiners :[Positive P Invariants (semi-flows): 43/43 constraints, Generalized P Invariants (flows): 420/423 constraints, State Equation: 0/2717 constraints, PredecessorRefiner: 4/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1045ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 4 atomic propositions for a total of 11 simplifications.
Computed a total of 2717 stabilizing places and 2354 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2717 transition count 2354
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' '!(X(((G(p0)||(p0&&F(p1))) U X(X(p2)))))'
Support contains 170 out of 2717 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2717/2717 places, 2354/2354 transitions.
Reduce places removed 44 places and 0 transitions.
Discarding 168 places :
Implicit places reduction removed 168 places
Iterating post reduction 0 with 212 rules applied. Total rules applied 212 place count 2505 transition count 2354
Discarding 104 places :
Symmetric choice reduction at 1 with 104 rule applications. Total rules 316 place count 2401 transition count 2250
Iterating global reduction 1 with 104 rules applied. Total rules applied 420 place count 2401 transition count 2250
Discarding 104 places :
Symmetric choice reduction at 1 with 104 rule applications. Total rules 524 place count 2297 transition count 2146
Iterating global reduction 1 with 104 rules applied. Total rules applied 628 place count 2297 transition count 2146
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 650 place count 2275 transition count 2084
Iterating global reduction 1 with 22 rules applied. Total rules applied 672 place count 2275 transition count 2084
Discarding 21 places :
Implicit places reduction removed 21 places
Iterating post reduction 1 with 21 rules applied. Total rules applied 693 place count 2254 transition count 2084
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 713 place count 2234 transition count 2044
Iterating global reduction 2 with 20 rules applied. Total rules applied 733 place count 2234 transition count 2044
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 753 place count 2214 transition count 2024
Iterating global reduction 2 with 20 rules applied. Total rules applied 773 place count 2214 transition count 2024
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 793 place count 2194 transition count 2004
Iterating global reduction 2 with 20 rules applied. Total rules applied 813 place count 2194 transition count 2004
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 833 place count 2174 transition count 1984
Iterating global reduction 2 with 20 rules applied. Total rules applied 853 place count 2174 transition count 1984
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 873 place count 2154 transition count 1964
Iterating global reduction 2 with 20 rules applied. Total rules applied 893 place count 2154 transition count 1964
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 913 place count 2134 transition count 1944
Iterating global reduction 2 with 20 rules applied. Total rules applied 933 place count 2134 transition count 1944
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 953 place count 2114 transition count 1924
Iterating global reduction 2 with 20 rules applied. Total rules applied 973 place count 2114 transition count 1924
Applied a total of 973 rules in 2622 ms. Remains 2114 /2717 variables (removed 603) and now considering 1924/2354 (removed 430) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12823216411509816668.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3576982029367008944.kers'
[2026-05-24 10:37:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12823216411509816668.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3576982029367008944.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 1924 rows 2114 cols 4476 entries
Finished phase 1 with 1650 SingleSign rule and 210 generalized
[2026-05-24 10:37:07] [INFO ] Computed 254 invariants in 25 ms
Computed 254 P flows in 26 ms.
Exported basis to /tmp/petrispot-output-3576982029367008944.kers
Total runtime 28 ms.
[2026-05-24 10:37:08] [INFO ] Implicit Places using invariants in 866 ms returned [1334]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 869 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2113/2717 places, 1924/2354 transitions.
Applied a total of 0 rules in 170 ms. Remains 2113 /2113 variables (removed 0) and now considering 1924/1924 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3662 ms. Remains : 2113/2717 places, 1924/2354 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)||(p0&&F(p1))) U X(X(p2)))))'
Stuttering acceptance computed with spot in 834 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p2), true, (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-00
Product exploration explored 100000 steps with 25000 reset in 1345 ms.
Product exploration explored 100000 steps with 25000 reset in 1180 ms.
Computed a total of 2113 stabilizing places and 1924 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2113 transition count 1924
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 176 ms. Reduced automaton from 14 states, 24 edges and 3 AP (stutter sensitive) to 12 states, 17 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (32 resets) in 1351 ms. (29 steps per ms) remains 2/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 315 ms. (126 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 418 ms. (95 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-6657816893945963596.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5566093296817751113.kers'
[2026-05-24 10:37:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6657816893945963596.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5566093296817751113.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1924 rows 2113 cols 4392 entries
Finished phase 1 with 1650 SingleSign rule and 210 generalized
[2026-05-24 10:37:13] [INFO ] Computed 253 invariants in 13 ms
Computed 253 P flows in 13 ms.
Exported basis to /tmp/petrispot-output-5566093296817751113.kers
Total runtime 16 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1685/1855 variables, 128/128 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1855 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 250/2105 variables, 125/253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2105 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1915/4020 variables, 2105/2358 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4020 variables, 0/2358 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 2/4022 variables, 1/2359 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4022 variables, 0/2359 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2/4024 variables, 1/2360 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4024 variables, 0/2360 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/4026 variables, 1/2361 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4026 variables, 0/2361 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2/4028 variables, 1/2362 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4028 variables, 0/2362 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 3/4031 variables, 1/2363 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/4031 variables, 0/2363 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 4/4035 variables, 2/2365 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/4035 variables, 0/2365 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/4037 variables, 1/2366 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/4037 variables, 0/2366 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/4037 variables, 0/2366 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4037/4037 variables, and 2366 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3253 ms.
Refiners :[Generalized P Invariants (flows): 253/253 constraints, State Equation: 2113/2113 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1685/1855 variables, 128/128 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1855 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 250/2105 variables, 125/253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2105 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1915/4020 variables, 2105/2358 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4020 variables, 0/2358 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 2/4022 variables, 1/2359 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4022 variables, 0/2359 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2/4024 variables, 1/2360 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4024 variables, 0/2360 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/4026 variables, 1/2361 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4026 variables, 0/2361 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2/4028 variables, 1/2362 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4028 variables, 0/2362 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 3/4031 variables, 1/2363 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/4031 variables, 0/2363 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 4/4035 variables, 2/2365 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/4035 variables, 0/2365 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/4037 variables, 1/2366 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4037/4037 variables, and 2366 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5013 ms.
Refiners :[Generalized P Invariants (flows): 253/253 constraints, State Equation: 2113/2113 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8315ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 170 out of 2113 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2113/2113 places, 1924/1924 transitions.
Graph (complete) has 2468 edges and 2113 vertex of which 2018 are kept as prefixes of interest. Removing 95 places using SCC suffix rule.6 ms
Discarding 95 places :
Also discarding 74 output transitions
Drop transitions (Output transitions of discarded places.) removed 74 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 987 transitions
Trivial Post-agglo rules discarded 987 transitions
Performed 987 trivial Post agglomeration. Transition count delta: 987
Iterating post reduction 0 with 987 rules applied. Total rules applied 988 place count 2018 transition count 863
Reduce places removed 987 places and 0 transitions.
Iterating post reduction 1 with 987 rules applied. Total rules applied 1975 place count 1031 transition count 863
Performed 378 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 378 Pre rules applied. Total rules applied 1975 place count 1031 transition count 485
Deduced a syphon composed of 378 places in 0 ms
Ensure Unique test removed 231 places
Reduce places removed 609 places and 0 transitions.
Iterating global reduction 2 with 987 rules applied. Total rules applied 2962 place count 422 transition count 485
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 2962 place count 422 transition count 464
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 3004 place count 401 transition count 464
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 3046 place count 380 transition count 443
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 3088 place count 359 transition count 464
Applied a total of 3088 rules in 249 ms. Remains 359 /2113 variables (removed 1754) and now considering 464/1924 (removed 1460) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 249 ms. Remains : 359/2113 places, 464/1924 transitions.
RANDOM walk for 240 steps (0 resets) in 13 ms. (17 steps per ms) remains 0/2 properties
Knowledge based reduction with 11 factoid took 438 ms. Reduced automaton from 12 states, 17 edges and 3 AP (stutter sensitive) to 12 states, 17 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 527 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true, (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p0))]
Knowledge-based reduction took 11180 ms.
Stuttering acceptance computed with spot in 523 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true, (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 170 out of 2113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2113/2113 places, 1924/1924 transitions.
Applied a total of 0 rules in 183 ms. Remains 2113 /2113 variables (removed 0) and now considering 1924/1924 (removed 0) transitions.
[2026-05-24 10:37:23] [INFO ] Invariant cache hit.
[2026-05-24 10:37:24] [INFO ] Implicit Places using invariants in 966 ms returned []
[2026-05-24 10:37:24] [INFO ] Invariant cache hit.
[2026-05-24 10:37:27] [INFO ] Implicit Places using invariants and state equation in 2889 ms returned []
Implicit Place search using SMT with State Equation took 3859 ms to find 0 implicit places.
Running 1903 sub problems to find dead transitions.
[2026-05-24 10:37:27] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/2092 variables, 251/251 constraints. Problems are: Problem set: 0 solved, 1903 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2092/4037 variables, and 251 constraints, problems are : Problem set: 0 solved, 1903 unsolved in 30096 ms.
Refiners :[Generalized P Invariants (flows): 251/253 constraints, State Equation: 0/2113 constraints, PredecessorRefiner: 1903/1903 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1903 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2092 variables, 251/251 constraints. Problems are: Problem set: 0 solved, 1903 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2092/4037 variables, and 251 constraints, problems are : Problem set: 0 solved, 1903 unsolved in 30057 ms.
Refiners :[Generalized P Invariants (flows): 251/253 constraints, State Equation: 0/2113 constraints, PredecessorRefiner: 0/1903 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60703ms problems are : Problem set: 0 solved, 1903 unsolved
Search for dead transitions found 0 dead transitions in 60714ms
Finished structural reductions in LTL mode , in 1 iterations and 64771 ms. Remains : 2113/2113 places, 1924/1924 transitions.
Computed a total of 2113 stabilizing places and 1924 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2113 transition count 1924
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 143 ms. Reduced automaton from 12 states, 17 edges and 3 AP (stutter sensitive) to 12 states, 17 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (32 resets) in 1152 ms. (34 steps per ms) remains 2/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 184 ms. (216 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 234 ms. (170 steps per ms) remains 2/2 properties
[2026-05-24 10:38:29] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1685/1855 variables, 128/128 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1855 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 250/2105 variables, 125/253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2105 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1915/4020 variables, 2105/2358 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4020 variables, 0/2358 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 2/4022 variables, 1/2359 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4022 variables, 0/2359 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2/4024 variables, 1/2360 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4024 variables, 0/2360 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/4026 variables, 1/2361 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4026 variables, 0/2361 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2/4028 variables, 1/2362 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4028 variables, 0/2362 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 3/4031 variables, 1/2363 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/4031 variables, 0/2363 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 4/4035 variables, 2/2365 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/4035 variables, 0/2365 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/4037 variables, 1/2366 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/4037 variables, 0/2366 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/4037 variables, 0/2366 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4037/4037 variables, and 2366 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3245 ms.
Refiners :[Generalized P Invariants (flows): 253/253 constraints, State Equation: 2113/2113 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1685/1855 variables, 128/128 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1855 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 250/2105 variables, 125/253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2105 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1915/4020 variables, 2105/2358 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4020 variables, 0/2358 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 2/4022 variables, 1/2359 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4022 variables, 0/2359 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2/4024 variables, 1/2360 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4024 variables, 0/2360 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/4026 variables, 1/2361 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4026 variables, 0/2361 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2/4028 variables, 1/2362 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4028 variables, 0/2362 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 3/4031 variables, 1/2363 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/4031 variables, 0/2363 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 4/4035 variables, 2/2365 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4035/4037 variables, and 2365 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5013 ms.
Refiners :[Generalized P Invariants (flows): 253/253 constraints, State Equation: 2112/2113 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8283ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 170 out of 2113 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2113/2113 places, 1924/1924 transitions.
Graph (complete) has 2468 edges and 2113 vertex of which 2018 are kept as prefixes of interest. Removing 95 places using SCC suffix rule.4 ms
Discarding 95 places :
Also discarding 74 output transitions
Drop transitions (Output transitions of discarded places.) removed 74 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 987 transitions
Trivial Post-agglo rules discarded 987 transitions
Performed 987 trivial Post agglomeration. Transition count delta: 987
Iterating post reduction 0 with 987 rules applied. Total rules applied 988 place count 2018 transition count 863
Reduce places removed 987 places and 0 transitions.
Iterating post reduction 1 with 987 rules applied. Total rules applied 1975 place count 1031 transition count 863
Performed 378 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 378 Pre rules applied. Total rules applied 1975 place count 1031 transition count 485
Deduced a syphon composed of 378 places in 1 ms
Ensure Unique test removed 231 places
Reduce places removed 609 places and 0 transitions.
Iterating global reduction 2 with 987 rules applied. Total rules applied 2962 place count 422 transition count 485
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 2962 place count 422 transition count 464
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 3004 place count 401 transition count 464
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 3046 place count 380 transition count 443
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 3088 place count 359 transition count 464
Applied a total of 3088 rules in 132 ms. Remains 359 /2113 variables (removed 1754) and now considering 464/1924 (removed 1460) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 132 ms. Remains : 359/2113 places, 464/1924 transitions.
RANDOM walk for 259 steps (0 resets) in 8 ms. (28 steps per ms) remains 0/2 properties
Knowledge based reduction with 4 factoid took 503 ms. Reduced automaton from 12 states, 17 edges and 3 AP (stutter sensitive) to 12 states, 17 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 574 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true, (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p0))]
Knowledge-based reduction took 10981 ms.
Stuttering acceptance computed with spot in 523 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true, (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 535 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true, (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 25000 reset in 878 ms.
Product exploration explored 100000 steps with 25000 reset in 762 ms.
Spot run failed in 118 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/ltsmin3788772292233381726
[2026-05-24 10:38:42] [INFO ] Built C files in 56ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3788772292233381726
Running compilation step : cd /tmp/ltsmin3788772292233381726;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3788772292233381726;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3788772292233381726;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 170 out of 2113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2113/2113 places, 1924/1924 transitions.
Applied a total of 0 rules in 285 ms. Remains 2113 /2113 variables (removed 0) and now considering 1924/1924 (removed 0) transitions.
[2026-05-24 10:38:45] [INFO ] Invariant cache hit.
[2026-05-24 10:38:46] [INFO ] Implicit Places using invariants in 1174 ms returned []
[2026-05-24 10:38:46] [INFO ] Invariant cache hit.
[2026-05-24 10:38:50] [INFO ] Implicit Places using invariants and state equation in 3445 ms returned []
Implicit Place search using SMT with State Equation took 4623 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 4910 ms. Remains : 2113/2113 places, 1924/1924 transitions.
Built C files in :
/tmp/ltsmin2277269138116159273
[2026-05-24 10:38:50] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2277269138116159273
Running compilation step : cd /tmp/ltsmin2277269138116159273;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2277269138116159273;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2277269138116159273;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2026-05-24 10:38:53] [INFO ] Flatten gal took : 78 ms
[2026-05-24 10:38:53] [INFO ] Flatten gal took : 73 ms
[2026-05-24 10:38:53] [INFO ] Time to serialize gal into /tmp/LTL17489830249926638643.gal : 21 ms
[2026-05-24 10:38:53] [INFO ] Time to serialize properties into /tmp/LTL1040940644410848146.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/LTL17489830249926638643.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4643729419943336607.hoa' '-atoms' '/tmp/LTL1040940644410848146.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...318
Loading property file /tmp/LTL1040940644410848146.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4643729419943336607.hoa
Detected timeout of ITS tools.
[2026-05-24 10:39:08] [INFO ] Flatten gal took : 61 ms
[2026-05-24 10:39:09] [INFO ] Flatten gal took : 92 ms
[2026-05-24 10:39:09] [INFO ] Time to serialize gal into /tmp/LTL8535517280123116752.gal : 36 ms
[2026-05-24 10:39:09] [INFO ] Time to serialize properties into /tmp/LTL3198879305832682365.ltl : 12 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/LTL8535517280123116752.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3198879305832682365.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(((G("(((((((l5_0+l5_1)+(l5_2+l5_3))+((l5_4+l5_5)+(l5_6+l5_7)))+(((l5_8+l5_9)+(l5_10+l5_11))+((l5_12+l5_13)+(l5_14+l5_15))))+((((l...2073
Formula 0 simplified : X((F!"(((((((l5_0+l5_1)+(l5_2+l5_3))+((l5_4+l5_5)+(l5_6+l5_7)))+(((l5_8+l5_9)+(l5_10+l5_11))+((l5_12+l5_13)+(l5_14+l5_15))))+((((l5_...2062
Detected timeout of ITS tools.
[2026-05-24 10:39:24] [INFO ] Flatten gal took : 52 ms
[2026-05-24 10:39:24] [INFO ] Applying decomposition
[2026-05-24 10:39:24] [INFO ] Flatten gal took : 50 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/graph17260893376038286170.txt' '-o' '/tmp/graph17260893376038286170.bin' '-w' '/tmp/graph17260893376038286170.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17260893376038286170.bin' '-l' '-1' '-v' '-w' '/tmp/graph17260893376038286170.weights' '-q' '0' '-e' '0.001'
[2026-05-24 10:39:24] [INFO ] Decomposing Gal with order
[2026-05-24 10:39:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 10:39:25] [INFO ] Removed a total of 143 redundant transitions.
[2026-05-24 10:39:25] [INFO ] Flatten gal took : 304 ms
[2026-05-24 10:39:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 16 ms.
[2026-05-24 10:39:25] [INFO ] Time to serialize gal into /tmp/LTL12857630102015252328.gal : 23 ms
[2026-05-24 10:39:25] [INFO ] Time to serialize properties into /tmp/LTL4546712117418172284.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/LTL12857630102015252328.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4546712117418172284.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 : !((X(((G("(((((((gu356.l5_0+gu356.l5_1)+(gu356.l5_2+gu356.l5_3))+((gu356.l5_4+gu356.l5_5)+(gu356.l5_6+gu356.l5_7)))+(((gu356.l5_8+gu35...3666
Formula 0 simplified : X((F!"(((((((gu356.l5_0+gu356.l5_1)+(gu356.l5_2+gu356.l5_3))+((gu356.l5_4+gu356.l5_5)+(gu356.l5_6+gu356.l5_7)))+(((gu356.l5_8+gu356....3655
Detected timeout of ITS tools.
Treatment of property FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-00 finished in 156171 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(((p1 U p2)&&F(p1)))))'
Support contains 189 out of 2717 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2717/2717 places, 2354/2354 transitions.
Reduce places removed 44 places and 0 transitions.
Discarding 210 places :
Implicit places reduction removed 210 places
Iterating post reduction 0 with 254 rules applied. Total rules applied 254 place count 2463 transition count 2354
Discarding 106 places :
Symmetric choice reduction at 1 with 106 rule applications. Total rules 360 place count 2357 transition count 2248
Iterating global reduction 1 with 106 rules applied. Total rules applied 466 place count 2357 transition count 2248
Discarding 104 places :
Symmetric choice reduction at 1 with 104 rule applications. Total rules 570 place count 2253 transition count 2144
Iterating global reduction 1 with 104 rules applied. Total rules applied 674 place count 2253 transition count 2144
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 717 place count 2210 transition count 2061
Iterating global reduction 1 with 43 rules applied. Total rules applied 760 place count 2210 transition count 2061
Discarding 21 places :
Implicit places reduction removed 21 places
Iterating post reduction 1 with 21 rules applied. Total rules applied 781 place count 2189 transition count 2061
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 801 place count 2169 transition count 2021
Iterating global reduction 2 with 20 rules applied. Total rules applied 821 place count 2169 transition count 2021
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 841 place count 2149 transition count 2001
Iterating global reduction 2 with 20 rules applied. Total rules applied 861 place count 2149 transition count 2001
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 881 place count 2129 transition count 1981
Iterating global reduction 2 with 20 rules applied. Total rules applied 901 place count 2129 transition count 1981
Applied a total of 901 rules in 1397 ms. Remains 2129 /2717 variables (removed 588) and now considering 1981/2354 (removed 373) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5441765167258029332.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4392695426344545346.kers'
[2026-05-24 10:39:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5441765167258029332.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4392695426344545346.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1981 rows 2129 cols 4507 entries
Finished phase 1 with 1770 SingleSign rule and 147 generalized
[2026-05-24 10:39:42] [INFO ] Computed 212 invariants in 19 ms
Computed 212 P flows in 20 ms.
Exported basis to /tmp/petrispot-output-4392695426344545346.kers
Total runtime 24 ms.
[2026-05-24 10:39:43] [INFO ] Implicit Places using invariants in 1007 ms returned [1372]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1009 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2128/2717 places, 1981/2354 transitions.
Applied a total of 0 rules in 171 ms. Remains 2128 /2128 variables (removed 0) and now considering 1981/1981 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2579 ms. Remains : 2128/2717 places, 1981/2354 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(((p1 U p2)&&F(p1)))))'
Stuttering acceptance computed with spot in 282 ms :[(OR (NOT p2) (NOT p1)), true, (NOT p2), (NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (NOT p1)]
Running random walk in product with property : FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-03
Product exploration explored 100000 steps with 50000 reset in 1575 ms.
Product exploration explored 100000 steps with 50000 reset in 1101 ms.
Computed a total of 2128 stabilizing places and 1981 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2128 transition count 1981
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 24 factoid took 13 ms. Proved property starting from automaton with 7 states, 18 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 778 ms.
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-03 finished in 6366 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0&&X(p1)) U X((!p1 U p0))))'
Support contains 42 out of 2717 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2717/2717 places, 2354/2354 transitions.
Reduce places removed 44 places and 0 transitions.
Discarding 273 places :
Implicit places reduction removed 273 places
Iterating post reduction 0 with 317 rules applied. Total rules applied 317 place count 2400 transition count 2354
Discarding 148 places :
Symmetric choice reduction at 1 with 148 rule applications. Total rules 465 place count 2252 transition count 2206
Iterating global reduction 1 with 148 rules applied. Total rules applied 613 place count 2252 transition count 2206
Discarding 104 places :
Symmetric choice reduction at 1 with 104 rule applications. Total rules 717 place count 2148 transition count 2102
Iterating global reduction 1 with 104 rules applied. Total rules applied 821 place count 2148 transition count 2102
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 864 place count 2105 transition count 2019
Iterating global reduction 1 with 43 rules applied. Total rules applied 907 place count 2105 transition count 2019
Discarding 21 places :
Implicit places reduction removed 21 places
Iterating post reduction 1 with 21 rules applied. Total rules applied 928 place count 2084 transition count 2019
Discarding 62 places :
Symmetric choice reduction at 2 with 62 rule applications. Total rules 990 place count 2022 transition count 1937
Iterating global reduction 2 with 62 rules applied. Total rules applied 1052 place count 2022 transition count 1937
Discarding 62 places :
Symmetric choice reduction at 2 with 62 rule applications. Total rules 1114 place count 1960 transition count 1875
Iterating global reduction 2 with 62 rules applied. Total rules applied 1176 place count 1960 transition count 1875
Discarding 62 places :
Symmetric choice reduction at 2 with 62 rule applications. Total rules 1238 place count 1898 transition count 1813
Iterating global reduction 2 with 62 rules applied. Total rules applied 1300 place count 1898 transition count 1813
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1342 place count 1856 transition count 1771
Iterating global reduction 2 with 42 rules applied. Total rules applied 1384 place count 1856 transition count 1771
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1426 place count 1814 transition count 1729
Iterating global reduction 2 with 42 rules applied. Total rules applied 1468 place count 1814 transition count 1729
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1510 place count 1772 transition count 1687
Iterating global reduction 2 with 42 rules applied. Total rules applied 1552 place count 1772 transition count 1687
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1594 place count 1730 transition count 1645
Iterating global reduction 2 with 42 rules applied. Total rules applied 1636 place count 1730 transition count 1645
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1678 place count 1688 transition count 1603
Iterating global reduction 2 with 42 rules applied. Total rules applied 1720 place count 1688 transition count 1603
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1762 place count 1646 transition count 1561
Iterating global reduction 2 with 42 rules applied. Total rules applied 1804 place count 1646 transition count 1561
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1846 place count 1604 transition count 1519
Iterating global reduction 2 with 42 rules applied. Total rules applied 1888 place count 1604 transition count 1519
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1930 place count 1562 transition count 1477
Iterating global reduction 2 with 42 rules applied. Total rules applied 1972 place count 1562 transition count 1477
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 2014 place count 1520 transition count 1435
Iterating global reduction 2 with 42 rules applied. Total rules applied 2056 place count 1520 transition count 1435
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 2098 place count 1478 transition count 1393
Iterating global reduction 2 with 42 rules applied. Total rules applied 2140 place count 1478 transition count 1393
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 2 with 42 rules applied. Total rules applied 2182 place count 1478 transition count 1351
Applied a total of 2182 rules in 2677 ms. Remains 1478 /2717 variables (removed 1239) and now considering 1351/2354 (removed 1003) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11676874276570517799.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15194007900947529021.kers'
[2026-05-24 10:39:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11676874276570517799.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15194007900947529021.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1351 rows 1478 cols 3079 entries
Finished phase 1 with 1224 SingleSign rule and 105 generalized
[2026-05-24 10:39:49] [INFO ] Computed 149 invariants in 8 ms
Computed 149 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-15194007900947529021.kers
Total runtime 13 ms.
[2026-05-24 10:39:50] [INFO ] Implicit Places using invariants in 844 ms returned [721]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 847 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1477/2717 places, 1351/2354 transitions.
Applied a total of 0 rules in 92 ms. Remains 1477 /1477 variables (removed 0) and now considering 1351/1351 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3616 ms. Remains : 1477/2717 places, 1351/2354 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0&&X(p1)) U X((!p1 U p0))))'
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), true, (NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-04
Product exploration explored 100000 steps with 50000 reset in 826 ms.
Product exploration explored 100000 steps with 50000 reset in 628 ms.
Computed a total of 1477 stabilizing places and 1351 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1477 transition count 1351
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 11 factoid took 14 ms. Proved property starting from automaton with 4 states, 6 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 557 ms.
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-04 finished in 5829 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 63 out of 2717 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2717/2717 places, 2354/2354 transitions.
Graph (complete) has 3486 edges and 2717 vertex of which 861 are kept as prefixes of interest. Removing 1856 places using SCC suffix rule.14 ms
Discarding 1856 places :
Also discarding 1640 output transitions
Drop transitions (Output transitions of discarded places.) removed 1640 transitions
Reduce places removed 21 places and 21 transitions.
Discarding 126 places :
Implicit places reduction removed 126 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 441 transitions
Trivial Post-agglo rules discarded 441 transitions
Performed 441 trivial Post agglomeration. Transition count delta: 441
Iterating post reduction 0 with 567 rules applied. Total rules applied 568 place count 714 transition count 252
Reduce places removed 441 places and 0 transitions.
Iterating post reduction 1 with 441 rules applied. Total rules applied 1009 place count 273 transition count 252
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 63 Pre rules applied. Total rules applied 1009 place count 273 transition count 189
Deduced a syphon composed of 63 places in 0 ms
Ensure Unique test removed 63 places
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 2 with 189 rules applied. Total rules applied 1198 place count 147 transition count 189
Applied a total of 1198 rules in 55 ms. Remains 147 /2717 variables (removed 2570) and now considering 189/2354 (removed 2165) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8628124821471934064.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17285465997180467577.kers'
[2026-05-24 10:39:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8628124821471934064.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17285465997180467577.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 189 rows 147 cols 315 entries
Finished phase 1 with 147 SingleSign rule and 0 generalized
[2026-05-24 10:39:53] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17285465997180467577.kers
Total runtime 1 ms.
[2026-05-24 10:39:53] [INFO ] Implicit Places using invariants in 47 ms returned []
[2026-05-24 10:39:53] [INFO ] Invariant cache hit.
[2026-05-24 10:39:53] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
[2026-05-24 10:39:53] [INFO ] Redundant transitions in 9 ms returned []
Running 126 sub problems to find dead transitions.
[2026-05-24 10:39:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (OVERLAPS) 189/315 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/315 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (OVERLAPS) 21/336 variables, 21/147 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/336 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (OVERLAPS) 0/336 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Real declared 336/336 variables, and 147 constraints, problems are : Problem set: 0 solved, 126 unsolved in 8379 ms.
Refiners :[State Equation: 147/147 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 126 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (OVERLAPS) 189/315 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/315 variables, 126/252 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/315 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (OVERLAPS) 21/336 variables, 21/273 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/336 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (OVERLAPS) 0/336 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Int declared 336/336 variables, and 273 constraints, problems are : Problem set: 0 solved, 126 unsolved in 7407 ms.
Refiners :[State Equation: 147/147 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15800ms problems are : Problem set: 0 solved, 126 unsolved
Search for dead transitions found 0 dead transitions in 15800ms
Starting structural reductions in SI_LTL mode, iteration 1 : 147/2717 places, 189/2354 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16067 ms. Remains : 147/2717 places, 189/2354 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 87 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-05
Product exploration explored 100000 steps with 5285 reset in 445 ms.
Product exploration explored 100000 steps with 5280 reset in 572 ms.
Computed a total of 147 stabilizing places and 189 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 147 transition count 189
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Property proved to be false by K+ with min(phi)
Knowledge based reduction with 4 factoid took 26 ms. Proved property starting from automaton with 2 states, 3 edges and 1 AP (stutter insensitive
Knowledge-based reduction took 120 ms.
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-05 FALSE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-05 finished in 17323 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)))'
Support contains 21 out of 2717 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2717/2717 places, 2354/2354 transitions.
Reduce places removed 23 places and 0 transitions.
Discarding 294 places :
Implicit places reduction removed 294 places
Iterating post reduction 0 with 317 rules applied. Total rules applied 317 place count 2400 transition count 2354
Discarding 127 places :
Symmetric choice reduction at 1 with 127 rule applications. Total rules 444 place count 2273 transition count 2227
Iterating global reduction 1 with 127 rules applied. Total rules applied 571 place count 2273 transition count 2227
Discarding 83 places :
Symmetric choice reduction at 1 with 83 rule applications. Total rules 654 place count 2190 transition count 2144
Iterating global reduction 1 with 83 rules applied. Total rules applied 737 place count 2190 transition count 2144
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 760 place count 2167 transition count 2081
Iterating global reduction 1 with 23 rules applied. Total rules applied 783 place count 2167 transition count 2081
Discarding 21 places :
Implicit places reduction removed 21 places
Iterating post reduction 1 with 21 rules applied. Total rules applied 804 place count 2146 transition count 2081
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 846 place count 2104 transition count 2039
Iterating global reduction 2 with 42 rules applied. Total rules applied 888 place count 2104 transition count 2039
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 930 place count 2062 transition count 1997
Iterating global reduction 2 with 42 rules applied. Total rules applied 972 place count 2062 transition count 1997
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1014 place count 2020 transition count 1955
Iterating global reduction 2 with 42 rules applied. Total rules applied 1056 place count 2020 transition count 1955
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1098 place count 1978 transition count 1913
Iterating global reduction 2 with 42 rules applied. Total rules applied 1140 place count 1978 transition count 1913
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1182 place count 1936 transition count 1871
Iterating global reduction 2 with 42 rules applied. Total rules applied 1224 place count 1936 transition count 1871
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1266 place count 1894 transition count 1829
Iterating global reduction 2 with 42 rules applied. Total rules applied 1308 place count 1894 transition count 1829
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1350 place count 1852 transition count 1787
Iterating global reduction 2 with 42 rules applied. Total rules applied 1392 place count 1852 transition count 1787
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1434 place count 1810 transition count 1745
Iterating global reduction 2 with 42 rules applied. Total rules applied 1476 place count 1810 transition count 1745
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1518 place count 1768 transition count 1703
Iterating global reduction 2 with 42 rules applied. Total rules applied 1560 place count 1768 transition count 1703
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1602 place count 1726 transition count 1661
Iterating global reduction 2 with 42 rules applied. Total rules applied 1644 place count 1726 transition count 1661
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1686 place count 1684 transition count 1619
Iterating global reduction 2 with 42 rules applied. Total rules applied 1728 place count 1684 transition count 1619
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1770 place count 1642 transition count 1577
Iterating global reduction 2 with 42 rules applied. Total rules applied 1812 place count 1642 transition count 1577
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1854 place count 1600 transition count 1535
Iterating global reduction 2 with 42 rules applied. Total rules applied 1896 place count 1600 transition count 1535
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 2 with 42 rules applied. Total rules applied 1938 place count 1600 transition count 1493
Applied a total of 1938 rules in 2948 ms. Remains 1600 /2717 variables (removed 1117) and now considering 1493/2354 (removed 861) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17124976984531617936.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11003206977277709209.kers'
[2026-05-24 10:40:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17124976984531617936.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11003206977277709209.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1493 rows 1600 cols 3321 entries
Finished phase 1 with 1367 SingleSign rule and 105 generalized
[2026-05-24 10:40:13] [INFO ] Computed 128 invariants in 9 ms
Computed 128 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-11003206977277709209.kers
Total runtime 11 ms.
[2026-05-24 10:40:13] [INFO ] Implicit Places using invariants in 614 ms returned [801]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 615 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1599/2717 places, 1493/2354 transitions.
Applied a total of 0 rules in 112 ms. Remains 1599 /1599 variables (removed 0) and now considering 1493/1493 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3675 ms. Remains : 1599/2717 places, 1493/2354 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)))'
Stuttering acceptance computed with spot in 93 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-07
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-07 finished in 3815 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(!p0)&&F(G(p1)))))'
Support contains 105 out of 2717 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2717/2717 places, 2354/2354 transitions.
Graph (complete) has 3486 edges and 2717 vertex of which 2040 are kept as prefixes of interest. Removing 677 places using SCC suffix rule.7 ms
Discarding 677 places :
Also discarding 548 output transitions
Drop transitions (Output transitions of discarded places.) removed 548 transitions
Reduce places removed 21 places and 21 transitions.
Discarding 210 places :
Implicit places reduction removed 210 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1029 transitions
Trivial Post-agglo rules discarded 1029 transitions
Performed 1029 trivial Post agglomeration. Transition count delta: 1029
Iterating post reduction 0 with 1239 rules applied. Total rules applied 1240 place count 1809 transition count 756
Reduce places removed 1029 places and 0 transitions.
Performed 84 Post agglomeration using F-continuation condition.Transition count delta: 84
Iterating post reduction 1 with 1113 rules applied. Total rules applied 2353 place count 780 transition count 672
Reduce places removed 84 places and 0 transitions.
Iterating post reduction 2 with 84 rules applied. Total rules applied 2437 place count 696 transition count 672
Performed 231 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 231 Pre rules applied. Total rules applied 2437 place count 696 transition count 441
Deduced a syphon composed of 231 places in 0 ms
Ensure Unique test removed 105 places
Reduce places removed 336 places and 0 transitions.
Iterating global reduction 3 with 567 rules applied. Total rules applied 3004 place count 360 transition count 441
Discarding 65 places :
Symmetric choice reduction at 3 with 65 rule applications. Total rules 3069 place count 295 transition count 336
Iterating global reduction 3 with 65 rules applied. Total rules applied 3134 place count 295 transition count 336
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Iterating post reduction 3 with 42 rules applied. Total rules applied 3176 place count 295 transition count 294
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 4 with 21 rules applied. Total rules applied 3197 place count 274 transition count 294
Applied a total of 3197 rules in 77 ms. Remains 274 /2717 variables (removed 2443) and now considering 294/2354 (removed 2060) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6355052584425092939.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15868624628241770040.kers'
[2026-05-24 10:40:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6355052584425092939.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15868624628241770040.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 294 rows 274 cols 693 entries
Finished phase 1 with 231 SingleSign rule and 21 generalized
[2026-05-24 10:40:14] [INFO ] Computed 22 invariants in 2 ms
Computed 22 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-15868624628241770040.kers
Total runtime 3 ms.
[2026-05-24 10:40:14] [INFO ] Implicit Places using invariants in 112 ms returned [189]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 113 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 273/2717 places, 294/2354 transitions.
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 21 Pre rules applied. Total rules applied 0 place count 273 transition count 273
Deduced a syphon composed of 21 places in 0 ms
Ensure Unique test removed 21 places
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 0 with 63 rules applied. Total rules applied 63 place count 231 transition count 273
Applied a total of 63 rules in 17 ms. Remains 231 /273 variables (removed 42) and now considering 273/294 (removed 21) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13960818073428026848.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3217212811326539418.kers'
[2026-05-24 10:40:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13960818073428026848.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3217212811326539418.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 273 rows 231 cols 525 entries
Finished phase 1 with 231 SingleSign rule and 0 generalized
[2026-05-24 10:40:14] [INFO ] Computed 0 invariants in 2 ms
Computed 0 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-3217212811326539418.kers
Total runtime 3 ms.
[2026-05-24 10:40:14] [INFO ] Implicit Places using invariants in 67 ms returned []
[2026-05-24 10:40:14] [INFO ] Invariant cache hit.
[2026-05-24 10:40:14] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 231/2717 places, 273/2354 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 441 ms. Remains : 231/2717 places, 273/2354 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(!p0)&&F(G(p1)))))'
Stuttering acceptance computed with spot in 171 ms :[true, (NOT p0), p0, (NOT p1)]
Running random walk in product with property : FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-08
Stuttering criterion allowed to conclude after 147 steps with 0 reset in 0 ms.
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-08 finished in 651 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))&&(X(X(G(p1)))||(X(X(p1))&&F(p0)))))'
Support contains 168 out of 2717 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2717/2717 places, 2354/2354 transitions.
Reduce places removed 44 places and 0 transitions.
Discarding 294 places :
Implicit places reduction removed 294 places
Iterating post reduction 0 with 338 rules applied. Total rules applied 338 place count 2379 transition count 2354
Discarding 148 places :
Symmetric choice reduction at 1 with 148 rule applications. Total rules 486 place count 2231 transition count 2206
Iterating global reduction 1 with 148 rules applied. Total rules applied 634 place count 2231 transition count 2206
Discarding 104 places :
Symmetric choice reduction at 1 with 104 rule applications. Total rules 738 place count 2127 transition count 2102
Iterating global reduction 1 with 104 rules applied. Total rules applied 842 place count 2127 transition count 2102
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 885 place count 2084 transition count 2019
Iterating global reduction 1 with 43 rules applied. Total rules applied 928 place count 2084 transition count 2019
Discarding 21 places :
Implicit places reduction removed 21 places
Iterating post reduction 1 with 21 rules applied. Total rules applied 949 place count 2063 transition count 2019
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 969 place count 2043 transition count 1979
Iterating global reduction 2 with 20 rules applied. Total rules applied 989 place count 2043 transition count 1979
Applied a total of 989 rules in 858 ms. Remains 2043 /2717 variables (removed 674) and now considering 1979/2354 (removed 375) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11771986364671899948.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8945937065857984097.kers'
[2026-05-24 10:40:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11771986364671899948.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8945937065857984097.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1979 rows 2043 cols 4335 entries
Finished phase 1 with 1810 SingleSign rule and 105 generalized
[2026-05-24 10:40:15] [INFO ] Computed 128 invariants in 28 ms
Computed 128 P flows in 29 ms.
Exported basis to /tmp/petrispot-output-8945937065857984097.kers
Total runtime 32 ms.
[2026-05-24 10:40:16] [INFO ] Implicit Places using invariants in 1016 ms returned [1286]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1018 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2042/2717 places, 1979/2354 transitions.
Applied a total of 0 rules in 156 ms. Remains 2042 /2042 variables (removed 0) and now considering 1979/1979 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2038 ms. Remains : 2042/2717 places, 1979/2354 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))&&(X(X(G(p1)))||(X(X(p1))&&F(p0)))))'
Stuttering acceptance computed with spot in 178 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), true]
Running random walk in product with property : FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-09
Stuttering criterion allowed to conclude after 1215 steps with 0 reset in 11 ms.
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-09 finished in 2280 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||F(G(p1))) U G(p2)))'
Support contains 168 out of 2717 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2717/2717 places, 2354/2354 transitions.
Graph (complete) has 3486 edges and 2717 vertex of which 2608 are kept as prefixes of interest. Removing 109 places using SCC suffix rule.6 ms
Discarding 109 places :
Also discarding 65 output transitions
Drop transitions (Output transitions of discarded places.) removed 65 transitions
Reduce places removed 21 places and 21 transitions.
Discarding 294 places :
Implicit places reduction removed 294 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1365 transitions
Trivial Post-agglo rules discarded 1365 transitions
Performed 1365 trivial Post agglomeration. Transition count delta: 1365
Iterating post reduction 0 with 1659 rules applied. Total rules applied 1660 place count 2293 transition count 903
Reduce places removed 1365 places and 0 transitions.
Performed 105 Post agglomeration using F-continuation condition.Transition count delta: 105
Iterating post reduction 1 with 1470 rules applied. Total rules applied 3130 place count 928 transition count 798
Reduce places removed 105 places and 0 transitions.
Iterating post reduction 2 with 105 rules applied. Total rules applied 3235 place count 823 transition count 798
Performed 273 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 273 Pre rules applied. Total rules applied 3235 place count 823 transition count 525
Deduced a syphon composed of 273 places in 0 ms
Ensure Unique test removed 105 places
Reduce places removed 378 places and 0 transitions.
Iterating global reduction 3 with 651 rules applied. Total rules applied 3886 place count 445 transition count 525
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 3 with 42 rules applied. Total rules applied 3928 place count 445 transition count 483
Reduce places removed 42 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Discarding 21 places :
Implicit places reduction removed 21 places
Iterating post reduction 4 with 84 rules applied. Total rules applied 4012 place count 382 transition count 462
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 21 Pre rules applied. Total rules applied 4012 place count 382 transition count 441
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 5 with 42 rules applied. Total rules applied 4054 place count 361 transition count 441
Discarding 42 places :
Symmetric choice reduction at 5 with 42 rule applications. Total rules 4096 place count 319 transition count 399
Iterating global reduction 5 with 42 rules applied. Total rules applied 4138 place count 319 transition count 399
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 5 with 42 rules applied. Total rules applied 4180 place count 298 transition count 378
Applied a total of 4180 rules in 103 ms. Remains 298 /2717 variables (removed 2419) and now considering 378/2354 (removed 1976) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6231480030179490863.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-310897820327074177.kers'
[2026-05-24 10:40:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6231480030179490863.kers, --Pflows, --basisKERS=/tmp/petrispot-output-310897820327074177.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 378 rows 298 cols 945 entries
Finished phase 1 with 254 SingleSign rule and 21 generalized
[2026-05-24 10:40:17] [INFO ] Computed 23 invariants in 2 ms
Computed 23 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-310897820327074177.kers
Total runtime 4 ms.
[2026-05-24 10:40:17] [INFO ] Implicit Places using invariants in 269 ms returned [256, 257, 258, 259, 260, 261, 262, 263, 264, 265, 266, 267, 268, 269, 270, 271, 272, 273, 274, 275, 276]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 270 ms to find 21 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 277/2717 places, 378/2354 transitions.
Applied a total of 0 rules in 7 ms. Remains 277 /277 variables (removed 0) and now considering 378/378 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 381 ms. Remains : 277/2717 places, 378/2354 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||F(G(p1))) U G(p2)))'
Stuttering acceptance computed with spot in 154 ms :[(NOT p2), (NOT p1), (AND (NOT p1) (NOT p2) p0)]
Running random walk in product with property : FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-10
Stuttering criterion allowed to conclude after 153 steps with 0 reset in 1 ms.
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-10 finished in 577 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(p1))) U p2) U X(G((G(p3) U p2)))))'
Support contains 232 out of 2717 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2717/2717 places, 2354/2354 transitions.
Reduce places removed 22 places and 0 transitions.
Discarding 231 places :
Implicit places reduction removed 231 places
Iterating post reduction 0 with 253 rules applied. Total rules applied 253 place count 2464 transition count 2354
Discarding 127 places :
Symmetric choice reduction at 1 with 127 rule applications. Total rules 380 place count 2337 transition count 2227
Iterating global reduction 1 with 127 rules applied. Total rules applied 507 place count 2337 transition count 2227
Discarding 63 places :
Symmetric choice reduction at 1 with 63 rule applications. Total rules 570 place count 2274 transition count 2164
Iterating global reduction 1 with 63 rules applied. Total rules applied 633 place count 2274 transition count 2164
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 656 place count 2251 transition count 2101
Iterating global reduction 1 with 23 rules applied. Total rules applied 679 place count 2251 transition count 2101
Discarding 21 places :
Implicit places reduction removed 21 places
Iterating post reduction 1 with 21 rules applied. Total rules applied 700 place count 2230 transition count 2101
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 742 place count 2188 transition count 2059
Iterating global reduction 2 with 42 rules applied. Total rules applied 784 place count 2188 transition count 2059
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 826 place count 2146 transition count 2017
Iterating global reduction 2 with 42 rules applied. Total rules applied 868 place count 2146 transition count 2017
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 910 place count 2104 transition count 1975
Iterating global reduction 2 with 42 rules applied. Total rules applied 952 place count 2104 transition count 1975
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 994 place count 2062 transition count 1933
Iterating global reduction 2 with 42 rules applied. Total rules applied 1036 place count 2062 transition count 1933
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1078 place count 2020 transition count 1891
Iterating global reduction 2 with 42 rules applied. Total rules applied 1120 place count 2020 transition count 1891
Applied a total of 1120 rules in 2175 ms. Remains 2020 /2717 variables (removed 697) and now considering 1891/2354 (removed 463) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15958834165334084978.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17727843343731145893.kers'
[2026-05-24 10:40:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15958834165334084978.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17727843343731145893.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1891 rows 2020 cols 4306 entries
Finished phase 1 with 1639 SingleSign rule and 168 generalized
[2026-05-24 10:40:19] [INFO ] Computed 213 invariants in 12 ms
Computed 213 P flows in 12 ms.
Exported basis to /tmp/petrispot-output-17727843343731145893.kers
Total runtime 15 ms.
[2026-05-24 10:40:20] [INFO ] Implicit Places using invariants in 999 ms returned [1241]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1002 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2019/2717 places, 1891/2354 transitions.
Applied a total of 0 rules in 236 ms. Remains 2019 /2019 variables (removed 0) and now considering 1891/1891 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3414 ms. Remains : 2019/2717 places, 1891/2354 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(p1))) U p2) U X(G((G(p3) U p2)))))'
Stuttering acceptance computed with spot in 813 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p3)), (NOT p2), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p2) p3) (AND (NOT p1) (NOT p2) p3)), (NOT p1), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) p3)), (NOT p2), (NOT p2), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3))]
Running random walk in product with property : FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-12
Product exploration explored 100000 steps with 696 reset in 1227 ms.
Product exploration explored 100000 steps with 685 reset in 1215 ms.
Computed a total of 2019 stabilizing places and 1891 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2019 transition count 1891
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 60 factoid took 1660 ms. Reduced automaton from 15 states, 70 edges and 4 AP (stutter sensitive) to 8 states, 29 edges and 3 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 14 to 13
RANDOM walk for 40000 steps (32 resets) in 945 ms. (42 steps per ms) remains 4/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 379 ms. (105 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 307 ms. (129 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 225 ms. (177 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 232 ms. (171 steps per ms) remains 4/4 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2833928191372042556.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15576511558618280771.kers'
[2026-05-24 10:40:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2833928191372042556.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15576511558618280771.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1891 rows 2019 cols 4264 entries
Finished phase 1 with 1660 SingleSign rule and 147 generalized
[2026-05-24 10:40:27] [INFO ] Computed 212 invariants in 12 ms
Computed 212 P flows in 12 ms.
Exported basis to /tmp/petrispot-output-15576511558618280771.kers
Total runtime 15 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/211 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1530/1741 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1741 variables, 60/102 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1741 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem apf4 is UNSAT
At refinement iteration 4 (OVERLAPS) 267/2008 variables, 105/207 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2008 variables, 0/207 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 10/2018 variables, 5/212 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2018 variables, 0/212 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1890/3908 variables, 2018/2230 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3908 variables, 0/2230 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 2/3910 variables, 1/2231 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3910 variables, 0/2231 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/3910 variables, 0/2231 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3910/3910 variables, and 2231 constraints, problems are : Problem set: 1 solved, 3 unsolved in 2602 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, Generalized P Invariants (flows): 170/170 constraints, State Equation: 2019/2019 constraints, PredecessorRefiner: 4/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/211 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1530/1741 variables, 42/42 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1741 variables, 60/102 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1741 variables, 0/102 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 267/2008 variables, 105/207 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2008 variables, 0/207 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 10/2018 variables, 5/212 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2018 variables, 0/212 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1890/3908 variables, 2018/2230 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3908 variables, 0/2230 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 2/3910 variables, 1/2231 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3910 variables, 0/2231 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/3910 variables, 0/2231 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3910/3910 variables, and 2231 constraints, problems are : Problem set: 1 solved, 3 unsolved in 4496 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, Generalized P Invariants (flows): 170/170 constraints, State Equation: 2019/2019 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7148ms problems are : Problem set: 1 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 681 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=113 )
Parikh walk visited 3 properties in 672 ms.
Found 1 invariant AP formulas.
Knowledge based reduction with 61 factoid took 1182 ms. Reduced automaton from 8 states, 29 edges and 3 AP (stutter sensitive) to 7 states, 24 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 309 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p3))), (NOT p2), (NOT p0), (NOT p2), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p3)))]
Knowledge-based reduction took 12364 ms.
Stuttering acceptance computed with spot in 311 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p3))), (NOT p2), (NOT p0), (NOT p2), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p3)))]
Support contains 211 out of 2019 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 2019/2019 places, 1891/1891 transitions.
Applied a total of 0 rules in 166 ms. Remains 2019 /2019 variables (removed 0) and now considering 1891/1891 (removed 0) transitions.
[2026-05-24 10:40:37] [INFO ] Invariant cache hit.
[2026-05-24 10:40:38] [INFO ] Implicit Places using invariants in 872 ms returned []
[2026-05-24 10:40:38] [INFO ] Invariant cache hit.
[2026-05-24 10:40:41] [INFO ] Implicit Places using invariants and state equation in 2887 ms returned []
Implicit Place search using SMT with State Equation took 3761 ms to find 0 implicit places.
Running 1870 sub problems to find dead transitions.
[2026-05-24 10:40:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1976 variables, 168/168 constraints. Problems are: Problem set: 0 solved, 1870 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1976/3910 variables, and 168 constraints, problems are : Problem set: 0 solved, 1870 unsolved in 30081 ms.
Refiners :[Positive P Invariants (semi-flows): 0/42 constraints, Generalized P Invariants (flows): 168/170 constraints, State Equation: 0/2019 constraints, PredecessorRefiner: 1870/1870 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1870 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1976 variables, 168/168 constraints. Problems are: Problem set: 0 solved, 1870 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 1976/3910 variables, and 168 constraints, problems are : Problem set: 0 solved, 1870 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 0/42 constraints, Generalized P Invariants (flows): 168/170 constraints, State Equation: 0/2019 constraints, PredecessorRefiner: 0/1870 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60854ms problems are : Problem set: 0 solved, 1870 unsolved
Search for dead transitions found 0 dead transitions in 60863ms
Finished structural reductions in LTL mode , in 1 iterations and 64801 ms. Remains : 2019/2019 places, 1891/1891 transitions.
Computed a total of 2019 stabilizing places and 1891 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2019 transition count 1891
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 24 factoid took 311 ms. Reduced automaton from 7 states, 24 edges and 3 AP (stutter sensitive) to 7 states, 24 edges and 3 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 10 to 9
RANDOM walk for 40000 steps (32 resets) in 338 ms. (117 steps per ms) remains 1/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 186 ms. (213 steps per ms) remains 1/1 properties
[2026-05-24 10:41:43] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1590/1738 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1738 variables, 60/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1738 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 270/2008 variables, 105/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2008 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 10/2018 variables, 5/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2018 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1890/3908 variables, 2018/2230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3908 variables, 0/2230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/3910 variables, 1/2231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3910 variables, 0/2231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/3910 variables, 0/2231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3910/3910 variables, and 2231 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1864 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, Generalized P Invariants (flows): 170/170 constraints, State Equation: 2019/2019 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1590/1738 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1738 variables, 60/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1738 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 270/2008 variables, 105/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2008 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 10/2018 variables, 5/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2018 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1890/3908 variables, 2018/2230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3908 variables, 0/2230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/3910 variables, 1/2231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3910 variables, 0/2231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/3910 variables, 0/2231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3910/3910 variables, and 2231 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1956 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, Generalized P Invariants (flows): 170/170 constraints, State Equation: 2019/2019 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3840ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 662 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=132 )
Parikh walk visited 1 properties in 6 ms.
Knowledge based reduction with 24 factoid took 849 ms. Reduced automaton from 7 states, 24 edges and 3 AP (stutter sensitive) to 7 states, 24 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 307 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p3))), (NOT p2), (NOT p0), (NOT p2), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p3)))]
Knowledge-based reduction took 6437 ms.
Stuttering acceptance computed with spot in 307 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p3))), (NOT p2), (NOT p0), (NOT p2), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p3)))]
Stuttering acceptance computed with spot in 325 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p3))), (NOT p2), (NOT p0), (NOT p2), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p3)))]
Product exploration explored 100000 steps with 694 reset in 1017 ms.
Product exploration explored 100000 steps with 712 reset in 1052 ms.
Spot run failed in 56 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/ltsmin12418482413760883573
[2026-05-24 10:41:51] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12418482413760883573
Running compilation step : cd /tmp/ltsmin12418482413760883573;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12418482413760883573;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12418482413760883573;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 211 out of 2019 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2019/2019 places, 1891/1891 transitions.
Applied a total of 0 rules in 143 ms. Remains 2019 /2019 variables (removed 0) and now considering 1891/1891 (removed 0) transitions.
[2026-05-24 10:41:54] [INFO ] Invariant cache hit.
[2026-05-24 10:41:55] [INFO ] Implicit Places using invariants in 795 ms returned []
[2026-05-24 10:41:55] [INFO ] Invariant cache hit.
[2026-05-24 10:41:58] [INFO ] Implicit Places using invariants and state equation in 2909 ms returned []
Implicit Place search using SMT with State Equation took 3708 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 3854 ms. Remains : 2019/2019 places, 1891/1891 transitions.
Built C files in :
/tmp/ltsmin1400416769996585337
[2026-05-24 10:41:58] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1400416769996585337
Running compilation step : cd /tmp/ltsmin1400416769996585337;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1400416769996585337;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1400416769996585337;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2026-05-24 10:42:01] [INFO ] Flatten gal took : 60 ms
[2026-05-24 10:42:01] [INFO ] Flatten gal took : 47 ms
[2026-05-24 10:42:01] [INFO ] Time to serialize gal into /tmp/LTL14412016862946930357.gal : 8 ms
[2026-05-24 10:42:01] [INFO ] Time to serialize properties into /tmp/LTL9686085942185401003.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/LTL14412016862946930357.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2749505211660822526.hoa' '-atoms' '/tmp/LTL9686085942185401003.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...318
Loading property file /tmp/LTL9686085942185401003.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2749505211660822526.hoa
Detected timeout of ITS tools.
[2026-05-24 10:42:16] [INFO ] Flatten gal took : 44 ms
[2026-05-24 10:42:16] [INFO ] Flatten gal took : 44 ms
[2026-05-24 10:42:16] [INFO ] Time to serialize gal into /tmp/LTL10962398041799130230.gal : 9 ms
[2026-05-24 10:42:16] [INFO ] Time to serialize properties into /tmp/LTL17310599339716826166.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10962398041799130230.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17310599339716826166.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...277
Read 1 LTL properties
Checking formula 0 : !((((F(("(((((((m4_0+m4_1)+(m4_2+m4_3))+((m4_4+m4_5)+(m4_6+m4_7)))+(((m4_8+m4_9)+(m4_10+m4_11))+((m4_12+m4_13)+(m4_14+m4_15))))+((((m4...2775
Formula 0 simplified : (G(!"(((((((m4_0+m4_1)+(m4_2+m4_3))+((m4_4+m4_5)+(m4_6+m4_7)))+(((m4_8+m4_9)+(m4_10+m4_11))+((m4_12+m4_13)+(m4_14+m4_15))))+((((m4_1...2764
Detected timeout of ITS tools.
[2026-05-24 10:42:31] [INFO ] Flatten gal took : 37 ms
[2026-05-24 10:42:31] [INFO ] Applying decomposition
[2026-05-24 10:42:31] [INFO ] Flatten gal took : 38 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/graph3743574048120211298.txt' '-o' '/tmp/graph3743574048120211298.bin' '-w' '/tmp/graph3743574048120211298.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph3743574048120211298.bin' '-l' '-1' '-v' '-w' '/tmp/graph3743574048120211298.weights' '-q' '0' '-e' '0.001'
[2026-05-24 10:42:31] [INFO ] Decomposing Gal with order
[2026-05-24 10:42:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 10:42:32] [INFO ] Removed a total of 227 redundant transitions.
[2026-05-24 10:42:32] [INFO ] Flatten gal took : 190 ms
[2026-05-24 10:42:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 136 labels/synchronizations in 57 ms.
[2026-05-24 10:42:32] [INFO ] Time to serialize gal into /tmp/LTL332210851999033889.gal : 16 ms
[2026-05-24 10:42:32] [INFO ] Time to serialize properties into /tmp/LTL8014029629325063167.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/LTL332210851999033889.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8014029629325063167.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...274
Read 1 LTL properties
Checking formula 0 : !((((F(("(((((((gu247.m4_0+gu247.m4_1)+(gu247.m4_2+gu247.m4_3))+((gu247.m4_4+gu247.m4_5)+(gu247.m4_6+gu247.m4_7)))+(((gu247.m4_8+gu247...5091
Formula 0 simplified : (G(!"(((((((gu247.m4_0+gu247.m4_1)+(gu247.m4_2+gu247.m4_3))+((gu247.m4_4+gu247.m4_5)+(gu247.m4_6+gu247.m4_7)))+(((gu247.m4_8+gu247.m...5080
Detected timeout of ITS tools.
Treatment of property FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-12 finished in 150361 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((G(F((G(F(p0))||(p1&&F(p0)))))||(F(p2)&&X(X(F((G(F(p0))||(p1&&F(p0)))))))))))'
Support contains 148 out of 2717 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2717/2717 places, 2354/2354 transitions.
Reduce places removed 43 places and 0 transitions.
Discarding 273 places :
Implicit places reduction removed 273 places
Iterating post reduction 0 with 316 rules applied. Total rules applied 316 place count 2401 transition count 2354
Discarding 106 places :
Symmetric choice reduction at 1 with 106 rule applications. Total rules 422 place count 2295 transition count 2248
Iterating global reduction 1 with 106 rules applied. Total rules applied 528 place count 2295 transition count 2248
Discarding 62 places :
Symmetric choice reduction at 1 with 62 rule applications. Total rules 590 place count 2233 transition count 2186
Iterating global reduction 1 with 62 rules applied. Total rules applied 652 place count 2233 transition count 2186
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 693 place count 2192 transition count 2145
Iterating global reduction 1 with 41 rules applied. Total rules applied 734 place count 2192 transition count 2145
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 754 place count 2172 transition count 2105
Iterating global reduction 1 with 20 rules applied. Total rules applied 774 place count 2172 transition count 2105
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 794 place count 2152 transition count 2085
Iterating global reduction 1 with 20 rules applied. Total rules applied 814 place count 2152 transition count 2085
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 834 place count 2132 transition count 2065
Iterating global reduction 1 with 20 rules applied. Total rules applied 854 place count 2132 transition count 2065
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 874 place count 2112 transition count 2045
Iterating global reduction 1 with 20 rules applied. Total rules applied 894 place count 2112 transition count 2045
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 914 place count 2092 transition count 2025
Iterating global reduction 1 with 20 rules applied. Total rules applied 934 place count 2092 transition count 2025
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 954 place count 2072 transition count 2005
Iterating global reduction 1 with 20 rules applied. Total rules applied 974 place count 2072 transition count 2005
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 994 place count 2052 transition count 1985
Iterating global reduction 1 with 20 rules applied. Total rules applied 1014 place count 2052 transition count 1985
Applied a total of 1014 rules in 2099 ms. Remains 2052 /2717 variables (removed 665) and now considering 1985/2354 (removed 369) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6896596730627703080.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1882881229586058265.kers'
[2026-05-24 10:42:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6896596730627703080.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1882881229586058265.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 1985 rows 2052 cols 4455 entries
Finished phase 1 with 1756 SingleSign rule and 125 generalized
[2026-05-24 10:42:50] [INFO ] Computed 171 invariants in 35 ms
Computed 171 P flows in 36 ms.
Exported basis to /tmp/petrispot-output-1882881229586058265.kers
Total runtime 38 ms.
[2026-05-24 10:42:51] [INFO ] Implicit Places using invariants in 995 ms returned [1317, 1318, 1319, 1320, 1321, 1322, 1323, 1324, 1325, 1326, 1327, 1328, 1329, 1330, 1331, 1332, 1333, 1334, 1335, 1336, 1337]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 999 ms to find 21 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2031/2717 places, 1985/2354 transitions.
Applied a total of 0 rules in 263 ms. Remains 2031 /2031 variables (removed 0) and now considering 1985/1985 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3362 ms. Remains : 2031/2717 places, 1985/2354 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((G(F((G(F(p0))||(p1&&F(p0)))))||(F(p2)&&X(X(F((G(F(p0))||(p1&&F(p0)))))))))))'
Stuttering acceptance computed with spot in 377 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p2) (NOT p0)), (NOT p0), (AND (NOT p2) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-13
Product exploration explored 100000 steps with 889 reset in 780 ms.
Product exploration explored 100000 steps with 906 reset in 568 ms.
Computed a total of 2031 stabilizing places and 1985 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2031 transition count 1985
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 12 ms. Proved property starting from automaton with 8 states, 13 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 823 ms.
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-13 finished in 5979 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 42 out of 2717 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2717/2717 places, 2354/2354 transitions.
Graph (complete) has 3486 edges and 2717 vertex of which 1599 are kept as prefixes of interest. Removing 1118 places using SCC suffix rule.4 ms
Discarding 1118 places :
Also discarding 926 output transitions
Drop transitions (Output transitions of discarded places.) removed 926 transitions
Reduce places removed 21 places and 21 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Discarding 252 places :
Implicit places reduction removed 252 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1092 transitions
Trivial Post-agglo rules discarded 1092 transitions
Performed 1092 trivial Post agglomeration. Transition count delta: 1092
Iterating post reduction 0 with 1365 rules applied. Total rules applied 1366 place count 1326 transition count 294
Reduce places removed 1092 places and 0 transitions.
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Iterating post reduction 1 with 1113 rules applied. Total rules applied 2479 place count 234 transition count 273
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 2 with 21 rules applied. Total rules applied 2500 place count 213 transition count 273
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 2500 place count 213 transition count 252
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 2542 place count 192 transition count 252
Discarding 44 places :
Symmetric choice reduction at 3 with 44 rule applications. Total rules 2586 place count 148 transition count 168
Iterating global reduction 3 with 44 rules applied. Total rules applied 2630 place count 148 transition count 168
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Discarding 21 places :
Implicit places reduction removed 21 places
Iterating post reduction 3 with 63 rules applied. Total rules applied 2693 place count 127 transition count 126
Reduce places removed 21 places and 21 transitions.
Iterating global reduction 4 with 21 rules applied. Total rules applied 2714 place count 106 transition count 105
Applied a total of 2714 rules in 37 ms. Remains 106 /2717 variables (removed 2611) and now considering 105/2354 (removed 2249) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2941315961090768269.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6818810412018995845.kers'
[2026-05-24 10:42:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2941315961090768269.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6818810412018995845.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 105 rows 106 cols 210 entries
Finished phase 1 with 84 SingleSign rule and 21 generalized
[2026-05-24 10:42:54] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6818810412018995845.kers
Total runtime 1 ms.
[2026-05-24 10:42:54] [INFO ] Implicit Places using invariants in 79 ms returned [63]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 80 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 105/2717 places, 105/2354 transitions.
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 105 transition count 84
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 42 place count 84 transition count 84
Applied a total of 42 rules in 3 ms. Remains 84 /105 variables (removed 21) and now considering 84/105 (removed 21) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1840847441971148568.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10904597388803207532.kers'
[2026-05-24 10:42:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1840847441971148568.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10904597388803207532.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 84 rows 84 cols 147 entries
Finished phase 1 with 84 SingleSign rule and 0 generalized
[2026-05-24 10:42:54] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10904597388803207532.kers
Total runtime 1 ms.
[2026-05-24 10:42:54] [INFO ] Implicit Places using invariants in 34 ms returned []
[2026-05-24 10:42:54] [INFO ] Invariant cache hit.
[2026-05-24 10:42:54] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 84/2717 places, 84/2354 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 235 ms. Remains : 84/2717 places, 84/2354 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 44 ms :[(NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-14
Stuttering criterion allowed to conclude after 84 steps with 0 reset in 0 ms.
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-14 finished in 308 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)||(p0&&F(p1))) U X(X(p2)))))'
Spot run failed in 56 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.
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(p1))) U p2) U X(G((G(p3) U p2)))))'
Spot run failed in 52 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 10:42:54] [INFO ] Flatten gal took : 86 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14100506735836636029
[2026-05-24 10:42:54] [INFO ] Too many transitions (2354) to apply POR reductions. Disabling POR matrices.
[2026-05-24 10:42:54] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14100506735836636029
Running compilation step : cd /tmp/ltsmin14100506735836636029;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '360' '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 10:42:54] [INFO ] Applying decomposition
[2026-05-24 10:42:54] [INFO ] Flatten gal took : 97 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/graph8842451894364518519.txt' '-o' '/tmp/graph8842451894364518519.bin' '-w' '/tmp/graph8842451894364518519.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8842451894364518519.bin' '-l' '-1' '-v' '-w' '/tmp/graph8842451894364518519.weights' '-q' '0' '-e' '0.001'
[2026-05-24 10:42:55] [INFO ] Decomposing Gal with order
[2026-05-24 10:42:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 10:42:55] [INFO ] Removed a total of 325 redundant transitions.
[2026-05-24 10:42:55] [INFO ] Flatten gal took : 251 ms
[2026-05-24 10:42:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 108 labels/synchronizations in 57 ms.
[2026-05-24 10:42:56] [INFO ] Time to serialize gal into /tmp/LTLCardinality7312902675974397794.gal : 24 ms
[2026-05-24 10:42:56] [INFO ] Time to serialize properties into /tmp/LTLCardinality1578979218420690795.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality7312902675974397794.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality1578979218420690795.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 2 LTL properties
Checking formula 0 : !((X(((G("(((((((gu282.l5_0+gu282.l5_1)+(gu282.l5_2+gu282.l5_3))+((gu282.l5_4+gu282.l5_5)+(gu282.l5_6+gu282.l5_7)))+(((gu282.l5_8+gu28...3918
Formula 0 simplified : X((F!"(((((((gu282.l5_0+gu282.l5_1)+(gu282.l5_2+gu282.l5_3))+((gu282.l5_4+gu282.l5_5)+(gu282.l5_6+gu282.l5_7)))+(((gu282.l5_8+gu282....3907
Compilation finished in 9486 ms.
Running link step : cd /tmp/ltsmin14100506735836636029;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 73 ms.
Running LTSmin : cd /tmp/ltsmin14100506735836636029;'/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((([]((LTLAPp0==true))||((LTLAPp0==true)&&<>((LTLAPp1==true)))) U X(X((LTLAPp2==true)))))' '--buchi-type=spotba'
LTSmin run took 5018 ms.
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-00 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin14100506735836636029;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '((<>(((LTLAPp3==true)&&<>((LTLAPp4==true)))) U (LTLAPp5==true)) U X([](([]((LTLAPp6==true)) U (LTLAPp5==true)))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin14100506735836636029;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '((<>(((LTLAPp3==true)&&<>((LTLAPp4==true)))) U (LTLAPp5==true)) U X([](([]((LTLAPp6==true)) U (LTLAPp5==true)))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 14400 s
Running LTSmin : cd /tmp/ltsmin14100506735836636029;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '((<>(((LTLAPp3==true)&&<>((LTLAPp4==true)))) U (LTLAPp5==true)) U X([](([]((LTLAPp6==true)) U (LTLAPp5==true)))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2026-05-24 11:05:25] [INFO ] Applying decomposition
[2026-05-24 11:05:28] [INFO ] Flatten gal took : 1320 ms
[2026-05-24 11:05:28] [INFO ] Decomposing Gal with order
[2026-05-24 11:05:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 11:05:30] [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, l40_0],[gl1_1, l37_1],[gl1_2, l37_2, l39_2, l40_2],[gl1_3, l37_3],[gl1_4, l37_4, l39_4, l40_4],[gl1_5, l37_5],[gl1_6, l37_6, l39_6, l40_6],[gl1_7, l37_7],[gl1_8, l37_8, l39_8, l40_8],[gl1_9, l37_9],[gl1_10, l37_10, l39_10, l40_10],[gl1_11, l37_11],[gl1_12, l37_12, l39_12, l40_12],[gl1_13, l37_13],[gl1_14, l37_14, l39_14, l40_14],[gl1_15, l37_15],[gl1_16, l37_16, l39_16, l40_16],[gl1_17, l37_17],[gl1_18, l37_18, l39_18, l40_18],[gl1_19, l37_19],[gl1_20, l37_20, l39_20, l40_20],[gl1_21, l37_21],[gl1_22, l37_22, l39_22, l40_22],[gl1_23, l37_23],[gl1_24, l37_24, l39_24, l40_24],[gl1_25, l37_25],[gl1_26, l37_26, l39_26, l40_26],[gl1_27, l37_27],[gl1_28, l37_28, l39_28, l40_28],[gl1_29, l37_29],[gl1_30, l37_30, l39_30, l40_30],[gl1_31, l37_31],[gl1_32, l37_32, l39_32, l40_32],[gl1_33, l37_33],[gl1_34, l37_34, l39_34, l40_34],[gl1_35, l37_35],[gl1_36, l37_36, l39_36, l40_36],[gl1_37, l37_37],[gl1_38, l37_38, l39_38, l40_38],[gl1_39, l37_39],[gl1_40, l37_40, l39_40, l40_40],[gl1_41, l37_41],[lm0_0, l12_0, l0_0, l30_0, lc1_0, l32_0, lc2_0, l33_0, lc3_0, l34_0, cg0_0, l35_0, lg0_0, l8_0, l9_0, lm4_0, l38_0, l10_0, l11_0, l13_0, l14_0, l15_0, l17_0, lp0_0, l19_0, lp1_0, l20_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, lc1_1, l32_1, lc2_1, l33_1, lc3_1, l34_1, cg0_1, l35_1, lg0_1, l8_1, l9_1, lm4_1, l38_1, l10_1, l11_1, l13_1, l14_1, l15_1, l17_1, lp0_1, l19_1, lp1_1, l20_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, lc1_2, l32_2, lc2_2, l33_2, lc3_2, l34_2, cg0_2, l35_2, lg0_2, l8_2, l9_2, lm4_2, l38_2, l10_2, l11_2, l13_2, l14_2, l15_2, l17_2, lp0_2, l19_2, lp1_2, l20_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, lc1_3, l32_3, lc2_3, l33_3, lc3_3, l34_3, cg0_3, l35_3, lg0_3, l8_3, l9_3, lm4_3, l38_3, l10_3, l11_3, l13_3, l14_3, l15_3, l17_3, lp0_3, l19_3, lp1_3, l20_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, lc1_4, l32_4, lc2_4, l33_4, lc3_4, l34_4, cg0_4, l35_4, lg0_4, l8_4, l9_4, lm4_4, l38_4, l10_4, l11_4, l13_4, l14_4, l15_4, l17_4, lp0_4, l19_4, lp1_4, l20_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, lc1_5, l32_5, lc2_5, l33_5, lc3_5, l34_5, cg0_5, l35_5, lg0_5, l8_5, l9_5, lm4_5, l38_5, l10_5, l11_5, l13_5, l14_5, l15_5, l17_5, lp0_5, l19_5, lp1_5, l20_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, lc1_6, l32_6, lc2_6, l33_6, lc3_6, l34_6, cg0_6, l35_6, lg0_6, l8_6, l9_6, lm4_6, l38_6, l10_6, l11_6, l13_6, l14_6, l15_6, l17_6, lp0_6, l19_6, lp1_6, l20_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, lc1_7, l32_7, lc2_7, l33_7, lc3_7, l34_7, cg0_7, l35_7, lg0_7, l8_7, l9_7, lm4_7, l38_7, l10_7, l11_7, l13_7, l14_7, l15_7, l17_7, lp0_7, l19_7, lp1_7, l20_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, lc1_8, l32_8, lc2_8, l33_8, lc3_8, l34_8, cg0_8, l35_8, lg0_8, l8_8, l9_8, lm4_8, l38_8, l10_8, l11_8, l13_8, l14_8, l15_8, l17_8, lp0_8, l19_8, lp1_8, l20_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, lc1_9, l32_9, lc2_9, l33_9, lc3_9, l34_9, cg0_9, l35_9, lg0_9, l8_9, l9_9, lm4_9, l38_9, l10_9, l11_9, l13_9, l14_9, l15_9, l17_9, lp0_9, l19_9, lp1_9, l20_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, lc1_10, l32_10, lc2_10, l33_10, lc3_10, l34_10, cg0_10, l35_10, lg0_10, l8_10, l9_10, lm4_10, l38_10, l10_10, l11_10, l13_10, l14_10, l15_10, l17_10, lp0_10, l19_10, lp1_10, l20_10, l21_10, l22_10, l24_10, l25_10, l23_10, l28_10, l26_10, l27_10, l29_10],[lm0_11, l12_11, l0_11, l30_11, lc1_11, l32_11, lc2_11, l33_11, lc3_11, l34_11, cg0_11, l35_11, lg0_11, l8_11, l9_11, lm4_11, l38_11, l10_11, l11_11, l13_11, l14_11, l15_11, l17_11, lp0_11, l19_11, lp1_11, l20_11, l21_11, l22_11, l24_11, l25_11, l23_11, l28_11, l26_11, l27_11, l29_11],[lm0_12, l12_12, l0_12, l30_12, lc1_12, l32_12, lc2_12, l33_12, lc3_12, l34_12, cg0_12, l35_12, lg0_12, l8_12, l9_12, lm4_12, l38_12, l10_12, l11_12, l13_12, l14_12, l15_12, l17_12, lp0_12, l19_12, lp1_12, l20_12, l21_12, l22_12, l24_12, l25_12, l23_12, l28_12, l26_12, l27_12, l29_12],[lm0_13, l12_13, l0_13, l30_13, lc1_13, l32_13, lc2_13, l33_13, lc3_13, l34_13, cg0_13, l35_13, lg0_13, l8_13, l9_13, lm4_13, l38_13, l10_13, l11_13, l13_13, l14_13, l15_13, l17_13, lp0_13, l19_13, lp1_13, l20_13, l21_13, l22_13, l24_13, l25_13, l23_13, l28_13, l26_13, l27_13, l29_13],[lm0_14, l12_14, l0_14, l30_14, lc1_14, l32_14, lc2_14, l33_14, lc3_14, l34_14, cg0_14, l35_14, lg0_14, l8_14, l9_14, lm4_14, l38_14, l10_14, l11_14, l13_14, l14_14, l15_14, l17_14, lp0_14, l19_14, lp1_14, l20_14, l21_14, l22_14, l24_14, l25_14, l23_14, l28_14, l26_14, l27_14, l29_14],[lm0_15, l12_15, l0_15, l30_15, lc1_15, l32_15, lc2_15, l33_15, lc3_15, l34_15, cg0_15, l35_15, lg0_15, l8_15, l9_15, lm4_15, l38_15, l10_15, l11_15, l13_15, l14_15, l15_15, l17_15, lp0_15, l19_15, lp1_15, l20_15, l21_15, l22_15, l24_15, l25_15, l23_15, l28_15, l26_15, l27_15, l29_15],[lm0_16, l12_16, l0_16, l30_16, lc1_16, l32_16, lc2_16, l33_16, lc3_16, l34_16, cg0_16, l35_16, lg0_16, l8_16, l9_16, lm4_16, l38_16, l10_16, l11_16, l13_16, l14_16, l15_16, l17_16, lp0_16, l19_16, lp1_16, l20_16, l21_16, l22_16, l24_16, l25_16, l23_16, l28_16, l26_16, l27_16, l29_16],[lm0_17, l12_17, l0_17, l30_17, lc1_17, l32_17, lc2_17, l33_17, lc3_17, l34_17, cg0_17, l35_17, lg0_17, l8_17, l9_17, lm4_17, l38_17, l10_17, l11_17, l13_17, l14_17, l15_17, l17_17, lp0_17, l19_17, lp1_17, l20_17, l21_17, l22_17, l24_17, l25_17, l23_17, l28_17, l26_17, l27_17, l29_17],[lm0_18, l12_18, l0_18, l30_18, lc1_18, l32_18, lc2_18, l33_18, lc3_18, l34_18, cg0_18, l35_18, lg0_18, l8_18, l9_18, lm4_18, l38_18, l10_18, l11_18, l13_18, l14_18, l15_18, l17_18, lp0_18, l19_18, lp1_18, l20_18, l21_18, l22_18, l24_18, l25_18, l23_18, l28_18, l26_18, l27_18, l29_18],[lm0_19, l12_19, l0_19, l30_19, lc1_19, l32_19, lc2_19, l33_19, lc3_19, l34_19, cg0_19, l35_19, lg0_19, l8_19, l9_19, lm4_19, l38_19, l10_19, l11_19, l13_19, l14_19, l15_19, l17_19, lp0_19, l19_19, lp1_19, l20_19, l21_19, l22_19, l24_19, l25_19, l23_19, l28_19, l26_19, l27_19, l29_19],[lm0_20, l12_20, l0_20, l30_20, lc1_20, l32_20, lc2_20, l33_20, lc3_20, l34_20, cg0_20, l35_20, lg0_20, l8_20, l9_20, lm4_20, l38_20, l10_20, l11_20, l13_20, l14_20, l15_20, l17_20, lp0_20, l19_20, lp1_20, l20_20, l21_20, l22_20, l24_20, l25_20, l23_20, l28_20, l26_20, l27_20, l29_20],[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],[g1_11, gl0_11, g3_11],[g1_12, gl0_12, g3_12],[g1_13, gl0_13, g3_13],[g1_14, gl0_14, g3_14],[g1_15, gl0_15, g3_15],[g1_16, gl0_16, g3_16],[g1_17, gl0_17, g3_17],[g1_18, gl0_18, g3_18],[g1_19, gl0_19, g3_19],[g1_20, gl0_20, g3_20],[m8_0],[m8_1],[m8_2],[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, p9_1, pl0_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, p9_3, pl0_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, p9_5, pl0_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, p9_7, pl0_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, p9_9, pl0_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, p9_11, pl0_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, p9_13, pl0_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, p9_15, pl0_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, p9_17, pl0_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, p9_19, pl0_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, p9_21, pl0_21],[p1_22, p3_22, p2_22, p5_22, p4_22, p6_22, p9_22, pl0_22, pl1_22],[p1_23, p3_23, p2_23, p5_23, p4_23, p6_23, p9_23, pl0_23],[p1_24, p3_24, p2_24, p5_24, p4_24, p6_24, p9_24, pl0_24, pl1_24],[p1_25, p3_25, p2_25, p5_25, p4_25, p6_25, p9_25, pl0_25],[p1_26, p3_26, p2_26, p5_26, p4_26, p6_26, p9_26, pl0_26, pl1_26],[p1_27, p3_27, p2_27, p5_27, p4_27, p6_27, p9_27, pl0_27],[p1_28, p3_28, p2_28, p5_28, p4_28, p6_28, p9_28, pl0_28, pl1_28],[p1_29, p3_29, p2_29, p5_29, p4_29, p6_29, p9_29, pl0_29],[p1_30, p3_30, p2_30, p5_30, p4_30, p6_30, p9_30, pl0_30, pl1_30],[p1_31, p3_31, p2_31, p5_31, p4_31, p6_31, p9_31, pl0_31],[p1_32, p3_32, p2_32, p5_32, p4_32, p6_32, p9_32, pl0_32, pl1_32],[p1_33, p3_33, p2_33, p5_33, p4_33, p6_33, p9_33, pl0_33],[p1_34, p3_34, p2_34, p5_34, p4_34, p6_34, p9_34, pl0_34, pl1_34],[p1_35, p3_35, p2_35, p5_35, p4_35, p6_35, p9_35, pl0_35],[p1_36, p3_36, p2_36, p5_36, p4_36, p6_36, p9_36, pl0_36, pl1_36],[p1_37, p3_37, p2_37, p5_37, p4_37, p6_37, p9_37, pl0_37],[p1_38, p3_38, p2_38, p5_38, p4_38, p6_38, p9_38, pl0_38, pl1_38],[p1_39, p3_39, p2_39, p5_39, p4_39, p6_39, p9_39, pl0_39],[p1_40, p3_40, p2_40, p5_40, p4_40, p6_40, p9_40, pl0_40, pl1_40],[p1_41, p3_41, p2_41, p5_41, p4_41, p6_41, p9_41, pl0_41],[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, l7_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, ml3_1, l7_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, l7_2, m9_2, m10_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, ml3_3, l7_3, m9_3, m10_3, ml4_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, l7_4, m9_4, m10_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, ml3_5, l7_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, l7_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, ml3_7, l7_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, l7_8, m9_8, m10_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, ml3_9, l7_9, m9_9, m10_9, ml4_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, l7_10, m9_10, m10_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, ml3_11, l7_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, l7_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, ml3_13, l7_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, l7_14, m9_14, m10_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, ml3_15, l7_15, m9_15, m10_15, ml4_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, l7_16, m9_16, m10_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, ml3_17, l7_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, l7_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, ml3_19, l7_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, l7_20, m9_20, m10_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, ml3_21, l7_21, m9_21, m10_21, ml4_21],[m1_22, ml0_22, l2_22, m2_22, lm1_22, m3_22, ml1_22, l4_22, lm2_22, m4_22, m5_22, l5_22, ml2_22, l6_22, lm3_22, m7_22, ml3_22, l7_22, m9_22, m10_22],[m1_23, ml0_23, l2_23, m2_23, lm1_23, m3_23, ml1_23, l4_23, lm2_23, m4_23, m5_23, l5_23, ml2_23, l6_23, lm3_23, m7_23, ml3_23, l7_23, m9_23, m10_23],[m1_24, ml0_24, l2_24, m2_24, lm1_24, m3_24, ml1_24, l4_24, lm2_24, m4_24, m5_24, l5_24, ml2_24, l6_24, lm3_24, m7_24, ml3_24, l7_24, m9_24, m10_24, ml4_24],[m1_25, ml0_25, l2_25, m2_25, lm1_25, m3_25, ml1_25, l4_25, lm2_25, m4_25, m5_25, l5_25, ml2_25, l6_25, lm3_25, m7_25, ml3_25, l7_25, m9_25, m10_25],[m1_26, ml0_26, l2_26, m2_26, lm1_26, m3_26, ml1_26, l4_26, lm2_26, m4_26, m5_26, l5_26, ml2_26, l6_26, lm3_26, m7_26, ml3_26, l7_26, m9_26, m10_26],[m1_27, ml0_27, l2_27, m2_27, lm1_27, m3_27, ml1_27, l4_27, lm2_27, m4_27, m5_27, l5_27, ml2_27, l6_27, lm3_27, m7_27, ml3_27, l7_27, m9_27, m10_27, ml4_27],[m1_28, ml0_28, l2_28, m2_28, lm1_28, m3_28, ml1_28, l4_28, lm2_28, m4_28, m5_28, l5_28, ml2_28, l6_28, lm3_28, m7_28, ml3_28, l7_28, m9_28, m10_28],[m1_29, ml0_29, l2_29, m2_29, lm1_29, m3_29, ml1_29, l4_29, lm2_29, m4_29, m5_29, l5_29, ml2_29, l6_29, lm3_29, m7_29, ml3_29, l7_29, m9_29, m10_29],[m1_30, ml0_30, l2_30, m2_30, lm1_30, m3_30, ml1_30, l4_30, lm2_30, m4_30, m5_30, l5_30, ml2_30, l6_30, lm3_30, m7_30, ml3_30, l7_30, m9_30, m10_30, ml4_30],[m1_31, ml0_31, l2_31, m2_31, lm1_31, m3_31, ml1_31, l4_31, lm2_31, m4_31, m5_31, l5_31, ml2_31, l6_31, lm3_31, m7_31, ml3_31, l7_31, m9_31, m10_31],[m1_32, ml0_32, l2_32, m2_32, lm1_32, m3_32, ml1_32, l4_32, lm2_32, m4_32, m5_32, l5_32, ml2_32, l6_32, lm3_32, m7_32, ml3_32, l7_32, m9_32, m10_32],[m1_33, ml0_33, l2_33, m2_33, lm1_33, m3_33, ml1_33, l4_33, lm2_33, m4_33, m5_33, l5_33, ml2_33, l6_33, lm3_33, m7_33, ml3_33, l7_33, m9_33, m10_33, ml4_33],[m1_34, ml0_34, l2_34, m2_34, lm1_34, m3_34, ml1_34, l4_34, lm2_34, m4_34, m5_34, l5_34, ml2_34, l6_34, lm3_34, m7_34, ml3_34, l7_34, m9_34, m10_34],[m1_35, ml0_35, l2_35, m2_35, lm1_35, m3_35, ml1_35, l4_35, lm2_35, m4_35, m5_35, l5_35, ml2_35, l6_35, lm3_35, m7_35, ml3_35, l7_35, m9_35, m10_35],[m1_36, ml0_36, l2_36, m2_36, lm1_36, m3_36, ml1_36, l4_36, lm2_36, m4_36, m5_36, l5_36, ml2_36, l6_36, lm3_36, m7_36, ml3_36, l7_36, m9_36, m10_36, ml4_36],[m1_37, ml0_37, l2_37, m2_37, lm1_37, m3_37, ml1_37, l4_37, lm2_37, m4_37, m5_37, l5_37, ml2_37, l6_37, lm3_37, m7_37, ml3_37, l7_37, m9_37, m10_37],[m1_38, ml0_38, l2_38, m2_38, lm1_38, m3_38, ml1_38, l4_38, lm2_38, m4_38, m5_38, l5_38, ml2_38, l6_38, lm3_38, m7_38, ml3_38, l7_38, m9_38, m10_38],[m1_39, ml0_39, l2_39, m2_39, lm1_39, m3_39, ml1_39, l4_39, lm2_39, m4_39, m5_39, l5_39, ml2_39, l6_39, lm3_39, m7_39, ml3_39, l7_39, m9_39, m10_39, ml4_39],[m1_40, ml0_40, l2_40, m2_40, lm1_40, m3_40, ml1_40, l4_40, lm2_40, m4_40, m5_40, l5_40, ml2_40, l6_40, lm3_40, m7_40, ml3_40, l7_40, m9_40, m10_40],[m1_41, ml0_41, l2_41, m2_41, lm1_41, m3_41, ml1_41, l4_41, lm2_41, m4_41, m5_41, l5_41, ml2_41, l6_41, lm3_41, m7_41, ml3_41, l7_41, m9_41, m10_41],[m1_42, ml0_42, l2_42, m2_42, lm1_42, m3_42, ml1_42, l4_42, lm2_42, m4_42, m5_42, l5_42, ml2_42, l6_42, lm3_42, m7_42, ml3_42, l7_42, m9_42, m10_42, ml4_42],[m1_43, ml0_43, l2_43, m2_43, lm1_43, m3_43, ml1_43, l4_43, lm2_43, m4_43, m5_43, l5_43, ml2_43, l6_43, lm3_43, m7_43, ml3_43, l7_43, m9_43, m10_43],[m1_44, ml0_44, l2_44, m2_44, lm1_44, m3_44, ml1_44, l4_44, lm2_44, m4_44, m5_44, l5_44, ml2_44, l6_44, lm3_44, m7_44, ml3_44, l7_44, m9_44, m10_44],[m1_45, ml0_45, l2_45, m2_45, lm1_45, m3_45, ml1_45, l4_45, lm2_45, m4_45, m5_45, l5_45, ml2_45, l6_45, lm3_45, m7_45, ml3_45, l7_45, m9_45, m10_45, ml4_45],[m1_46, ml0_46, l2_46, m2_46, lm1_46, m3_46, ml1_46, l4_46, lm2_46, m4_46, m5_46, l5_46, ml2_46, l6_46, lm3_46, m7_46, ml3_46, l7_46, m9_46, m10_46],[m1_47, ml0_47, l2_47, m2_47, lm1_47, m3_47, ml1_47, l4_47, lm2_47, m4_47, m5_47, l5_47, ml2_47, l6_47, lm3_47, m7_47, ml3_47, l7_47, m9_47, m10_47],[m1_48, ml0_48, l2_48, m2_48, lm1_48, m3_48, ml1_48, l4_48, lm2_48, m4_48, m5_48, l5_48, ml2_48, l6_48, lm3_48, m7_48, ml3_48, l7_48, m9_48, m10_48, ml4_48],[m1_49, ml0_49, l2_49, m2_49, lm1_49, m3_49, ml1_49, l4_49, lm2_49, m4_49, m5_49, l5_49, ml2_49, l6_49, lm3_49, m7_49, ml3_49, l7_49, m9_49, m10_49],[m1_50, ml0_50, l2_50, m2_50, lm1_50, m3_50, ml1_50, l4_50, lm2_50, m4_50, m5_50, l5_50, ml2_50, l6_50, lm3_50, m7_50, ml3_50, l7_50, m9_50, m10_50],[m1_51, ml0_51, l2_51, m2_51, lm1_51, m3_51, ml1_51, l4_51, lm2_51, m4_51, m5_51, l5_51, ml2_51, l6_51, lm3_51, m7_51, ml3_51, l7_51, m9_51, m10_51, ml4_51],[m1_52, ml0_52, l2_52, m2_52, lm1_52, m3_52, ml1_52, l4_52, lm2_52, m4_52, m5_52, l5_52, ml2_52, l6_52, lm3_52, m7_52, ml3_52, l7_52, m9_52, m10_52],[m1_53, ml0_53, l2_53, m2_53, lm1_53, m3_53, ml1_53, l4_53, lm2_53, m4_53, m5_53, l5_53, ml2_53, l6_53, lm3_53, m7_53, ml3_53, l7_53, m9_53, m10_53],[m1_54, ml0_54, l2_54, m2_54, lm1_54, m3_54, ml1_54, l4_54, lm2_54, m4_54, m5_54, l5_54, ml2_54, l6_54, lm3_54, m7_54, ml3_54, l7_54, m9_54, m10_54, ml4_54],[m1_55, ml0_55, l2_55, m2_55, lm1_55, m3_55, ml1_55, l4_55, lm2_55, m4_55, m5_55, l5_55, ml2_55, l6_55, lm3_55, m7_55, ml3_55, l7_55, m9_55, m10_55],[m1_56, ml0_56, l2_56, m2_56, lm1_56, m3_56, ml1_56, l4_56, lm2_56, m4_56, m5_56, l5_56, ml2_56, l6_56, lm3_56, m7_56, ml3_56, l7_56, m9_56, m10_56],[m1_57, ml0_57, l2_57, m2_57, lm1_57, m3_57, ml1_57, l4_57, lm2_57, m4_57, m5_57, l5_57, ml2_57, l6_57, lm3_57, m7_57, ml3_57, l7_57, m9_57, m10_57, ml4_57],[m1_58, ml0_58, l2_58, m2_58, lm1_58, m3_58, ml1_58, l4_58, lm2_58, m4_58, m5_58, l5_58, ml2_58, l6_58, lm3_58, m7_58, ml3_58, l7_58, m9_58, m10_58],[m1_59, ml0_59, l2_59, m2_59, lm1_59, m3_59, ml1_59, l4_59, lm2_59, m4_59, m5_59, l5_59, ml2_59, l6_59, lm3_59, m7_59, ml3_59, l7_59, m9_59, m10_59],[m1_60, ml0_60, l2_60, m2_60, lm1_60, m3_60, ml1_60, l4_60, lm2_60, m4_60, m5_60, l5_60, ml2_60, l6_60, lm3_60, m7_60, ml3_60, l7_60, m9_60, m10_60, ml4_60],[m1_61, ml0_61, l2_61, m2_61, lm1_61, m3_61, ml1_61, l4_61, lm2_61, m4_61, m5_61, l5_61, ml2_61, l6_61, lm3_61, m7_61, ml3_61, l7_61, m9_61, m10_61],[m1_62, ml0_62, l2_62, m2_62, lm1_62, m3_62, ml1_62, l4_62, lm2_62, m4_62, m5_62, l5_62, ml2_62, l6_62, lm3_62, m7_62, ml3_62, l7_62, m9_62, m10_62],[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],[c3_11, cl2_11, c5_11, c6_11, cl0_11, cl1_11],[c3_12, cl2_12, c5_12, c6_12, cl0_12, cl1_12],[c3_13, cl2_13, c5_13, c6_13, cl0_13, cl1_13],[c3_14, cl2_14, c5_14, c6_14, cl0_14, cl1_14],[c3_15, cl2_15, c5_15, c6_15, cl0_15, cl1_15],[c3_16, cl2_16, c5_16, c6_16, cl0_16, cl1_16],[c3_17, cl2_17, c5_17, c6_17, cl0_17, cl1_17],[c3_18, cl2_18, c5_18, c6_18, cl0_18, cl1_18],[c3_19, cl2_19, c5_19, c6_19, cl0_19, cl1_19],[c3_20, cl2_20, c5_20, c6_20, cl0_20, cl1_20],

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 11:05:31] [INFO ] Flatten gal took : 1203 ms
[2026-05-24 11:05:32] [INFO ] Time to serialize gal into /tmp/LTLCardinality10631978773868753420.gal : 138 ms
[2026-05-24 11:05:32] [INFO ] Time to serialize properties into /tmp/LTLCardinality13786684655058071871.ltl : 48 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/LTLCardinality10631978773868753420.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality13786684655058071871.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...299
Read 1 LTL properties
Checking formula 0 : !((((F(("(((((((m4_0+m4_1)+(m4_2+m4_3))+((m4_4+m4_5)+(m4_6+m4_7)))+(((m4_8+m4_9)+(m4_10+m4_11))+((m4_12+m4_13)+(m4_14+m4_15))))+((((m4...2775
Formula 0 simplified : (G(!"(((((((m4_0+m4_1)+(m4_2+m4_3))+((m4_4+m4_5)+(m4_6+m4_7)))+(((m4_8+m4_9)+(m4_10+m4_11))+((m4_12+m4_13)+(m4_14+m4_15))))+((((m4_1...2764
Detected timeout of ITS tools.
[2026-05-24 11:28:01] [INFO ] Flatten gal took : 1841 ms
[2026-05-24 11:28:08] [INFO ] Input system was already deterministic with 2354 transitions.
[2026-05-24 11:28:09] [INFO ] Transformed 2717 places.
[2026-05-24 11:28:09] [INFO ] Transformed 2354 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
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 11:28:40] [INFO ] Time to serialize gal into /tmp/LTLCardinality16888164593547514761.gal : 53 ms
[2026-05-24 11:28:40] [INFO ] Time to serialize properties into /tmp/LTLCardinality7811521619490330255.ltl : 24 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/LTLCardinality16888164593547514761.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality7811521619490330255.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(("(((((((m4_0+m4_1)+(m4_2+m4_3))+((m4_4+m4_5)+(m4_6+m4_7)))+(((m4_8+m4_9)+(m4_10+m4_11))+((m4_12+m4_13)+(m4_14+m4_15))))+((((m4...2775
Formula 0 simplified : (G(!"(((((((m4_0+m4_1)+(m4_2+m4_3))+((m4_4+m4_5)+(m4_6+m4_7)))+(((m4_8+m4_9)+(m4_10+m4_11))+((m4_12+m4_13)+(m4_14+m4_15))))+((((m4_1...2764

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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FamilyReunion-COL-L00020M0002C001P001G001"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is FamilyReunion-COL-L00020M0002C001P001G001, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r130-smll-177955808800011"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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