Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r156-tall-174881254300579.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is PolyORBNT-COL-S05J60, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r156-tall-174881254300579
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 6.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.4K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 146K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_pt
-rw-r--r-- 1 mcc users 7 May 29 14:32 instance
-rw-r--r-- 1 mcc users 5 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 94K May 29 14:32 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 PolyORBNT-COL-S05J60-LTLCardinality-00
FORMULA_NAME PolyORBNT-COL-S05J60-LTLCardinality-01
FORMULA_NAME PolyORBNT-COL-S05J60-LTLCardinality-02
FORMULA_NAME PolyORBNT-COL-S05J60-LTLCardinality-03
FORMULA_NAME PolyORBNT-COL-S05J60-LTLCardinality-04
FORMULA_NAME PolyORBNT-COL-S05J60-LTLCardinality-05
FORMULA_NAME PolyORBNT-COL-S05J60-LTLCardinality-06
FORMULA_NAME PolyORBNT-COL-S05J60-LTLCardinality-07
FORMULA_NAME PolyORBNT-COL-S05J60-LTLCardinality-08
FORMULA_NAME PolyORBNT-COL-S05J60-LTLCardinality-09
FORMULA_NAME PolyORBNT-COL-S05J60-LTLCardinality-10
FORMULA_NAME PolyORBNT-COL-S05J60-LTLCardinality-11
FORMULA_NAME PolyORBNT-COL-S05J60-LTLCardinality-12
FORMULA_NAME PolyORBNT-COL-S05J60-LTLCardinality-13
FORMULA_NAME PolyORBNT-COL-S05J60-LTLCardinality-14
FORMULA_NAME PolyORBNT-COL-S05J60-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1749052071384

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-COL-S05J60
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202505121319
[2025-06-04 15:47:52] [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]
[2025-06-04 15:47:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-04 15:47:52] [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.
[2025-06-04 15:47:52] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-04 15:47:53] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 572 ms
[2025-06-04 15:47:53] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 969 PT places and 2152.0 transition bindings in 20 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2025-06-04 15:47:53] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 6 ms.
[2025-06-04 15:47:53] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 7 formulas.
FORMULA PolyORBNT-COL-S05J60-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S05J60-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S05J60-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S05J60-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S05J60-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S05J60-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S05J60-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 9 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40000 steps (3197 resets) in 1602 ms. (24 steps per ms) remains 11/25 properties
BEST_FIRST walk for 40003 steps (1000 resets) in 163 ms. (243 steps per ms) remains 6/11 properties
BEST_FIRST walk for 40002 steps (985 resets) in 120 ms. (330 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (1454 resets) in 140 ms. (283 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (980 resets) in 144 ms. (275 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (991 resets) in 92 ms. (430 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1459 resets) in 86 ms. (459 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1284 resets) in 89 ms. (444 steps per ms) remains 6/6 properties
// Phase 1: matrix 38 rows 48 cols
[2025-06-04 15:47:54] [INFO ] Computed 13 invariants in 6 ms
[2025-06-04 15:47:54] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem AtomicPropp4 is UNSAT
At refinement iteration 1 (OVERLAPS) 11/16 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp24 is UNSAT
After SMT solving in domain Real declared 39/86 variables, and 7 constraints, problems are : Problem set: 6 solved, 0 unsolved in 226 ms.
Refiners :[Positive P Invariants (semi-flows): 1/6 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/48 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 266ms problems are : Problem set: 6 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 6 atomic propositions for a total of 9 simplifications.
FORMULA PolyORBNT-COL-S05J60-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S05J60-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-04 15:47:54] [INFO ] Flatten gal took : 28 ms
[2025-06-04 15:47:54] [INFO ] Flatten gal took : 6 ms
Transition Run forces synchronizations/join behavior on parameter j of sort Jobs
Transition trans_376 forces synchronizations/join behavior on parameter s of sort Sources
Symmetric sort wr.t. initial and guards and successors and join/free detected :States
Arc [42:1*[$t, 0, $j]] contains constants of sort States
Transition WillPerformWork : constants on arcs in [[42:1*[$t, 0, $j]]] introduces in States(2) partition with 1 elements that refines current partition to 2 subsets.
[2025-06-04 15:47:54] [INFO ] Unfolded HLPN to a Petri net with 969 places and 2030 transitions 12704 arcs in 111 ms.
[2025-06-04 15:47:54] [INFO ] Unfolded 7 HLPN properties in 0 ms.
Deduced a syphon composed of 60 places in 17 ms
Reduce places removed 60 places and 60 transitions.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Support contains 568 out of 909 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 909/909 places, 1315/1315 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 904 transition count 1315
Applied a total of 5 rules in 73 ms. Remains 904 /909 variables (removed 5) and now considering 1315/1315 (removed 0) transitions.
Running 1309 sub problems to find dead transitions.
[2025-06-04 15:47:54] [INFO ] Flow matrix only has 1311 transitions (discarded 4 similar events)
// Phase 1: matrix 1311 rows 904 cols
[2025-06-04 15:47:54] [INFO ] Computed 137 invariants in 89 ms
[2025-06-04 15:47:55] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/898 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/898 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 898/2215 variables, and 131 constraints, problems are : Problem set: 0 solved, 1309 unsolved in 20045 ms.
Refiners :[Positive P Invariants (semi-flows): 126/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/904 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1309/1309 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1309 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/898 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/898 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 898/2215 variables, and 131 constraints, problems are : Problem set: 0 solved, 1309 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 126/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/904 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1309 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42026ms problems are : Problem set: 0 solved, 1309 unsolved
Search for dead transitions found 0 dead transitions in 42059ms
[2025-06-04 15:48:36] [INFO ] Flow matrix only has 1311 transitions (discarded 4 similar events)
[2025-06-04 15:48:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:48:37] [INFO ] Implicit Places using invariants in 1027 ms returned []
[2025-06-04 15:48:37] [INFO ] Flow matrix only has 1311 transitions (discarded 4 similar events)
[2025-06-04 15:48:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:48:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 15:48:43] [INFO ] Implicit Places using invariants and state equation in 5521 ms returned []
Implicit Place search using SMT with State Equation took 6556 ms to find 0 implicit places.
Running 1309 sub problems to find dead transitions.
[2025-06-04 15:48:43] [INFO ] Flow matrix only has 1311 transitions (discarded 4 similar events)
[2025-06-04 15:48:43] [INFO ] Invariant cache hit.
[2025-06-04 15:48:43] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/898 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/898 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 898/2215 variables, and 131 constraints, problems are : Problem set: 0 solved, 1309 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 126/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/904 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1309/1309 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1309 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/898 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/898 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 898/2215 variables, and 131 constraints, problems are : Problem set: 0 solved, 1309 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 126/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/904 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1309 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61286ms problems are : Problem set: 0 solved, 1309 unsolved
Search for dead transitions found 0 dead transitions in 61290ms
Starting structural reductions in LTL mode, iteration 1 : 904/909 places, 1315/1315 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 110023 ms. Remains : 904/909 places, 1315/1315 transitions.
Support contains 568 out of 904 places after structural reductions.
[2025-06-04 15:49:44] [INFO ] Flatten gal took : 145 ms
[2025-06-04 15:49:45] [INFO ] Flatten gal took : 101 ms
[2025-06-04 15:49:45] [INFO ] Input system was already deterministic with 1315 transitions.
RANDOM walk for 40000 steps (2784 resets) in 1067 ms. (37 steps per ms) remains 4/19 properties
BEST_FIRST walk for 40001 steps (1006 resets) in 177 ms. (224 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (457 resets) in 211 ms. (188 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (517 resets) in 163 ms. (243 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (1003 resets) in 191 ms. (208 steps per ms) remains 4/4 properties
[2025-06-04 15:49:45] [INFO ] Flow matrix only has 1311 transitions (discarded 4 similar events)
[2025-06-04 15:49:45] [INFO ] Invariant cache hit.
[2025-06-04 15:49:45] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 510/573 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/573 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 307/880 variables, 63/126 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/880 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 12/892 variables, 4/130 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/892 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp11 is UNSAT
At refinement iteration 7 (OVERLAPS) 10/902 variables, 6/136 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/902 variables, 0/136 constraints. Problems are: Problem set: 3 solved, 1 unsolved
Problem AtomicPropp3 is UNSAT
After SMT solving in domain Real declared 903/2215 variables, and 137 constraints, problems are : Problem set: 4 solved, 0 unsolved in 668 ms.
Refiners :[Positive P Invariants (semi-flows): 131/131 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/904 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 694ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA PolyORBNT-COL-S05J60-LTLCardinality-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 4 atomic propositions for a total of 6 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U G(p1)))'
Support contains 308 out of 904 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 904/904 places, 1315/1315 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 904 transition count 1252
Reduce places removed 63 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 64 rules applied. Total rules applied 127 place count 841 transition count 1251
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 128 place count 840 transition count 1251
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 64 Pre rules applied. Total rules applied 128 place count 840 transition count 1187
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 256 place count 776 transition count 1187
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 260 place count 774 transition count 1185
Applied a total of 260 rules in 131 ms. Remains 774 /904 variables (removed 130) and now considering 1185/1315 (removed 130) transitions.
Running 1179 sub problems to find dead transitions.
[2025-06-04 15:49:47] [INFO ] Flow matrix only has 1181 transitions (discarded 4 similar events)
// Phase 1: matrix 1181 rows 774 cols
[2025-06-04 15:49:47] [INFO ] Computed 137 invariants in 32 ms
[2025-06-04 15:49:47] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/769 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/769 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 769/1955 variables, and 132 constraints, problems are : Problem set: 0 solved, 1179 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/774 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1179/1179 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1179 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/769 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/769 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:50:15] [INFO ] Deduced a trap composed of 13 places in 128 ms of which 10 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 769/1955 variables, and 133 constraints, problems are : Problem set: 0 solved, 1179 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/774 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1179 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41205ms problems are : Problem set: 0 solved, 1179 unsolved
Search for dead transitions found 0 dead transitions in 41208ms
[2025-06-04 15:50:28] [INFO ] Flow matrix only has 1181 transitions (discarded 4 similar events)
[2025-06-04 15:50:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:50:30] [INFO ] Implicit Places using invariants in 1833 ms returned []
[2025-06-04 15:50:30] [INFO ] Flow matrix only has 1181 transitions (discarded 4 similar events)
[2025-06-04 15:50:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:50:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 15:50:34] [INFO ] Implicit Places using invariants and state equation in 4740 ms returned []
Implicit Place search using SMT with State Equation took 6578 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 15:50:34] [INFO ] Redundant transitions in 65 ms returned []
Running 1179 sub problems to find dead transitions.
[2025-06-04 15:50:34] [INFO ] Flow matrix only has 1181 transitions (discarded 4 similar events)
[2025-06-04 15:50:34] [INFO ] Invariant cache hit.
[2025-06-04 15:50:34] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/769 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/769 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 769/1955 variables, and 132 constraints, problems are : Problem set: 0 solved, 1179 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/774 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1179/1179 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1179 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/769 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/769 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 769/1955 variables, and 132 constraints, problems are : Problem set: 0 solved, 1179 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/774 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1179 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61209ms problems are : Problem set: 0 solved, 1179 unsolved
Search for dead transitions found 0 dead transitions in 61211ms
Starting structural reductions in SI_LTL mode, iteration 1 : 774/904 places, 1185/1315 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 109204 ms. Remains : 774/904 places, 1185/1315 transitions.
Stuttering acceptance computed with spot in 195 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S05J60-LTLCardinality-00
Product exploration explored 100000 steps with 6281 reset in 2260 ms.
Product exploration explored 100000 steps with 6270 reset in 2303 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 79 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p1), (NOT p0)]
Reduction of identical properties reduced properties to check from 3 to 2
RANDOM walk for 546 steps (37 resets) in 11 ms. (45 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 204 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p1), (NOT p0)]
Support contains 308 out of 774 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 774/774 places, 1185/1185 transitions.
Applied a total of 0 rules in 35 ms. Remains 774 /774 variables (removed 0) and now considering 1185/1185 (removed 0) transitions.
Running 1179 sub problems to find dead transitions.
[2025-06-04 15:51:41] [INFO ] Flow matrix only has 1181 transitions (discarded 4 similar events)
[2025-06-04 15:51:41] [INFO ] Invariant cache hit.
[2025-06-04 15:51:41] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/769 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/769 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 769/1955 variables, and 132 constraints, problems are : Problem set: 0 solved, 1179 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/774 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1179/1179 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1179 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/769 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/769 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 769/1955 variables, and 132 constraints, problems are : Problem set: 0 solved, 1179 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/774 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1179 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41345ms problems are : Problem set: 0 solved, 1179 unsolved
Search for dead transitions found 0 dead transitions in 41347ms
[2025-06-04 15:52:22] [INFO ] Flow matrix only has 1181 transitions (discarded 4 similar events)
[2025-06-04 15:52:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:52:24] [INFO ] Implicit Places using invariants in 1811 ms returned []
[2025-06-04 15:52:24] [INFO ] Flow matrix only has 1181 transitions (discarded 4 similar events)
[2025-06-04 15:52:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:52:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 15:52:29] [INFO ] Implicit Places using invariants and state equation in 4648 ms returned []
Implicit Place search using SMT with State Equation took 6462 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 15:52:29] [INFO ] Redundant transitions in 45 ms returned []
Running 1179 sub problems to find dead transitions.
[2025-06-04 15:52:29] [INFO ] Flow matrix only has 1181 transitions (discarded 4 similar events)
[2025-06-04 15:52:29] [INFO ] Invariant cache hit.
[2025-06-04 15:52:29] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/769 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/769 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
(s79 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 769/1955 variables, and 132 constraints, problems are : Problem set: 0 solved, 1179 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/774 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1179/1179 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1179 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/769 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/769 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 769/1955 variables, and 132 constraints, problems are : Problem set: 0 solved, 1179 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/774 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1179 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61249ms problems are : Problem set: 0 solved, 1179 unsolved
Search for dead transitions found 0 dead transitions in 61252ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 109158 ms. Remains : 774/774 places, 1185/1185 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 89 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(NOT p1), (NOT p0)]
Reduction of identical properties reduced properties to check from 3 to 2
RANDOM walk for 259 steps (14 resets) in 9 ms. (25 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 190 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 81 ms :[(NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 6246 reset in 1699 ms.
Product exploration explored 100000 steps with 6204 reset in 1726 ms.
Built C files in :
/tmp/ltsmin1015280999250629400
[2025-06-04 15:53:34] [INFO ] Computing symmetric may disable matrix : 1185 transitions.
[2025-06-04 15:53:34] [INFO ] Computation of Complete disable matrix. took 16 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 15:53:34] [INFO ] Computing symmetric may enable matrix : 1185 transitions.
[2025-06-04 15:53:34] [INFO ] Computation of Complete enable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 15:53:35] [INFO ] Computing Do-Not-Accords matrix : 1185 transitions.
[2025-06-04 15:53:35] [INFO ] Computation of Completed DNA matrix. took 53 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 15:53:35] [INFO ] Built C files in 379ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1015280999250629400
Running compilation step : cd /tmp/ltsmin1015280999250629400;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/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/ltsmin1015280999250629400;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/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/ltsmin1015280999250629400;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/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:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 308 out of 774 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 774/774 places, 1185/1185 transitions.
Applied a total of 0 rules in 38 ms. Remains 774 /774 variables (removed 0) and now considering 1185/1185 (removed 0) transitions.
Running 1179 sub problems to find dead transitions.
[2025-06-04 15:53:38] [INFO ] Flow matrix only has 1181 transitions (discarded 4 similar events)
[2025-06-04 15:53:38] [INFO ] Invariant cache hit.
[2025-06-04 15:53:38] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/769 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/769 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 769/1955 variables, and 132 constraints, problems are : Problem set: 0 solved, 1179 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/774 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1179/1179 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1179 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/769 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/769 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 769/1955 variables, and 132 constraints, problems are : Problem set: 0 solved, 1179 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/774 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1179 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41349ms problems are : Problem set: 0 solved, 1179 unsolved
Search for dead transitions found 0 dead transitions in 41352ms
[2025-06-04 15:54:19] [INFO ] Flow matrix only has 1181 transitions (discarded 4 similar events)
[2025-06-04 15:54:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:54:21] [INFO ] Implicit Places using invariants in 1855 ms returned []
[2025-06-04 15:54:21] [INFO ] Flow matrix only has 1181 transitions (discarded 4 similar events)
[2025-06-04 15:54:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:54:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 15:54:26] [INFO ] Implicit Places using invariants and state equation in 4984 ms returned []
Implicit Place search using SMT with State Equation took 6842 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 15:54:26] [INFO ] Redundant transitions in 21 ms returned []
Running 1179 sub problems to find dead transitions.
[2025-06-04 15:54:26] [INFO ] Flow matrix only has 1181 transitions (discarded 4 similar events)
[2025-06-04 15:54:26] [INFO ] Invariant cache hit.
[2025-06-04 15:54:26] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/769 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/769 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 (/ 2.0 3.0))
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 1.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 (/ 1.0 3.0))
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 (/ 1.0 3.0))
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 (/ 2.0 3.0))
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 1.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 4.0)
(s382 4.0)
(s383 4.0)
(s384 4.0)
(s385 4.0)
(s386 9.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 (/ 2.0 3.0))
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 769/1955 variables, and 132 constraints, problems are : Problem set: 0 solved, 1179 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/774 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1179/1179 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1179 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/769 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/769 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 769/1955 variables, and 132 constraints, problems are : Problem set: 0 solved, 1179 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/774 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1179 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61252ms problems are : Problem set: 0 solved, 1179 unsolved
Search for dead transitions found 0 dead transitions in 61255ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 109518 ms. Remains : 774/774 places, 1185/1185 transitions.
Built C files in :
/tmp/ltsmin12925504620572641304
[2025-06-04 15:55:27] [INFO ] Computing symmetric may disable matrix : 1185 transitions.
[2025-06-04 15:55:27] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 15:55:27] [INFO ] Computing symmetric may enable matrix : 1185 transitions.
[2025-06-04 15:55:27] [INFO ] Computation of Complete enable matrix. took 20 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 15:55:27] [INFO ] Computing Do-Not-Accords matrix : 1185 transitions.
[2025-06-04 15:55:27] [INFO ] Computation of Completed DNA matrix. took 44 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 15:55:28] [INFO ] Built C files in 342ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12925504620572641304
Running compilation step : cd /tmp/ltsmin12925504620572641304;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/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/ltsmin12925504620572641304;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/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/ltsmin12925504620572641304;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/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:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-06-04 15:55:31] [INFO ] Flatten gal took : 63 ms
[2025-06-04 15:55:31] [INFO ] Flatten gal took : 56 ms
[2025-06-04 15:55:31] [INFO ] Time to serialize gal into /tmp/LTL3018546430745902630.gal : 19 ms
[2025-06-04 15:55:31] [INFO ] Time to serialize properties into /tmp/LTL6661934321521352749.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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3018546430745902630.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13761914199046175635.hoa' '-atoms' '/tmp/LTL6661934321521352749.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.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL6661934321521352749.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13761914199046175635.hoa
Detected timeout of ITS tools.
[2025-06-04 15:55:46] [INFO ] Flatten gal took : 49 ms
[2025-06-04 15:55:46] [INFO ] Flatten gal took : 49 ms
[2025-06-04 15:55:46] [INFO ] Time to serialize gal into /tmp/LTL8094185055364270509.gal : 10 ms
[2025-06-04 15:55:46] [INFO ] Time to serialize properties into /tmp/LTL6626469491822364945.ltl : 5 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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8094185055364270509.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6626469491822364945.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.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((F("(NotifyEventEndOfCheckSourcesE<=Check_Sources_B)"))U(G("((NotifyEventEndOfCheckSourcesE<=Check_Sources_B)&&(QueueJobE<=((((((((...5531
Formula 0 simplified : G!"(NotifyEventEndOfCheckSourcesE<=Check_Sources_B)" R F!"((NotifyEventEndOfCheckSourcesE<=Check_Sources_B)&&(QueueJobE<=(((((((((Cr...5524
Detected timeout of ITS tools.
[2025-06-04 15:56:01] [INFO ] Flatten gal took : 49 ms
[2025-06-04 15:56:01] [INFO ] Applying decomposition
[2025-06-04 15:56:01] [INFO ] Flatten gal took : 49 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph16776424884147380780.txt' '-o' '/tmp/graph16776424884147380780.bin' '-w' '/tmp/graph16776424884147380780.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16776424884147380780.bin' '-l' '-1' '-v' '-w' '/tmp/graph16776424884147380780.weights' '-q' '0' '-e' '0.001'
[2025-06-04 15:56:01] [INFO ] Decomposing Gal with order
[2025-06-04 15:56:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 15:56:02] [INFO ] Removed a total of 1037 redundant transitions.
[2025-06-04 15:56:02] [INFO ] Flatten gal took : 695 ms
[2025-06-04 15:56:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 558 labels/synchronizations in 61 ms.
[2025-06-04 15:56:03] [INFO ] Time to serialize gal into /tmp/LTL7330277983386177240.gal : 14 ms
[2025-06-04 15:56:03] [INFO ] Time to serialize properties into /tmp/LTL18128684946275302931.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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7330277983386177240.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18128684946275302931.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.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((F("(gi0.gi1.gu64.NotifyEventEndOfCheckSourcesE<=gi0.gi1.gu64.Check_Sources_B)"))U(G("((gi0.gi1.gu64.NotifyEventEndOfCheckSourcesE<...7113
Formula 0 simplified : G!"(gi0.gi1.gu64.NotifyEventEndOfCheckSourcesE<=gi0.gi1.gu64.Check_Sources_B)" R F!"((gi0.gi1.gu64.NotifyEventEndOfCheckSourcesE<=gi...7106
Detected timeout of ITS tools.
Treatment of property PolyORBNT-COL-S05J60-LTLCardinality-00 finished in 391256 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(p0)&&X(p1)))))'
Support contains 62 out of 904 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 904/904 places, 1315/1315 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 903 transition count 1314
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 903 transition count 1314
Applied a total of 2 rules in 71 ms. Remains 903 /904 variables (removed 1) and now considering 1314/1315 (removed 1) transitions.
Running 1308 sub problems to find dead transitions.
[2025-06-04 15:56:18] [INFO ] Flow matrix only has 1310 transitions (discarded 4 similar events)
// Phase 1: matrix 1310 rows 903 cols
[2025-06-04 15:56:18] [INFO ] Computed 137 invariants in 21 ms
[2025-06-04 15:56:18] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 897/2213 variables, and 131 constraints, problems are : Problem set: 0 solved, 1308 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 126/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1308/1308 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1308 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:56:52] [INFO ] Deduced a trap composed of 12 places in 219 ms of which 20 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 897/2213 variables, and 132 constraints, problems are : Problem set: 0 solved, 1308 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 126/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1308 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41400ms problems are : Problem set: 0 solved, 1308 unsolved
Search for dead transitions found 0 dead transitions in 41403ms
[2025-06-04 15:56:59] [INFO ] Flow matrix only has 1310 transitions (discarded 4 similar events)
[2025-06-04 15:56:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:57:01] [INFO ] Implicit Places using invariants in 1456 ms returned []
[2025-06-04 15:57:01] [INFO ] Flow matrix only has 1310 transitions (discarded 4 similar events)
[2025-06-04 15:57:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:57:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 15:57:07] [INFO ] Implicit Places using invariants and state equation in 6191 ms returned []
Implicit Place search using SMT with State Equation took 7649 ms to find 0 implicit places.
Running 1308 sub problems to find dead transitions.
[2025-06-04 15:57:07] [INFO ] Flow matrix only has 1310 transitions (discarded 4 similar events)
[2025-06-04 15:57:07] [INFO ] Invariant cache hit.
[2025-06-04 15:57:07] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 2.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 (/ 2.0 3.0))
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 1.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 (/ 2.0 3.0))
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 (/ 2.0 3.0))
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 1.0)
(s314 1.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 1.0)
(s377 1.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 4.0)
(s385 4.0)
(s386 4.0)
(s387 4.0)
(s388 4.0)
(s389 9.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 (/ 2.0 3.0))
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 (/ 2.0 3.0))
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 (/ 2.0 3.0))
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 0.0)
(s686 0.0)
(s687 0.0)
(s688 0.0)
(s689 0.0)
(s690 0.0)
(s691 0.0)
(s692 0.0)
(s693 0.0)
(s694 0.0)
(s695 0.0)
(s696 0.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 4.0)
(s701 0.0)
(s702 0.0)
(s703 0.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 (/ 1.0 3.0))
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 1.0)
(s722 1.0)
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 (/ 1.0 3.0))
(s727 1.0)
(s728 (/ 1.0 3.0))
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 1.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 1.0)
(s756 1.0)
(s757 1.0)
(s758 1.0)
(s759 1.0)
(s760 1.0)
(s761 1.0)
(s762 1.0)
(s763 1.0)
(s764 1.0)
(s770 0.0)
(s771 0.0)
(s772 1.0)
(s773 1.0)
(s774 1.0)
(s775 1.0)
(s776 0.0)
(s777 0.0)
(s778 0.0)
(s779 0.0)
(s780 0.0)
(s781 0.0)
(s782 0.0)
(s783 timeout
0.0)
(s784 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 897/2213 variables, and 131 constraints, problems are : Problem set: 0 solved, 1308 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 126/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1308/1308 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1308 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 897/2213 variables, and 131 constraints, problems are : Problem set: 0 solved, 1308 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 126/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1308 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61315ms problems are : Problem set: 0 solved, 1308 unsolved
Search for dead transitions found 0 dead transitions in 61318ms
Starting structural reductions in LTL mode, iteration 1 : 903/904 places, 1314/1315 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 110452 ms. Remains : 903/904 places, 1314/1315 transitions.
Stuttering acceptance computed with spot in 181 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Running random walk in product with property : PolyORBNT-COL-S05J60-LTLCardinality-02
Product exploration explored 100000 steps with 24905 reset in 453 ms.
Product exploration explored 100000 steps with 25001 reset in 459 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 73 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
RANDOM walk for 856 steps (60 resets) in 12 ms. (65 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 145 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Stuttering acceptance computed with spot in 204 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Support contains 62 out of 903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 903/903 places, 1314/1314 transitions.
Applied a total of 0 rules in 51 ms. Remains 903 /903 variables (removed 0) and now considering 1314/1314 (removed 0) transitions.
Running 1308 sub problems to find dead transitions.
[2025-06-04 15:58:10] [INFO ] Flow matrix only has 1310 transitions (discarded 4 similar events)
[2025-06-04 15:58:10] [INFO ] Invariant cache hit.
[2025-06-04 15:58:10] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 897/2213 variables, and 131 constraints, problems are : Problem set: 0 solved, 1308 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 126/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1308/1308 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1308 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 897/2213 variables, and 131 constraints, problems are : Problem set: 0 solved, 1308 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 126/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1308 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41412ms problems are : Problem set: 0 solved, 1308 unsolved
Search for dead transitions found 0 dead transitions in 41414ms
[2025-06-04 15:58:51] [INFO ] Flow matrix only has 1310 transitions (discarded 4 similar events)
[2025-06-04 15:58:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:58:53] [INFO ] Implicit Places using invariants in 1484 ms returned []
[2025-06-04 15:58:53] [INFO ] Flow matrix only has 1310 transitions (discarded 4 similar events)
[2025-06-04 15:58:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:58:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 15:58:59] [INFO ] Implicit Places using invariants and state equation in 6237 ms returned []
Implicit Place search using SMT with State Equation took 7728 ms to find 0 implicit places.
Running 1308 sub problems to find dead transitions.
[2025-06-04 15:58:59] [INFO ] Flow matrix only has 1310 transitions (discarded 4 similar events)
[2025-06-04 15:58:59] [INFO ] Invariant cache hit.
[2025-06-04 15:58:59] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 897/2213 variables, and 131 constraints, problems are : Problem set: 0 solved, 1308 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 126/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1308/1308 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1308 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 897/2213 variables, and 131 constraints, problems are : Problem set: 0 solved, 1308 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 126/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1308 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61221ms problems are : Problem set: 0 solved, 1308 unsolved
Search for dead transitions found 0 dead transitions in 61227ms
Finished structural reductions in LTL mode , in 1 iterations and 110430 ms. Remains : 903/903 places, 1314/1314 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 83 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 170 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
RANDOM walk for 685 steps (46 resets) in 12 ms. (52 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 130 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Product exploration explored 100000 steps with 25074 reset in 406 ms.
Product exploration explored 100000 steps with 24988 reset in 430 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Support contains 62 out of 903 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 903/903 places, 1314/1314 transitions.
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 903 transition count 1314
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 64 place count 903 transition count 1315
Deduced a syphon composed of 66 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 66 place count 903 transition count 1315
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 67 place count 902 transition count 1314
Deduced a syphon composed of 65 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 68 place count 902 transition count 1314
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 131 places in 0 ms
Iterating global reduction 1 with 66 rules applied. Total rules applied 134 place count 902 transition count 1314
Discarding 63 places :
Symmetric choice reduction at 1 with 63 rule applications. Total rules 197 place count 839 transition count 1251
Deduced a syphon composed of 68 places in 0 ms
Iterating global reduction 1 with 63 rules applied. Total rules applied 260 place count 839 transition count 1251
Deduced a syphon composed of 68 places in 0 ms
Applied a total of 260 rules in 219 ms. Remains 839 /903 variables (removed 64) and now considering 1251/1314 (removed 63) transitions.
Running 1245 sub problems to find dead transitions.
[2025-06-04 16:00:03] [INFO ] Flow matrix only has 1247 transitions (discarded 4 similar events)
// Phase 1: matrix 1247 rows 839 cols
[2025-06-04 16:00:03] [INFO ] Computed 137 invariants in 19 ms
[2025-06-04 16:00:03] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/834 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 1245 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/834 variables, 5/132 constraints. Problems are: Problem set: 0 solved, 1245 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:00:22] [INFO ] Deduced a trap composed of 9 places in 290 ms of which 17 ms to minimize.
Problem TDEAD62 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 834/2086 variables, and 133 constraints, problems are : Problem set: 1 solved, 1244 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 127/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/839 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1245/1245 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1244 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/833 variables, 125/125 constraints. Problems are: Problem set: 1 solved, 1244 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/833 variables, 5/130 constraints. Problems are: Problem set: 1 solved, 1244 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/833 variables, 1/131 constraints. Problems are: Problem set: 1 solved, 1244 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:00:33] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 2 ms to minimize.
Problem TDEAD503 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:00:33] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
Problem TDEAD504 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:00:33] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
Problem TDEAD505 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:00:33] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
Problem TDEAD506 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:00:33] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 2 ms to minimize.
Problem TDEAD507 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:00:33] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
Problem TDEAD508 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:00:33] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 2 ms to minimize.
Problem TDEAD509 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:00:33] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
Problem TDEAD510 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:00:33] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:00:34] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 2 ms to minimize.
Problem TDEAD512 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:00:34] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
Problem TDEAD513 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:00:34] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 2 ms to minimize.
Problem TDEAD514 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:00:34] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
Problem TDEAD515 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:00:34] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 2 ms to minimize.
Problem TDEAD516 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:00:34] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 1 ms to minimize.
Problem TDEAD517 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:00:34] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
Problem TDEAD518 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:00:34] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 2 ms to minimize.
Problem TDEAD519 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:00:34] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
Problem TDEAD520 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:00:34] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
Problem TDEAD521 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:00:34] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 2 ms to minimize.
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD522 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/833 variables, 20/151 constraints. Problems are: Problem set: 21 solved, 1224 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:00:42] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 1 ms to minimize.
Problem TDEAD523 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:00:42] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 2 ms to minimize.
Problem TDEAD524 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:00:42] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 2 ms to minimize.
Problem TDEAD525 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:00:43] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
Problem TDEAD526 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:00:43] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
Problem TDEAD527 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:00:43] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
Problem TDEAD528 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:00:43] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
Problem TDEAD529 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:00:43] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
Problem TDEAD530 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:00:43] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
Problem TDEAD531 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:00:43] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 2 ms to minimize.
Problem TDEAD532 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:00:43] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 2 ms to minimize.
Problem TDEAD533 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:00:43] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 1 ms to minimize.
Problem TDEAD534 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:00:43] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 2 ms to minimize.
Problem TDEAD535 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:00:43] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 2 ms to minimize.
Problem TDEAD536 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:00:43] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
Problem TDEAD537 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:00:43] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
Problem TDEAD538 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:00:43] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
Problem TDEAD539 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:00:43] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 2 ms to minimize.
Problem TDEAD540 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:00:43] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 2 ms to minimize.
Problem TDEAD541 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:00:43] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
Problem TDEAD523 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD542 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/833 variables, 20/171 constraints. Problems are: Problem set: 41 solved, 1204 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 833/2086 variables, and 171 constraints, problems are : Problem set: 41 solved, 1204 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 125/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/839 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1245 constraints, Known Traps: 41/41 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41518ms problems are : Problem set: 41 solved, 1204 unsolved
Search for dead transitions found 41 dead transitions in 41520ms
Found 41 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 41 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 41 transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 16:00:44] [INFO ] Redundant transitions in 17 ms returned []
Starting structural reductions in SI_LTL mode, iteration 1 : 839/903 places, 1210/1314 transitions.
Graph (complete) has 4271 edges and 839 vertex of which 798 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.5 ms
Discarding 41 places :
Also discarding 0 output transitions
Deduced a syphon composed of 27 places in 0 ms
Applied a total of 1 rules in 70 ms. Remains 798 /839 variables (removed 41) and now considering 1210/1210 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 798/903 places, 1210/1314 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 41840 ms. Remains : 798/903 places, 1210/1314 transitions.
Built C files in :
/tmp/ltsmin8201266906644131917
[2025-06-04 16:00:44] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8201266906644131917
Running compilation step : cd /tmp/ltsmin8201266906644131917;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2543 ms.
Running link step : cd /tmp/ltsmin8201266906644131917;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 61 ms.
Running LTSmin : cd /tmp/ltsmin8201266906644131917;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased18426920252293425676.hoa' '--buchi-type=spotba'
LTSmin run took 10182 ms.
FORMULA PolyORBNT-COL-S05J60-LTLCardinality-02 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property PolyORBNT-COL-S05J60-LTLCardinality-02 finished in 279560 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G((p0||X(p1)))||X(G(p0))))))'
Support contains 3 out of 904 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 904/904 places, 1315/1315 transitions.
Applied a total of 0 rules in 28 ms. Remains 904 /904 variables (removed 0) and now considering 1315/1315 (removed 0) transitions.
Running 1309 sub problems to find dead transitions.
[2025-06-04 16:00:57] [INFO ] Flow matrix only has 1311 transitions (discarded 4 similar events)
// Phase 1: matrix 1311 rows 904 cols
[2025-06-04 16:00:57] [INFO ] Computed 137 invariants in 26 ms
[2025-06-04 16:00:57] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/898 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/898 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 898/2215 variables, and 131 constraints, problems are : Problem set: 0 solved, 1309 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 126/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/904 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1309/1309 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1309 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/898 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/898 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:01:38] [INFO ] Deduced a trap composed of 12 places in 330 ms of which 32 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 898/2215 variables, and 132 constraints, problems are : Problem set: 0 solved, 1309 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 126/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/904 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1309 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41285ms problems are : Problem set: 0 solved, 1309 unsolved
Search for dead transitions found 0 dead transitions in 41288ms
[2025-06-04 16:01:39] [INFO ] Flow matrix only has 1311 transitions (discarded 4 similar events)
[2025-06-04 16:01:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 16:01:40] [INFO ] Implicit Places using invariants in 1517 ms returned []
[2025-06-04 16:01:40] [INFO ] Flow matrix only has 1311 transitions (discarded 4 similar events)
[2025-06-04 16:01:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 16:01:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 16:01:45] [INFO ] Implicit Places using invariants and state equation in 5198 ms returned []
Implicit Place search using SMT with State Equation took 6718 ms to find 0 implicit places.
Running 1309 sub problems to find dead transitions.
[2025-06-04 16:01:45] [INFO ] Flow matrix only has 1311 transitions (discarded 4 similar events)
[2025-06-04 16:01:45] [INFO ] Invariant cache hit.
[2025-06-04 16:01:45] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/898 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/898 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 898/2215 variables, and 131 constraints, problems are : Problem set: 0 solved, 1309 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 126/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/904 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1309/1309 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1309 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/898 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/898 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 898/2215 variables, and 131 constraints, problems are : Problem set: 0 solved, 1309 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 126/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/904 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1309 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61276ms problems are : Problem set: 0 solved, 1309 unsolved
Search for dead transitions found 0 dead transitions in 61280ms
Finished structural reductions in LTL mode , in 1 iterations and 109326 ms. Remains : 904/904 places, 1315/1315 transitions.
Stuttering acceptance computed with spot in 292 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBNT-COL-S05J60-LTLCardinality-03
Entered a terminal (fully accepting) state of product in 1182 steps with 80 reset in 6 ms.
FORMULA PolyORBNT-COL-S05J60-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S05J60-LTLCardinality-03 finished in 109655 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 904 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 904/904 places, 1315/1315 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 904 transition count 1249
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 132 place count 838 transition count 1249
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 64 Pre rules applied. Total rules applied 132 place count 838 transition count 1185
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 260 place count 774 transition count 1185
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 261 place count 773 transition count 1184
Iterating global reduction 2 with 1 rules applied. Total rules applied 262 place count 773 transition count 1184
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 266 place count 771 transition count 1182
Applied a total of 266 rules in 91 ms. Remains 771 /904 variables (removed 133) and now considering 1182/1315 (removed 133) transitions.
Running 1176 sub problems to find dead transitions.
[2025-06-04 16:02:47] [INFO ] Flow matrix only has 1178 transitions (discarded 4 similar events)
// Phase 1: matrix 1178 rows 771 cols
[2025-06-04 16:02:47] [INFO ] Computed 137 invariants in 26 ms
[2025-06-04 16:02:47] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1176 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 765/1949 variables, and 131 constraints, problems are : Problem set: 0 solved, 1176 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 5/7 constraints, State Equation: 0/771 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1176/1176 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1176 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1176 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 765/1949 variables, and 131 constraints, problems are : Problem set: 0 solved, 1176 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 5/7 constraints, State Equation: 0/771 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1176 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41264ms problems are : Problem set: 0 solved, 1176 unsolved
Search for dead transitions found 0 dead transitions in 41266ms
[2025-06-04 16:03:28] [INFO ] Flow matrix only has 1178 transitions (discarded 4 similar events)
[2025-06-04 16:03:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 16:03:31] [INFO ] Implicit Places using invariants in 2696 ms returned []
[2025-06-04 16:03:31] [INFO ] Flow matrix only has 1178 transitions (discarded 4 similar events)
[2025-06-04 16:03:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 16:03:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 16:03:36] [INFO ] Implicit Places using invariants and state equation in 5434 ms returned []
Implicit Place search using SMT with State Equation took 8132 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 16:03:36] [INFO ] Redundant transitions in 11 ms returned []
Running 1176 sub problems to find dead transitions.
[2025-06-04 16:03:36] [INFO ] Flow matrix only has 1178 transitions (discarded 4 similar events)
[2025-06-04 16:03:36] [INFO ] Invariant cache hit.
[2025-06-04 16:03:36] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1176 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1176 unsolved
Problem TDEAD743 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD765 is UNSAT
Problem TDEAD766 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD778 is UNSAT
Problem TDEAD783 is UNSAT
Problem TDEAD791 is UNSAT
Problem TDEAD792 is UNSAT
Problem TDEAD793 is UNSAT
Problem TDEAD796 is UNSAT
Problem TDEAD797 is UNSAT
Problem TDEAD798 is UNSAT
Problem TDEAD799 is UNSAT
Problem TDEAD800 is UNSAT
Problem TDEAD801 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD803 is UNSAT
Problem TDEAD806 is UNSAT
Problem TDEAD807 is UNSAT
Problem TDEAD810 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD815 is UNSAT
Problem TDEAD816 is UNSAT
Problem TDEAD817 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD819 is UNSAT
Problem TDEAD820 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD822 is UNSAT
Problem TDEAD823 is UNSAT
Problem TDEAD826 is UNSAT
Problem TDEAD827 is UNSAT
Problem TDEAD830 is UNSAT
Problem TDEAD831 is UNSAT
Problem TDEAD832 is UNSAT
Problem TDEAD833 is UNSAT
Problem TDEAD836 is UNSAT
Problem TDEAD839 is UNSAT
Problem TDEAD840 is UNSAT
Problem TDEAD841 is UNSAT
Problem TDEAD842 is UNSAT
Problem TDEAD843 is UNSAT
Problem TDEAD844 is UNSAT
Problem TDEAD845 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD847 is UNSAT
Problem TDEAD848 is UNSAT
Problem TDEAD849 is UNSAT
Problem TDEAD850 is UNSAT
Problem TDEAD851 is UNSAT
Problem TDEAD852 is UNSAT
Problem TDEAD853 is UNSAT
Problem TDEAD854 is UNSAT
Problem TDEAD855 is UNSAT
Problem TDEAD856 is UNSAT
Problem TDEAD857 is UNSAT
Problem TDEAD858 is UNSAT
Problem TDEAD861 is UNSAT
Problem TDEAD862 is UNSAT
Problem TDEAD865 is UNSAT
Problem TDEAD866 is UNSAT
Problem TDEAD867 is UNSAT
At refinement iteration 3 (OVERLAPS) 4/769 variables, 4/135 constraints. Problems are: Problem set: 78 solved, 1098 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 769/1949 variables, and 135 constraints, problems are : Problem set: 78 solved, 1098 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 130/130 constraints, Generalized P Invariants (flows): 5/7 constraints, State Equation: 0/771 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1176/1176 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 78 solved, 1098 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 78 solved, 1098 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 5/131 constraints. Problems are: Problem set: 78 solved, 1098 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 0/131 constraints. Problems are: Problem set: 78 solved, 1098 unsolved
At refinement iteration 3 (OVERLAPS) 4/769 variables, 4/135 constraints. Problems are: Problem set: 78 solved, 1098 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 769/1949 variables, and 135 constraints, problems are : Problem set: 78 solved, 1098 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 130/130 constraints, Generalized P Invariants (flows): 5/7 constraints, State Equation: 0/771 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1176 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61349ms problems are : Problem set: 78 solved, 1098 unsolved
Search for dead transitions found 78 dead transitions in 61352ms
Found 78 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 78 transitions
Dead transitions reduction (with SMT) removed 78 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 771/904 places, 1104/1315 transitions.
Applied a total of 0 rules in 29 ms. Remains 771 /771 variables (removed 0) and now considering 1104/1104 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 16:04:38] [INFO ] Redundant transitions in 12 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 110924 ms. Remains : 771/904 places, 1104/1315 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S05J60-LTLCardinality-06
Stuttering criterion allowed to conclude after 70 steps with 9 reset in 1 ms.
FORMULA PolyORBNT-COL-S05J60-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S05J60-LTLCardinality-06 finished in 111007 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(G(p1))))'
Support contains 123 out of 904 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 904/904 places, 1315/1315 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 903 transition count 1314
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 903 transition count 1314
Applied a total of 2 rules in 44 ms. Remains 903 /904 variables (removed 1) and now considering 1314/1315 (removed 1) transitions.
Running 1308 sub problems to find dead transitions.
[2025-06-04 16:04:38] [INFO ] Flow matrix only has 1310 transitions (discarded 4 similar events)
// Phase 1: matrix 1310 rows 903 cols
[2025-06-04 16:04:38] [INFO ] Computed 137 invariants in 21 ms
[2025-06-04 16:04:38] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 897/2213 variables, and 131 constraints, problems are : Problem set: 0 solved, 1308 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 126/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1308/1308 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1308 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:05:12] [INFO ] Deduced a trap composed of 12 places in 242 ms of which 19 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 897/2213 variables, and 132 constraints, problems are : Problem set: 0 solved, 1308 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 126/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1308 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41234ms problems are : Problem set: 0 solved, 1308 unsolved
Search for dead transitions found 0 dead transitions in 41236ms
[2025-06-04 16:05:19] [INFO ] Flow matrix only has 1310 transitions (discarded 4 similar events)
[2025-06-04 16:05:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 16:05:21] [INFO ] Implicit Places using invariants in 1349 ms returned []
[2025-06-04 16:05:21] [INFO ] Flow matrix only has 1310 transitions (discarded 4 similar events)
[2025-06-04 16:05:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 16:05:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 16:05:26] [INFO ] Implicit Places using invariants and state equation in 5086 ms returned []
Implicit Place search using SMT with State Equation took 6440 ms to find 0 implicit places.
Running 1308 sub problems to find dead transitions.
[2025-06-04 16:05:26] [INFO ] Flow matrix only has 1310 transitions (discarded 4 similar events)
[2025-06-04 16:05:26] [INFO ] Invariant cache hit.
[2025-06-04 16:05:26] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 897/2213 variables, and 131 constraints, problems are : Problem set: 0 solved, 1308 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 126/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1308/1308 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1308 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 897/2213 variables, and 131 constraints, problems are : Problem set: 0 solved, 1308 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 126/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1308 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61305ms problems are : Problem set: 0 solved, 1308 unsolved
Search for dead transitions found 0 dead transitions in 61309ms
Starting structural reductions in LTL mode, iteration 1 : 903/904 places, 1314/1315 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 109039 ms. Remains : 903/904 places, 1314/1315 transitions.
Stuttering acceptance computed with spot in 139 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBNT-COL-S05J60-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 11 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-COL-S05J60-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S05J60-LTLCardinality-09 finished in 109198 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))&&(X((p0||X(p1))) U (X(G((p0||X(p1))))||(p0&&X((p2&&(p0||X(p1)))))))))'
Support contains 66 out of 904 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 904/904 places, 1315/1315 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 903 transition count 1314
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 903 transition count 1314
Applied a total of 2 rules in 44 ms. Remains 903 /904 variables (removed 1) and now considering 1314/1315 (removed 1) transitions.
Running 1308 sub problems to find dead transitions.
[2025-06-04 16:06:27] [INFO ] Flow matrix only has 1310 transitions (discarded 4 similar events)
[2025-06-04 16:06:27] [INFO ] Invariant cache hit.
[2025-06-04 16:06:27] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 897/2213 variables, and 131 constraints, problems are : Problem set: 0 solved, 1308 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 126/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1308/1308 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1308 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 897/2213 variables, and 131 constraints, problems are : Problem set: 0 solved, 1308 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 126/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1308 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41267ms problems are : Problem set: 0 solved, 1308 unsolved
Search for dead transitions found 0 dead transitions in 41269ms
[2025-06-04 16:07:08] [INFO ] Flow matrix only has 1310 transitions (discarded 4 similar events)
[2025-06-04 16:07:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 16:07:10] [INFO ] Implicit Places using invariants in 1268 ms returned []
[2025-06-04 16:07:10] [INFO ] Flow matrix only has 1310 transitions (discarded 4 similar events)
[2025-06-04 16:07:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 16:07:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 16:07:15] [INFO ] Implicit Places using invariants and state equation in 5295 ms returned []
Implicit Place search using SMT with State Equation took 6566 ms to find 0 implicit places.
Running 1308 sub problems to find dead transitions.
[2025-06-04 16:07:15] [INFO ] Flow matrix only has 1310 transitions (discarded 4 similar events)
[2025-06-04 16:07:15] [INFO ] Invariant cache hit.
[2025-06-04 16:07:15] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 897/2213 variables, and 131 constraints, problems are : Problem set: 0 solved, 1308 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 126/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1308/1308 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1308 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 897/2213 variables, and 131 constraints, problems are : Problem set: 0 solved, 1308 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 126/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1308 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61310ms problems are : Problem set: 0 solved, 1308 unsolved
Search for dead transitions found 0 dead transitions in 61316ms
Starting structural reductions in LTL mode, iteration 1 : 903/904 places, 1314/1315 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 109205 ms. Remains : 903/904 places, 1314/1315 transitions.
Stuttering acceptance computed with spot in 369 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), true, (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBNT-COL-S05J60-LTLCardinality-10
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-COL-S05J60-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S05J60-LTLCardinality-10 finished in 109604 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U G(p1)))'
[2025-06-04 16:08:17] [INFO ] Flatten gal took : 55 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4772175909162706346
[2025-06-04 16:08:17] [INFO ] Computing symmetric may disable matrix : 1315 transitions.
[2025-06-04 16:08:17] [INFO ] Applying decomposition
[2025-06-04 16:08:17] [INFO ] Computation of Complete disable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 16:08:17] [INFO ] Computing symmetric may enable matrix : 1315 transitions.
[2025-06-04 16:08:17] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 16:08:17] [INFO ] Flatten gal took : 49 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph8756726285632965293.txt' '-o' '/tmp/graph8756726285632965293.bin' '-w' '/tmp/graph8756726285632965293.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8756726285632965293.bin' '-l' '-1' '-v' '-w' '/tmp/graph8756726285632965293.weights' '-q' '0' '-e' '0.001'
[2025-06-04 16:08:17] [INFO ] Decomposing Gal with order
[2025-06-04 16:08:17] [INFO ] Computing Do-Not-Accords matrix : 1315 transitions.
[2025-06-04 16:08:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 16:08:17] [INFO ] Computation of Completed DNA matrix. took 39 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 16:08:17] [INFO ] Built C files in 394ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4772175909162706346
Running compilation step : cd /tmp/ltsmin4772175909162706346;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2025-06-04 16:08:18] [INFO ] Removed a total of 2021 redundant transitions.
[2025-06-04 16:08:18] [INFO ] Flatten gal took : 450 ms
[2025-06-04 16:08:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 225 labels/synchronizations in 54 ms.
[2025-06-04 16:08:18] [INFO ] Time to serialize gal into /tmp/LTLCardinality4368175659070182488.gal : 12 ms
[2025-06-04 16:08:18] [INFO ] Time to serialize properties into /tmp/LTLCardinality8151459970620806972.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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality4368175659070182488.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality8151459970620806972.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.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 1 LTL properties
Checking formula 0 : !(((F("(gi1.gi1.gu106.NotifyEventEndOfCheckSourcesE<=gi1.gi1.gu106.Check_Sources_B)"))U(G("((gi1.gi1.gu106.NotifyEventEndOfCheckSource...7117
Formula 0 simplified : G!"(gi1.gi1.gu106.NotifyEventEndOfCheckSourcesE<=gi1.gi1.gu106.Check_Sources_B)" R F!"((gi1.gi1.gu106.NotifyEventEndOfCheckSourcesE<...7110
Compilation finished in 5147 ms.
Running link step : cd /tmp/ltsmin4772175909162706346;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 66 ms.
Running LTSmin : cd /tmp/ltsmin4772175909162706346;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '(<>((LTLAPp0==true)) U []((LTLAPp1==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2025-06-04 16:35:11] [INFO ] Applying decomposition
[2025-06-04 16:35:12] [INFO ] Flatten gal took : 773 ms
[2025-06-04 16:35:12] [INFO ] Decomposing Gal with order
[2025-06-04 16:35:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 16:35:13] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.lang.RuntimeException: Could not find partition element corresponding to block in partition [CreatedJobs_0],[CreatedJobs_1],[CreatedJobs_2],[CreatedJobs_3],[CreatedJobs_4],[CreatedJobs_5],[CreatedJobs_6],[CreatedJobs_7],[CreatedJobs_8],[CreatedJobs_9],[CreatedJobs_10],[CreatedJobs_11],[CreatedJobs_12],[CreatedJobs_13],[CreatedJobs_14],[CreatedJobs_15],[CreatedJobs_16],[CreatedJobs_17],[CreatedJobs_18],[CreatedJobs_19],[CreatedJobs_20],[CreatedJobs_21],[CreatedJobs_22],[CreatedJobs_23],[CreatedJobs_24],[CreatedJobs_25],[CreatedJobs_26],[CreatedJobs_27],[CreatedJobs_28],[CreatedJobs_29],[CreatedJobs_30],[CreatedJobs_31],[CreatedJobs_32],[CreatedJobs_33],[CreatedJobs_34],[CreatedJobs_35],[CreatedJobs_36],[CreatedJobs_37],[CreatedJobs_38],[CreatedJobs_39],[CreatedJobs_40],[CreatedJobs_41],[CreatedJobs_42],[CreatedJobs_43],[CreatedJobs_44],[CreatedJobs_45],[CreatedJobs_46],[CreatedJobs_47],[CreatedJobs_48],[CreatedJobs_49],[CreatedJobs_50],[CreatedJobs_51],[CreatedJobs_52],[CreatedJobs_53],[CreatedJobs_54],[CreatedJobs_55],[CreatedJobs_56],[CreatedJobs_57],[CreatedJobs_58],[CreatedJobs_59],[CreatedJobs_60],[CreatedJobs_61],[CreatedJobs_62],[CreatedJobs_63],[CreatedJobs_64],[CreatedJobs_65],[CreatedJobs_66],[CreatedJobs_67],[CreatedJobs_68],[CreatedJobs_69],[CreatedJobs_70],[CreatedJobs_71],[CreatedJobs_72],[CreatedJobs_73],[CreatedJobs_74],[CreatedJobs_75],[CreatedJobs_76],[CreatedJobs_77],[CreatedJobs_78],[CreatedJobs_79],[CreatedJobs_80],[CreatedJobs_81],[CreatedJobs_82],[CreatedJobs_83],[CreatedJobs_84],[CreatedJobs_85],[CreatedJobs_86],[CreatedJobs_87],[CreatedJobs_88],[CreatedJobs_89],[CreatedJobs_90],[CreatedJobs_91],[CreatedJobs_92],[CreatedJobs_93],[CreatedJobs_94],[CreatedJobs_95],[CreatedJobs_96],[CreatedJobs_97],[CreatedJobs_98],[CreatedJobs_99],[CreatedJobs_100],[CreatedJobs_101],[CreatedJobs_102],[CreatedJobs_103],[CreatedJobs_104],[CreatedJobs_105],[CreatedJobs_106],[CreatedJobs_107],[CreatedJobs_108],[CreatedJobs_109],[CreatedJobs_110],[CreatedJobs_111],[CreatedJobs_112],[CreatedJobs_113],[CreatedJobs_114],[CreatedJobs_115],[CreatedJobs_116],[CreatedJobs_117],[CreatedJobs_118],[CreatedJobs_119],[CreatedJobs_120],[CreatedJobs_121],[CreatedJobs_122],[CreatedJobs_123],[CreatedJobs_124],[CreatedJobs_125],[CreatedJobs_126],[CreatedJobs_127],[CreatedJobs_128],[CreatedJobs_129],[CreatedJobs_130],[CreatedJobs_131],[CreatedJobs_132],[CreatedJobs_133],[CreatedJobs_134],[CreatedJobs_135],[CreatedJobs_136],[CreatedJobs_137],[CreatedJobs_138],[CreatedJobs_139],[CreatedJobs_140],[CreatedJobs_141],[CreatedJobs_142],[CreatedJobs_143],[CreatedJobs_144],[CreatedJobs_145],[CreatedJobs_146],[CreatedJobs_147],[CreatedJobs_148],[CreatedJobs_149],[CreatedJobs_150],[CreatedJobs_151],[CreatedJobs_152],[CreatedJobs_153],[CreatedJobs_154],[CreatedJobs_155],[CreatedJobs_156],[CreatedJobs_157],[CreatedJobs_158],[CreatedJobs_159],[CreatedJobs_160],[CreatedJobs_161],[CreatedJobs_162],[CreatedJobs_163],[CreatedJobs_164],[CreatedJobs_165],[CreatedJobs_166],[CreatedJobs_167],[CreatedJobs_168],[CreatedJobs_169],[CreatedJobs_170],[CreatedJobs_171],[CreatedJobs_172],[CreatedJobs_173],[CreatedJobs_174],[CreatedJobs_175],[CreatedJobs_176],[CreatedJobs_177],[CreatedJobs_178],[CreatedJobs_179],[CreatedJobs_180],[CreatedJobs_181],[CreatedJobs_182],[CreatedJobs_183],[CreatedJobs_184],[CreatedJobs_185],[CreatedJobs_186],[CreatedJobs_187],[CreatedJobs_188],[CreatedJobs_189],[CreatedJobs_190],[CreatedJobs_191],[CreatedJobs_192],[CreatedJobs_193],[CreatedJobs_194],[CreatedJobs_195],[CreatedJobs_196],[CreatedJobs_197],[CreatedJobs_198],[CreatedJobs_199],[CreatedJobs_200],[CreatedJobs_201],[CreatedJobs_202],[CreatedJobs_203],[CreatedJobs_204],[CreatedJobs_205],[CreatedJobs_206],[CreatedJobs_207],[CreatedJobs_208],[CreatedJobs_209],[CreatedJobs_210],[CreatedJobs_211],[CreatedJobs_212],[CreatedJobs_213],[CreatedJobs_214],[CreatedJobs_215],[CreatedJobs_216],[CreatedJobs_217],[CreatedJobs_218],[CreatedJobs_219],[CreatedJobs_220],[CreatedJobs_221],[CreatedJobs_222],[CreatedJobs_223],[CreatedJobs_224],[CreatedJobs_225],[CreatedJobs_226],[CreatedJobs_227],[CreatedJobs_228],[CreatedJobs_229],[CreatedJobs_230],[CreatedJobs_231],[CreatedJobs_232],[CreatedJobs_233],[CreatedJobs_234],[CreatedJobs_235],[CreatedJobs_236],[CreatedJobs_237],[CreatedJobs_238],[CreatedJobs_239],[CreatedJobs_240],[CreatedJobs_241],[CreatedJobs_242],[CreatedJobs_243],[CreatedJobs_244],[CreatedJobs_245],[CreatedJobs_246],[CreatedJobs_247],[CreatedJobs_248],[CreatedJobs_249],[CreatedJobs_250],[CreatedJobs_251],[CreatedJobs_252],[CreatedJobs_253],[CreatedJobs_254],[CreatedJobs_255],[CreatedJobs_256],[CreatedJobs_257],[CreatedJobs_258],[CreatedJobs_259],[CreatedJobs_260],[CreatedJobs_261],[CreatedJobs_262],[CreatedJobs_263],[CreatedJobs_264],[CreatedJobs_265],[CreatedJobs_266],[CreatedJobs_267],[CreatedJobs_268],[CreatedJobs_269],[CreatedJobs_270],[CreatedJobs_271],[CreatedJobs_272],[CreatedJobs_273],[CreatedJobs_274],[CreatedJobs_275],[CreatedJobs_276],[CreatedJobs_277],[CreatedJobs_278],[CreatedJobs_279],[CreatedJobs_280],[CreatedJobs_281],[CreatedJobs_282],[CreatedJobs_283],[CreatedJobs_284],[CreatedJobs_285],[CreatedJobs_286],[CreatedJobs_287],[CreatedJobs_288],[CreatedJobs_289],[CreatedJobs_290],[CreatedJobs_291],[CreatedJobs_292],[CreatedJobs_293],[CreatedJobs_294],[CreatedJobs_295],[CreatedJobs_296],[CreatedJobs_297],[CreatedJobs_298],[CreatedJobs_299],[CreatedJobs_300],[CreatedJobs_301],[CreatedJobs_302],[CreatedJobs_303],[CreatedJobs_304],[Schedule_Task_E_0],[Schedule_Task_E_1],[Schedule_Task_E_2],[Schedule_Task_E_3],[Schedule_Task_E_4],[Schedule_Task_E_5],[Schedule_Task_E_6],[Schedule_Task_E_7],[Schedule_Task_E_8],[Schedule_Task_E_9],[Schedule_Task_E_10],[Schedule_Task_E_11],[Schedule_Task_E_12],[Schedule_Task_E_13],[Schedule_Task_E_14],[Schedule_Task_E_15],[Schedule_Task_E_16],[Schedule_Task_E_17],[Schedule_Task_E_18],[Schedule_Task_E_19],[Schedule_Task_E_20],[Schedule_Task_E_21],[Schedule_Task_E_22],[Schedule_Task_E_23],[Schedule_Task_E_24],[Schedule_Task_E_25],[Schedule_Task_E_26],[Schedule_Task_E_27],[Schedule_Task_E_28],[Schedule_Task_E_29],[Schedule_Task_E_30],[Schedule_Task_E_31],[Schedule_Task_E_32],[Schedule_Task_E_33],[Schedule_Task_E_34],[Schedule_Task_E_35],[Schedule_Task_E_36],[Schedule_Task_E_37],[Schedule_Task_E_38],[Schedule_Task_E_39],[Schedule_Task_E_40],[Schedule_Task_E_41],[Schedule_Task_E_42],[Schedule_Task_E_43],[Schedule_Task_E_44],[Schedule_Task_E_45],[Schedule_Task_E_46],[Schedule_Task_E_47],[Schedule_Task_E_48],[Schedule_Task_E_49],[Schedule_Task_E_50],[Schedule_Task_E_51],[Schedule_Task_E_52],[Schedule_Task_E_53],[Schedule_Task_E_54],[Schedule_Task_E_55],[Schedule_Task_E_56],[Schedule_Task_E_57],[Schedule_Task_E_58],[Schedule_Task_E_59],[Schedule_Task_E_60],[Schedule_Task_E_61],[f3_0, f2_0, f1_0, AvailableJobId_0],[f3_1, f2_1, f1_1, AvailableJobId_1],[f3_2, f2_2, f1_2, AvailableJobId_2],[f3_3, f2_3, f1_3, AvailableJobId_3],[f3_4, f2_4, f1_4, AvailableJobId_4],[f3_5, f2_5, f1_5, AvailableJobId_5],[f3_6, f2_6, f1_6, AvailableJobId_6],[f3_7, f2_7, f1_7, AvailableJobId_7],[f3_8, f2_8, f1_8, AvailableJobId_8],[f3_9, f2_9, f1_9, AvailableJobId_9],[f3_10, f2_10, f1_10, AvailableJobId_10],[f3_11, f2_11, f1_11, AvailableJobId_11],[f3_12, f2_12, f1_12, AvailableJobId_12],[f3_13, f2_13, f1_13, AvailableJobId_13],[f3_14, f2_14, f1_14, AvailableJobId_14],[f3_15, f2_15, f1_15, AvailableJobId_15],[f3_16, f2_16, f1_16, AvailableJobId_16],[f3_17, f2_17, f1_17, AvailableJobId_17],[f3_18, f2_18, f1_18, AvailableJobId_18],[f3_19, f2_19, f1_19, AvailableJobId_19],[f3_20, f2_20, f1_20, AvailableJobId_20],[f3_21, f2_21, f1_21, AvailableJobId_21],[f3_22, f2_22, f1_22, AvailableJobId_22],[f3_23, f2_23, f1_23, AvailableJobId_23],[f3_24, f2_24, f1_24, AvailableJobId_24],[f3_25, f2_25, f1_25, AvailableJobId_25],[f3_26, f2_26, f1_26, AvailableJobId_26],[f3_27, f2_27, f1_27, AvailableJobId_27],[f3_28, f2_28, f1_28, AvailableJobId_28],[f3_29, f2_29, f1_29, AvailableJobId_29],[f3_30, f2_30, f1_30, AvailableJobId_30],[f3_31, f2_31, f1_31, AvailableJobId_31],[f3_32, f2_32, f1_32, AvailableJobId_32],[f3_33, f2_33, f1_33, AvailableJobId_33],[f3_34, f2_34, f1_34, AvailableJobId_34],[f3_35, f2_35, f1_35, AvailableJobId_35],[f3_36, f2_36, f1_36, AvailableJobId_36],[f3_37, f2_37, f1_37, AvailableJobId_37],[f3_38, f2_38, f1_38, AvailableJobId_38],[f3_39, f2_39, f1_39, AvailableJobId_39],[f3_40, f2_40, f1_40, AvailableJobId_40],[f3_41, f2_41, f1_41, AvailableJobId_41],[f3_42, f2_42, f1_42, AvailableJobId_42],[f3_43, f2_43, f1_43, AvailableJobId_43],[f3_44, f2_44, f1_44, AvailableJobId_44],[f3_45, f2_45, f1_45, AvailableJobId_45],[f3_46, f2_46, f1_46, AvailableJobId_46],[f3_47, f2_47, f1_47, AvailableJobId_47],[f3_48, f2_48, f1_48, AvailableJobId_48],[f3_49, f2_49, f1_49, AvailableJobId_49],[f3_50, f2_50, f1_50, AvailableJobId_50],[f3_51, f2_51, f1_51, AvailableJobId_51],[f3_52, f2_52, f1_52, AvailableJobId_52],[f3_53, f2_53, f1_53, AvailableJobId_53],[f3_54, f2_54, f1_54, AvailableJobId_54],[f3_55, f2_55, f1_55, AvailableJobId_55],[f3_56, f2_56, f1_56, AvailableJobId_56],[f3_57, f2_57, f1_57, AvailableJobId_57],[f3_58, f2_58, f1_58, AvailableJobId_58],[f3_59, f2_59, f1_59, AvailableJobId_59],[f3_60, f2_60, f1_60, AvailableJobId_60],[FetchJobE_0, QueueJobB_0, NotifyEventJobQueuedB_0, Perform_Work_B_0],[FetchJobE_1, QueueJobB_1, NotifyEventJobQueuedB_1, Perform_Work_B_1],[FetchJobE_2, QueueJobB_2, NotifyEventJobQueuedB_2, Perform_Work_B_2],[FetchJobE_3, QueueJobB_3, NotifyEventJobQueuedB_3, Perform_Work_B_3],[FetchJobE_4, QueueJobB_4, NotifyEventJobQueuedB_4, Perform_Work_B_4],[FetchJobE_5, QueueJobB_5, NotifyEventJobQueuedB_5, Perform_Work_B_5],[FetchJobE_6, QueueJobB_6, NotifyEventJobQueuedB_6, Perform_Work_B_6],[FetchJobE_7, QueueJobB_7, NotifyEventJobQueuedB_7, Perform_Work_B_7],[FetchJobE_8, QueueJobB_8, NotifyEventJobQueuedB_8, Perform_Work_B_8],[FetchJobE_9, QueueJobB_9, NotifyEventJobQueuedB_9, Perform_Work_B_9],[FetchJobE_10, QueueJobB_10, NotifyEventJobQueuedB_10, Perform_Work_B_10],[FetchJobE_11, QueueJobB_11, NotifyEventJobQueuedB_11, Perform_Work_B_11],[FetchJobE_12, QueueJobB_12, NotifyEventJobQueuedB_12, Perform_Work_B_12],[FetchJobE_13, QueueJobB_13, NotifyEventJobQueuedB_13, Perform_Work_B_13],[FetchJobE_14, QueueJobB_14, NotifyEventJobQueuedB_14, Perform_Work_B_14],[FetchJobE_15, QueueJobB_15, NotifyEventJobQueuedB_15, Perform_Work_B_15],[FetchJobE_16, QueueJobB_16, NotifyEventJobQueuedB_16, Perform_Work_B_16],[FetchJobE_17, QueueJobB_17, NotifyEventJobQueuedB_17, Perform_Work_B_17],[FetchJobE_18, QueueJobB_18, NotifyEventJobQueuedB_18, Perform_Work_B_18],[FetchJobE_19, QueueJobB_19, NotifyEventJobQueuedB_19, Perform_Work_B_19],[FetchJobE_20, QueueJobB_20, NotifyEventJobQueuedB_20, Perform_Work_B_20],[FetchJobE_21, QueueJobB_21, NotifyEventJobQueuedB_21, Perform_Work_B_21],[FetchJobE_22, QueueJobB_22, NotifyEventJobQueuedB_22, Perform_Work_B_22],[FetchJobE_23, QueueJobB_23, NotifyEventJobQueuedB_23, Perform_Work_B_23],[FetchJobE_24, QueueJobB_24, NotifyEventJobQueuedB_24, Perform_Work_B_24],[FetchJobE_25, QueueJobB_25, NotifyEventJobQueuedB_25, Perform_Work_B_25],[FetchJobE_26, QueueJobB_26, NotifyEventJobQueuedB_26, Perform_Work_B_26],[FetchJobE_27, QueueJobB_27, NotifyEventJobQueuedB_27, Perform_Work_B_27],[FetchJobE_28, QueueJobB_28, NotifyEventJobQueuedB_28, Perform_Work_B_28],[FetchJobE_29, QueueJobB_29, NotifyEventJobQueuedB_29, Perform_Work_B_29],[FetchJobE_30, QueueJobB_30, NotifyEventJobQueuedB_30, Perform_Work_B_30],[FetchJobE_31, QueueJobB_31, NotifyEventJobQueuedB_31, Perform_Work_B_31],[FetchJobE_32, QueueJobB_32, NotifyEventJobQueuedB_32, Perform_Work_B_32],[FetchJobE_33, QueueJobB_33, NotifyEventJobQueuedB_33, Perform_Work_B_33],[FetchJobE_34, QueueJobB_34, NotifyEventJobQueuedB_34, Perform_Work_B_34],[FetchJobE_35, QueueJobB_35, NotifyEventJobQueuedB_35, Perform_Work_B_35],[FetchJobE_36, QueueJobB_36, NotifyEventJobQueuedB_36, Perform_Work_B_36],[FetchJobE_37, QueueJobB_37, NotifyEventJobQueuedB_37, Perform_Work_B_37],[FetchJobE_38, QueueJobB_38, NotifyEventJobQueuedB_38, Perform_Work_B_38],[FetchJobE_39, QueueJobB_39, NotifyEventJobQueuedB_39, Perform_Work_B_39],[FetchJobE_40, QueueJobB_40, NotifyEventJobQueuedB_40, Perform_Work_B_40],[FetchJobE_41, QueueJobB_41, NotifyEventJobQueuedB_41, Perform_Work_B_41],[FetchJobE_42, QueueJobB_42, NotifyEventJobQueuedB_42, Perform_Work_B_42],[FetchJobE_43, QueueJobB_43, NotifyEventJobQueuedB_43, Perform_Work_B_43],[FetchJobE_44, QueueJobB_44, NotifyEventJobQueuedB_44, Perform_Work_B_44],[FetchJobE_45, QueueJobB_45, NotifyEventJobQueuedB_45, Perform_Work_B_45],[FetchJobE_46, QueueJobB_46, NotifyEventJobQueuedB_46, Perform_Work_B_46],[FetchJobE_47, QueueJobB_47, NotifyEventJobQueuedB_47, Perform_Work_B_47],[FetchJobE_48, QueueJobB_48, NotifyEventJobQueuedB_48, Perform_Work_B_48],[FetchJobE_49, QueueJobB_49, NotifyEventJobQueuedB_49, Perform_Work_B_49],[FetchJobE_50, QueueJobB_50, NotifyEventJobQueuedB_50, Perform_Work_B_50],[FetchJobE_51, QueueJobB_51, NotifyEventJobQueuedB_51, Perform_Work_B_51],[FetchJobE_52, QueueJobB_52, NotifyEventJobQueuedB_52, Perform_Work_B_52],[FetchJobE_53, QueueJobB_53, NotifyEventJobQueuedB_53, Perform_Work_B_53],[FetchJobE_54, QueueJobB_54, NotifyEventJobQueuedB_54, Perform_Work_B_54],[FetchJobE_55, QueueJobB_55, NotifyEventJobQueuedB_55, Perform_Work_B_55],[FetchJobE_56, QueueJobB_56, NotifyEventJobQueuedB_56, Perform_Work_B_56],[FetchJobE_57, QueueJobB_57, NotifyEventJobQueuedB_57, Perform_Work_B_57],[FetchJobE_58, QueueJobB_58, NotifyEventJobQueuedB_58, Perform_Work_B_58],[FetchJobE_59, QueueJobB_59, NotifyEventJobQueuedB_59, Perform_Work_B_59],[FetchJobE_60, QueueJobB_60, NotifyEventJobQueuedB_60, Perform_Work_B_60],[place_482_0],[place_482_1],[place_482_2],[place_482_3],[place_482_4],[ModifiedSrc_0, DataOnSrc_0],[ModifiedSrc_1, DataOnSrc_1],[ModifiedSrc_2, DataOnSrc_2],[ModifiedSrc_3, DataOnSrc_3],[ModifiedSrc_4, DataOnSrc_4],

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:1028)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
[2025-06-04 16:35:13] [INFO ] Flatten gal took : 357 ms
[2025-06-04 16:35:13] [INFO ] Time to serialize gal into /tmp/LTLCardinality10987386848127495919.gal : 30 ms
[2025-06-04 16:35:13] [INFO ] Time to serialize properties into /tmp/LTLCardinality6344728845538639312.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality10987386848127495919.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality6344728845538639312.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.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 1 LTL properties
Checking formula 0 : !(((F("(NotifyEventEndOfCheckSourcesE<=Check_Sources_B)"))U(G("((NotifyEventEndOfCheckSourcesE<=Check_Sources_B)&&(QueueJobE<=((((((((...5531
Formula 0 simplified : G!"(NotifyEventEndOfCheckSourcesE<=Check_Sources_B)" R F!"((NotifyEventEndOfCheckSourcesE<=Check_Sources_B)&&(QueueJobE<=(((((((((Cr...5524

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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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="PolyORBNT-COL-S05J60"
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-5832"
echo " Executing tool itstools"
echo " Input is PolyORBNT-COL-S05J60, 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 r156-tall-174881254300579"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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