Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r030-smll-174853813900420.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 CircularTrains-PT-192, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r030-smll-174853813900420
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 604K
-rw-r--r-- 1 mcc users 7.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K 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.4K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 147K 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 CircularTrains-PT-192-LTLFireability-00
FORMULA_NAME CircularTrains-PT-192-LTLFireability-01
FORMULA_NAME CircularTrains-PT-192-LTLFireability-02
FORMULA_NAME CircularTrains-PT-192-LTLFireability-03
FORMULA_NAME CircularTrains-PT-192-LTLFireability-04
FORMULA_NAME CircularTrains-PT-192-LTLFireability-05
FORMULA_NAME CircularTrains-PT-192-LTLFireability-06
FORMULA_NAME CircularTrains-PT-192-LTLFireability-07
FORMULA_NAME CircularTrains-PT-192-LTLFireability-08
FORMULA_NAME CircularTrains-PT-192-LTLFireability-09
FORMULA_NAME CircularTrains-PT-192-LTLFireability-10
FORMULA_NAME CircularTrains-PT-192-LTLFireability-11
FORMULA_NAME CircularTrains-PT-192-LTLFireability-12
FORMULA_NAME CircularTrains-PT-192-LTLFireability-13
FORMULA_NAME CircularTrains-PT-192-LTLFireability-14
FORMULA_NAME CircularTrains-PT-192-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748902761998

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CircularTrains-PT-192
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-02 22:19:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 22:19:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 22:19:24] [INFO ] Load time of PNML (sax parser for PT used): 169 ms
[2025-06-02 22:19:24] [INFO ] Transformed 384 places.
[2025-06-02 22:19:24] [INFO ] Transformed 192 transitions.
[2025-06-02 22:19:24] [INFO ] Parsed PT model containing 384 places and 192 transitions and 768 arcs in 411 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 21 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA CircularTrains-PT-192-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-192-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-192-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-192-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 56 out of 384 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 384/384 places, 192/192 transitions.
Applied a total of 0 rules in 75 ms. Remains 384 /384 variables (removed 0) and now considering 192/192 (removed 0) transitions.
// Phase 1: matrix 192 rows 384 cols
[2025-06-02 22:19:25] [INFO ] Computed 193 invariants in 50 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:19:26] [INFO ] Implicit Places using invariants in 1406 ms returned [1, 7, 10, 18, 21, 28, 37, 44, 47, 48, 62, 64, 65, 78, 81, 89, 101, 102, 108, 138, 141, 144, 146, 160, 167, 217, 230, 231, 244, 245, 247, 261, 283, 284, 285, 293, 298, 311, 313, 314, 324, 327, 333, 346, 350, 356, 357, 366, 369, 371, 374, 375, 376, 378, 380, 382]
Discarding 56 places :
Implicit Place search using SMT only with invariants took 1472 ms to find 56 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 328/384 places, 192/192 transitions.
Applied a total of 0 rules in 31 ms. Remains 328 /328 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1605 ms. Remains : 328/384 places, 192/192 transitions.
Support contains 56 out of 328 places after structural reductions.
[2025-06-02 22:19:27] [INFO ] Flatten gal took : 106 ms
[2025-06-02 22:19:27] [INFO ] Flatten gal took : 42 ms
[2025-06-02 22:19:27] [INFO ] Input system was already deterministic with 192 transitions.
Support contains 52 out of 328 places (down from 56) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 27 to 26
RANDOM walk for 2047 steps (0 resets) in 303 ms. (6 steps per ms) remains 0/26 properties
FORMULA CircularTrains-PT-192-LTLFireability-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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' '!(X((F(p0)&&(X(G(p0))||p1))))'
Support contains 4 out of 328 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 328/328 places, 192/192 transitions.
Applied a total of 0 rules in 29 ms. Remains 328 /328 variables (removed 0) and now considering 192/192 (removed 0) transitions.
// Phase 1: matrix 192 rows 328 cols
[2025-06-02 22:19:28] [INFO ] Computed 137 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:19:28] [INFO ] Implicit Places using invariants in 579 ms returned [62, 114, 139, 171, 288, 290, 309, 313]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 582 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 320/328 places, 192/192 transitions.
Applied a total of 0 rules in 11 ms. Remains 320 /320 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 623 ms. Remains : 320/328 places, 192/192 transitions.
Stuttering acceptance computed with spot in 445 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CircularTrains-PT-192-LTLFireability-00
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA CircularTrains-PT-192-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-192-LTLFireability-00 finished in 1197 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(X(X(p0)))))'
Support contains 2 out of 328 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 328/328 places, 192/192 transitions.
Applied a total of 0 rules in 8 ms. Remains 328 /328 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2025-06-02 22:19:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:19:30] [INFO ] Implicit Places using invariants in 596 ms returned [62, 114, 139, 171, 288, 290, 309, 313]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 605 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 320/328 places, 192/192 transitions.
Applied a total of 0 rules in 10 ms. Remains 320 /320 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 623 ms. Remains : 320/328 places, 192/192 transitions.
Stuttering acceptance computed with spot in 271 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : CircularTrains-PT-192-LTLFireability-02
Entered a terminal (fully accepting) state of product in 54 steps with 10 reset in 5 ms.
FORMULA CircularTrains-PT-192-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-192-LTLFireability-02 finished in 916 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(G(p0)))'
Support contains 2 out of 328 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 328/328 places, 192/192 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 47 place count 328 transition count 145
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 1 with 47 rules applied. Total rules applied 94 place count 281 transition count 145
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 94 place count 281 transition count 136
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 112 place count 272 transition count 136
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 126 place count 265 transition count 129
Applied a total of 126 rules in 101 ms. Remains 265 /328 variables (removed 63) and now considering 129/192 (removed 63) transitions.
// Phase 1: matrix 129 rows 265 cols
[2025-06-02 22:19:30] [INFO ] Computed 137 invariants in 18 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:19:30] [INFO ] Implicit Places using invariants in 507 ms returned [54, 97, 118, 140, 230, 231, 248, 252]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 517 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 257/328 places, 129/192 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 257 transition count 128
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 256 transition count 128
Applied a total of 2 rules in 25 ms. Remains 256 /257 variables (removed 1) and now considering 128/129 (removed 1) transitions.
// Phase 1: matrix 128 rows 256 cols
[2025-06-02 22:19:30] [INFO ] Computed 129 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:19:31] [INFO ] Implicit Places using invariants in 524 ms returned []
[2025-06-02 22:19:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:19:32] [INFO ] Implicit Places using invariants and state equation in 592 ms returned []
Implicit Place search using SMT with State Equation took 1120 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 256/328 places, 128/192 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1763 ms. Remains : 256/328 places, 128/192 transitions.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0)]
Running random walk in product with property : CircularTrains-PT-192-LTLFireability-03
Product exploration explored 100000 steps with 0 reset in 1359 ms.
Product exploration explored 100000 steps with 0 reset in 1143 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 : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 126 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
RANDOM walk for 261 steps (0 resets) in 11 ms. (21 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 130 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Support contains 2 out of 256 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 256/256 places, 128/128 transitions.
Applied a total of 0 rules in 8 ms. Remains 256 /256 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2025-06-02 22:19:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:19:35] [INFO ] Implicit Places using invariants in 509 ms returned []
[2025-06-02 22:19:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:19:36] [INFO ] Implicit Places using invariants and state equation in 616 ms returned []
Implicit Place search using SMT with State Equation took 1130 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 22:19:36] [INFO ] Redundant transitions in 6 ms returned []
Running 64 sub problems to find dead transitions.
[2025-06-02 22:19:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 127/255 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/255 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 1/256 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 128/384 variables, 256/385 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/384 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 0/384 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 384/384 variables, and 385 constraints, problems are : Problem set: 0 solved, 64 unsolved in 8197 ms.
Refiners :[Positive P Invariants (semi-flows): 127/127 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 256/256 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 127/255 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/255 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 1/256 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 128/384 variables, 256/385 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/384 variables, 64/449 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/384 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (OVERLAPS) 0/384 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 384/384 variables, and 449 constraints, problems are : Problem set: 0 solved, 64 unsolved in 4613 ms.
Refiners :[Positive P Invariants (semi-flows): 127/127 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 256/256 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12882ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 12926ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 14082 ms. Remains : 256/256 places, 128/128 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 : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 139 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
RANDOM walk for 222 steps (0 resets) in 9 ms. (22 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 136 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 795 ms.
Product exploration explored 100000 steps with 0 reset in 937 ms.
Built C files in :
/tmp/ltsmin2547435648470931179
[2025-06-02 22:19:51] [INFO ] Computing symmetric may disable matrix : 128 transitions.
[2025-06-02 22:19:51] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 22:19:51] [INFO ] Computing symmetric may enable matrix : 128 transitions.
[2025-06-02 22:19:51] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 22:19:51] [INFO ] Computing Do-Not-Accords matrix : 128 transitions.
[2025-06-02 22:19:51] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 22:19:51] [INFO ] Built C files in 45ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2547435648470931179
Running compilation step : cd /tmp/ltsmin2547435648470931179;'/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 683 ms.
Running link step : cd /tmp/ltsmin2547435648470931179;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 58 ms.
Running LTSmin : cd /tmp/ltsmin2547435648470931179;'/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' '--hoa' '/tmp/stateBased13497582680386769094.hoa' '--buchi-type=spotba'
LTSmin run took 653 ms.
FORMULA CircularTrains-PT-192-LTLFireability-03 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CircularTrains-PT-192-LTLFireability-03 finished in 22541 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((X((!p1 U (X(!p2)||G(!p1))))&&p0))))'
Support contains 6 out of 328 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 328/328 places, 192/192 transitions.
Applied a total of 0 rules in 4 ms. Remains 328 /328 variables (removed 0) and now considering 192/192 (removed 0) transitions.
// Phase 1: matrix 192 rows 328 cols
[2025-06-02 22:19:52] [INFO ] Computed 137 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:19:53] [INFO ] Implicit Places using invariants in 394 ms returned [62, 114, 139, 171, 288, 290, 309, 313]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 397 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 320/328 places, 192/192 transitions.
Applied a total of 0 rules in 3 ms. Remains 320 /320 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 404 ms. Remains : 320/328 places, 192/192 transitions.
Stuttering acceptance computed with spot in 211 ms :[(OR (NOT p0) (AND p1 p2)), (OR (NOT p0) (AND p1 p2)), (AND p1 p2), (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2))]
Running random walk in product with property : CircularTrains-PT-192-LTLFireability-04
Product exploration explored 100000 steps with 1181 reset in 1059 ms.
Product exploration explored 100000 steps with 1132 reset in 1076 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 (NOT p0) p1 p2), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 263 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 203 ms :[(OR (NOT p0) (AND p1 p2)), (OR (NOT p0) (AND p1 p2)), (AND p1 p2), (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2))]
Reduction of identical properties reduced properties to check from 10 to 9
RANDOM walk for 40000 steps (8 resets) in 779 ms. (51 steps per ms) remains 2/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 268 ms. (148 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 154 ms. (258 steps per ms) remains 2/2 properties
// Phase 1: matrix 192 rows 320 cols
[2025-06-02 22:19:56] [INFO ] Computed 129 invariants in 2 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf8 is UNSAT
Problem apf9 is UNSAT
After SMT solving in domain Real declared 6/512 variables, and 0 constraints, problems are : Problem set: 2 solved, 0 unsolved in 18 ms.
Refiners :[Positive P Invariants (semi-flows): 0/127 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/320 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 35ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (X (NOT (AND p0 p1)))), (G (OR (NOT p0) (NOT p1) (NOT p2))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (X (X p1)), (F (NOT (AND (NOT p0) p2))), (F (NOT (AND (NOT p0) p1))), (F (NOT p1)), (F (NOT (OR p1 (NOT p2)))), (F (NOT p2)), (F (NOT (OR (NOT p0) (NOT p2)))), (F p0), (F (NOT (AND (NOT p0) p1 p2)))]
Knowledge based reduction with 4 factoid took 501 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 193 ms :[(OR (NOT p0) (AND p1 p2)), (OR (NOT p0) (AND p1 p2)), (AND p1 p2), (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2))]
Stuttering acceptance computed with spot in 198 ms :[(OR (NOT p0) (AND p1 p2)), (OR (NOT p0) (AND p1 p2)), (AND p1 p2), (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2))]
[2025-06-02 22:19:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 22:19:57] [INFO ] [Real]Absence check using 127 positive place invariants in 68 ms returned sat
[2025-06-02 22:19:57] [INFO ] [Real]Absence check using 127 positive and 2 generalized place invariants in 108 ms returned sat
[2025-06-02 22:20:01] [INFO ] [Real]Absence check using state equation in 3425 ms returned sat
[2025-06-02 22:20:01] [INFO ] Computed and/alt/rep : 128/192/128 causal constraints (skipped 0 transitions) in 16 ms.
[2025-06-02 22:20:04] [INFO ] Added : 125 causal constraints over 25 iterations in 2913 ms. Result :sat
Could not prove EG (NOT p0)
[2025-06-02 22:20:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 22:20:04] [INFO ] [Real]Absence check using 127 positive place invariants in 59 ms returned sat
[2025-06-02 22:20:04] [INFO ] [Real]Absence check using 127 positive and 2 generalized place invariants in 36 ms returned sat
[2025-06-02 22:20:07] [INFO ] [Real]Absence check using state equation in 2639 ms returned sat
[2025-06-02 22:20:07] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 22:20:07] [INFO ] [Nat]Absence check using 127 positive place invariants in 64 ms returned sat
[2025-06-02 22:20:07] [INFO ] [Nat]Absence check using 127 positive and 2 generalized place invariants in 32 ms returned sat
[2025-06-02 22:20:10] [INFO ] [Nat]Absence check using state equation in 2677 ms returned sat
[2025-06-02 22:20:10] [INFO ] Computed and/alt/rep : 128/192/128 causal constraints (skipped 0 transitions) in 15 ms.
[2025-06-02 22:20:13] [INFO ] Added : 125 causal constraints over 25 iterations in 3624 ms. Result :sat
Could not prove EG (AND p1 p2)
Support contains 6 out of 320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 320/320 places, 192/192 transitions.
Applied a total of 0 rules in 6 ms. Remains 320 /320 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2025-06-02 22:20:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:20:14] [INFO ] Implicit Places using invariants in 485 ms returned []
[2025-06-02 22:20:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:20:14] [INFO ] Implicit Places using invariants and state equation in 576 ms returned []
Implicit Place search using SMT with State Equation took 1064 ms to find 0 implicit places.
Running 128 sub problems to find dead transitions.
[2025-06-02 22:20:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (OVERLAPS) 127/319 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/319 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/319 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (OVERLAPS) 1/320 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/320 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (OVERLAPS) 192/512 variables, 320/449 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/512 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 8 (OVERLAPS) 0/512 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Real declared 512/512 variables, and 449 constraints, problems are : Problem set: 0 solved, 128 unsolved in 14795 ms.
Refiners :[Positive P Invariants (semi-flows): 127/127 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 320/320 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 128 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (OVERLAPS) 127/319 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/319 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/319 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (OVERLAPS) 1/320 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/320 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (OVERLAPS) 192/512 variables, 320/449 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/512 variables, 128/577 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/512 variables, 0/577 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 9 (OVERLAPS) 0/512 variables, 0/577 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Int declared 512/512 variables, and 577 constraints, problems are : Problem set: 0 solved, 128 unsolved in 13824 ms.
Refiners :[Positive P Invariants (semi-flows): 127/127 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 320/320 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 28661ms problems are : Problem set: 0 solved, 128 unsolved
Search for dead transitions found 0 dead transitions in 28665ms
Finished structural reductions in LTL mode , in 1 iterations and 29744 ms. Remains : 320/320 places, 192/192 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 (NOT p0) p1 p2)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 307 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 277 ms :[(OR (NOT p0) (AND p1 p2)), (OR (NOT p0) (AND p1 p2)), (AND p1 p2), (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2))]
RANDOM walk for 533 steps (0 resets) in 18 ms. (28 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND (NOT p0) p1 p2)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (X (X (NOT p1))), (X (X p1)), (F (NOT (OR p1 (NOT p2)))), (F (NOT (AND (NOT p0) p2))), (F (NOT (AND p1 p2))), (F (NOT p1)), (F (NOT p2)), (F (NOT (OR (NOT p0) (NOT p2)))), (F p0)]
Knowledge based reduction with 1 factoid took 522 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 302 ms :[(OR (NOT p0) (AND p1 p2)), (OR (NOT p0) (AND p1 p2)), (AND p1 p2), (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2))]
Stuttering acceptance computed with spot in 284 ms :[(OR (NOT p0) (AND p1 p2)), (OR (NOT p0) (AND p1 p2)), (AND p1 p2), (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2))]
[2025-06-02 22:20:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 22:20:45] [INFO ] [Real]Absence check using 127 positive place invariants in 91 ms returned sat
[2025-06-02 22:20:45] [INFO ] [Real]Absence check using 127 positive and 2 generalized place invariants in 175 ms returned sat
[2025-06-02 22:20:49] [INFO ] [Real]Absence check using state equation in 3872 ms returned sat
[2025-06-02 22:20:49] [INFO ] Computed and/alt/rep : 128/192/128 causal constraints (skipped 0 transitions) in 15 ms.
[2025-06-02 22:20:52] [INFO ] Added : 125 causal constraints over 25 iterations in 2928 ms. Result :sat
Could not prove EG (NOT p0)
[2025-06-02 22:20:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 22:20:53] [INFO ] [Real]Absence check using 127 positive place invariants in 65 ms returned sat
[2025-06-02 22:20:53] [INFO ] [Real]Absence check using 127 positive and 2 generalized place invariants in 61 ms returned sat
[2025-06-02 22:20:56] [INFO ] [Real]Absence check using state equation in 3108 ms returned sat
[2025-06-02 22:20:56] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 22:20:56] [INFO ] [Nat]Absence check using 127 positive place invariants in 60 ms returned sat
[2025-06-02 22:20:56] [INFO ] [Nat]Absence check using 127 positive and 2 generalized place invariants in 47 ms returned sat
[2025-06-02 22:20:59] [INFO ] [Nat]Absence check using state equation in 2716 ms returned sat
[2025-06-02 22:20:59] [INFO ] Computed and/alt/rep : 128/192/128 causal constraints (skipped 0 transitions) in 15 ms.
[2025-06-02 22:21:03] [INFO ] Added : 125 causal constraints over 25 iterations in 4383 ms. Result :sat
Could not prove EG (AND p1 p2)
Stuttering acceptance computed with spot in 257 ms :[(OR (NOT p0) (AND p1 p2)), (OR (NOT p0) (AND p1 p2)), (AND p1 p2), (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2))]
Product exploration explored 100000 steps with 1155 reset in 1163 ms.
Product exploration explored 100000 steps with 1147 reset in 1210 ms.
Built C files in :
/tmp/ltsmin17557032376180331322
[2025-06-02 22:21:06] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17557032376180331322
Running compilation step : cd /tmp/ltsmin17557032376180331322;'/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 843 ms.
Running link step : cd /tmp/ltsmin17557032376180331322;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin17557032376180331322;'/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/stateBased10936848436572458372.hoa' '--buchi-type=spotba'
LTSmin run took 2240 ms.
FORMULA CircularTrains-PT-192-LTLFireability-04 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CircularTrains-PT-192-LTLFireability-04 finished in 77096 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(p0)||X(X(X(p1)))) U p1)))'
Support contains 4 out of 328 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 328/328 places, 192/192 transitions.
Applied a total of 0 rules in 4 ms. Remains 328 /328 variables (removed 0) and now considering 192/192 (removed 0) transitions.
// Phase 1: matrix 192 rows 328 cols
[2025-06-02 22:21:09] [INFO ] Computed 137 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:21:10] [INFO ] Implicit Places using invariants in 501 ms returned [62, 114, 171, 288, 290, 309, 313]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 503 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 321/328 places, 192/192 transitions.
Applied a total of 0 rules in 6 ms. Remains 321 /321 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 513 ms. Remains : 321/328 places, 192/192 transitions.
Stuttering acceptance computed with spot in 491 ms :[(NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p1), true, (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : CircularTrains-PT-192-LTLFireability-05
Entered a terminal (fully accepting) state of product in 9 steps with 0 reset in 0 ms.
FORMULA CircularTrains-PT-192-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-192-LTLFireability-05 finished in 1033 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((X(X((F(p2)||p1)))||p0)))))'
Support contains 6 out of 328 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 328/328 places, 192/192 transitions.
Applied a total of 0 rules in 6 ms. Remains 328 /328 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2025-06-02 22:21:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:21:11] [INFO ] Implicit Places using invariants in 541 ms returned [62, 139, 171, 288, 290, 309, 313]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 542 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 321/328 places, 192/192 transitions.
Applied a total of 0 rules in 6 ms. Remains 321 /321 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 554 ms. Remains : 321/328 places, 192/192 transitions.
Stuttering acceptance computed with spot in 316 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : CircularTrains-PT-192-LTLFireability-06
Product exploration explored 100000 steps with 207 reset in 1300 ms.
Product exploration explored 100000 steps with 198 reset in 889 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 (NOT p2)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 123 ms. Reduced automaton from 6 states, 7 edges and 3 AP (stutter sensitive) to 6 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 321 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
RANDOM walk for 1367 steps (0 resets) in 32 ms. (41 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (X p0))]
False Knowledge obtained : [(F (NOT p1)), (F p2), (F (NOT (OR p1 p2))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 259 ms. Reduced automaton from 6 states, 7 edges and 3 AP (stutter sensitive) to 6 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 317 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 318 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Support contains 6 out of 321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 321/321 places, 192/192 transitions.
Applied a total of 0 rules in 6 ms. Remains 321 /321 variables (removed 0) and now considering 192/192 (removed 0) transitions.
// Phase 1: matrix 192 rows 321 cols
[2025-06-02 22:21:15] [INFO ] Computed 130 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:21:15] [INFO ] Implicit Places using invariants in 504 ms returned []
[2025-06-02 22:21:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:21:16] [INFO ] Implicit Places using invariants and state equation in 719 ms returned []
Implicit Place search using SMT with State Equation took 1231 ms to find 0 implicit places.
Running 128 sub problems to find dead transitions.
[2025-06-02 22:21:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/193 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (OVERLAPS) 127/320 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/320 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/320 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (OVERLAPS) 1/321 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/321 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (OVERLAPS) 192/513 variables, 321/451 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/513 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 8 (OVERLAPS) 0/513 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Real declared 513/513 variables, and 451 constraints, problems are : Problem set: 0 solved, 128 unsolved in 20110 ms.
Refiners :[Positive P Invariants (semi-flows): 127/127 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 321/321 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 128 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/193 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (OVERLAPS) 127/320 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/320 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/320 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (OVERLAPS) 1/321 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/321 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (OVERLAPS) 192/513 variables, 321/451 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/513 variables, 128/579 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/513 variables, 0/579 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 9 (OVERLAPS) 0/513 variables, 0/579 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Int declared 513/513 variables, and 579 constraints, problems are : Problem set: 0 solved, 128 unsolved in 15996 ms.
Refiners :[Positive P Invariants (semi-flows): 127/127 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 321/321 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 36148ms problems are : Problem set: 0 solved, 128 unsolved
Search for dead transitions found 0 dead transitions in 36150ms
Finished structural reductions in LTL mode , in 1 iterations and 37388 ms. Remains : 321/321 places, 192/192 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 (NOT p2)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 135 ms. Reduced automaton from 6 states, 7 edges and 3 AP (stutter sensitive) to 6 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 329 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
RANDOM walk for 1581 steps (0 resets) in 27 ms. (56 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (X p0))]
False Knowledge obtained : [(F (NOT p1)), (F p2), (F (NOT (OR p1 p2))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 286 ms. Reduced automaton from 6 states, 7 edges and 3 AP (stutter sensitive) to 6 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 335 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 342 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 331 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Product exploration explored 100000 steps with 249 reset in 1178 ms.
Product exploration explored 100000 steps with 227 reset in 910 ms.
Applying partial POR strategy [false, false, false, false, true, true]
Stuttering acceptance computed with spot in 286 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Support contains 6 out of 321 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 321/321 places, 192/192 transitions.
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 321 transition count 192
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 60 place count 321 transition count 192
Deduced a syphon composed of 61 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 321 transition count 192
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 62 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 62 place count 321 transition count 192
Deduced a syphon composed of 62 places in 0 ms
Applied a total of 62 rules in 50 ms. Remains 321 /321 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 22:21:57] [INFO ] Redundant transitions in 7 ms returned []
Running 128 sub problems to find dead transitions.
// Phase 1: matrix 192 rows 321 cols
[2025-06-02 22:21:57] [INFO ] Computed 130 invariants in 3 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/193 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (OVERLAPS) 127/320 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/320 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 128 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:22:00] [INFO ] Deduced a trap composed of 2 places in 104 ms of which 9 ms to minimize.
Problem TDEAD0 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:22:00] [INFO ] Deduced a trap composed of 2 places in 87 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:22:00] [INFO ] Deduced a trap composed of 2 places in 77 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:22:00] [INFO ] Deduced a trap composed of 2 places in 83 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:22:00] [INFO ] Deduced a trap composed of 2 places in 83 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:22:00] [INFO ] Deduced a trap composed of 2 places in 77 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:22:00] [INFO ] Deduced a trap composed of 2 places in 87 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:22:00] [INFO ] Deduced a trap composed of 2 places in 75 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:22:00] [INFO ] Deduced a trap composed of 2 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:22:00] [INFO ] Deduced a trap composed of 2 places in 68 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:22:00] [INFO ] Deduced a trap composed of 2 places in 69 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:22:01] [INFO ] Deduced a trap composed of 2 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:22:01] [INFO ] Deduced a trap composed of 2 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:22:01] [INFO ] Deduced a trap composed of 2 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:22:01] [INFO ] Deduced a trap composed of 2 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:22:01] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:22:01] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:22:01] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:22:01] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:22:01] [INFO ] Deduced a trap composed of 2 places in 34 ms of which 3 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD125 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/320 variables, 20/149 constraints. Problems are: Problem set: 20 solved, 108 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:22:02] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:22:02] [INFO ] Deduced a trap composed of 2 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:22:02] [INFO ] Deduced a trap composed of 2 places in 31 ms of which 3 ms to minimize.
Problem TDEAD7 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:22:02] [INFO ] Deduced a trap composed of 2 places in 31 ms of which 3 ms to minimize.
Problem TDEAD8 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:22:03] [INFO ] Deduced a trap composed of 2 places in 37 ms of which 3 ms to minimize.
Problem TDEAD9 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:22:03] [INFO ] Deduced a trap composed of 2 places in 31 ms of which 3 ms to minimize.
Problem TDEAD10 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:22:03] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 3 ms to minimize.
Problem TDEAD11 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:22:03] [INFO ] Deduced a trap composed of 2 places in 34 ms of which 3 ms to minimize.
Problem TDEAD16 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:22:03] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 3 ms to minimize.
Problem TDEAD22 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:22:03] [INFO ] Deduced a trap composed of 2 places in 34 ms of which 3 ms to minimize.
Problem TDEAD26 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:22:03] [INFO ] Deduced a trap composed of 2 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:22:03] [INFO ] Deduced a trap composed of 2 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:22:03] [INFO ] Deduced a trap composed of 2 places in 31 ms of which 3 ms to minimize.
Problem TDEAD30 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:22:03] [INFO ] Deduced a trap composed of 2 places in 32 ms of which 3 ms to minimize.
Problem TDEAD33 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:22:03] [INFO ] Deduced a trap composed of 2 places in 32 ms of which 3 ms to minimize.
Problem TDEAD39 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:22:03] [INFO ] Deduced a trap composed of 2 places in 33 ms of which 3 ms to minimize.
Problem TDEAD45 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:22:03] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 3 ms to minimize.
Problem TDEAD52 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:22:03] [INFO ] Deduced a trap composed of 2 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:22:04] [INFO ] Deduced a trap composed of 2 places in 31 ms of which 3 ms to minimize.
Problem TDEAD57 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:22:04] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 4 ms to minimize.
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD123 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/320 variables, 20/169 constraints. Problems are: Problem set: 40 solved, 88 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:22:04] [INFO ] Deduced a trap composed of 2 places in 52 ms of which 4 ms to minimize.
Problem TDEAD62 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:22:04] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:22:04] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:22:04] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 3 ms to minimize.
Problem TDEAD66 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:22:04] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 3 ms to minimize.
Problem TDEAD69 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:22:04] [INFO ] Deduced a trap composed of 2 places in 35 ms of which 3 ms to minimize.
Problem TDEAD70 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:22:04] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 3 ms to minimize.
Problem TDEAD73 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:22:05] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 8 ms to minimize.
Problem TDEAD74 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:22:05] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 2 ms to minimize.
Problem TDEAD75 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:22:05] [INFO ] Deduced a trap composed of 2 places in 32 ms of which 3 ms to minimize.
Problem TDEAD76 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:22:05] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 3 ms to minimize.
Problem TDEAD83 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:22:05] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 3 ms to minimize.
Problem TDEAD84 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:22:05] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 4 ms to minimize.
Problem TDEAD87 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:22:05] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 3 ms to minimize.
Problem TDEAD89 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:22:05] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 3 ms to minimize.
Problem TDEAD90 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:22:05] [INFO ] Deduced a trap composed of 2 places in 36 ms of which 3 ms to minimize.
Problem TDEAD91 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:22:05] [INFO ] Deduced a trap composed of 2 places in 31 ms of which 3 ms to minimize.
Problem TDEAD97 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:22:05] [INFO ] Deduced a trap composed of 2 places in 31 ms of which 3 ms to minimize.
Problem TDEAD98 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:22:05] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 3 ms to minimize.
Problem TDEAD101 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:22:05] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 2 ms to minimize.
Problem TDEAD55 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD110 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/320 variables, 20/189 constraints. Problems are: Problem set: 60 solved, 68 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/320 variables, 0/189 constraints. Problems are: Problem set: 60 solved, 68 unsolved
At refinement iteration 7 (OVERLAPS) 1/321 variables, 1/190 constraints. Problems are: Problem set: 60 solved, 68 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/321 variables, 0/190 constraints. Problems are: Problem set: 60 solved, 68 unsolved
Problem TDEAD12 is UNSAT
Problem TDEAD121 is UNSAT
At refinement iteration 9 (OVERLAPS) 192/513 variables, 321/511 constraints. Problems are: Problem set: 62 solved, 66 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/513 variables, 0/511 constraints. Problems are: Problem set: 62 solved, 66 unsolved
At refinement iteration 11 (OVERLAPS) 0/513 variables, 0/511 constraints. Problems are: Problem set: 62 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Real declared 513/513 variables, and 511 constraints, problems are : Problem set: 62 solved, 66 unsolved in 17616 ms.
Refiners :[Positive P Invariants (semi-flows): 127/127 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 321/321 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 60/60 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 62 solved, 66 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 62 solved, 66 unsolved
At refinement iteration 1 (OVERLAPS) 189/320 variables, 127/127 constraints. Problems are: Problem set: 62 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/320 variables, 2/129 constraints. Problems are: Problem set: 62 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/320 variables, 60/189 constraints. Problems are: Problem set: 62 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/320 variables, 0/189 constraints. Problems are: Problem set: 62 solved, 66 unsolved
At refinement iteration 5 (OVERLAPS) 1/321 variables, 1/190 constraints. Problems are: Problem set: 62 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/321 variables, 0/190 constraints. Problems are: Problem set: 62 solved, 66 unsolved
At refinement iteration 7 (OVERLAPS) 192/513 variables, 321/511 constraints. Problems are: Problem set: 62 solved, 66 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/513 variables, 66/577 constraints. Problems are: Problem set: 62 solved, 66 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/513 variables, 0/577 constraints. Problems are: Problem set: 62 solved, 66 unsolved
At refinement iteration 10 (OVERLAPS) 0/513 variables, 0/577 constraints. Problems are: Problem set: 62 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Int declared 513/513 variables, and 577 constraints, problems are : Problem set: 62 solved, 66 unsolved in 12285 ms.
Refiners :[Positive P Invariants (semi-flows): 127/127 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 321/321 constraints, PredecessorRefiner: 66/128 constraints, Known Traps: 60/60 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 29929ms problems are : Problem set: 62 solved, 66 unsolved
Search for dead transitions found 62 dead transitions in 29931ms
Found 62 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 62 transitions
Dead transitions reduction (with SMT) removed 62 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 321/321 places, 130/192 transitions.
Graph (complete) has 516 edges and 321 vertex of which 259 are kept as prefixes of interest. Removing 62 places using SCC suffix rule.3 ms
Discarding 62 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 17 ms. Remains 259 /321 variables (removed 62) and now considering 130/130 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 259/321 places, 130/192 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 30025 ms. Remains : 259/321 places, 130/192 transitions.
Built C files in :
/tmp/ltsmin12580225728195927162
[2025-06-02 22:22:27] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12580225728195927162
Running compilation step : cd /tmp/ltsmin12580225728195927162;'/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 719 ms.
Running link step : cd /tmp/ltsmin12580225728195927162;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 62 ms.
Running LTSmin : cd /tmp/ltsmin12580225728195927162;'/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/stateBased14385437721312179284.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 321/321 places, 192/192 transitions.
Applied a total of 0 rules in 7 ms. Remains 321 /321 variables (removed 0) and now considering 192/192 (removed 0) transitions.
// Phase 1: matrix 192 rows 321 cols
[2025-06-02 22:22:42] [INFO ] Computed 130 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:22:42] [INFO ] Implicit Places using invariants in 415 ms returned []
[2025-06-02 22:22:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:22:43] [INFO ] Implicit Places using invariants and state equation in 639 ms returned []
Implicit Place search using SMT with State Equation took 1064 ms to find 0 implicit places.
Running 128 sub problems to find dead transitions.
[2025-06-02 22:22:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/193 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (OVERLAPS) 127/320 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/320 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/320 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (OVERLAPS) 1/321 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/321 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (OVERLAPS) 192/513 variables, 321/451 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/513 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 8 (OVERLAPS) 0/513 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Real declared 513/513 variables, and 451 constraints, problems are : Problem set: 0 solved, 128 unsolved in 18447 ms.
Refiners :[Positive P Invariants (semi-flows): 127/127 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 321/321 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 128 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/193 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (OVERLAPS) 127/320 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/320 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/320 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (OVERLAPS) 1/321 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/321 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (OVERLAPS) 192/513 variables, 321/451 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/513 variables, 128/579 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/513 variables, 0/579 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 9 (OVERLAPS) 0/513 variables, 0/579 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Int declared 513/513 variables, and 579 constraints, problems are : Problem set: 0 solved, 128 unsolved in 10105 ms.
Refiners :[Positive P Invariants (semi-flows): 127/127 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 321/321 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 28568ms problems are : Problem set: 0 solved, 128 unsolved
Search for dead transitions found 0 dead transitions in 28570ms
Finished structural reductions in LTL mode , in 1 iterations and 29646 ms. Remains : 321/321 places, 192/192 transitions.
Built C files in :
/tmp/ltsmin7654761268360246548
[2025-06-02 22:23:12] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7654761268360246548
Running compilation step : cd /tmp/ltsmin7654761268360246548;'/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 566 ms.
Running link step : cd /tmp/ltsmin7654761268360246548;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin7654761268360246548;'/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/stateBased15826821760002829871.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-02 22:23:27] [INFO ] Flatten gal took : 19 ms
[2025-06-02 22:23:27] [INFO ] Flatten gal took : 18 ms
[2025-06-02 22:23:27] [INFO ] Time to serialize gal into /tmp/LTL11786549019404599377.gal : 6 ms
[2025-06-02 22:23:27] [INFO ] Time to serialize properties into /tmp/LTL6763937508520194002.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11786549019404599377.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3040007975085058401.hoa' '-atoms' '/tmp/LTL6763937508520194002.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/LTL6763937508520194002.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3040007975085058401.hoa
Detected timeout of ITS tools.
[2025-06-02 22:23:42] [INFO ] Flatten gal took : 17 ms
[2025-06-02 22:23:42] [INFO ] Flatten gal took : 16 ms
[2025-06-02 22:23:42] [INFO ] Time to serialize gal into /tmp/LTL2133611812086245135.gal : 4 ms
[2025-06-02 22:23:42] [INFO ] Time to serialize properties into /tmp/LTL1308805270740751890.ltl : 20 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/LTL2133611812086245135.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1308805270740751890.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 : !((X(X(G(("(((Section_119<1)||(F120<1))||((F176<1)||(Section_175<1)))")||(X(X(("((F176<1)||(Section_175<1))")||(F("((F121<1)||(Section...174
Formula 0 simplified : XXF(!"(((Section_119<1)||(F120<1))||((F176<1)||(Section_175<1)))" & XX(!"((F176<1)||(Section_175<1))" & G!"((F121<1)||(Section_120<1...160
Detected timeout of ITS tools.
[2025-06-02 22:23:57] [INFO ] Flatten gal took : 17 ms
[2025-06-02 22:23:57] [INFO ] Applying decomposition
[2025-06-02 22:23:57] [INFO ] Flatten gal took : 16 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/graph1864693122479020576.txt' '-o' '/tmp/graph1864693122479020576.bin' '-w' '/tmp/graph1864693122479020576.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1864693122479020576.bin' '-l' '-1' '-v' '-w' '/tmp/graph1864693122479020576.weights' '-q' '0' '-e' '0.001'
[2025-06-02 22:23:57] [INFO ] Decomposing Gal with order
[2025-06-02 22:23:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 22:23:57] [INFO ] Flatten gal took : 73 ms
[2025-06-02 22:23:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2025-06-02 22:23:57] [INFO ] Time to serialize gal into /tmp/LTL12693032901243279179.gal : 7 ms
[2025-06-02 22:23:57] [INFO ] Time to serialize properties into /tmp/LTL9059730107508187085.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12693032901243279179.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9059730107508187085.ltl' '-c' '-stutter-deadlock'

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...255
Read 1 LTL properties
Checking formula 0 : !((X(X(G(("(((i6.i0.u47.Section_119<1)||(i15.u44.F120<1))||((i10.i0.u23.F176<1)||(i10.i0.u21.Section_175<1)))")||(X(X(("((i10.i0.u23.F...252
Formula 0 simplified : XXF(!"(((i6.i0.u47.Section_119<1)||(i15.u44.F120<1))||((i10.i0.u23.F176<1)||(i10.i0.u21.Section_175<1)))" & XX(!"((i10.i0.u23.F176<1...238
Detected timeout of ITS tools.
Treatment of property CircularTrains-PT-192-LTLFireability-06 finished in 182045 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)&&F(p1))))'
Support contains 4 out of 328 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 328/328 places, 192/192 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 46 place count 328 transition count 146
Reduce places removed 46 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 47 rules applied. Total rules applied 93 place count 282 transition count 145
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 94 place count 281 transition count 145
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 94 place count 281 transition count 136
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 112 place count 272 transition count 136
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 126 place count 265 transition count 129
Applied a total of 126 rules in 33 ms. Remains 265 /328 variables (removed 63) and now considering 129/192 (removed 63) transitions.
// Phase 1: matrix 129 rows 265 cols
[2025-06-02 22:24:13] [INFO ] Computed 137 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:24:13] [INFO ] Implicit Places using invariants in 385 ms returned [54, 97, 118, 140, 230, 231, 248, 252]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 388 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 257/328 places, 129/192 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 257 transition count 128
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 256 transition count 128
Applied a total of 2 rules in 10 ms. Remains 256 /257 variables (removed 1) and now considering 128/129 (removed 1) transitions.
// Phase 1: matrix 128 rows 256 cols
[2025-06-02 22:24:13] [INFO ] Computed 129 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:24:14] [INFO ] Implicit Places using invariants in 607 ms returned []
[2025-06-02 22:24:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:24:14] [INFO ] Implicit Places using invariants and state equation in 396 ms returned []
Implicit Place search using SMT with State Equation took 1006 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 256/328 places, 128/192 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1438 ms. Remains : 256/328 places, 128/192 transitions.
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CircularTrains-PT-192-LTLFireability-08
Product exploration explored 100000 steps with 1442 reset in 1328 ms.
Product exploration explored 100000 steps with 1416 reset in 1224 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 (NOT p1)), (X (NOT p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 202 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 280 steps (0 resets) in 9 ms. (28 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (X (X (NOT p1))), (X (X p1)), (F (NOT p0)), (F p1)]
Knowledge based reduction with 2 factoid took 321 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2025-06-02 22:24:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 22:24:18] [INFO ] [Real]Absence check using 127 positive place invariants in 57 ms returned sat
[2025-06-02 22:24:18] [INFO ] [Real]Absence check using 127 positive and 2 generalized place invariants in 35 ms returned sat
[2025-06-02 22:24:19] [INFO ] [Real]Absence check using state equation in 1094 ms returned sat
[2025-06-02 22:24:19] [INFO ] Computed and/alt/rep : 64/128/64 causal constraints (skipped 0 transitions) in 8 ms.
[2025-06-02 22:24:20] [INFO ] Added : 62 causal constraints over 13 iterations in 635 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 4 out of 256 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 256/256 places, 128/128 transitions.
Applied a total of 0 rules in 7 ms. Remains 256 /256 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2025-06-02 22:24:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:24:20] [INFO ] Implicit Places using invariants in 420 ms returned []
[2025-06-02 22:24:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:24:20] [INFO ] Implicit Places using invariants and state equation in 432 ms returned []
Implicit Place search using SMT with State Equation took 855 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 22:24:20] [INFO ] Redundant transitions in 3 ms returned []
Running 64 sub problems to find dead transitions.
[2025-06-02 22:24:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 127/255 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/255 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 1/256 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 128/384 variables, 256/385 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/384 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 0/384 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 384/384 variables, and 385 constraints, problems are : Problem set: 0 solved, 64 unsolved in 6211 ms.
Refiners :[Positive P Invariants (semi-flows): 127/127 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 256/256 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 127/255 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/255 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 1/256 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 128/384 variables, 256/385 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/384 variables, 64/449 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/384 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (OVERLAPS) 0/384 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 384/384 variables, and 449 constraints, problems are : Problem set: 0 solved, 64 unsolved in 6189 ms.
Refiners :[Positive P Invariants (semi-flows): 127/127 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 256/256 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12412ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 12413ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 13284 ms. Remains : 256/256 places, 128/128 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 (NOT p1)), (X (NOT p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 309 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 721 steps (0 resets) in 16 ms. (42 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (X (X (NOT p1))), (X (X p1)), (F (NOT p0)), (F p1)]
Knowledge based reduction with 2 factoid took 376 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 152 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2025-06-02 22:24:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 22:24:34] [INFO ] [Real]Absence check using 127 positive place invariants in 87 ms returned sat
[2025-06-02 22:24:34] [INFO ] [Real]Absence check using 127 positive and 2 generalized place invariants in 60 ms returned sat
[2025-06-02 22:24:36] [INFO ] [Real]Absence check using state equation in 1359 ms returned sat
[2025-06-02 22:24:36] [INFO ] Computed and/alt/rep : 64/128/64 causal constraints (skipped 0 transitions) in 13 ms.
[2025-06-02 22:24:37] [INFO ] Added : 62 causal constraints over 13 iterations in 905 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 1476 reset in 1218 ms.
Product exploration explored 100000 steps with 1443 reset in 1046 ms.
Built C files in :
/tmp/ltsmin1906673257228575174
[2025-06-02 22:24:39] [INFO ] Computing symmetric may disable matrix : 128 transitions.
[2025-06-02 22:24:39] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 22:24:39] [INFO ] Computing symmetric may enable matrix : 128 transitions.
[2025-06-02 22:24:39] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 22:24:39] [INFO ] Computing Do-Not-Accords matrix : 128 transitions.
[2025-06-02 22:24:39] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 22:24:39] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1906673257228575174
Running compilation step : cd /tmp/ltsmin1906673257228575174;'/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 508 ms.
Running link step : cd /tmp/ltsmin1906673257228575174;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin1906673257228575174;'/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' '--hoa' '/tmp/stateBased6091165745271405933.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 256 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 256/256 places, 128/128 transitions.
Applied a total of 0 rules in 13 ms. Remains 256 /256 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2025-06-02 22:24:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:24:55] [INFO ] Implicit Places using invariants in 399 ms returned []
[2025-06-02 22:24:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:24:55] [INFO ] Implicit Places using invariants and state equation in 638 ms returned []
Implicit Place search using SMT with State Equation took 1041 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 22:24:55] [INFO ] Redundant transitions in 1 ms returned []
Running 64 sub problems to find dead transitions.
[2025-06-02 22:24:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 127/255 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/255 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 1/256 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 128/384 variables, 256/385 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/384 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 0/384 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 384/384 variables, and 385 constraints, problems are : Problem set: 0 solved, 64 unsolved in 8118 ms.
Refiners :[Positive P Invariants (semi-flows): 127/127 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 256/256 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 127/255 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/255 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 1/256 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 128/384 variables, 256/385 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/384 variables, 64/449 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/384 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (OVERLAPS) 0/384 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 384/384 variables, and 449 constraints, problems are : Problem set: 0 solved, 64 unsolved in 6431 ms.
Refiners :[Positive P Invariants (semi-flows): 127/127 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 256/256 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14562ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 14563ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 15626 ms. Remains : 256/256 places, 128/128 transitions.
Built C files in :
/tmp/ltsmin17643127391124302779
[2025-06-02 22:25:10] [INFO ] Computing symmetric may disable matrix : 128 transitions.
[2025-06-02 22:25:10] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 22:25:10] [INFO ] Computing symmetric may enable matrix : 128 transitions.
[2025-06-02 22:25:10] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 22:25:10] [INFO ] Computing Do-Not-Accords matrix : 128 transitions.
[2025-06-02 22:25:10] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 22:25:10] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17643127391124302779
Running compilation step : cd /tmp/ltsmin17643127391124302779;'/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 623 ms.
Running link step : cd /tmp/ltsmin17643127391124302779;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin17643127391124302779;'/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' '--hoa' '/tmp/stateBased262371864443106007.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-02 22:25:25] [INFO ] Flatten gal took : 12 ms
[2025-06-02 22:25:25] [INFO ] Flatten gal took : 16 ms
[2025-06-02 22:25:25] [INFO ] Time to serialize gal into /tmp/LTL10065020999292812734.gal : 3 ms
[2025-06-02 22:25:25] [INFO ] Time to serialize properties into /tmp/LTL14492066159876637944.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10065020999292812734.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1063416496877515501.hoa' '-atoms' '/tmp/LTL14492066159876637944.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...319
Loading property file /tmp/LTL14492066159876637944.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1063416496877515501.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2025-06-02 22:25:40] [INFO ] Flatten gal took : 10 ms
[2025-06-02 22:25:40] [INFO ] Flatten gal took : 9 ms
[2025-06-02 22:25:40] [INFO ] Time to serialize gal into /tmp/LTL4383363295089508695.gal : 2 ms
[2025-06-02 22:25:40] [INFO ] Time to serialize properties into /tmp/LTL1409567805792842186.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4383363295089508695.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1409567805792842186.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 : !((G((F("((Section_156>=1)&&(F157>=1))"))&&(F("((F87>=1)&&(Section_86>=1))")))))
Formula 0 simplified : F(G!"((Section_156>=1)&&(F157>=1))" | G!"((F87>=1)&&(Section_86>=1))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2025-06-02 22:25:55] [INFO ] Flatten gal took : 10 ms
[2025-06-02 22:25:55] [INFO ] Applying decomposition
[2025-06-02 22:25:55] [INFO ] Flatten gal took : 10 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/graph15458970075002167323.txt' '-o' '/tmp/graph15458970075002167323.bin' '-w' '/tmp/graph15458970075002167323.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15458970075002167323.bin' '-l' '-1' '-v' '-w' '/tmp/graph15458970075002167323.weights' '-q' '0' '-e' '0.001'
[2025-06-02 22:25:55] [INFO ] Decomposing Gal with order
[2025-06-02 22:25:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 22:25:56] [INFO ] Flatten gal took : 52 ms
[2025-06-02 22:25:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 19 ms.
[2025-06-02 22:25:56] [INFO ] Time to serialize gal into /tmp/LTL4727152511213847545.gal : 6 ms
[2025-06-02 22:25:56] [INFO ] Time to serialize properties into /tmp/LTL11653818647116949756.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/LTL4727152511213847545.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11653818647116949756.ltl' '-c' '-stutter-deadlock'

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...255
Read 1 LTL properties
Checking formula 0 : !((G((F("((i4.u23.Section_156>=1)&&(i9.u102.F157>=1))"))&&(F("((i12.i0.i0.u10.F87>=1)&&(i12.i0.i0.u64.Section_86>=1))")))))
Formula 0 simplified : F(G!"((i4.u23.Section_156>=1)&&(i9.u102.F157>=1))" | G!"((i12.i0.i0.u10.F87>=1)&&(i12.i0.i0.u64.Section_86>=1))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Treatment of property CircularTrains-PT-192-LTLFireability-08 finished in 118132 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(X(p0)) U p0)||!(p1 U p2)||X(!p1)))'
Support contains 6 out of 328 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 328/328 places, 192/192 transitions.
Applied a total of 0 rules in 3 ms. Remains 328 /328 variables (removed 0) and now considering 192/192 (removed 0) transitions.
// Phase 1: matrix 192 rows 328 cols
[2025-06-02 22:26:11] [INFO ] Computed 137 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:26:11] [INFO ] Implicit Places using invariants in 363 ms returned [62, 114, 139, 171, 288, 290, 313]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 365 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 321/328 places, 192/192 transitions.
Applied a total of 0 rules in 3 ms. Remains 321 /321 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 372 ms. Remains : 321/328 places, 192/192 transitions.
Stuttering acceptance computed with spot in 231 ms :[true, (AND (NOT p0) p2 p1), (AND (NOT p0) p1), (AND (NOT p0) p2 p1), (NOT p0), p2, (AND (NOT p0) p2)]
Running random walk in product with property : CircularTrains-PT-192-LTLFireability-11
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA CircularTrains-PT-192-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-192-LTLFireability-11 finished in 626 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))'
Support contains 2 out of 328 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 328/328 places, 192/192 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 49 place count 328 transition count 143
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 98 place count 279 transition count 143
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 98 place count 279 transition count 137
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 110 place count 273 transition count 137
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 124 place count 266 transition count 130
Applied a total of 124 rules in 15 ms. Remains 266 /328 variables (removed 62) and now considering 130/192 (removed 62) transitions.
// Phase 1: matrix 130 rows 266 cols
[2025-06-02 22:26:11] [INFO ] Computed 137 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:26:12] [INFO ] Implicit Places using invariants in 285 ms returned [54, 97, 118, 140, 231, 249, 253]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 294 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 259/328 places, 130/192 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 259 transition count 129
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 258 transition count 129
Applied a total of 2 rules in 7 ms. Remains 258 /259 variables (removed 1) and now considering 129/130 (removed 1) transitions.
// Phase 1: matrix 129 rows 258 cols
[2025-06-02 22:26:12] [INFO ] Computed 130 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:26:12] [INFO ] Implicit Places using invariants in 329 ms returned []
[2025-06-02 22:26:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:26:12] [INFO ] Implicit Places using invariants and state equation in 430 ms returned []
Implicit Place search using SMT with State Equation took 763 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 258/328 places, 129/192 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1079 ms. Remains : 258/328 places, 129/192 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : CircularTrains-PT-192-LTLFireability-13
Product exploration explored 100000 steps with 2060 reset in 992 ms.
Product exploration explored 100000 steps with 2116 reset in 1094 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 : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 150 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
RANDOM walk for 139 steps (0 resets) in 6 ms. (19 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 168 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
[2025-06-02 22:26:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 22:26:15] [INFO ] [Real]Absence check using 126 positive place invariants in 55 ms returned sat
[2025-06-02 22:26:15] [INFO ] [Real]Absence check using 126 positive and 4 generalized place invariants in 25 ms returned sat
[2025-06-02 22:26:17] [INFO ] [Real]Absence check using state equation in 1377 ms returned sat
[2025-06-02 22:26:17] [INFO ] Computed and/alt/rep : 65/129/65 causal constraints (skipped 0 transitions) in 9 ms.
[2025-06-02 22:26:17] [INFO ] Added : 62 causal constraints over 13 iterations in 603 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 258 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 258/258 places, 129/129 transitions.
Applied a total of 0 rules in 5 ms. Remains 258 /258 variables (removed 0) and now considering 129/129 (removed 0) transitions.
[2025-06-02 22:26:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:26:18] [INFO ] Implicit Places using invariants in 340 ms returned []
[2025-06-02 22:26:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:26:18] [INFO ] Implicit Places using invariants and state equation in 484 ms returned []
Implicit Place search using SMT with State Equation took 833 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 22:26:18] [INFO ] Redundant transitions in 1 ms returned []
Running 65 sub problems to find dead transitions.
[2025-06-02 22:26:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (OVERLAPS) 126/256 variables, 126/127 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (OVERLAPS) 2/258 variables, 2/130 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (OVERLAPS) 129/387 variables, 258/388 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/387 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 9 (OVERLAPS) 0/387 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Real declared 387/387 variables, and 388 constraints, problems are : Problem set: 0 solved, 65 unsolved in 8286 ms.
Refiners :[Positive P Invariants (semi-flows): 126/126 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 258/258 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 65 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (OVERLAPS) 126/256 variables, 126/127 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (OVERLAPS) 2/258 variables, 2/130 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (OVERLAPS) 129/387 variables, 258/388 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/387 variables, 65/453 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/387 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 10 (OVERLAPS) 0/387 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Int declared 387/387 variables, and 453 constraints, problems are : Problem set: 0 solved, 65 unsolved in 7268 ms.
Refiners :[Positive P Invariants (semi-flows): 126/126 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 258/258 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15577ms problems are : Problem set: 0 solved, 65 unsolved
Search for dead transitions found 0 dead transitions in 15578ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 16423 ms. Remains : 258/258 places, 129/129 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 : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 247 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
RANDOM walk for 85 steps (0 resets) in 6 ms. (12 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 224 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
[2025-06-02 22:26:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 22:26:35] [INFO ] [Real]Absence check using 126 positive place invariants in 60 ms returned sat
[2025-06-02 22:26:35] [INFO ] [Real]Absence check using 126 positive and 4 generalized place invariants in 24 ms returned sat
[2025-06-02 22:26:36] [INFO ] [Real]Absence check using state equation in 1522 ms returned sat
[2025-06-02 22:26:36] [INFO ] Computed and/alt/rep : 65/129/65 causal constraints (skipped 0 transitions) in 11 ms.
[2025-06-02 22:26:37] [INFO ] Added : 62 causal constraints over 13 iterations in 814 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2119 reset in 1157 ms.
Product exploration explored 100000 steps with 2154 reset in 1042 ms.
Built C files in :
/tmp/ltsmin719872282678484554
[2025-06-02 22:26:39] [INFO ] Computing symmetric may disable matrix : 129 transitions.
[2025-06-02 22:26:39] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 22:26:39] [INFO ] Computing symmetric may enable matrix : 129 transitions.
[2025-06-02 22:26:39] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 22:26:39] [INFO ] Computing Do-Not-Accords matrix : 129 transitions.
[2025-06-02 22:26:39] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 22:26:39] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin719872282678484554
Running compilation step : cd /tmp/ltsmin719872282678484554;'/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 487 ms.
Running link step : cd /tmp/ltsmin719872282678484554;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin719872282678484554;'/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' '--hoa' '/tmp/stateBased16794054114072210420.hoa' '--buchi-type=spotba'
LTSmin run took 825 ms.
FORMULA CircularTrains-PT-192-LTLFireability-13 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CircularTrains-PT-192-LTLFireability-13 finished in 29246 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((p0||G(p1))) U X(!p1)))'
Support contains 4 out of 328 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 328/328 places, 192/192 transitions.
Applied a total of 0 rules in 5 ms. Remains 328 /328 variables (removed 0) and now considering 192/192 (removed 0) transitions.
// Phase 1: matrix 192 rows 328 cols
[2025-06-02 22:26:41] [INFO ] Computed 137 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:26:41] [INFO ] Implicit Places using invariants in 408 ms returned [62, 114, 139, 171, 288, 290, 309]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 409 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 321/328 places, 192/192 transitions.
Applied a total of 0 rules in 5 ms. Remains 321 /321 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 419 ms. Remains : 321/328 places, 192/192 transitions.
Stuttering acceptance computed with spot in 300 ms :[(OR (NOT p0) p1), (NOT p1), (AND (NOT p1) (NOT p0)), p1, p1, true, p1]
Running random walk in product with property : CircularTrains-PT-192-LTLFireability-14
Entered a terminal (fully accepting) state of product in 205 steps with 55 reset in 2 ms.
FORMULA CircularTrains-PT-192-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-192-LTLFireability-14 finished in 747 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((p0||G((G(p1)||X(p2))))))'
Support contains 6 out of 328 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 328/328 places, 192/192 transitions.
Applied a total of 0 rules in 5 ms. Remains 328 /328 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2025-06-02 22:26:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:26:42] [INFO ] Implicit Places using invariants in 378 ms returned [114, 139, 288, 290, 309, 313]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 380 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 322/328 places, 192/192 transitions.
Applied a total of 0 rules in 5 ms. Remains 322 /322 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 391 ms. Remains : 322/328 places, 192/192 transitions.
Stuttering acceptance computed with spot in 280 ms :[true, (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p1)]
Running random walk in product with property : CircularTrains-PT-192-LTLFireability-15
Entered a terminal (fully accepting) state of product in 287 steps with 0 reset in 4 ms.
FORMULA CircularTrains-PT-192-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-192-LTLFireability-15 finished in 701 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((X(X((F(p2)||p1)))||p0)))))'
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)&&F(p1))))'
[2025-06-02 22:26:42] [INFO ] Flatten gal took : 18 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin3181744648723717013
[2025-06-02 22:26:42] [INFO ] Applying decomposition
[2025-06-02 22:26:42] [INFO ] Computing symmetric may disable matrix : 192 transitions.
[2025-06-02 22:26:42] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 22:26:42] [INFO ] Computing symmetric may enable matrix : 192 transitions.
[2025-06-02 22:26:42] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 22:26:42] [INFO ] Flatten gal took : 9 ms
[2025-06-02 22:26:42] [INFO ] Computing Do-Not-Accords matrix : 192 transitions.
[2025-06-02 22:26:42] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
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/graph17400288773882338796.txt' '-o' '/tmp/graph17400288773882338796.bin' '-w' '/tmp/graph17400288773882338796.weights'
[2025-06-02 22:26:42] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3181744648723717013
Running compilation step : cd /tmp/ltsmin3181744648723717013;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '360' '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'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17400288773882338796.bin' '-l' '-1' '-v' '-w' '/tmp/graph17400288773882338796.weights' '-q' '0' '-e' '0.001'
[2025-06-02 22:26:42] [INFO ] Decomposing Gal with order
[2025-06-02 22:26:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 22:26:42] [INFO ] Flatten gal took : 27 ms
[2025-06-02 22:26:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-06-02 22:26:42] [INFO ] Time to serialize gal into /tmp/LTLFireability15760699071950528654.gal : 9 ms
[2025-06-02 22:26:42] [INFO ] Time to serialize properties into /tmp/LTLFireability10307658642704714015.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability15760699071950528654.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability10307658642704714015.ltl' '-c' '-stutter-deadlock'

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...278
Read 2 LTL properties
Checking formula 0 : !((X(X(G(("(((i12.u31.Section_119<1)||(i12.u64.F120<1))||((i17.i1.u9.F176<1)||(i17.i1.u24.Section_175<1)))")||(X(X(("((i17.i1.u9.F176<...248
Formula 0 simplified : XXF(!"(((i12.u31.Section_119<1)||(i12.u64.F120<1))||((i17.i1.u9.F176<1)||(i17.i1.u24.Section_175<1)))" & XX(!"((i17.i1.u9.F176<1)||(...234
Compilation finished in 877 ms.
Running link step : cd /tmp/ltsmin3181744648723717013;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin3181744648723717013;'/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' '--ltl' 'X(X([]((X(X((<>((LTLAPp2==true))||(LTLAPp1==true))))||(LTLAPp0==true)))))' '--buchi-type=spotba'
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.012: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.005: LTL layer: formula: X(X([]((X(X((<>((LTLAPp2==true))||(LTLAPp1==true))))||(LTLAPp0==true)))))
pins2lts-mc-linux64( 0/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.012: "X(X([]((X(X((<>((LTLAPp2==true))||(LTLAPp1==true))))||(LTLAPp0==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.012: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.030: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.100: DFS-FIFO for weak LTL, using special progress label 198
pins2lts-mc-linux64( 0/ 8), 0.100: There are 199 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.100: State length is 329, there are 199 groups
pins2lts-mc-linux64( 0/ 8), 0.100: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.100: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.100: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.100: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 7/ 8), 0.994: ~1 levels ~960 states ~61360 transitions
pins2lts-mc-linux64( 0/ 8), 1.277: ~1 levels ~1920 states ~122816 transitions
pins2lts-mc-linux64( 0/ 8), 1.652: ~1 levels ~3840 states ~245568 transitions
pins2lts-mc-linux64( 0/ 8), 2.709: ~1 levels ~7680 states ~489960 transitions
pins2lts-mc-linux64( 0/ 8), 4.145: ~1 levels ~15360 states ~980560 transitions
pins2lts-mc-linux64( 4/ 8), 5.795: ~1 levels ~30720 states ~1964016 transitions
pins2lts-mc-linux64( 4/ 8), 9.365: ~1 levels ~61440 states ~3925296 transitions
pins2lts-mc-linux64( 4/ 8), 14.372: ~1 levels ~122880 states ~7849312 transitions
pins2lts-mc-linux64( 4/ 8), 24.816: ~1 levels ~245760 states ~15691760 transitions
pins2lts-mc-linux64( 6/ 8), 46.139: ~1 levels ~491520 states ~31394328 transitions
pins2lts-mc-linux64( 7/ 8), 100.410: ~1 levels ~983040 states ~62692544 transitions
pins2lts-mc-linux64( 5/ 8), 131.106: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 133.080:
pins2lts-mc-linux64( 0/ 8), 133.080: mean standard work distribution: 1.8% (states) 1.8% (transitions)
pins2lts-mc-linux64( 0/ 8), 133.080:
pins2lts-mc-linux64( 0/ 8), 133.080: Explored 1153297 states 73525031 transitions, fanout: 63.752
pins2lts-mc-linux64( 0/ 8), 133.080: Total exploration time 132.970 sec (131.110 sec minimum, 132.163 sec on average)
pins2lts-mc-linux64( 0/ 8), 133.080: States per second: 8673, Transitions per second: 552944
pins2lts-mc-linux64( 0/ 8), 133.080:
pins2lts-mc-linux64( 0/ 8), 133.080: Progress states detected: 19383246
pins2lts-mc-linux64( 0/ 8), 133.080: Redundant explorations: -94.0502
pins2lts-mc-linux64( 0/ 8), 133.080:
pins2lts-mc-linux64( 0/ 8), 133.080: Queue width: 8B, total height: 28521268, memory: 217.60MB
pins2lts-mc-linux64( 0/ 8), 133.080: Tree memory: 403.9MB, 21.8 B/state, compr.: 1.7%
pins2lts-mc-linux64( 0/ 8), 133.080: Tree fill ratio (roots/leafs): 14.0%/100.0%
pins2lts-mc-linux64( 0/ 8), 133.080: Stored 193 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 133.080: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 133.080: Est. total memory use: 621.5MB (~1241.6MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin3181744648723717013;'/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' '--ltl' 'X(X([]((X(X((<>((LTLAPp2==true))||(LTLAPp1==true))))||(LTLAPp0==true)))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin3181744648723717013;'/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' '--ltl' 'X(X([]((X(X((<>((LTLAPp2==true))||(LTLAPp1==true))))||(LTLAPp0==true)))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:1583)
Detected timeout of ITS tools.
[2025-06-02 22:49:09] [INFO ] Flatten gal took : 14 ms
[2025-06-02 22:49:09] [INFO ] Time to serialize gal into /tmp/LTLFireability15557024167558767715.gal : 3 ms
[2025-06-02 22:49:09] [INFO ] Time to serialize properties into /tmp/LTLFireability7715820739522114368.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability15557024167558767715.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability7715820739522114368.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 2 LTL properties
Checking formula 0 : !((X(X(G(("(((Section_119<1)||(F120<1))||((F176<1)||(Section_175<1)))")||(X(X(("((F176<1)||(Section_175<1))")||(F("((F121<1)||(Section...174
Formula 0 simplified : XXF(!"(((Section_119<1)||(F120<1))||((F176<1)||(Section_175<1)))" & XX(!"((F176<1)||(Section_175<1))" & G!"((F121<1)||(Section_120<1...160
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2025-06-02 23:11:35] [INFO ] Flatten gal took : 9 ms
[2025-06-02 23:11:35] [INFO ] Input system was already deterministic with 192 transitions.
[2025-06-02 23:11:35] [INFO ] Transformed 328 places.
[2025-06-02 23:11:35] [INFO ] Transformed 192 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2025-06-02 23:11:35] [INFO ] Time to serialize gal into /tmp/LTLFireability3371006267218607715.gal : 1 ms
[2025-06-02 23:11:35] [INFO ] Time to serialize properties into /tmp/LTLFireability12397902285687786689.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/LTLFireability3371006267218607715.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability12397902285687786689.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(X(G(("(((Section_119<1)||(F120<1))||((F176<1)||(Section_175<1)))")||(X(X(("((F176<1)||(Section_175<1))")||(F("((F121<1)||(Section...174
Formula 0 simplified : XXF(!"(((Section_119<1)||(F120<1))||((F176<1)||(Section_175<1)))" & XX(!"((F176<1)||(Section_175<1))" & G!"((F121<1)||(Section_120<1...160
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is CircularTrains-PT-192, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r030-smll-174853813900420"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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